Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080700498.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748743026751

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:57:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 01:57:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:57:08] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2025-06-01 01:57:08] [INFO ] Transformed 712 places.
[2025-06-01 01:57:08] [INFO ] Transformed 2816 transitions.
[2025-06-01 01:57:08] [INFO ] Found NUPN structural information;
[2025-06-01 01:57:08] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 348 ms.
RANDOM walk for 40000 steps (8 resets) in 2538 ms. (15 steps per ms) remains 226/712 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
[2025-06-01 01:57:09] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2025-06-01 01:57:09] [INFO ] Computed 25 invariants in 22 ms
[2025-06-01 01:57:09] [INFO ] State equation strengthened by 676 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 462/688 variables, 16/242 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 462/704 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2080 variables, and 704 constraints, problems are : Problem set: 0 solved, 226 unsolved in 5065 ms.
Refiners :[Domain max(s): 688/712 constraints, Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/712 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 462/688 variables, 16/242 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 462/704 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2080 variables, and 704 constraints, problems are : Problem set: 0 solved, 226 unsolved in 5018 ms.
Refiners :[Domain max(s): 688/712 constraints, Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/712 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 0/226 constraints, Known Traps: 0/0 constraints]
After SMT, in 10294ms problems are : Problem set: 0 solved, 226 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 144 Pre rules applied. Total rules applied 16 place count 704 transition count 2664
Deduced a syphon composed of 144 places in 2 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 304 place count 560 transition count 2664
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 360 place count 504 transition count 2216
Iterating global reduction 2 with 56 rules applied. Total rules applied 416 place count 504 transition count 2216
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 522 place count 451 transition count 2163
Applied a total of 522 rules in 265 ms. Remains 451 /712 variables (removed 261) and now considering 2163/2816 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 451/712 places, 2163/2816 transitions.
RANDOM walk for 4000000 steps (8 resets) in 66043 ms. (60 steps per ms) remains 213/226 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 213/213 properties
Interrupted probabilistic random walk after 6215733 steps, run timeout after 54001 ms. (steps per millisecond=115 ) properties seen :201 out of 213
Probabilistic random walk after 6215733 steps, saw 1534533 distinct states, run finished after 54007 ms. (steps per millisecond=115 ) properties seen :201
[2025-06-01 01:58:32] [INFO ] Flow matrix only has 715 transitions (discarded 1448 similar events)
// Phase 1: matrix 715 rows 451 cols
[2025-06-01 01:58:32] [INFO ] Computed 25 invariants in 4 ms
[2025-06-01 01:58:32] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 308/320 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 12/332 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 536/868 variables, 332/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/868 variables, 102/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/868 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 36/904 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/904 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/904 variables, 58/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/904 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 44/948 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/948 variables, 18/557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/948 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 87/1035 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1035 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 4/1039 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1039 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 127/1166 variables, 91/654 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1166 variables, 106/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1166 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 0/1166 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 760 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2097 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 451/451 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 308/320 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 12/332 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-01 01:58:35] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 35 ms to minimize.
[2025-06-01 01:58:35] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 3 ms to minimize.
[2025-06-01 01:58:35] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:58:35] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 3 ms to minimize.
[2025-06-01 01:58:35] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:58:35] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 1 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 14 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:58:37] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:58:38] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2025-06-01 01:58:38] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 1 ms to minimize.
[2025-06-01 01:58:38] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:58:38] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-01 01:58:38] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:58:39] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 536/868 variables, 332/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 102/482 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/868 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 36/904 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/904 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/904 variables, 58/549 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/904 variables, 6/555 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/904 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 44/948 variables, 20/575 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/948 variables, 18/593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 87/1035 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1035 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 4/1039 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1039 variables, 6/605 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-01 01:58:41] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 3 ms to minimize.
[2025-06-01 01:58:41] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 3 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 4 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 3 ms to minimize.
[2025-06-01 01:58:43] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 2 ms to minimize.
[2025-06-01 01:58:43] [INFO ] Deduced a trap composed of 70 places in 233 ms of which 3 ms to minimize.
[2025-06-01 01:58:43] [INFO ] Deduced a trap composed of 81 places in 220 ms of which 2 ms to minimize.
[2025-06-01 01:58:43] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2025-06-01 01:58:44] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 2 ms to minimize.
[2025-06-01 01:58:44] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 2 ms to minimize.
[2025-06-01 01:58:44] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2025-06-01 01:58:44] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2025-06-01 01:58:45] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 2 ms to minimize.
[2025-06-01 01:58:45] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 2 ms to minimize.
[2025-06-01 01:58:45] [INFO ] Deduced a trap composed of 82 places in 227 ms of which 3 ms to minimize.
[2025-06-01 01:58:45] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1039 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 4 ms to minimize.
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:58:47] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:58:47] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:58:47] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:58:47] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:58:48] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:58:48] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1039 variables, 8/633 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-01 01:58:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1039 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1039 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 127/1166 variables, 91/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1166 variables, 106/831 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1166 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 0/1166 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 831 constraints, problems are : Problem set: 0 solved, 12 unsolved in 16366 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 451/451 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 59/59 constraints]
After SMT, in 18528ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 5 properties in 7709 ms.
Support contains 7 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 2163/2163 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 451 transition count 2107
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 395 transition count 2107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 392 transition count 2104
Applied a total of 118 rules in 111 ms. Remains 392 /451 variables (removed 59) and now considering 2104/2163 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 392/451 places, 2104/2163 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19231 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3218 ms. (1242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3210 ms. (1245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3224 ms. (1240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3219 ms. (1242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3238 ms. (1234 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3252 ms. (1229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3277 ms. (1220 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 4720554 steps, run timeout after 36001 ms. (steps per millisecond=131 ) properties seen :1 out of 7
Probabilistic random walk after 4720554 steps, saw 1238716 distinct states, run finished after 36001 ms. (steps per millisecond=131 ) properties seen :1
[2025-06-01 01:59:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 01:59:47] [INFO ] Computed 25 invariants in 2 ms
[2025-06-01 01:59:47] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 410/650 variables, 240/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 70/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 50/700 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 48/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 66/766 variables, 30/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 24/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/766 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 107/873 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/875 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/875 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/880 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/880 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 168/1048 variables, 114/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 142/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 6 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 01:59:48] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:59:48] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:59:49] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:59:50] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 410/650 variables, 240/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 70/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 50/700 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 48/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 5/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 66/766 variables, 30/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/766 variables, 24/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 01:59:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:59:51] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/766 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/766 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 107/873 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/873 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/875 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 01:59:51] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:59:52] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:59:52] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:59:52] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2025-06-01 01:59:52] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 5/476 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 01:59:52] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 88 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/875 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/875 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 5/880 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/880 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 168/1048 variables, 114/598 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 142/740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1048 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 0/1048 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 740 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5928 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 6903ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1409 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 4000000 steps (8 resets) in 17777 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3060 ms. (1306 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3062 ms. (1305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3045 ms. (1313 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3049 ms. (1311 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3042 ms. (1314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3061 ms. (1306 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 3024297 steps, run timeout after 27001 ms. (steps per millisecond=112 ) properties seen :0 out of 6
Probabilistic random walk after 3024297 steps, saw 928989 distinct states, run finished after 27003 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-01 02:00:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:00:32] [INFO ] Invariant cache hit.
[2025-06-01 02:00:32] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 410/650 variables, 240/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 70/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 50/700 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 48/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 66/766 variables, 30/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 24/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/766 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 107/873 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/875 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/875 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/880 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/880 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 168/1048 variables, 114/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 142/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 6 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:00:33] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:00:33] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:00:33] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:00:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 410/650 variables, 240/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 70/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:00:35] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 50/700 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 48/407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 5/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 66/766 variables, 30/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/766 variables, 24/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:00:36] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:00:36] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/766 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/766 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 107/873 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 2/875 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/875 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 5/880 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 168/1048 variables, 114/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 142/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/1048 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 734 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4453 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 27/27 constraints]
After SMT, in 5405ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1839 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 59 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 61 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:00:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:00:39] [INFO ] Invariant cache hit.
[2025-06-01 02:00:40] [INFO ] Implicit Places using invariants in 423 ms returned []
[2025-06-01 02:00:40] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:00:40] [INFO ] Invariant cache hit.
[2025-06-01 02:00:40] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:00:42] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2025-06-01 02:00:42] [INFO ] Redundant transitions in 99 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:00:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:00:42] [INFO ] Invariant cache hit.
[2025-06-01 02:00:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 3 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 1 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:01:05] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:01:06] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:01:06] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:01:06] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:01:18] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:01:19] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 2 ms to minimize.
[2025-06-01 02:01:19] [INFO ] Deduced a trap composed of 70 places in 236 ms of which 2 ms to minimize.
[2025-06-01 02:01:19] [INFO ] Deduced a trap composed of 77 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:01:20] [INFO ] Deduced a trap composed of 76 places in 231 ms of which 2 ms to minimize.
[2025-06-01 02:01:20] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 2 ms to minimize.
[2025-06-01 02:01:20] [INFO ] Deduced a trap composed of 88 places in 234 ms of which 2 ms to minimize.
[2025-06-01 02:01:20] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 3 ms to minimize.
[2025-06-01 02:01:21] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 2 ms to minimize.
[2025-06-01 02:01:21] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:01:21] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2025-06-01 02:01:21] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:01:22] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 3 ms to minimize.
[2025-06-01 02:01:22] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 3 ms to minimize.
[2025-06-01 02:01:22] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:01:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:01:24] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:01:24] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:01:24] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:01:25] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 3 ms to minimize.
[2025-06-01 02:01:25] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:01:25] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:01:25] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 67 places in 208 ms of which 2 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 80 places in 229 ms of which 2 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 3 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 3 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 3 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 83 places in 231 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:01:33] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2025-06-01 02:01:33] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:01:33] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:01:33] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:01:34] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:01:34] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 3 ms to minimize.
[2025-06-01 02:01:35] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:01:36] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:01:36] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:01:36] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 3 ms to minimize.
[2025-06-01 02:01:36] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:01:37] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:01:37] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:01:37] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:01:37] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:01:39] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 1 ms to minimize.
[2025-06-01 02:01:41] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:01:41] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:01:42] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:01:42] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:01:42] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:01:42] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:01:42] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:01:42] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 3 ms to minimize.
[2025-06-01 02:01:43] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:01:43] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:01:43] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 2 ms to minimize.
SMT process timed out in 61318ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63868 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 3221 ms. (124 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2025-06-01 02:01:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:01:44] [INFO ] Invariant cache hit.
[2025-06-01 02:01:44] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-01 02:01:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-01 02:01:44] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2025-06-01 02:01:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:01:44] [INFO ] After 59ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:01:45] [INFO ] After 318ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:01:45] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:01:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-01 02:01:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 02:01:45] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 02:01:45] [INFO ] After 56ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:01:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2025-06-01 02:01:45] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:01:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 02:01:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2025-06-01 02:01:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-01 02:01:45] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:01:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
TRAPS : Iteration 1
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2025-06-01 02:01:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2025-06-01 02:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
TRAPS : Iteration 2
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 328 ms
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2025-06-01 02:01:47] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
TRAPS : Iteration 3
[2025-06-01 02:01:48] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
TRAPS : Iteration 4
[2025-06-01 02:01:48] [INFO ] After 3231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 02:01:48] [INFO ] After 3491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 4000000 steps (8 resets) in 18231 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3103 ms. (1288 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3040 ms. (1315 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3049 ms. (1311 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3053 ms. (1309 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3065 ms. (1304 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3094 ms. (1292 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 3648186 steps, run timeout after 27001 ms. (steps per millisecond=135 ) properties seen :0 out of 6
Probabilistic random walk after 3648186 steps, saw 1064942 distinct states, run finished after 27001 ms. (steps per millisecond=135 ) properties seen :0
[2025-06-01 02:02:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:02:25] [INFO ] Invariant cache hit.
[2025-06-01 02:02:25] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 410/650 variables, 240/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 70/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 50/700 variables, 8/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/700 variables, 48/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/700 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 66/766 variables, 30/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/766 variables, 24/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/766 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 107/873 variables, 5/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/875 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/875 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 5/880 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/880 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 168/1048 variables, 114/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 142/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 6 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 224/230 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/240 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-06-01 02:02:28] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:02:28] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2025-06-01 02:02:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:02:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 410/650 variables, 240/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 70/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 50/700 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/700 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/700 variables, 48/407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/700 variables, 5/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/700 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 66/766 variables, 30/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/766 variables, 24/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:29] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:02:29] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/766 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/766 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 107/873 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/873 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 2/875 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/875 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 5/880 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/880 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/880 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 168/1048 variables, 114/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 142/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/1048 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 734 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4318 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 27/27 constraints]
After SMT, in 5268ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1382 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:02:31] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:02:31] [INFO ] Invariant cache hit.
[2025-06-01 02:02:32] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-06-01 02:02:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:02:32] [INFO ] Invariant cache hit.
[2025-06-01 02:02:32] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:02:34] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2025-06-01 02:02:34] [INFO ] Redundant transitions in 110 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:02:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:02:34] [INFO ] Invariant cache hit.
[2025-06-01 02:02:34] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:02:48] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:02:48] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:02:48] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:02:48] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:02:49] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-01 02:02:49] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 02:02:50] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:02:50] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:02:50] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:02:50] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:02:50] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:02:51] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:02:52] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:02:52] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:02:53] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:02:54] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:02:54] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:02:54] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 2 ms to minimize.
[2025-06-01 02:02:54] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 1 ms to minimize.
[2025-06-01 02:02:55] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:02:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2025-06-01 02:02:55] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:02:55] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:02:55] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:02:55] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:02:56] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:02:56] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:02:57] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:02:57] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:02:58] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:02:58] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:02:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2025-06-01 02:02:58] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:02:59] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:03:07] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:03:07] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2025-06-01 02:03:07] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2025-06-01 02:03:08] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2025-06-01 02:03:08] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:03:09] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:03:10] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 3 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 77 places in 241 ms of which 2 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 2 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 88 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 82 places in 227 ms of which 3 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 57 places in 223 ms of which 3 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 57 places in 223 ms of which 2 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 2 ms to minimize.
[2025-06-01 02:03:14] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:03:14] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:03:16] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:03:16] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2025-06-01 02:03:16] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:03:16] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 3 ms to minimize.
[2025-06-01 02:03:16] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:03:17] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2025-06-01 02:03:17] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:03:17] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:03:17] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:03:18] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 2 ms to minimize.
[2025-06-01 02:03:18] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2025-06-01 02:03:18] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:03:18] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:03:18] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:03:19] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:03:19] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:03:19] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2025-06-01 02:03:19] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:03:20] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:03:23] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:03:23] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
[2025-06-01 02:03:24] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:03:24] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:03:24] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:03:24] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:03:24] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:03:25] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:03:25] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 1 ms to minimize.
[2025-06-01 02:03:25] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:03:26] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:03:26] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:03:27] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:03:28] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:03:28] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:03:28] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:03:28] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:03:28] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:03:28] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:03:29] [INFO ] Deduced a trap composed of 90 places in 211 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:03:31] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 3 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:03:34] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 3 ms to minimize.
[2025-06-01 02:03:35] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2025-06-01 02:03:35] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2025-06-01 02:03:35] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 2 ms to minimize.
SMT process timed out in 61049ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63585 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 400000 steps (8 resets) in 2286 ms. (174 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2025-06-01 02:03:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:03:36] [INFO ] Invariant cache hit.
[2025-06-01 02:03:36] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-01 02:03:36] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 02:03:36] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2025-06-01 02:03:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:03:36] [INFO ] After 60ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:03:36] [INFO ] After 314ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:03:36] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:03:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-01 02:03:36] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 02:03:37] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 02:03:37] [INFO ] After 60ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:03:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2025-06-01 02:03:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 296 ms
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 1
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:03:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
TRAPS : Iteration 2
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-01 02:03:39] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
TRAPS : Iteration 3
[2025-06-01 02:03:40] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:03:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 4
[2025-06-01 02:03:40] [INFO ] After 3270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 02:03:40] [INFO ] After 3542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559863 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559863 steps, saw 287338 distinct states, run finished after 3002 ms. (steps per millisecond=186 ) properties seen :0
[2025-06-01 02:03:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:03:43] [INFO ] Invariant cache hit.
[2025-06-01 02:03:43] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 246/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:03:44] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 246/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:03:44] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:03:44] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1037ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 537381 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 537381 steps, saw 276521 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2025-06-01 02:03:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:03:47] [INFO ] Invariant cache hit.
[2025-06-01 02:03:47] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 246/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 28/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 246/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1063ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:03:48] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:03:48] [INFO ] Invariant cache hit.
[2025-06-01 02:03:49] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-06-01 02:03:49] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:03:49] [INFO ] Invariant cache hit.
[2025-06-01 02:03:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:03:51] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
[2025-06-01 02:03:51] [INFO ] Redundant transitions in 40 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:03:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:03:51] [INFO ] Invariant cache hit.
[2025-06-01 02:03:51] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:04:07] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:04:08] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2025-06-01 02:04:09] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:04:09] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:04:09] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:04:09] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:04:09] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:04:11] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:04:11] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:04:11] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 1 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:04:12] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2025-06-01 02:04:13] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:04:14] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:04:15] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:04:15] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:04:15] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:04:16] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2025-06-01 02:04:16] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2025-06-01 02:04:16] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 2 ms to minimize.
[2025-06-01 02:04:16] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:04:24] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:04:24] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:04:24] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:04:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 02:04:25] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 77 places in 220 ms of which 2 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 2 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 77 places in 264 ms of which 2 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 76 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 78 places in 255 ms of which 2 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 88 places in 246 ms of which 3 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 3 ms to minimize.
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 2 ms to minimize.
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 2 ms to minimize.
[2025-06-01 02:04:31] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 3 ms to minimize.
[2025-06-01 02:04:31] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 3 ms to minimize.
[2025-06-01 02:04:31] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 3 ms to minimize.
[2025-06-01 02:04:31] [INFO ] Deduced a trap composed of 58 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:04:34] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:04:34] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:04:34] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:04:35] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:04:35] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:04:35] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 3 ms to minimize.
[2025-06-01 02:04:35] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 2 ms to minimize.
[2025-06-01 02:04:36] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2025-06-01 02:04:36] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:04:36] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:04:36] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:04:36] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 2 ms to minimize.
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 3 ms to minimize.
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 3 ms to minimize.
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 1 ms to minimize.
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:04:42] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:04:42] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:04:42] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:04:42] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:04:44] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 6 ms to minimize.
[2025-06-01 02:04:44] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:04:46] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:04:46] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:04:46] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 1 ms to minimize.
[2025-06-01 02:04:46] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:04:46] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:04:46] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:04:47] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:04:47] [INFO ] Deduced a trap composed of 90 places in 206 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:04:49] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:04:51] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 1 ms to minimize.
[2025-06-01 02:04:51] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:04:51] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:04:51] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:04:52] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:04:52] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:04:52] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 2 ms to minimize.
SMT process timed out in 61107ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63632 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 69 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:04:52] [INFO ] Computed 17 invariants in 0 ms
[2025-06-01 02:04:52] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:04:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:04:52] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:04:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:04:52] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:04:52] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:04:52] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 189 ms.
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 566469 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 566469 steps, saw 290661 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2025-06-01 02:04:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:04:55] [INFO ] Computed 25 invariants in 8 ms
[2025-06-01 02:04:55] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:04:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 02:04:56] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:04:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 996ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 62 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548190 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548190 steps, saw 281639 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2025-06-01 02:05:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:05:00] [INFO ] Invariant cache hit.
[2025-06-01 02:05:00] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:05:00] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:05:00] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 59 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:05:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:05:01] [INFO ] Invariant cache hit.
[2025-06-01 02:05:01] [INFO ] Implicit Places using invariants in 380 ms returned []
[2025-06-01 02:05:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:05:01] [INFO ] Invariant cache hit.
[2025-06-01 02:05:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:05:03] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2025-06-01 02:05:03] [INFO ] Redundant transitions in 39 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:05:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:05:03] [INFO ] Invariant cache hit.
[2025-06-01 02:05:03] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:05:18] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:05:18] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:05:18] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:05:18] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:05:18] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:05:19] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 02:05:19] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:05:19] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:05:20] [INFO ] Deduced a trap composed of 61 places in 284 ms of which 1 ms to minimize.
[2025-06-01 02:05:20] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:05:20] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:05:20] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:05:20] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:05:20] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:05:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:05:21] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:05:21] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:05:21] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:05:21] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:05:21] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:05:23] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:05:23] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:05:23] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:05:24] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:05:24] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:05:24] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 3 ms to minimize.
[2025-06-01 02:05:24] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:05:24] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:05:25] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:05:25] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:05:25] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:05:25] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:05:26] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:05:27] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:05:27] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:05:27] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:05:28] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:05:28] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2025-06-01 02:05:28] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:05:28] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:05:36] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:05:36] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2025-06-01 02:05:36] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:05:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 02:05:38] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:05:39] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:05:40] [INFO ] Deduced a trap composed of 77 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:05:40] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 3 ms to minimize.
[2025-06-01 02:05:40] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 3 ms to minimize.
[2025-06-01 02:05:41] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 2 ms to minimize.
[2025-06-01 02:05:41] [INFO ] Deduced a trap composed of 78 places in 238 ms of which 2 ms to minimize.
[2025-06-01 02:05:41] [INFO ] Deduced a trap composed of 88 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:05:41] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:05:41] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 2 ms to minimize.
[2025-06-01 02:05:42] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 3 ms to minimize.
[2025-06-01 02:05:42] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:05:42] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 2 ms to minimize.
[2025-06-01 02:05:42] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:05:43] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:05:43] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:05:44] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:05:46] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:05:46] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:05:46] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:05:46] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 3 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 3 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 3 ms to minimize.
[2025-06-01 02:05:49] [INFO ] Deduced a trap composed of 83 places in 225 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:05:52] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:05:52] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:05:53] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:05:53] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:05:53] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:05:53] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:05:54] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:05:54] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:05:54] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:05:54] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:05:55] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:05:55] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:05:58] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:05:58] [INFO ] Deduced a trap composed of 90 places in 215 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:06:00] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 1 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:06:04] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:06:04] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:06:04] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:06:04] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:06:04] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 61183ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63730 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 38 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:06:04] [INFO ] Computed 17 invariants in 0 ms
[2025-06-01 02:06:04] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:06:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-01 02:06:05] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:06:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:06:05] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:06:05] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:06:05] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 232 ms.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 577521 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 1
Probabilistic random walk after 577521 steps, saw 295108 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2025-06-01 02:06:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:06:08] [INFO ] Computed 25 invariants in 6 ms
[2025-06-01 02:06:08] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:08] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-06-01 02:06:08] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:09] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:09] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 565884 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 565884 steps, saw 290385 distinct states, run finished after 3003 ms. (steps per millisecond=188 ) properties seen :0
[2025-06-01 02:06:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:06:12] [INFO ] Invariant cache hit.
[2025-06-01 02:06:12] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:13] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:06:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:06:13] [INFO ] Invariant cache hit.
[2025-06-01 02:06:14] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-06-01 02:06:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:06:14] [INFO ] Invariant cache hit.
[2025-06-01 02:06:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:06:16] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2025-06-01 02:06:16] [INFO ] Redundant transitions in 41 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:06:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:06:16] [INFO ] Invariant cache hit.
[2025-06-01 02:06:16] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:06:30] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 02:06:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 02:06:32] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:06:32] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:06:33] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:06:34] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:06:34] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:06:34] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:06:34] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:06:36] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:06:36] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:06:36] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:06:37] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:06:37] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:06:37] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:06:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:06:37] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:06:37] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:06:38] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:06:38] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:06:38] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:06:38] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:06:40] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:06:40] [INFO ] Deduced a trap composed of 69 places in 165 ms of which 3 ms to minimize.
[2025-06-01 02:06:40] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:06:41] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:06:41] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 02:06:41] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:06:41] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:06:49] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-06-01 02:06:49] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:06:49] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2025-06-01 02:06:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 02:06:50] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:06:51] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2025-06-01 02:06:52] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 77 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 3 ms to minimize.
[2025-06-01 02:06:53] [INFO ] Deduced a trap composed of 78 places in 239 ms of which 2 ms to minimize.
[2025-06-01 02:06:54] [INFO ] Deduced a trap composed of 88 places in 230 ms of which 3 ms to minimize.
[2025-06-01 02:06:54] [INFO ] Deduced a trap composed of 82 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:06:54] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 2 ms to minimize.
[2025-06-01 02:06:54] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 3 ms to minimize.
[2025-06-01 02:06:55] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2025-06-01 02:06:55] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2025-06-01 02:06:55] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 2 ms to minimize.
[2025-06-01 02:06:55] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:06:56] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:06:56] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2025-06-01 02:06:57] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 1 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:06:58] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:06:59] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:07:00] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 2 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:07:01] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:07:05] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:07:05] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:07:05] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:07:06] [INFO ] Deduced a trap composed of 85 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:07:06] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:07:06] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:07:06] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 1 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:07:08] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2025-06-01 02:07:09] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 3 ms to minimize.
[2025-06-01 02:07:11] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:07:13] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:07:14] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 3 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 2 ms to minimize.
SMT process timed out in 61148ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63556 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 26 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:07:17] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:07:17] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:07:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2025-06-01 02:07:17] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:07:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:07:17] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:07:17] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:07:17] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549297 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549297 steps, saw 282188 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2025-06-01 02:07:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:07:20] [INFO ] Computed 25 invariants in 2 ms
[2025-06-01 02:07:20] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 3/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 562356 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562356 steps, saw 288619 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2025-06-01 02:07:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:07:25] [INFO ] Invariant cache hit.
[2025-06-01 02:07:25] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:07:25] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 65 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:07:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:07:26] [INFO ] Invariant cache hit.
[2025-06-01 02:07:26] [INFO ] Implicit Places using invariants in 422 ms returned []
[2025-06-01 02:07:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:07:26] [INFO ] Invariant cache hit.
[2025-06-01 02:07:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:07:28] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2025-06-01 02:07:28] [INFO ] Redundant transitions in 41 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:07:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:07:28] [INFO ] Invariant cache hit.
[2025-06-01 02:07:28] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:07:43] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:07:43] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:07:43] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2025-06-01 02:07:43] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2025-06-01 02:07:43] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 02:07:44] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2025-06-01 02:07:44] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:07:46] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2025-06-01 02:07:46] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:07:46] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:07:46] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:07:46] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:07:46] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:07:47] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:07:48] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:07:48] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:07:49] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:07:49] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:07:49] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:07:49] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:07:49] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:07:50] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:07:50] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:07:50] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:07:50] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:07:50] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:07:51] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 1 ms to minimize.
[2025-06-01 02:07:52] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:07:52] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:07:52] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:07:53] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:07:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2025-06-01 02:07:53] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:07:53] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:08:01] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:08:01] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:08:01] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:08:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 02:08:02] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:08:03] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 3 ms to minimize.
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 70 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 77 places in 239 ms of which 2 ms to minimize.
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 3 ms to minimize.
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 78 places in 230 ms of which 2 ms to minimize.
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 88 places in 232 ms of which 3 ms to minimize.
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 2 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 3 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 2 ms to minimize.
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 2 ms to minimize.
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 3 ms to minimize.
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 3 ms to minimize.
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:08:12] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:08:12] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:08:12] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:08:12] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2025-06-01 02:08:12] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:08:13] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 2 ms to minimize.
[2025-06-01 02:08:13] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 3 ms to minimize.
[2025-06-01 02:08:13] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:08:13] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 3 ms to minimize.
[2025-06-01 02:08:13] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 90 places in 192 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:08:25] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:08:27] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 60978ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 60996ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63511 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 30 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:08:29] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:08:29] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:08:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2025-06-01 02:08:29] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:08:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:08:29] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:08:29] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:08:29] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 121 ms.
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 566568 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 566568 steps, saw 290725 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2025-06-01 02:08:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:08:32] [INFO ] Computed 25 invariants in 7 ms
[2025-06-01 02:08:32] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:08:33] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-06-01 02:08:33] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:08:33] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 987ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 564714 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 564714 steps, saw 289857 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2025-06-01 02:08:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:08:36] [INFO ] Invariant cache hit.
[2025-06-01 02:08:36] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:08:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-01 02:08:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:08:37] [INFO ] Invariant cache hit.
[2025-06-01 02:08:38] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-01 02:08:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:08:38] [INFO ] Invariant cache hit.
[2025-06-01 02:08:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-01 02:08:40] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
[2025-06-01 02:08:40] [INFO ] Redundant transitions in 38 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-01 02:08:40] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:08:40] [INFO ] Invariant cache hit.
[2025-06-01 02:08:40] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:08:54] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2025-06-01 02:08:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 1 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:08:56] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2025-06-01 02:08:57] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:08:59] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 1 ms to minimize.
[2025-06-01 02:08:59] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:09:00] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:09:00] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:09:00] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:09:00] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:09:00] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 1 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:09:01] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:09:02] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:09:04] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 65 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:09:12] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2025-06-01 02:09:12] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2025-06-01 02:09:13] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:09:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 02:09:14] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:09:15] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 77 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 3 ms to minimize.
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 76 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 78 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 88 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 2 ms to minimize.
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2025-06-01 02:09:19] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 2 ms to minimize.
[2025-06-01 02:09:19] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 2 ms to minimize.
[2025-06-01 02:09:19] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:09:19] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 3 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 3 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 3 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 2 ms to minimize.
[2025-06-01 02:09:25] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:09:25] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 3 ms to minimize.
[2025-06-01 02:09:25] [INFO ] Deduced a trap composed of 83 places in 216 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 2 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 3 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 90 places in 205 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:09:38] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:09:38] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 3 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:09:41] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:09:41] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 61061ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63455 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 23 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-01 02:09:41] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:09:41] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:09:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-01 02:09:41] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:09:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:09:41] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:09:41] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:09:41] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 157 ms.
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567999 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567999 steps, saw 291409 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2025-06-01 02:09:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-01 02:09:44] [INFO ] Computed 25 invariants in 5 ms
[2025-06-01 02:09:44] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1048 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 50 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549918 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549918 steps, saw 282476 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
[2025-06-01 02:09:48] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-01 02:09:48] [INFO ] Invariant cache hit.
[2025-06-01 02:09:48] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 106/236 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 154/390 variables, 70/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 25/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 251/641 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/641 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/643 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/656 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/656 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 392/1048 variables, 266/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 247/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/130 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 9 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1948 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 413 place count 126 transition count 286
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 469 place count 126 transition count 230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 485 place count 118 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 493 place count 118 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 501 place count 118 transition count 214
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 557 place count 118 transition count 158
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 613 place count 62 transition count 158
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 62 transition count 158
Applied a total of 621 rules in 23 ms. Remains 62 /392 variables (removed 330) and now considering 158/2104 (removed 1946) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 158 rows 62 cols
[2025-06-01 02:09:49] [INFO ] Computed 17 invariants in 1 ms
[2025-06-01 02:09:49] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:09:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2025-06-01 02:09:49] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 02:09:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 02:09:49] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:09:49] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 02:09:49] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
Unable to solve all queries for examination StableMarking. Remains :6 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 6 properties from file /home/mcc/execution/StableMarking.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 761680 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-08

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 712
TRANSITIONS: 2816
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 13440
NUPN UNITS: 19
LOADING TIME: 1.536

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

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

Process ID: 3918
MODEL NAME: /home/mcc/execution/model
712 places, 2816 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-08, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080700498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;