Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 168K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748684290088

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 09:38:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 09:38:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:38:13] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2025-05-31 09:38:13] [INFO ] Transformed 437 places.
[2025-05-31 09:38:13] [INFO ] Transformed 707 transitions.
[2025-05-31 09:38:13] [INFO ] Found NUPN structural information;
[2025-05-31 09:38:13] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 577 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 325 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 11 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 418 transition count 613
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 181 place count 334 transition count 611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 333 transition count 611
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 182 place count 333 transition count 600
Deduced a syphon composed of 11 places in 13 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 204 place count 322 transition count 600
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 6 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 410 place count 219 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 412 place count 219 transition count 495
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -195
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 472 place count 189 transition count 690
Applied a total of 472 rules in 268 ms. Remains 189 /437 variables (removed 248) and now considering 690/707 (removed 17) transitions.
[2025-05-31 09:38:13] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
// Phase 1: matrix 656 rows 189 cols
[2025-05-31 09:38:13] [INFO ] Computed 7 invariants in 47 ms
[2025-05-31 09:38:14] [INFO ] Implicit Places using invariants in 964 ms returned []
[2025-05-31 09:38:14] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
[2025-05-31 09:38:14] [INFO ] Invariant cache hit.
[2025-05-31 09:38:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-05-31 09:38:16] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 2335 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-05-31 09:38:16] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
[2025-05-31 09:38:16] [INFO ] Invariant cache hit.
[2025-05-31 09:38:16] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2025-05-31 09:38:31] [INFO ] Deduced a trap composed of 60 places in 270 ms of which 33 ms to minimize.
[2025-05-31 09:38:31] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 5 ms to minimize.
[2025-05-31 09:38:32] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 3 ms to minimize.
[2025-05-31 09:38:33] [INFO ] Deduced a trap composed of 57 places in 279 ms of which 4 ms to minimize.
[2025-05-31 09:38:33] [INFO ] Deduced a trap composed of 114 places in 277 ms of which 3 ms to minimize.
[2025-05-31 09:38:34] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 4 ms to minimize.
[2025-05-31 09:38:34] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 4 ms to minimize.
[2025-05-31 09:38:35] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2025-05-31 09:38:35] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 3 ms to minimize.
[2025-05-31 09:38:35] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2025-05-31 09:38:35] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2025-05-31 09:38:41] [INFO ] Deduced a trap composed of 124 places in 212 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2025-05-31 09:38:47] [INFO ] Deduced a trap composed of 124 places in 264 ms of which 3 ms to minimize.
[2025-05-31 09:38:47] [INFO ] Deduced a trap composed of 134 places in 251 ms of which 2 ms to minimize.
[2025-05-31 09:38:47] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/845 variables, and 211 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30071 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 15/211 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (OVERLAPS) 655/844 variables, 189/400 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 681/1095 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/845 variables, and 1095 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30031 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 15/15 constraints]
After SMT, in 61816ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 61880ms
Starting structural reductions in LIVENESS mode, iteration 1 : 189/437 places, 690/707 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 64555 ms. Remains : 189/437 places, 690/707 transitions.
Discarding 311 transitions out of 690. Remains 379
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2104 resets) in 4840 ms. (8 steps per ms) remains 308/378 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 308/308 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 308/308 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 308/308 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 308/308 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 308/308 properties
[2025-05-31 09:39:19] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
[2025-05-31 09:39:19] [INFO ] Invariant cache hit.
[2025-05-31 09:39:19] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 13/183 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 13/190 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/845 variables, and 190 constraints, problems are : Problem set: 0 solved, 308 unsolved in 5019 ms.
Refiners :[Domain max(s): 183/189 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 13/183 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 13/190 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2025-05-31 09:39:28] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 4 ms to minimize.
[2025-05-31 09:39:29] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2025-05-31 09:39:29] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 2 ms to minimize.
[2025-05-31 09:39:29] [INFO ] Deduced a trap composed of 114 places in 213 ms of which 2 ms to minimize.
[2025-05-31 09:39:30] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/845 variables, and 195 constraints, problems are : Problem set: 0 solved, 308 unsolved in 5013 ms.
Refiners :[Domain max(s): 183/189 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/308 constraints, Known Traps: 5/5 constraints]
After SMT, in 10684ms problems are : Problem set: 0 solved, 308 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 170 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 690/690 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 687
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 187 transition count 685
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 187 transition count 685
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 187 transition count 680
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 187 transition count 672
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 187 transition count 668
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 183 transition count 668
Applied a total of 28 rules in 95 ms. Remains 183 /189 variables (removed 6) and now considering 668/690 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 183/189 places, 668/690 transitions.
RANDOM walk for 4000000 steps (179218 resets) in 66613 ms. (60 steps per ms) remains 174/308 properties
BEST_FIRST walk for 40002 steps (236 resets) in 394 ms. (101 steps per ms) remains 171/174 properties
BEST_FIRST walk for 40003 steps (236 resets) in 227 ms. (175 steps per ms) remains 170/171 properties
BEST_FIRST walk for 40003 steps (421 resets) in 292 ms. (136 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40001 steps (235 resets) in 274 ms. (145 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (406 resets) in 268 ms. (148 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (236 resets) in 337 ms. (118 steps per ms) remains 167/170 properties
BEST_FIRST walk for 40001 steps (429 resets) in 221 ms. (180 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40002 steps (225 resets) in 230 ms. (173 steps per ms) remains 165/167 properties
BEST_FIRST walk for 40004 steps (424 resets) in 212 ms. (187 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (239 resets) in 221 ms. (180 steps per ms) remains 164/165 properties
BEST_FIRST walk for 40003 steps (431 resets) in 207 ms. (192 steps per ms) remains 164/164 properties
BEST_FIRST walk for 40003 steps (225 resets) in 267 ms. (149 steps per ms) remains 162/164 properties
BEST_FIRST walk for 40002 steps (416 resets) in 139 ms. (285 steps per ms) remains 162/162 properties
BEST_FIRST walk for 40004 steps (231 resets) in 145 ms. (274 steps per ms) remains 160/162 properties
BEST_FIRST walk for 40003 steps (422 resets) in 136 ms. (291 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (414 resets) in 137 ms. (289 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (421 resets) in 204 ms. (195 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (240 resets) in 144 ms. (275 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (231 resets) in 144 ms. (275 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40002 steps (426 resets) in 137 ms. (289 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (237 resets) in 144 ms. (275 steps per ms) remains 159/160 properties
BEST_FIRST walk for 40003 steps (429 resets) in 135 ms. (294 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (247 resets) in 160 ms. (248 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (413 resets) in 195 ms. (204 steps per ms) remains 158/159 properties
BEST_FIRST walk for 40003 steps (252 resets) in 205 ms. (194 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (420 resets) in 202 ms. (197 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40002 steps (232 resets) in 202 ms. (197 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (424 resets) in 196 ms. (203 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (230 resets) in 481 ms. (82 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (421 resets) in 244 ms. (163 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (247 resets) in 168 ms. (236 steps per ms) remains 157/158 properties
BEST_FIRST walk for 40004 steps (410 resets) in 157 ms. (253 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (435 resets) in 160 ms. (248 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (434 resets) in 167 ms. (238 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (418 resets) in 165 ms. (240 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (430 resets) in 158 ms. (251 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (429 resets) in 152 ms. (261 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (427 resets) in 153 ms. (259 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (402 resets) in 151 ms. (263 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (415 resets) in 148 ms. (268 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (425 resets) in 125 ms. (317 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (415 resets) in 127 ms. (312 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (234 resets) in 135 ms. (294 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (257 resets) in 142 ms. (279 steps per ms) remains 156/157 properties
BEST_FIRST walk for 40002 steps (467 resets) in 146 ms. (272 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40001 steps (233 resets) in 133 ms. (298 steps per ms) remains 155/156 properties
BEST_FIRST walk for 40004 steps (231 resets) in 135 ms. (294 steps per ms) remains 154/155 properties
BEST_FIRST walk for 40003 steps (491 resets) in 147 ms. (270 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (432 resets) in 129 ms. (307 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (428 resets) in 126 ms. (314 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (406 resets) in 131 ms. (303 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (432 resets) in 138 ms. (287 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (427 resets) in 128 ms. (310 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (430 resets) in 129 ms. (307 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (422 resets) in 165 ms. (240 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (425 resets) in 166 ms. (239 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (421 resets) in 163 ms. (243 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (421 resets) in 163 ms. (243 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (421 resets) in 164 ms. (242 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (437 resets) in 219 ms. (181 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (420 resets) in 169 ms. (235 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (419 resets) in 165 ms. (240 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (429 resets) in 163 ms. (243 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (432 resets) in 169 ms. (235 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (428 resets) in 169 ms. (235 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (423 resets) in 168 ms. (236 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40001 steps (418 resets) in 171 ms. (232 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (425 resets) in 170 ms. (233 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (419 resets) in 171 ms. (232 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (433 resets) in 176 ms. (226 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (439 resets) in 168 ms. (236 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (417 resets) in 170 ms. (233 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (425 resets) in 185 ms. (215 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (389 resets) in 132 ms. (300 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (415 resets) in 132 ms. (300 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (408 resets) in 130 ms. (305 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (430 resets) in 138 ms. (287 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (428 resets) in 133 ms. (298 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (425 resets) in 138 ms. (287 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (417 resets) in 131 ms. (303 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (420 resets) in 132 ms. (300 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (444 resets) in 133 ms. (298 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (428 resets) in 134 ms. (296 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (425 resets) in 134 ms. (296 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (432 resets) in 141 ms. (281 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40001 steps (425 resets) in 176 ms. (225 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (429 resets) in 177 ms. (224 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (424 resets) in 184 ms. (216 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (422 resets) in 177 ms. (224 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (427 resets) in 261 ms. (152 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (560 resets) in 197 ms. (202 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (569 resets) in 200 ms. (199 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (429 resets) in 162 ms. (245 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (399 resets) in 120 ms. (330 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (437 resets) in 132 ms. (300 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (559 resets) in 155 ms. (256 steps per ms) remains 154/154 properties
[2025-05-31 09:39:53] [INFO ] Flow matrix only has 636 transitions (discarded 32 similar events)
// Phase 1: matrix 636 rows 183 cols
[2025-05-31 09:39:53] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 09:39:53] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 64/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2025-05-31 09:39:54] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2025-05-31 09:39:54] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2025-05-31 09:39:55] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2025-05-31 09:39:55] [INFO ] Deduced a trap composed of 55 places in 303 ms of which 4 ms to minimize.
[2025-05-31 09:39:55] [INFO ] Deduced a trap composed of 110 places in 306 ms of which 3 ms to minimize.
[2025-05-31 09:39:56] [INFO ] Deduced a trap composed of 120 places in 296 ms of which 3 ms to minimize.
[2025-05-31 09:39:56] [INFO ] Deduced a trap composed of 120 places in 297 ms of which 4 ms to minimize.
[2025-05-31 09:39:56] [INFO ] Deduced a trap composed of 109 places in 293 ms of which 3 ms to minimize.
[2025-05-31 09:39:57] [INFO ] Deduced a trap composed of 130 places in 271 ms of which 4 ms to minimize.
[2025-05-31 09:39:57] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 4 ms to minimize.
[2025-05-31 09:39:58] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 4 ms to minimize.
[2025-05-31 09:39:58] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2025-05-31 09:39:58] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 2 ms to minimize.
[2025-05-31 09:39:58] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 636/813 variables, 177/198 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 16/214 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2025-05-31 09:40:04] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 6/819 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/819 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 221 constraints, problems are : Problem set: 0 solved, 154 unsolved in 40280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 183/183 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 64/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 636/813 variables, 177/199 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 16/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 146/361 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 6/819 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 375 constraints, problems are : Problem set: 0 solved, 154 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 183/183 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 15/15 constraints]
After SMT, in 85467ms problems are : Problem set: 0 solved, 154 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 113 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 668/668 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 181 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 181 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 181 transition count 551
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 181 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 180 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 180 transition count 544
Applied a total of 13 rules in 83 ms. Remains 180 /183 variables (removed 3) and now considering 544/668 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 180/183 places, 544/668 transitions.
RANDOM walk for 4000000 steps (183423 resets) in 51405 ms. (77 steps per ms) remains 149/154 properties
BEST_FIRST walk for 40004 steps (273 resets) in 146 ms. (272 steps per ms) remains 148/149 properties
BEST_FIRST walk for 40004 steps (277 resets) in 142 ms. (279 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (422 resets) in 135 ms. (294 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40003 steps (279 resets) in 141 ms. (281 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40002 steps (445 resets) in 127 ms. (312 steps per ms) remains 148/148 properties
BEST_FIRST walk for 40004 steps (271 resets) in 140 ms. (283 steps per ms) remains 147/148 properties
BEST_FIRST walk for 40003 steps (432 resets) in 129 ms. (307 steps per ms) remains 146/147 properties
BEST_FIRST walk for 40002 steps (262 resets) in 141 ms. (281 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (441 resets) in 132 ms. (300 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (263 resets) in 141 ms. (281 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (437 resets) in 132 ms. (300 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (280 resets) in 149 ms. (266 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (443 resets) in 131 ms. (303 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (262 resets) in 141 ms. (281 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (439 resets) in 129 ms. (307 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (435 resets) in 132 ms. (300 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (255 resets) in 139 ms. (285 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (272 resets) in 141 ms. (281 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (446 resets) in 130 ms. (305 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (267 resets) in 140 ms. (283 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (428 resets) in 135 ms. (294 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (269 resets) in 143 ms. (277 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (444 resets) in 138 ms. (287 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (264 resets) in 140 ms. (283 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40001 steps (430 resets) in 131 ms. (303 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (260 resets) in 143 ms. (277 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (434 resets) in 128 ms. (310 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (271 resets) in 138 ms. (287 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (432 resets) in 131 ms. (303 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (256 resets) in 139 ms. (285 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (424 resets) in 136 ms. (291 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (442 resets) in 130 ms. (305 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (451 resets) in 128 ms. (310 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (457 resets) in 129 ms. (307 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40001 steps (428 resets) in 125 ms. (317 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (430 resets) in 122 ms. (325 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40004 steps (431 resets) in 125 ms. (317 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (415 resets) in 124 ms. (320 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40001 steps (431 resets) in 123 ms. (322 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (423 resets) in 131 ms. (303 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (268 resets) in 139 ms. (285 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (266 resets) in 137 ms. (289 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (533 resets) in 148 ms. (268 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (256 resets) in 141 ms. (281 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (266 resets) in 141 ms. (281 steps per ms) remains 145/146 properties
BEST_FIRST walk for 40004 steps (519 resets) in 145 ms. (274 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (439 resets) in 129 ms. (307 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (443 resets) in 128 ms. (310 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (442 resets) in 135 ms. (294 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (446 resets) in 127 ms. (312 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (443 resets) in 127 ms. (312 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (435 resets) in 126 ms. (314 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (443 resets) in 130 ms. (305 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (419 resets) in 131 ms. (303 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (435 resets) in 129 ms. (307 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (444 resets) in 151 ms. (263 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (424 resets) in 132 ms. (300 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (437 resets) in 129 ms. (307 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (448 resets) in 134 ms. (296 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (437 resets) in 128 ms. (310 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40003 steps (431 resets) in 127 ms. (312 steps per ms) remains 143/145 properties
BEST_FIRST walk for 40002 steps (439 resets) in 126 ms. (314 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (430 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (429 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (434 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (437 resets) in 123 ms. (322 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (424 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (446 resets) in 133 ms. (298 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (461 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (446 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (446 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (441 resets) in 126 ms. (314 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (426 resets) in 126 ms. (314 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (442 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (449 resets) in 129 ms. (307 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (440 resets) in 126 ms. (314 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (434 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (448 resets) in 134 ms. (296 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (439 resets) in 128 ms. (310 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (447 resets) in 130 ms. (305 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (437 resets) in 128 ms. (310 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (440 resets) in 128 ms. (310 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (440 resets) in 128 ms. (310 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (436 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (450 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (435 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (445 resets) in 148 ms. (268 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (435 resets) in 128 ms. (310 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (584 resets) in 145 ms. (273 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (596 resets) in 146 ms. (272 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (439 resets) in 125 ms. (317 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (575 resets) in 144 ms. (275 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (429 resets) in 124 ms. (320 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (443 resets) in 127 ms. (312 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40001 steps (449 resets) in 144 ms. (275 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (428 resets) in 177 ms. (224 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (448 resets) in 200 ms. (199 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40001 steps (427 resets) in 313 ms. (127 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (436 resets) in 269 ms. (148 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (440 resets) in 197 ms. (202 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (427 resets) in 203 ms. (196 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (451 resets) in 215 ms. (185 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (588 resets) in 257 ms. (155 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (364 resets) in 263 ms. (151 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (379 resets) in 281 ms. (141 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (374 resets) in 264 ms. (150 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (366 resets) in 171 ms. (232 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (367 resets) in 277 ms. (143 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (370 resets) in 182 ms. (218 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (436 resets) in 207 ms. (192 steps per ms) remains 143/143 properties
Interrupted probabilistic random walk after 2886438 steps, run timeout after 54001 ms. (steps per millisecond=53 ) properties seen :29 out of 143
Probabilistic random walk after 2886438 steps, saw 859767 distinct states, run finished after 54009 ms. (steps per millisecond=53 ) properties seen :29
[2025-05-31 09:42:30] [INFO ] Flow matrix only has 527 transitions (discarded 17 similar events)
// Phase 1: matrix 527 rows 180 cols
[2025-05-31 09:42:30] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:42:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 90/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2025-05-31 09:42:31] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2025-05-31 09:42:32] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2025-05-31 09:42:32] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2025-05-31 09:42:32] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-05-31 09:42:32] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 4 ms to minimize.
[2025-05-31 09:42:33] [INFO ] Deduced a trap composed of 120 places in 288 ms of which 3 ms to minimize.
[2025-05-31 09:42:33] [INFO ] Deduced a trap composed of 120 places in 256 ms of which 3 ms to minimize.
[2025-05-31 09:42:33] [INFO ] Deduced a trap composed of 130 places in 255 ms of which 3 ms to minimize.
[2025-05-31 09:42:34] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 3 ms to minimize.
[2025-05-31 09:42:34] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 3 ms to minimize.
[2025-05-31 09:42:34] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 2 ms to minimize.
[2025-05-31 09:42:35] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 527/698 variables, 171/190 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 9/707 variables, 9/212 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/707 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 212 constraints, problems are : Problem set: 0 solved, 114 unsolved in 20803 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 90/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 527/698 variables, 171/190 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 110/313 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 9/707 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/707 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/707 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 326 constraints, problems are : Problem set: 0 solved, 114 unsolved in 46705 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 12/12 constraints]
After SMT, in 67640ms problems are : Problem set: 0 solved, 114 unsolved
Parikh walk visited 0 properties in 30304 ms.
Support contains 81 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 544/544 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 173 transition count 480
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 173 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 173 transition count 479
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 173 transition count 477
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 171 transition count 471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 170 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 170 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 170 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 170 transition count 457
Applied a total of 40 rules in 45 ms. Remains 170 /180 variables (removed 10) and now considering 457/544 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 170/180 places, 457/544 transitions.
RANDOM walk for 4000000 steps (192399 resets) in 40930 ms. (97 steps per ms) remains 113/114 properties
BEST_FIRST walk for 40004 steps (295 resets) in 196 ms. (203 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (293 resets) in 200 ms. (199 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (484 resets) in 149 ms. (266 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (300 resets) in 268 ms. (148 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (473 resets) in 153 ms. (259 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (294 resets) in 250 ms. (159 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (477 resets) in 218 ms. (182 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (288 resets) in 296 ms. (134 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (477 resets) in 371 ms. (107 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (290 resets) in 268 ms. (148 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (462 resets) in 243 ms. (163 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (290 resets) in 290 ms. (137 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (471 resets) in 261 ms. (152 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (292 resets) in 277 ms. (143 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (464 resets) in 252 ms. (158 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (299 resets) in 386 ms. (103 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (449 resets) in 223 ms. (178 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40001 steps (276 resets) in 262 ms. (152 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40001 steps (457 resets) in 308 ms. (129 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (290 resets) in 252 ms. (158 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (470 resets) in 203 ms. (196 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (287 resets) in 262 ms. (152 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (479 resets) in 329 ms. (121 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (303 resets) in 315 ms. (126 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (466 resets) in 253 ms. (157 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (480 resets) in 300 ms. (132 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (474 resets) in 283 ms. (140 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (492 resets) in 218 ms. (182 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (471 resets) in 311 ms. (128 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (467 resets) in 234 ms. (170 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (476 resets) in 227 ms. (175 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (467 resets) in 235 ms. (169 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (283 resets) in 308 ms. (129 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (574 resets) in 311 ms. (128 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (292 resets) in 240 ms. (165 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (296 resets) in 283 ms. (140 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (568 resets) in 212 ms. (187 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (479 resets) in 281 ms. (141 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (470 resets) in 269 ms. (148 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (467 resets) in 202 ms. (197 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (470 resets) in 192 ms. (207 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (459 resets) in 219 ms. (181 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (472 resets) in 259 ms. (153 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (458 resets) in 207 ms. (192 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (463 resets) in 312 ms. (127 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (472 resets) in 205 ms. (194 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (476 resets) in 199 ms. (200 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (459 resets) in 288 ms. (138 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (466 resets) in 308 ms. (129 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (473 resets) in 192 ms. (207 steps per ms) remains 113/113 properties
Interrupted probabilistic random walk after 2782734 steps, run timeout after 45001 ms. (steps per millisecond=61 ) properties seen :15 out of 113
Probabilistic random walk after 2782734 steps, saw 819414 distinct states, run finished after 45004 ms. (steps per millisecond=61 ) properties seen :15
[2025-05-31 09:45:09] [INFO ] Flow matrix only has 450 transitions (discarded 7 similar events)
// Phase 1: matrix 450 rows 170 cols
[2025-05-31 09:45:09] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:45:09] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 80/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 09:45:10] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2025-05-31 09:45:10] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-05-31 09:45:11] [INFO ] Deduced a trap composed of 95 places in 228 ms of which 3 ms to minimize.
[2025-05-31 09:45:11] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 3 ms to minimize.
[2025-05-31 09:45:11] [INFO ] Deduced a trap composed of 125 places in 232 ms of which 3 ms to minimize.
[2025-05-31 09:45:12] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 3 ms to minimize.
[2025-05-31 09:45:12] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 3 ms to minimize.
[2025-05-31 09:45:12] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 9/163 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 09:45:14] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 5 ms to minimize.
[2025-05-31 09:45:14] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 450/613 variables, 163/180 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 54/234 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 7/620 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/620 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 241 constraints, problems are : Problem set: 0 solved, 98 unsolved in 20869 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 80/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 9/163 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 450/613 variables, 163/180 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 54/234 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 95/329 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 09:45:37] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 7/620 variables, 7/337 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (OVERLAPS) 0/620 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 340 constraints, problems are : Problem set: 0 solved, 98 unsolved in 43433 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 64384ms problems are : Problem set: 0 solved, 98 unsolved
Parikh walk visited 0 properties in 30266 ms.
Support contains 74 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 457/457 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 168 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 168 transition count 455
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 168 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 167 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 166 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 166 transition count 453
Applied a total of 8 rules in 35 ms. Remains 166 /170 variables (removed 4) and now considering 453/457 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 166/170 places, 453/457 transitions.
RANDOM walk for 4000000 steps (197549 resets) in 64002 ms. (62 steps per ms) remains 97/98 properties
BEST_FIRST walk for 400003 steps (2958 resets) in 2160 ms. (185 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (2952 resets) in 2760 ms. (144 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (4844 resets) in 2130 ms. (187 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (2965 resets) in 2799 ms. (142 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4871 resets) in 2187 ms. (182 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (2986 resets) in 2736 ms. (146 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4863 resets) in 1782 ms. (224 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (2958 resets) in 2136 ms. (187 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4861 resets) in 1691 ms. (236 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (2994 resets) in 2060 ms. (194 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4887 resets) in 2024 ms. (197 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (2978 resets) in 2231 ms. (179 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4886 resets) in 1689 ms. (236 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (2985 resets) in 2102 ms. (190 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4862 resets) in 1491 ms. (268 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4905 resets) in 2107 ms. (189 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (4830 resets) in 1983 ms. (201 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (4832 resets) in 1547 ms. (258 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4860 resets) in 1607 ms. (248 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4860 resets) in 1820 ms. (219 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4880 resets) in 1926 ms. (207 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400001 steps (4885 resets) in 1917 ms. (208 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4952 resets) in 1788 ms. (223 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4818 resets) in 1578 ms. (253 steps per ms) remains 96/97 properties
BEST_FIRST walk for 400004 steps (4830 resets) in 1688 ms. (236 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (4849 resets) in 1932 ms. (206 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (5635 resets) in 1939 ms. (206 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (2960 resets) in 2087 ms. (191 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (5957 resets) in 2180 ms. (183 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (4859 resets) in 1853 ms. (215 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4836 resets) in 1707 ms. (234 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4882 resets) in 1715 ms. (233 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4870 resets) in 1780 ms. (224 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (4882 resets) in 1750 ms. (228 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4850 resets) in 1837 ms. (217 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4833 resets) in 1772 ms. (225 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (4852 resets) in 2008 ms. (199 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (4818 resets) in 2080 ms. (192 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (4886 resets) in 2166 ms. (184 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4859 resets) in 1854 ms. (215 steps per ms) remains 95/96 properties
BEST_FIRST walk for 400003 steps (4824 resets) in 1854 ms. (215 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (4843 resets) in 1603 ms. (249 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4857 resets) in 2154 ms. (185 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (4888 resets) in 1622 ms. (246 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4901 resets) in 1918 ms. (208 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (4848 resets) in 2106 ms. (189 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4866 resets) in 1708 ms. (234 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4837 resets) in 1672 ms. (239 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400002 steps (4816 resets) in 1860 ms. (214 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4837 resets) in 1739 ms. (229 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (4823 resets) in 1908 ms. (209 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400002 steps (4864 resets) in 1726 ms. (231 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400002 steps (4870 resets) in 1927 ms. (207 steps per ms) remains 94/95 properties
BEST_FIRST walk for 400003 steps (4829 resets) in 1722 ms. (232 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4839 resets) in 2128 ms. (187 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4856 resets) in 2581 ms. (154 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4884 resets) in 1982 ms. (201 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4908 resets) in 1886 ms. (211 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4869 resets) in 1890 ms. (211 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4865 resets) in 1862 ms. (214 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4899 resets) in 1647 ms. (242 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4914 resets) in 1613 ms. (247 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4940 resets) in 1723 ms. (232 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (6561 resets) in 2081 ms. (192 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (6437 resets) in 1995 ms. (200 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4884 resets) in 1906 ms. (209 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4878 resets) in 1736 ms. (230 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400001 steps (4885 resets) in 1754 ms. (227 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4883 resets) in 2445 ms. (163 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (6410 resets) in 2167 ms. (184 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400001 steps (4874 resets) in 1551 ms. (257 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400002 steps (6392 resets) in 2128 ms. (187 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4896 resets) in 1787 ms. (223 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4884 resets) in 1690 ms. (236 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4887 resets) in 1790 ms. (223 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (4883 resets) in 1781 ms. (224 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400002 steps (4847 resets) in 1837 ms. (217 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4921 resets) in 1727 ms. (231 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400002 steps (4830 resets) in 1780 ms. (224 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4846 resets) in 1567 ms. (255 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (4868 resets) in 1986 ms. (201 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400001 steps (6429 resets) in 2017 ms. (198 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400000 steps (4133 resets) in 1677 ms. (238 steps per ms) remains 93/94 properties
BEST_FIRST walk for 400003 steps (4148 resets) in 1639 ms. (243 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400003 steps (4150 resets) in 1796 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400004 steps (4171 resets) in 1394 ms. (286 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400001 steps (4149 resets) in 1767 ms. (226 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400001 steps (4099 resets) in 1617 ms. (247 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400004 steps (4861 resets) in 1526 ms. (261 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400002 steps (4794 resets) in 1901 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400003 steps (4852 resets) in 1585 ms. (252 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400003 steps (4876 resets) in 1874 ms. (213 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400003 steps (4877 resets) in 1618 ms. (247 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400002 steps (4943 resets) in 1898 ms. (210 steps per ms) remains 92/93 properties
BEST_FIRST walk for 400003 steps (2956 resets) in 1968 ms. (203 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400001 steps (4846 resets) in 1862 ms. (214 steps per ms) remains 92/92 properties
Interrupted probabilistic random walk after 17712038 steps, run timeout after 252001 ms. (steps per millisecond=70 ) properties seen :41 out of 92
Probabilistic random walk after 17712038 steps, saw 4969700 distinct states, run finished after 252005 ms. (steps per millisecond=70 ) properties seen :41
[2025-05-31 09:52:21] [INFO ] Flow matrix only has 446 transitions (discarded 7 similar events)
// Phase 1: matrix 446 rows 166 cols
[2025-05-31 09:52:21] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:52:21] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 59/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 09:52:21] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2025-05-31 09:52:21] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 64/156 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 09:52:22] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2025-05-31 09:52:22] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 2 ms to minimize.
[2025-05-31 09:52:22] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
[2025-05-31 09:52:23] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2025-05-31 09:52:23] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-05-31 09:52:23] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 446/602 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 54/225 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 10/612 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 0/612 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 235 constraints, problems are : Problem set: 0 solved, 51 unsolved in 4947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 59/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 64/156 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 446/602 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 54/225 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 51/276 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 10/612 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 0/612 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 286 constraints, problems are : Problem set: 0 solved, 51 unsolved in 7004 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 8/8 constraints]
After SMT, in 12015ms problems are : Problem set: 0 solved, 51 unsolved
Parikh walk visited 0 properties in 12114 ms.
Support contains 33 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 453/453 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 434
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 154 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 154 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 154 transition count 426
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 153 transition count 423
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 153 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 152 transition count 421
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 152 transition count 421
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 151 transition count 418
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 151 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 150 transition count 416
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 150 transition count 416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 149 transition count 413
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 149 transition count 413
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 148 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 148 transition count 411
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 147 transition count 408
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 147 transition count 408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 146 transition count 406
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 146 transition count 406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 145 transition count 404
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 145 transition count 404
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 144 transition count 402
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 144 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 144 transition count 400
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 144 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 140 transition count 396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 139 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 139 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 139 transition count 392
Applied a total of 62 rules in 101 ms. Remains 139 /166 variables (removed 27) and now considering 392/453 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 139/166 places, 392/453 transitions.
RANDOM walk for 4000000 steps (185267 resets) in 47428 ms. (84 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400001 steps (1942 resets) in 1965 ms. (203 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4682 resets) in 1520 ms. (262 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1919 resets) in 1800 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4690 resets) in 1836 ms. (217 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1934 resets) in 1585 ms. (252 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4715 resets) in 1967 ms. (203 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1939 resets) in 2011 ms. (198 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4666 resets) in 1651 ms. (242 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1940 resets) in 1540 ms. (259 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4686 resets) in 1469 ms. (272 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (1932 resets) in 1790 ms. (223 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4643 resets) in 1355 ms. (294 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1939 resets) in 1617 ms. (247 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4820 resets) in 1636 ms. (244 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (1956 resets) in 1666 ms. (239 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4739 resets) in 1683 ms. (237 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4706 resets) in 1575 ms. (253 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4686 resets) in 1719 ms. (232 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4722 resets) in 1375 ms. (290 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4717 resets) in 1760 ms. (227 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (4658 resets) in 1342 ms. (297 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4666 resets) in 1412 ms. (283 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4675 resets) in 1385 ms. (288 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (4635 resets) in 1274 ms. (313 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4716 resets) in 1692 ms. (236 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4690 resets) in 1408 ms. (283 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4674 resets) in 1685 ms. (237 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4717 resets) in 1851 ms. (215 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4720 resets) in 1437 ms. (278 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4752 resets) in 1578 ms. (253 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4752 resets) in 1308 ms. (305 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4762 resets) in 1952 ms. (204 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4735 resets) in 1927 ms. (207 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4709 resets) in 1458 ms. (274 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4706 resets) in 1998 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (6193 resets) in 1994 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4793 resets) in 1756 ms. (227 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4667 resets) in 2008 ms. (199 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4763 resets) in 1694 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4772 resets) in 1704 ms. (234 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4739 resets) in 1477 ms. (270 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4667 resets) in 1735 ms. (230 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4773 resets) in 1219 ms. (327 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4725 resets) in 2146 ms. (186 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (6205 resets) in 2101 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4687 resets) in 1314 ms. (304 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4735 resets) in 1809 ms. (220 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (4778 resets) in 1446 ms. (276 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (1959 resets) in 1617 ms. (247 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4638 resets) in 1355 ms. (294 steps per ms) remains 50/50 properties
Interrupted probabilistic random walk after 9932145 steps, run timeout after 135001 ms. (steps per millisecond=73 ) properties seen :18 out of 50
Probabilistic random walk after 9932145 steps, saw 2786821 distinct states, run finished after 135001 ms. (steps per millisecond=73 ) properties seen :18
[2025-05-31 09:55:45] [INFO ] Flow matrix only has 385 transitions (discarded 7 similar events)
// Phase 1: matrix 385 rows 139 cols
[2025-05-31 09:55:45] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:55:45] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 61/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:55:45] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2025-05-31 09:55:46] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-05-31 09:55:46] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/131 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:55:46] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 385/516 variables, 131/142 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 49/191 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:55:48] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 8/524 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/524 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 200 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3911 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 61/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/131 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 385/516 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 49/192 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 32/224 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 8/524 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/524 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 232 constraints, problems are : Problem set: 0 solved, 32 unsolved in 5133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
After SMT, in 9079ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 6048 ms.
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 392/392 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 135 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 135 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 379
Applied a total of 11 rules in 32 ms. Remains 135 /139 variables (removed 4) and now considering 379/392 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 135/139 places, 379/392 transitions.
RANDOM walk for 4000000 steps (185569 resets) in 42818 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1910 resets) in 1849 ms. (216 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4697 resets) in 1361 ms. (293 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1939 resets) in 1405 ms. (284 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4737 resets) in 1272 ms. (314 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1964 resets) in 1460 ms. (273 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4672 resets) in 1457 ms. (274 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1943 resets) in 1730 ms. (231 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4712 resets) in 1433 ms. (278 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1940 resets) in 1613 ms. (247 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4773 resets) in 1443 ms. (277 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4760 resets) in 1291 ms. (309 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1927 resets) in 1817 ms. (220 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4721 resets) in 1205 ms. (331 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4681 resets) in 1480 ms. (270 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4642 resets) in 1571 ms. (254 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4675 resets) in 1413 ms. (282 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4689 resets) in 1197 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4663 resets) in 1656 ms. (241 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4624 resets) in 1787 ms. (223 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4672 resets) in 1249 ms. (320 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4671 resets) in 1423 ms. (280 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4675 resets) in 1374 ms. (290 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4708 resets) in 1185 ms. (337 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4731 resets) in 1333 ms. (299 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4727 resets) in 1440 ms. (277 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4719 resets) in 1453 ms. (275 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4720 resets) in 1362 ms. (293 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4698 resets) in 1368 ms. (292 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4757 resets) in 1257 ms. (317 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4688 resets) in 1174 ms. (340 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4731 resets) in 1125 ms. (355 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4745 resets) in 1275 ms. (313 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 7365695 steps, run timeout after 96001 ms. (steps per millisecond=76 ) properties seen :0 out of 32
Probabilistic random walk after 7365695 steps, saw 2042998 distinct states, run finished after 96001 ms. (steps per millisecond=76 ) properties seen :0
[2025-05-31 09:58:09] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2025-05-31 09:58:09] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:58:09] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:58:10] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-05-31 09:58:10] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2025-05-31 09:58:10] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:58:10] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2025-05-31 09:58:10] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:58:11] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 09:58:11] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 372/499 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 8/507 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/507 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 196 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 32/220 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 228 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints]
After SMT, in 6542ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 3998 ms.
Support contains 23 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 135/135 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2025-05-31 09:58:20] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 09:58:20] [INFO ] Invariant cache hit.
[2025-05-31 09:58:20] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-31 09:58:20] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 09:58:20] [INFO ] Invariant cache hit.
[2025-05-31 09:58:20] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-31 09:58:20] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2025-05-31 09:58:20] [INFO ] Redundant transitions in 27 ms returned []
Running 375 sub problems to find dead transitions.
[2025-05-31 09:58:20] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 09:58:20] [INFO ] Invariant cache hit.
[2025-05-31 09:58:20] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-31 09:58:24] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-05-31 09:58:24] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2025-05-31 09:58:24] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 2 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2025-05-31 09:58:25] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2025-05-31 09:58:26] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 200 constraints, problems are : Problem set: 0 solved, 375 unsolved in 16798 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 375/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
After SMT, in 47212ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 47217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47735 ms. Remains : 135/135 places, 379/379 transitions.
RANDOM walk for 400000 steps (18589 resets) in 5294 ms. (75 steps per ms) remains 16/23 properties
Running SMT prover for 16 properties.
[2025-05-31 09:59:09] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 09:59:09] [INFO ] Invariant cache hit.
[2025-05-31 09:59:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 09:59:10] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2025-05-31 09:59:10] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-31 09:59:10] [INFO ] After 59ms SMT Verify possible using 47 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2025-05-31 09:59:10] [INFO ] After 549ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2025-05-31 09:59:10] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2025-05-31 09:59:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 09:59:10] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2025-05-31 09:59:11] [INFO ] After 64ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2025-05-31 09:59:11] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
[2025-05-31 09:59:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-05-31 09:59:11] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2025-05-31 09:59:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
TRAPS : Iteration 1
[2025-05-31 09:59:12] [INFO ] After 1088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2025-05-31 09:59:12] [INFO ] After 1390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 4000000 steps (185764 resets) in 52038 ms. (76 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1944 resets) in 1941 ms. (205 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4689 resets) in 1583 ms. (252 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1935 resets) in 1929 ms. (207 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4666 resets) in 1668 ms. (239 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1909 resets) in 1430 ms. (279 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4667 resets) in 1604 ms. (249 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1920 resets) in 1707 ms. (234 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4692 resets) in 1625 ms. (246 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1938 resets) in 1584 ms. (252 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4721 resets) in 1480 ms. (270 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4710 resets) in 1720 ms. (232 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1979 resets) in 1728 ms. (231 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4670 resets) in 1692 ms. (236 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4693 resets) in 1104 ms. (361 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4716 resets) in 1679 ms. (238 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4716 resets) in 1553 ms. (257 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4697 resets) in 1713 ms. (233 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4669 resets) in 1806 ms. (221 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4680 resets) in 1179 ms. (338 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4698 resets) in 1503 ms. (265 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4670 resets) in 1517 ms. (263 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4680 resets) in 1485 ms. (269 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4728 resets) in 1537 ms. (260 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4767 resets) in 1560 ms. (256 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4757 resets) in 1515 ms. (263 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4739 resets) in 1495 ms. (267 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4755 resets) in 1535 ms. (260 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4675 resets) in 1632 ms. (244 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4720 resets) in 1699 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4710 resets) in 1827 ms. (218 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4698 resets) in 1711 ms. (233 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4787 resets) in 1753 ms. (228 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 9340285 steps, run timeout after 126001 ms. (steps per millisecond=74 ) properties seen :0 out of 32
Probabilistic random walk after 9340285 steps, saw 2613737 distinct states, run finished after 126001 ms. (steps per millisecond=74 ) properties seen :0
[2025-05-31 10:02:01] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 10:02:01] [INFO ] Invariant cache hit.
[2025-05-31 10:02:01] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 10:02:01] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-05-31 10:02:01] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2025-05-31 10:02:01] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 10:02:02] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-05-31 10:02:04] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 372/499 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 32/218 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 8/507 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/507 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 226 constraints, problems are : Problem set: 0 solved, 32 unsolved in 4367 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
After SMT, in 6972ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 5617 ms.
Support contains 23 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 135/135 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2025-05-31 10:02:13] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 10:02:13] [INFO ] Invariant cache hit.
[2025-05-31 10:02:13] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-05-31 10:02:13] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 10:02:13] [INFO ] Invariant cache hit.
[2025-05-31 10:02:14] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-31 10:02:14] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2025-05-31 10:02:14] [INFO ] Redundant transitions in 13 ms returned []
Running 375 sub problems to find dead transitions.
[2025-05-31 10:02:14] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 10:02:14] [INFO ] Invariant cache hit.
[2025-05-31 10:02:14] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2025-05-31 10:02:19] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 3 ms to minimize.
[2025-05-31 10:02:19] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2025-05-31 10:02:20] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 3 ms to minimize.
[2025-05-31 10:02:20] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2025-05-31 10:02:20] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2025-05-31 10:02:21] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 2 ms to minimize.
[2025-05-31 10:02:21] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2025-05-31 10:02:21] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2025-05-31 10:02:21] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2025-05-31 10:02:21] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2025-05-31 10:02:23] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 200 constraints, problems are : Problem set: 0 solved, 375 unsolved in 25459 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 375/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
After SMT, in 56074ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 56081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56775 ms. Remains : 135/135 places, 379/379 transitions.
RANDOM walk for 400000 steps (18618 resets) in 4084 ms. (97 steps per ms) remains 15/23 properties
Running SMT prover for 15 properties.
[2025-05-31 10:03:12] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 10:03:12] [INFO ] Invariant cache hit.
[2025-05-31 10:03:12] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 10:03:12] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2025-05-31 10:03:12] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-31 10:03:12] [INFO ] After 67ms SMT Verify possible using 47 Read/Feed constraints in real domain returned unsat :0 sat :15
TRAPS : Iteration 0
[2025-05-31 10:03:12] [INFO ] After 450ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2025-05-31 10:03:12] [INFO ] After 711ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2025-05-31 10:03:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 10:03:13] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2025-05-31 10:03:13] [INFO ] After 74ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :15
TRAPS : Iteration 0
[2025-05-31 10:03:13] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2025-05-31 10:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 1
[2025-05-31 10:03:14] [INFO ] After 1025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
[2025-05-31 10:03:14] [INFO ] After 1319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
RANDOM walk for 102 steps (3 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1830 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (476 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037179 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037179 steps, saw 305304 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2025-05-31 10:03:17] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2025-05-31 10:03:17] [INFO ] Invariant cache hit.
[2025-05-31 10:03:17] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:03:17] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2025-05-31 10:03:17] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 2 ms to minimize.
[2025-05-31 10:03:17] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2025-05-31 10:03:17] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:03:18] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 132 transition count 367
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 128 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 127 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 127 transition count 366
Applied a total of 16 rules in 35 ms. Remains 127 /135 variables (removed 8) and now considering 366/379 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 127/135 places, 366/379 transitions.
RANDOM walk for 40000 steps (2006 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (496 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 974208 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 1
Probabilistic random walk after 974208 steps, saw 281279 distinct states, run finished after 3003 ms. (steps per millisecond=324 ) properties seen :0
[2025-05-31 10:03:21] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
// Phase 1: matrix 359 rows 127 cols
[2025-05-31 10:03:21] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 10:03:21] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:03:21] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 359/478 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 67/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:03:22] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/486 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/486 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:03:22] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 359/478 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 67/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/486 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/486 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 366/366 transitions.
Applied a total of 0 rules in 8 ms. Remains 127 /127 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/127 places, 366/366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 366/366 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2025-05-31 10:03:22] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2025-05-31 10:03:22] [INFO ] Invariant cache hit.
[2025-05-31 10:03:22] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-05-31 10:03:22] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2025-05-31 10:03:22] [INFO ] Invariant cache hit.
[2025-05-31 10:03:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-05-31 10:03:23] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2025-05-31 10:03:23] [INFO ] Redundant transitions in 11 ms returned []
Running 362 sub problems to find dead transitions.
[2025-05-31 10:03:23] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2025-05-31 10:03:23] [INFO ] Invariant cache hit.
[2025-05-31 10:03:23] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2025-05-31 10:03:28] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2025-05-31 10:03:28] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2025-05-31 10:03:28] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2025-05-31 10:03:28] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 2 ms to minimize.
[2025-05-31 10:03:29] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
[2025-05-31 10:03:29] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2025-05-31 10:03:29] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2025-05-31 10:03:30] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2025-05-31 10:03:30] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 359/486 variables, 127/143 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 67/210 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 210 constraints, problems are : Problem set: 0 solved, 362 unsolved in 19046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2025-05-31 10:03:45] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 359/486 variables, 127/144 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 67/211 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 362/573 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 573 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 10/10 constraints]
After SMT, in 49697ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 49708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50609 ms. Remains : 127/127 places, 366/366 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 83 edges and 127 vertex of which 20 / 127 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 108 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 247
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 108 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 107 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 107 transition count 218
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 107 transition count 214
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 103 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 103 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 101 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 100 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 100 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 99 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 98 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 98 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 98 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 96 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 96 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 96 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 94 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 94 transition count 172
Applied a total of 72 rules in 59 ms. Remains 94 /127 variables (removed 33) and now considering 172/366 (removed 194) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:04:13] [INFO ] Flow matrix only has 170 transitions (discarded 2 similar events)
// Phase 1: matrix 170 rows 94 cols
[2025-05-31 10:04:13] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 10:04:13] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 10:04:13] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:04:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 10:04:13] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:04:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 10:04:13] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:04:13] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:04:13] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 323 ms.
RANDOM walk for 288 steps (10 resets) in 4 ms. (57 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1850 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (467 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1027896 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 1
Probabilistic random walk after 1027896 steps, saw 302656 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
[2025-05-31 10:04:16] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2025-05-31 10:04:16] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:04:16] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:04:16] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2025-05-31 10:04:16] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2025-05-31 10:04:16] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 131 transition count 365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 127 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 126 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 126 transition count 364
Applied a total of 18 rules in 27 ms. Remains 126 /135 variables (removed 9) and now considering 364/379 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 126/135 places, 364/379 transitions.
RANDOM walk for 40000 steps (1972 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (490 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1102046 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1102046 steps, saw 322401 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2025-05-31 10:04:20] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
// Phase 1: matrix 357 rows 126 cols
[2025-05-31 10:04:20] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:04:20] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:04:20] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 357/475 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 67/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/483 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/483 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:04:20] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2025-05-31 10:04:20] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2025-05-31 10:04:21] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 357/475 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 67/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/483 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/483 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 746ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 364/364 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 126/126 places, 364/364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 364/364 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2025-05-31 10:04:21] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
[2025-05-31 10:04:21] [INFO ] Invariant cache hit.
[2025-05-31 10:04:21] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-05-31 10:04:21] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
[2025-05-31 10:04:21] [INFO ] Invariant cache hit.
[2025-05-31 10:04:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-05-31 10:04:21] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2025-05-31 10:04:21] [INFO ] Redundant transitions in 3 ms returned []
Running 360 sub problems to find dead transitions.
[2025-05-31 10:04:21] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
[2025-05-31 10:04:21] [INFO ] Invariant cache hit.
[2025-05-31 10:04:21] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 4 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2025-05-31 10:04:25] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2025-05-31 10:04:26] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2025-05-31 10:04:26] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 357/483 variables, 126/143 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 67/210 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/483 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 210 constraints, problems are : Problem set: 0 solved, 360 unsolved in 17003 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 357/483 variables, 126/143 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 67/210 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 360/570 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-31 10:04:52] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 571 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 11/11 constraints]
After SMT, in 47412ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 47416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47955 ms. Remains : 126/126 places, 364/364 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 83 edges and 126 vertex of which 20 / 126 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 107 transition count 245
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 107 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 107 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 106 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 106 transition count 216
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 106 transition count 212
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 102 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 102 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 100 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 99 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 99 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 98 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 97 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 97 transition count 178
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 97 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 95 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 95 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 95 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 93 transition count 170
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 93 transition count 170
Applied a total of 72 rules in 41 ms. Remains 93 /126 variables (removed 33) and now considering 170/364 (removed 194) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:05:09] [INFO ] Flow matrix only has 168 transitions (discarded 2 similar events)
// Phase 1: matrix 168 rows 93 cols
[2025-05-31 10:05:09] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 10:05:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 10:05:09] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:05:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 10:05:09] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:05:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 10:05:09] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:05:09] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:05:09] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 314 ms.
RANDOM walk for 40000 steps (1850 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (471 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1033346 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1033346 steps, saw 304200 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2025-05-31 10:05:12] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2025-05-31 10:05:12] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:05:12] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:05:12] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2025-05-31 10:05:12] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2025-05-31 10:05:13] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:05:13] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 990ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 130 transition count 362
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 126 transition count 362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 125 transition count 361
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 125 transition count 361
Applied a total of 20 rules in 24 ms. Remains 125 /135 variables (removed 10) and now considering 361/379 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 125/135 places, 361/379 transitions.
RANDOM walk for 40000 steps (2005 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (487 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1130567 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 1130567 steps, saw 328957 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
[2025-05-31 10:05:16] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
// Phase 1: matrix 354 rows 125 cols
[2025-05-31 10:05:16] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:05:16] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/117 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:05:16] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 354/471 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 66/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/479 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/479 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/117 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:05:17] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 354/471 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 66/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/479 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/479 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 361/361 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 361/361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 361/361 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2025-05-31 10:05:17] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
[2025-05-31 10:05:17] [INFO ] Invariant cache hit.
[2025-05-31 10:05:17] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-05-31 10:05:17] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
[2025-05-31 10:05:17] [INFO ] Invariant cache hit.
[2025-05-31 10:05:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-05-31 10:05:17] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2025-05-31 10:05:17] [INFO ] Redundant transitions in 3 ms returned []
Running 357 sub problems to find dead transitions.
[2025-05-31 10:05:17] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
[2025-05-31 10:05:17] [INFO ] Invariant cache hit.
[2025-05-31 10:05:17] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2025-05-31 10:05:20] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2025-05-31 10:05:20] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2025-05-31 10:05:21] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
[2025-05-31 10:05:21] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-05-31 10:05:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2025-05-31 10:05:21] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2025-05-31 10:05:21] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2025-05-31 10:05:22] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2025-05-31 10:05:22] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 354/479 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 66/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 207 constraints, problems are : Problem set: 0 solved, 357 unsolved in 15488 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 354/479 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 66/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 357/564 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 564 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 9/9 constraints]
After SMT, in 45900ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 45904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46446 ms. Remains : 125/125 places, 361/361 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 82 edges and 125 vertex of which 20 / 125 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 106 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 106 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 106 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 105 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 105 transition count 213
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 105 transition count 209
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 101 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 101 transition count 205
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 99 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 98 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 98 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 97 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 96 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 96 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 96 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 94 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 94 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 94 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 92 transition count 168
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 92 transition count 168
Applied a total of 72 rules in 27 ms. Remains 92 /125 variables (removed 33) and now considering 168/361 (removed 193) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:06:03] [INFO ] Flow matrix only has 166 transitions (discarded 2 similar events)
// Phase 1: matrix 166 rows 92 cols
[2025-05-31 10:06:03] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 10:06:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 10:06:03] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:06:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 10:06:03] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:06:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 10:06:03] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:06:03] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:06:03] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 276 ms.
RANDOM walk for 40000 steps (1844 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (463 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1021289 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1021289 steps, saw 300342 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2025-05-31 10:06:07] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2025-05-31 10:06:07] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:06:07] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:06:07] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2025-05-31 10:06:07] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2025-05-31 10:06:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 129 transition count 360
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 125 transition count 360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 124 transition count 359
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 124 transition count 359
Applied a total of 22 rules in 26 ms. Remains 124 /135 variables (removed 11) and now considering 359/379 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 124/135 places, 359/379 transitions.
RANDOM walk for 40000 steps (1984 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (485 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1136998 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :0 out of 1
Probabilistic random walk after 1136998 steps, saw 330262 distinct states, run finished after 3005 ms. (steps per millisecond=378 ) properties seen :0
[2025-05-31 10:06:10] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
// Phase 1: matrix 352 rows 124 cols
[2025-05-31 10:06:10] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:06:10] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/116 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:06:10] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 352/468 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 66/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:06:11] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/476 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/476 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/476 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/116 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:06:11] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/468 variables, 116/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 66/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/476 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/476 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 359/359 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 124/124 places, 359/359 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 359/359 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 359/359 (removed 0) transitions.
[2025-05-31 10:06:11] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
[2025-05-31 10:06:11] [INFO ] Invariant cache hit.
[2025-05-31 10:06:11] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-31 10:06:11] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
[2025-05-31 10:06:11] [INFO ] Invariant cache hit.
[2025-05-31 10:06:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-05-31 10:06:12] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2025-05-31 10:06:12] [INFO ] Redundant transitions in 2 ms returned []
Running 355 sub problems to find dead transitions.
[2025-05-31 10:06:12] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
[2025-05-31 10:06:12] [INFO ] Invariant cache hit.
[2025-05-31 10:06:12] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2025-05-31 10:06:15] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 3 ms to minimize.
[2025-05-31 10:06:15] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2025-05-31 10:06:15] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2025-05-31 10:06:16] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2025-05-31 10:06:16] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2025-05-31 10:06:16] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2025-05-31 10:06:17] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2025-05-31 10:06:17] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 352/476 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 66/205 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 205 constraints, problems are : Problem set: 0 solved, 355 unsolved in 17542 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2025-05-31 10:06:32] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 352/476 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 66/206 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 355/561 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 561 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 9/9 constraints]
After SMT, in 47978ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 47983ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48576 ms. Remains : 124/124 places, 359/359 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 82 edges and 124 vertex of which 20 / 124 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 105 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 105 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 105 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 104 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 104 transition count 211
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 104 transition count 207
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 100 transition count 205
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 100 transition count 203
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 98 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 97 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 97 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 96 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 95 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 95 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 95 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 93 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 93 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 91 transition count 166
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 91 transition count 166
Applied a total of 72 rules in 50 ms. Remains 91 /124 variables (removed 33) and now considering 166/359 (removed 193) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:07:00] [INFO ] Flow matrix only has 164 transitions (discarded 2 similar events)
// Phase 1: matrix 164 rows 91 cols
[2025-05-31 10:07:00] [INFO ] Computed 7 invariants in 0 ms
[2025-05-31 10:07:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 10:07:00] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:07:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 10:07:00] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:07:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 10:07:00] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:07:00] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:07:00] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 404 ms.
RANDOM walk for 40000 steps (1863 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (468 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 987046 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 1
Probabilistic random walk after 987046 steps, saw 289740 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
[2025-05-31 10:07:03] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2025-05-31 10:07:03] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 10:07:03] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:07:03] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2025-05-31 10:07:03] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2025-05-31 10:07:04] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 128 transition count 357
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 124 transition count 357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 123 transition count 356
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 123 transition count 356
Applied a total of 24 rules in 37 ms. Remains 123 /135 variables (removed 12) and now considering 356/379 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 123/135 places, 356/379 transitions.
RANDOM walk for 40000 steps (2023 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (500 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1119546 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 1
Probabilistic random walk after 1119546 steps, saw 326680 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
[2025-05-31 10:07:07] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
// Phase 1: matrix 349 rows 123 cols
[2025-05-31 10:07:07] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:07:07] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/115 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:07:07] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2025-05-31 10:07:08] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 349/464 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/472 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/115 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 349/464 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/472 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 566ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 356/356 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 123/123 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 356/356 transitions.
Applied a total of 0 rules in 15 ms. Remains 123 /123 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2025-05-31 10:07:08] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
[2025-05-31 10:07:08] [INFO ] Invariant cache hit.
[2025-05-31 10:07:08] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-31 10:07:08] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
[2025-05-31 10:07:08] [INFO ] Invariant cache hit.
[2025-05-31 10:07:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 10:07:09] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2025-05-31 10:07:09] [INFO ] Redundant transitions in 4 ms returned []
Running 352 sub problems to find dead transitions.
[2025-05-31 10:07:09] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
[2025-05-31 10:07:09] [INFO ] Invariant cache hit.
[2025-05-31 10:07:09] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2025-05-31 10:07:13] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 2 ms to minimize.
[2025-05-31 10:07:13] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2025-05-31 10:07:13] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2025-05-31 10:07:14] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2025-05-31 10:07:14] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2025-05-31 10:07:14] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2025-05-31 10:07:16] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 349/472 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 65/202 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 202 constraints, problems are : Problem set: 0 solved, 352 unsolved in 21328 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2025-05-31 10:07:33] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2025-05-31 10:07:36] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (OVERLAPS) 349/472 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 65/204 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 352/556 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 556 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints]
After SMT, in 51943ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 51950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52800 ms. Remains : 123/123 places, 356/356 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 81 edges and 123 vertex of which 20 / 123 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 104 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 104 transition count 237
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 104 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 103 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 103 transition count 208
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 103 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 99 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 99 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 97 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 96 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 96 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 95 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 94 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 94 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 94 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 92 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 92 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 92 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 90 transition count 164
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 90 transition count 164
Applied a total of 72 rules in 38 ms. Remains 90 /123 variables (removed 33) and now considering 164/356 (removed 192) transitions.
Running SMT prover for 1 properties.
[2025-05-31 10:08:01] [INFO ] Flow matrix only has 162 transitions (discarded 2 similar events)
// Phase 1: matrix 162 rows 90 cols
[2025-05-31 10:08:01] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 10:08:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 10:08:01] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 10:08:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 10:08:01] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 10:08:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 10:08:01] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 10:08:01] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 10:08:01] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 335 ms.
RANDOM walk for 40000 steps (1829 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (450 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037574 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037574 steps, saw 305419 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2025-05-31 10:08:04] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2025-05-31 10:08:04] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 10:08:04] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:08:04] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2025-05-31 10:08:04] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2025-05-31 10:08:04] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 127 transition count 355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 123 transition count 355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 122 transition count 354
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 122 transition count 354
Applied a total of 26 rules in 18 ms. Remains 122 /135 variables (removed 13) and now considering 354/379 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 122/135 places, 354/379 transitions.
RANDOM walk for 40000 steps (1985 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (498 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1136545 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :0 out of 1
Probabilistic random walk after 1136545 steps, saw 330127 distinct states, run finished after 3001 ms. (steps per millisecond=378 ) properties seen :0
[2025-05-31 10:08:08] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
// Phase 1: matrix 347 rows 122 cols
[2025-05-31 10:08:08] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 10:08:08] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:08:08] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-05-31 10:08:08] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 347/461 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 65/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/469 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/469 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 10:08:08] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2025-05-31 10:08:09] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 347/461 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 65/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/469 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/469 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 122/122 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-05-31 10:08:09] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
[2025-05-31 10:08:09] [INFO ] Invariant cache hit.
[2025-05-31 10:08:09] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-31 10:08:09] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
[2025-05-31 10:08:09] [INFO ] Invariant cache hit.
[2025-05-31 10:08:09] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-31 10:08:09] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2025-05-31 10:08:09] [INFO ] Redundant transitions in 3 ms returned []
Running 350 sub problems to find dead transitions.
[2025-05-31 10:08:09] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
[2025-05-31 10:08:09] [INFO ] Invariant cache hit.
[2025-05-31 10:08:09] [INFO ] State equation strengthened by 65 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-18, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-smll-174860112300237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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