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-174860112300242.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-19, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112300242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 221K 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 1748684633310

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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 09:43:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 09:43:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 09:43:55] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2025-05-31 09:43:55] [INFO ] Transformed 602 places.
[2025-05-31 09:43:55] [INFO ] Transformed 944 transitions.
[2025-05-31 09:43:55] [INFO ] Found NUPN structural information;
[2025-05-31 09:43:55] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 359 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 494 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 9 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 186 rules applied. Total rules applied 187 place count 577 transition count 750
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 180 rules applied. Total rules applied 367 place count 400 transition count 747
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 369 place count 398 transition count 747
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 369 place count 398 transition count 738
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 387 place count 389 transition count 738
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 647 place count 259 transition count 608
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -255
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 741 place count 212 transition count 863
Applied a total of 741 rules in 188 ms. Remains 212 /602 variables (removed 390) and now considering 863/944 (removed 81) transitions.
[2025-05-31 09:43:55] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
// Phase 1: matrix 809 rows 212 cols
[2025-05-31 09:43:55] [INFO ] Computed 10 invariants in 43 ms
[2025-05-31 09:43:56] [INFO ] Implicit Places using invariants in 575 ms returned []
[2025-05-31 09:43:56] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
[2025-05-31 09:43:56] [INFO ] Invariant cache hit.
[2025-05-31 09:43:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-31 09:43:57] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-31 09:43:57] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
[2025-05-31 09:43:57] [INFO ] Invariant cache hit.
[2025-05-31 09:43:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2025-05-31 09:44:13] [INFO ] Deduced a trap composed of 63 places in 309 ms of which 33 ms to minimize.
[2025-05-31 09:44:13] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 3 ms to minimize.
[2025-05-31 09:44:13] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2025-05-31 09:44:13] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2025-05-31 09:44:14] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 3 ms to minimize.
[2025-05-31 09:44:15] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 808/1020 variables, 212/440 constraints. Problems are: Problem set: 0 solved, 847 unsolved
SMT process timed out in 32186ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 32237ms
Starting structural reductions in LIVENESS mode, iteration 1 : 212/602 places, 863/944 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 34471 ms. Remains : 212/602 places, 863/944 transitions.
Discarding 419 transitions out of 863. Remains 444
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2203 resets) in 3563 ms. (11 steps per ms) remains 325/443 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 325/325 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 325/325 properties
[2025-05-31 09:44:31] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
[2025-05-31 09:44:31] [INFO ] Invariant cache hit.
[2025-05-31 09:44:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 21/202 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 21/212 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/1021 variables, and 212 constraints, problems are : Problem set: 0 solved, 325 unsolved in 5022 ms.
Refiners :[Domain max(s): 202/212 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/212 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 21/202 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 21/212 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2025-05-31 09:44:39] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 3 ms to minimize.
[2025-05-31 09:44:40] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 2 ms to minimize.
[2025-05-31 09:44:41] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-05-31 09:44:41] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 3 ms to minimize.
[2025-05-31 09:44:41] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/1021 variables, and 217 constraints, problems are : Problem set: 0 solved, 325 unsolved in 5015 ms.
Refiners :[Domain max(s): 202/212 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/212 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/325 constraints, Known Traps: 5/5 constraints]
After SMT, in 10732ms problems are : Problem set: 0 solved, 325 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 181 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 863/863 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 212 transition count 850
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 209 transition count 844
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 209 transition count 844
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 209 transition count 836
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 208 transition count 843
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 2 with 120 rules applied. Total rules applied 149 place count 208 transition count 723
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 208 transition count 719
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 204 transition count 719
Applied a total of 157 rules in 129 ms. Remains 204 /212 variables (removed 8) and now considering 719/863 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 204/212 places, 719/863 transitions.
RANDOM walk for 4000000 steps (177485 resets) in 65845 ms. (60 steps per ms) remains 115/325 properties
BEST_FIRST walk for 40002 steps (222 resets) in 235 ms. (169 steps per ms) remains 107/115 properties
BEST_FIRST walk for 40003 steps (311 resets) in 331 ms. (120 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (224 resets) in 212 ms. (187 steps per ms) remains 104/107 properties
BEST_FIRST walk for 40004 steps (320 resets) in 203 ms. (196 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (218 resets) in 187 ms. (212 steps per ms) remains 98/104 properties
BEST_FIRST walk for 40003 steps (218 resets) in 203 ms. (196 steps per ms) remains 95/98 properties
BEST_FIRST walk for 40002 steps (307 resets) in 195 ms. (204 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (220 resets) in 198 ms. (201 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (299 resets) in 169 ms. (235 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (227 resets) in 178 ms. (223 steps per ms) remains 92/95 properties
BEST_FIRST walk for 40003 steps (317 resets) in 97 ms. (408 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40002 steps (232 resets) in 115 ms. (344 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40003 steps (303 resets) in 100 ms. (396 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40004 steps (223 resets) in 114 ms. (347 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40003 steps (212 resets) in 119 ms. (333 steps per ms) remains 90/92 properties
BEST_FIRST walk for 40004 steps (207 resets) in 116 ms. (341 steps per ms) remains 89/90 properties
BEST_FIRST walk for 40004 steps (302 resets) in 100 ms. (396 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (313 resets) in 100 ms. (396 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (307 resets) in 84 ms. (470 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (314 resets) in 84 ms. (470 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (314 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (302 resets) in 85 ms. (465 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (315 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (313 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (304 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (317 resets) in 82 ms. (481 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (314 resets) in 84 ms. (470 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (312 resets) in 85 ms. (465 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (304 resets) in 97 ms. (408 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (318 resets) in 78 ms. (506 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40001 steps (309 resets) in 79 ms. (500 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (315 resets) in 79 ms. (500 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (309 resets) in 77 ms. (512 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (299 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (305 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (309 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (314 resets) in 79 ms. (500 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (308 resets) in 79 ms. (500 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (315 resets) in 79 ms. (500 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (312 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (309 resets) in 83 ms. (476 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (290 resets) in 78 ms. (506 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (310 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (298 resets) in 82 ms. (481 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (299 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (308 resets) in 82 ms. (481 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (304 resets) in 82 ms. (481 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (308 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (313 resets) in 84 ms. (470 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (310 resets) in 83 ms. (476 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (305 resets) in 90 ms. (439 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (311 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (314 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (309 resets) in 78 ms. (506 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (294 resets) in 84 ms. (470 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (307 resets) in 80 ms. (493 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (293 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (299 resets) in 78 ms. (506 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (328 resets) in 81 ms. (487 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (295 resets) in 78 ms. (506 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (303 resets) in 78 ms. (506 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (307 resets) in 82 ms. (481 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40003 steps (309 resets) in 85 ms. (465 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (310 resets) in 93 ms. (425 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (319 resets) in 110 ms. (360 steps per ms) remains 89/89 properties
[2025-05-31 09:45:01] [INFO ] Flow matrix only has 676 transitions (discarded 43 similar events)
// Phase 1: matrix 676 rows 204 cols
[2025-05-31 09:45:01] [INFO ] Computed 10 invariants in 4 ms
[2025-05-31 09:45:01] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 117/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2025-05-31 09:45:02] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 3 ms to minimize.
[2025-05-31 09:45:02] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 2 ms to minimize.
[2025-05-31 09:45:03] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 10/198 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2025-05-31 09:45:04] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2025-05-31 09:45:05] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 676/874 variables, 198/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 76/289 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 6/880 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/880 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/880 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 295 constraints, problems are : Problem set: 0 solved, 89 unsolved in 19869 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 117/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 10/198 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2025-05-31 09:45:23] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2025-05-31 09:45:23] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 676/874 variables, 198/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 76/291 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/874 variables, 85/376 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/874 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 6/880 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/880 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/880 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 0/880 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 386 constraints, problems are : Problem set: 0 solved, 89 unsolved in 44273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
After SMT, in 64391ms problems are : Problem set: 0 solved, 89 unsolved
Fused 89 Parikh solutions to 88 different solutions.
Parikh walk visited 0 properties in 30468 ms.
Support contains 71 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 719/719 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 199 transition count 708
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 199 transition count 708
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 28 place count 199 transition count 690
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 39 place count 199 transition count 679
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 95 place count 188 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 125 place count 188 transition count 604
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 188 transition count 604
Applied a total of 129 rules in 85 ms. Remains 188 /204 variables (removed 16) and now considering 604/719 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 188/204 places, 604/719 transitions.
RANDOM walk for 4000000 steps (145328 resets) in 33385 ms. (119 steps per ms) remains 46/89 properties
BEST_FIRST walk for 400003 steps (2740 resets) in 662 ms. (603 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1095 resets) in 756 ms. (528 steps per ms) remains 44/46 properties
BEST_FIRST walk for 400002 steps (1080 resets) in 729 ms. (547 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (2749 resets) in 642 ms. (622 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (1074 resets) in 751 ms. (531 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (2744 resets) in 642 ms. (622 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400003 steps (2749 resets) in 648 ms. (616 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2744 resets) in 639 ms. (625 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2739 resets) in 651 ms. (613 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2733 resets) in 634 ms. (629 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2706 resets) in 645 ms. (619 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (2722 resets) in 654 ms. (610 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (2726 resets) in 619 ms. (645 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2752 resets) in 644 ms. (620 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (2825 resets) in 634 ms. (629 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2728 resets) in 638 ms. (625 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2724 resets) in 632 ms. (631 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2699 resets) in 630 ms. (633 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2768 resets) in 636 ms. (627 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2436 resets) in 577 ms. (692 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2716 resets) in 618 ms. (646 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2713 resets) in 643 ms. (621 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2750 resets) in 638 ms. (625 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2730 resets) in 638 ms. (625 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2757 resets) in 633 ms. (630 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2744 resets) in 648 ms. (616 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 627 ms. (636 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2538 resets) in 597 ms. (668 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2669 resets) in 605 ms. (660 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2765 resets) in 636 ms. (627 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2756 resets) in 632 ms. (631 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2777 resets) in 633 ms. (630 steps per ms) remains 37/41 properties
BEST_FIRST walk for 400004 steps (2744 resets) in 624 ms. (640 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2805 resets) in 612 ms. (652 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2780 resets) in 624 ms. (640 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2270 resets) in 534 ms. (747 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400003 steps (2745 resets) in 613 ms. (651 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (885 resets) in 754 ms. (529 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (2689 resets) in 632 ms. (631 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400003 steps (2747 resets) in 634 ms. (629 steps per ms) remains 35/35 properties
[2025-05-31 09:46:52] [INFO ] Flow matrix only has 572 transitions (discarded 32 similar events)
// Phase 1: matrix 572 rows 188 cols
[2025-05-31 09:46:52] [INFO ] Computed 10 invariants in 11 ms
[2025-05-31 09:46:52] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 136/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-31 09:46:52] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 3 ms to minimize.
[2025-05-31 09:46:53] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 2 ms to minimize.
[2025-05-31 09:46:53] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 11/182 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-31 09:46:53] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2025-05-31 09:46:53] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
[2025-05-31 09:46:53] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-05-31 09:46:54] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 572/754 variables, 182/199 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 58/257 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 6/760 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/760 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 263 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4497 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 136/171 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 11/182 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 572/754 variables, 182/199 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 58/257 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 32/289 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 6/760 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/760 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 298 constraints, problems are : Problem set: 0 solved, 35 unsolved in 8162 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 188/188 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 7/7 constraints]
After SMT, in 12723ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 0 properties in 8718 ms.
Support contains 35 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 604/604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 558
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 558
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 43 place count 186 transition count 519
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 186 transition count 514
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 181 transition count 514
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 181 transition count 514
Applied a total of 55 rules in 69 ms. Remains 181 /188 variables (removed 7) and now considering 514/604 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 181/188 places, 514/604 transitions.
RANDOM walk for 4000000 steps (152534 resets) in 26744 ms. (149 steps per ms) remains 32/35 properties
BEST_FIRST walk for 400003 steps (3064 resets) in 570 ms. (700 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1304 resets) in 651 ms. (613 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (1298 resets) in 650 ms. (614 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (3029 resets) in 572 ms. (698 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400003 steps (3071 resets) in 565 ms. (706 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (3050 resets) in 562 ms. (710 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (3092 resets) in 569 ms. (701 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (3017 resets) in 566 ms. (705 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2938 resets) in 543 ms. (735 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (3085 resets) in 569 ms. (701 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (3095 resets) in 560 ms. (713 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (3064 resets) in 570 ms. (700 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (3079 resets) in 561 ms. (711 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (3031 resets) in 567 ms. (704 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (3028 resets) in 591 ms. (675 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2684 resets) in 509 ms. (784 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400003 steps (2979 resets) in 712 ms. (561 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (2997 resets) in 563 ms. (709 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (3056 resets) in 1123 ms. (355 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (3089 resets) in 1076 ms. (371 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (3078 resets) in 1184 ms. (337 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (3031 resets) in 953 ms. (419 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (2674 resets) in 824 ms. (484 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (2864 resets) in 1021 ms. (391 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (3070 resets) in 1024 ms. (390 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (3030 resets) in 1210 ms. (330 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (3106 resets) in 912 ms. (438 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (3099 resets) in 1094 ms. (365 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (3041 resets) in 1084 ms. (368 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (3043 resets) in 1101 ms. (362 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (3031 resets) in 1200 ms. (333 steps per ms) remains 30/30 properties
[2025-05-31 09:47:31] [INFO ] Flow matrix only has 495 transitions (discarded 19 similar events)
// Phase 1: matrix 495 rows 181 cols
[2025-05-31 09:47:31] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 09:47:31] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 136/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-31 09:47:32] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 9/175 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-31 09:47:33] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2025-05-31 09:47:33] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2025-05-31 09:47:33] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 495/670 variables, 175/189 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 56/245 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 6/676 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 30 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/676 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 251 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3566 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 136/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 9/175 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 495/670 variables, 175/189 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 56/245 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 27/272 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 6/676 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/676 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 0/676 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 281 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5829 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
After SMT, in 9446ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 18384 ms.
Support contains 30 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 514/514 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 511
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 15 place count 178 transition count 502
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 33 place count 178 transition count 484
Applied a total of 33 rules in 36 ms. Remains 178 /181 variables (removed 3) and now considering 484/514 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 178/181 places, 484/514 transitions.
RANDOM walk for 4000000 steps (164574 resets) in 40082 ms. (99 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (3197 resets) in 1150 ms. (347 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1310 resets) in 1218 ms. (328 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1336 resets) in 1489 ms. (268 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3143 resets) in 999 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3216 resets) in 1079 ms. (370 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3147 resets) in 1232 ms. (324 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3154 resets) in 1102 ms. (362 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (3180 resets) in 1155 ms. (346 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3029 resets) in 1208 ms. (330 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (3223 resets) in 1274 ms. (313 steps per ms) remains 27/29 properties
BEST_FIRST walk for 400003 steps (3169 resets) in 1051 ms. (380 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (3160 resets) in 1124 ms. (355 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (3157 resets) in 1169 ms. (341 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (3208 resets) in 936 ms. (426 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (3099 resets) in 1210 ms. (330 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (3182 resets) in 1073 ms. (372 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (3211 resets) in 1108 ms. (360 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (3213 resets) in 1287 ms. (310 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (3200 resets) in 1110 ms. (360 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (3225 resets) in 1232 ms. (324 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (2840 resets) in 1075 ms. (371 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (2981 resets) in 1095 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (3155 resets) in 1117 ms. (357 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (3163 resets) in 1149 ms. (347 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (3153 resets) in 1089 ms. (366 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (3229 resets) in 1171 ms. (341 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (3189 resets) in 1166 ms. (342 steps per ms) remains 25/26 properties
[2025-05-31 09:48:25] [INFO ] Flow matrix only has 437 transitions (discarded 47 similar events)
// Phase 1: matrix 437 rows 178 cols
[2025-05-31 09:48:25] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 09:48:25] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 133/159 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-31 09:48:25] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 13/172 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-31 09:48:25] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2025-05-31 09:48:25] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 437/609 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 70/255 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 6/615 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/615 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/615 variables, and 261 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2720 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 133/159 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 13/172 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 437/609 variables, 172/185 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 70/255 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 23/278 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 6/615 variables, 6/284 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-05-31 09:48:29] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/615 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/615 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 0/615 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 615/615 variables, and 287 constraints, problems are : Problem set: 0 solved, 25 unsolved in 4361 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 4/4 constraints]
After SMT, in 7128ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 0 properties in 5028 ms.
Support contains 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 484/484 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 178/178 places, 484/484 transitions.
RANDOM walk for 4000000 steps (164165 resets) in 43868 ms. (91 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3174 resets) in 1076 ms. (371 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (1316 resets) in 1363 ms. (293 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (1308 resets) in 1281 ms. (312 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3165 resets) in 1251 ms. (319 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3199 resets) in 1288 ms. (310 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3127 resets) in 1133 ms. (352 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3139 resets) in 1021 ms. (391 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3212 resets) in 1253 ms. (318 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3188 resets) in 980 ms. (407 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3199 resets) in 1211 ms. (330 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3150 resets) in 1027 ms. (389 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3175 resets) in 1279 ms. (312 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3113 resets) in 1125 ms. (355 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3162 resets) in 1159 ms. (344 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3215 resets) in 1157 ms. (345 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3197 resets) in 1211 ms. (330 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3171 resets) in 1350 ms. (296 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3234 resets) in 1276 ms. (313 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (2753 resets) in 1076 ms. (371 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3056 resets) in 1200 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3170 resets) in 1204 ms. (331 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3194 resets) in 1109 ms. (360 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3196 resets) in 1172 ms. (341 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3226 resets) in 1277 ms. (312 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3173 resets) in 1045 ms. (382 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 6385412 steps, run timeout after 78001 ms. (steps per millisecond=81 ) properties seen :23 out of 25
Probabilistic random walk after 6385412 steps, saw 2287418 distinct states, run finished after 78010 ms. (steps per millisecond=81 ) properties seen :23
[2025-05-31 09:50:21] [INFO ] Flow matrix only has 437 transitions (discarded 47 similar events)
[2025-05-31 09:50:21] [INFO ] Invariant cache hit.
[2025-05-31 09:50:21] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/172 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 09:50:21] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 3 ms to minimize.
[2025-05-31 09:50:21] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 437/609 variables, 172/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 70/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/615 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/615 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/615 variables, and 260 constraints, problems are : Problem set: 0 solved, 2 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/172 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 09:50:22] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 3 ms to minimize.
[2025-05-31 09:50:22] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 437/609 variables, 172/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 70/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 09:50:22] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2025-05-31 09:50:22] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/615 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/615 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/615 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 615/615 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1630ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 484/484 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 172 transition count 469
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 172 transition count 469
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 172 transition count 463
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 166 transition count 463
Applied a total of 24 rules in 37 ms. Remains 166 /178 variables (removed 12) and now considering 463/484 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 166/178 places, 463/484 transitions.
RANDOM walk for 4000000 steps (169760 resets) in 18840 ms. (212 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4000003 steps (31112 resets) in 2835 ms. (1410 steps per ms) remains 1/1 properties
[2025-05-31 09:50:30] [INFO ] Flow matrix only has 416 transitions (discarded 47 similar events)
// Phase 1: matrix 416 rows 166 cols
[2025-05-31 09:50:30] [INFO ] Computed 10 invariants in 8 ms
[2025-05-31 09:50:30] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 09:50:30] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 416/576 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 94/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/582 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/582 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 94/94 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 416/576 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 94/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/582 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 09:50:31] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/582 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/582 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 463/463 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 462
Applied a total of 2 rules in 17 ms. Remains 165 /166 variables (removed 1) and now considering 462/463 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 165/166 places, 462/463 transitions.
RANDOM walk for 4000000 steps (170012 resets) in 10937 ms. (365 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (31103 resets) in 2815 ms. (1420 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2336827 steps, run timeout after 9001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 2336827 steps, saw 830876 distinct states, run finished after 9001 ms. (steps per millisecond=259 ) properties seen :0
[2025-05-31 09:50:44] [INFO ] Flow matrix only has 415 transitions (discarded 47 similar events)
// Phase 1: matrix 415 rows 165 cols
[2025-05-31 09:50:44] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 09:50:44] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/159 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 09:50:44] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 415/574 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/580 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/580 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/159 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 09:50:44] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/574 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 94/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/580 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/580 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 165/165 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 165 /165 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-05-31 09:50:44] [INFO ] Flow matrix only has 415 transitions (discarded 47 similar events)
[2025-05-31 09:50:44] [INFO ] Invariant cache hit.
[2025-05-31 09:50:45] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-31 09:50:45] [INFO ] Flow matrix only has 415 transitions (discarded 47 similar events)
[2025-05-31 09:50:45] [INFO ] Invariant cache hit.
[2025-05-31 09:50:45] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 09:50:45] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2025-05-31 09:50:45] [INFO ] Redundant transitions in 68 ms returned []
Running 444 sub problems to find dead transitions.
[2025-05-31 09:50:45] [INFO ] Flow matrix only has 415 transitions (discarded 47 similar events)
[2025-05-31 09:50:45] [INFO ] Invariant cache hit.
[2025-05-31 09:50:45] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-05-31 09:50:50] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2025-05-31 09:50:50] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2025-05-31 09:50:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2025-05-31 09:50:50] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 3 ms to minimize.
[2025-05-31 09:50:50] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2025-05-31 09:50:51] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2025-05-31 09:50:52] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-05-31 09:50:54] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 415/580 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 94/277 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 8 (OVERLAPS) 0/580 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 444 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 277 constraints, problems are : Problem set: 0 solved, 444 unsolved in 26938 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (OVERLAPS) 415/580 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 94/277 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 444/721 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-05-31 09:51:29] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2025-05-31 09:51:29] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-05-31 09:51:41] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/580 variables, and 724 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 11/11 constraints]
After SMT, in 57374ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 57380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58423 ms. Remains : 165/165 places, 462/462 transitions.
RANDOM walk for 400000 steps (16868 resets) in 2828 ms. (141 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2025-05-31 09:51:43] [INFO ] Flow matrix only has 415 transitions (discarded 47 similar events)
[2025-05-31 09:51:43] [INFO ] Invariant cache hit.
[2025-05-31 09:51:44] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 09:51:44] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-31 09:51:44] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 09:51:44] [INFO ] After 56ms SMT Verify possible using 94 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:51:44] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:51:44] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:51:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 09:51:44] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 09:51:44] [INFO ] After 42ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:51:44] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:51:44] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (169487 resets) in 10282 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3345882 steps (26120 resets) in 2369 ms. (1411 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 444 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 472927 ms.
ITS solved all properties within timeout

BK_STOP 1748685108122

--------------------
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-19"
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-19, 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-174860112300242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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