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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K 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 125K 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 1748679682216

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 08:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 08:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:21:25] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2025-05-31 08:21:25] [INFO ] Transformed 169 places.
[2025-05-31 08:21:25] [INFO ] Transformed 508 transitions.
[2025-05-31 08:21:25] [INFO ] Found NUPN structural information;
[2025-05-31 08:21:25] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 463 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 169/169 places, 508/508 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 169 transition count 443
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 65 place count 169 transition count 437
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 163 transition count 437
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 160 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 157 transition count 440
Applied a total of 89 rules in 122 ms. Remains 157 /169 variables (removed 12) and now considering 440/508 (removed 68) transitions.
[2025-05-31 08:21:25] [INFO ] Flow matrix only has 392 transitions (discarded 48 similar events)
// Phase 1: matrix 392 rows 157 cols
[2025-05-31 08:21:25] [INFO ] Computed 10 invariants in 21 ms
[2025-05-31 08:21:26] [INFO ] Implicit Places using invariants in 529 ms returned []
[2025-05-31 08:21:26] [INFO ] Flow matrix only has 392 transitions (discarded 48 similar events)
[2025-05-31 08:21:26] [INFO ] Invariant cache hit.
[2025-05-31 08:21:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 08:21:27] [INFO ] Implicit Places using invariants and state equation in 698 ms returned [59, 107, 155]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1351 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 154/169 places, 440/508 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1524 ms. Remains : 154/169 places, 440/508 transitions.
Discarding 141 transitions out of 440. Remains 299
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1243 resets) in 3929 ms. (10 steps per ms) remains 93/298 properties
BEST_FIRST walk for 4004 steps (29 resets) in 131 ms. (30 steps per ms) remains 92/93 properties
BEST_FIRST walk for 4002 steps (24 resets) in 94 ms. (42 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (26 resets) in 95 ms. (41 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (26 resets) in 98 ms. (40 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4002 steps (25 resets) in 81 ms. (48 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4001 steps (30 resets) in 77 ms. (51 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4003 steps (13 resets) in 81 ms. (48 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4003 steps (22 resets) in 33 ms. (117 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (38 resets) in 44 ms. (88 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4002 steps (27 resets) in 20 ms. (190 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 89/92 properties
BEST_FIRST walk for 4002 steps (27 resets) in 19 ms. (200 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (38 resets) in 35 ms. (111 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 88/89 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 88/88 properties
BEST_FIRST walk for 4004 steps (37 resets) in 33 ms. (117 steps per ms) remains 87/88 properties
BEST_FIRST walk for 4003 steps (24 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 86/87 properties
BEST_FIRST walk for 4004 steps (30 resets) in 40 ms. (97 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (26 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 85/86 properties
BEST_FIRST walk for 4003 steps (25 resets) in 21 ms. (181 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (27 resets) in 25 ms. (153 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 82/85 properties
BEST_FIRST walk for 4002 steps (29 resets) in 19 ms. (200 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 81/82 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (38 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (31 resets) in 22 ms. (174 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 80/81 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (24 resets) in 25 ms. (153 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (43 resets) in 37 ms. (105 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (32 resets) in 33 ms. (117 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (26 resets) in 23 ms. (166 steps per ms) remains 79/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4002 steps (26 resets) in 16 ms. (235 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4002 steps (20 resets) in 16 ms. (235 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4004 steps (26 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (9 resets) in 42 ms. (93 steps per ms) remains 76/78 properties
BEST_FIRST walk for 4001 steps (23 resets) in 29 ms. (133 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (28 resets) in 32 ms. (121 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (26 resets) in 23 ms. (166 steps per ms) remains 75/76 properties
BEST_FIRST walk for 4004 steps (27 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (22 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (23 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (25 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (22 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (25 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (25 resets) in 27 ms. (142 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (26 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (21 resets) in 23 ms. (166 steps per ms) remains 72/75 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 70/72 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
[2025-05-31 08:21:29] [INFO ] Flow matrix only has 392 transitions (discarded 48 similar events)
// Phase 1: matrix 392 rows 154 cols
[2025-05-31 08:21:29] [INFO ] Computed 7 invariants in 10 ms
[2025-05-31 08:21:29] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 93/152 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 93/159 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2025-05-31 08:21:30] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 22 ms to minimize.
[2025-05-31 08:21:31] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 5 ms to minimize.
[2025-05-31 08:21:31] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
[2025-05-31 08:21:31] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2025-05-31 08:21:31] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 391/543 variables, 152/316 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 59/375 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/546 variables, and 375 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5021 ms.
Refiners :[Domain max(s): 152/154 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/154 constraints, ReadFeed: 59/60 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 93/152 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 93/159 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 391/543 variables, 152/316 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 59/375 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 64/439 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2025-05-31 08:21:38] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 3 ms to minimize.
[2025-05-31 08:21:39] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-05-31 08:21:39] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/546 variables, and 442 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5017 ms.
Refiners :[Domain max(s): 152/154 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/154 constraints, ReadFeed: 59/60 constraints, PredecessorRefiner: 64/70 constraints, Known Traps: 8/8 constraints]
After SMT, in 10319ms problems are : Problem set: 0 solved, 70 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 440/440 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 154 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 154 transition count 422
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 154 transition count 427
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 29 place count 151 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 151 transition count 418
Applied a total of 33 rules in 135 ms. Remains 151 /154 variables (removed 3) and now considering 418/440 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 151/154 places, 418/440 transitions.
RANDOM walk for 4000000 steps (123972 resets) in 30296 ms. (132 steps per ms) remains 40/70 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 655 ms. (609 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (58 resets) in 1419 ms. (281 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 898 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (3825 resets) in 768 ms. (520 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2729 resets) in 658 ms. (606 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (89 resets) in 1373 ms. (291 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2671 resets) in 672 ms. (594 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (3796 resets) in 673 ms. (593 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 658 ms. (606 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400001 steps (165 resets) in 1265 ms. (315 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400001 steps (2676 resets) in 666 ms. (599 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (3831 resets) in 661 ms. (604 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2723 resets) in 658 ms. (606 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (136 resets) in 1287 ms. (310 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400001 steps (2757 resets) in 660 ms. (605 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (139 resets) in 1322 ms. (302 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2726 resets) in 684 ms. (583 steps per ms) remains 36/40 properties
BEST_FIRST walk for 400002 steps (3820 resets) in 655 ms. (609 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 665 ms. (600 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400003 steps (170 resets) in 1295 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (2598 resets) in 676 ms. (590 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (3829 resets) in 655 ms. (609 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 664 ms. (601 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1369 ms. (291 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (2630 resets) in 664 ms. (601 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 657 ms. (607 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (42 resets) in 1417 ms. (282 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (2690 resets) in 661 ms. (604 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (3803 resets) in 659 ms. (606 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (2689 resets) in 655 ms. (609 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (2749 resets) in 660 ms. (605 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (2699 resets) in 665 ms. (600 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (2667 resets) in 662 ms. (603 steps per ms) remains 33/35 properties
BEST_FIRST walk for 400003 steps (2755 resets) in 626 ms. (637 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 636 ms. (627 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2658 resets) in 620 ms. (644 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2589 resets) in 611 ms. (653 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2599 resets) in 619 ms. (645 steps per ms) remains 33/33 properties
[2025-05-31 08:21:57] [INFO ] Flow matrix only has 382 transitions (discarded 36 similar events)
// Phase 1: matrix 382 rows 151 cols
[2025-05-31 08:21:57] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 08:21:57] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 113/142 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 113/148 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2025-05-31 08:21:57] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 4 ms to minimize.
[2025-05-31 08:21:57] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-05-31 08:21:57] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 3/145 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2025-05-31 08:21:58] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 382/527 variables, 145/301 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 59/360 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 6/533 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/533 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 372 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4069 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 113/142 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 113/148 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 3/145 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 382/527 variables, 145/301 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 59/360 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 24/384 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 6/533 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 9/405 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2025-05-31 08:22:05] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 19 (OVERLAPS) 0/533 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 406 constraints, problems are : Problem set: 0 solved, 33 unsolved in 8122 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 5/5 constraints]
After SMT, in 12270ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 2803 ms.
Support contains 29 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 418/418 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 151 transition count 422
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 10 place count 148 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 148 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 147 transition count 415
Applied a total of 13 rules in 67 ms. Remains 147 /151 variables (removed 4) and now considering 415/418 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 147/151 places, 415/418 transitions.
RANDOM walk for 4000000 steps (128588 resets) in 22999 ms. (173 steps per ms) remains 31/33 properties
BEST_FIRST walk for 400004 steps (2712 resets) in 605 ms. (660 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2770 resets) in 589 ms. (677 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (34 resets) in 1498 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 796 ms. (501 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (3868 resets) in 583 ms. (684 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2849 resets) in 592 ms. (674 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (89 resets) in 1296 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2839 resets) in 596 ms. (670 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (193 resets) in 1243 ms. (321 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2644 resets) in 608 ms. (656 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (3861 resets) in 579 ms. (689 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (2728 resets) in 590 ms. (676 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400001 steps (84 resets) in 1278 ms. (312 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2620 resets) in 596 ms. (670 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (3881 resets) in 582 ms. (686 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2746 resets) in 595 ms. (671 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (182 resets) in 1146 ms. (348 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2688 resets) in 611 ms. (653 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (2784 resets) in 597 ms. (668 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (91 resets) in 1174 ms. (340 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (2665 resets) in 598 ms. (667 steps per ms) remains 28/31 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 569 ms. (701 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (2729 resets) in 583 ms. (684 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (2769 resets) in 591 ms. (675 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (2833 resets) in 580 ms. (688 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (2675 resets) in 583 ms. (684 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (2786 resets) in 585 ms. (682 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (2734 resets) in 583 ms. (684 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (2684 resets) in 576 ms. (693 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (2666 resets) in 568 ms. (702 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 563 ms. (709 steps per ms) remains 28/28 properties
[2025-05-31 08:22:24] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
// Phase 1: matrix 378 rows 147 cols
[2025-05-31 08:22:24] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 08:22:24] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 111/138 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-05-31 08:22:24] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 4 ms to minimize.
[2025-05-31 08:22:25] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2025-05-31 08:22:25] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 377/515 variables, 138/285 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 56/341 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 10/525 variables, 9/350 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/525 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 360 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3296 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 111/138 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 377/515 variables, 138/285 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 56/341 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 19/360 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 10/525 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 9/378 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-05-31 08:22:30] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2025-05-31 08:22:31] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/525 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 390 constraints, problems are : Problem set: 0 solved, 28 unsolved in 6289 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 5/5 constraints]
After SMT, in 9644ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 4 properties in 4528 ms.
Support contains 25 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 147/147 places, 415/415 transitions.
RANDOM walk for 4000000 steps (128338 resets) in 21231 ms. (188 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (2699 resets) in 592 ms. (674 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (2849 resets) in 587 ms. (680 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2644 resets) in 596 ms. (670 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2799 resets) in 587 ms. (680 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (52 resets) in 1265 ms. (315 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (2831 resets) in 590 ms. (676 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (66 resets) in 1201 ms. (332 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2684 resets) in 589 ms. (677 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3865 resets) in 578 ms. (690 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2794 resets) in 586 ms. (681 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2701 resets) in 596 ms. (670 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (2623 resets) in 597 ms. (668 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2850 resets) in 581 ms. (687 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (97 resets) in 1094 ms. (365 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (2690 resets) in 564 ms. (707 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3863 resets) in 542 ms. (736 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (2776 resets) in 561 ms. (711 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (2656 resets) in 583 ms. (684 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400003 steps (2826 resets) in 649 ms. (615 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (2764 resets) in 653 ms. (611 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (2753 resets) in 670 ms. (596 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (2675 resets) in 638 ms. (625 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (2612 resets) in 640 ms. (624 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 5003235 steps, run timeout after 30001 ms. (steps per millisecond=166 ) properties seen :19 out of 23
Probabilistic random walk after 5003235 steps, saw 1165578 distinct states, run finished after 30011 ms. (steps per millisecond=166 ) properties seen :19
[2025-05-31 08:23:19] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:23:19] [INFO ] Invariant cache hit.
[2025-05-31 08:23:19] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 78/86 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-31 08:23:19] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2025-05-31 08:23:19] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 246/332 variables, 86/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 103/435 variables, 15/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 15/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 36/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/436 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 79/515 variables, 39/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/515 variables, 39/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 9/524 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/524 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/524 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/524 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/525 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/525 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/525 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 359 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1308 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 78/86 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 246/332 variables, 86/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 103/435 variables, 15/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 15/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 36/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/436 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 79/515 variables, 39/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 39/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/515 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 9/524 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/524 variables, 5/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/524 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 1/525 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-31 08:23:21] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/525 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/525 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 0/525 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 364 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1273 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2593ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1728 ms.
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 147/147 places, 415/415 transitions.
RANDOM walk for 4000000 steps (128164 resets) in 11168 ms. (358 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000003 steps (27309 resets) in 3180 ms. (1257 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000001 steps (26489 resets) in 3552 ms. (1125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (26329 resets) in 3086 ms. (1295 steps per ms) remains 2/2 properties
[2025-05-31 08:23:29] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:23:29] [INFO ] Invariant cache hit.
[2025-05-31 08:23:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 76/80 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 76/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/324 variables, 80/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 111/435 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/436 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 79/515 variables, 39/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/515 variables, 39/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 08:23:29] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/515 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 9/524 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/524 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/524 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 1/525 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 574 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 76/80 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 76/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/324 variables, 80/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 111/435 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 08:23:30] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2025-05-31 08:23:30] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/436 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 79/515 variables, 39/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 39/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/515 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/515 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/515 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 9/524 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/524 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/524 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/525 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/525 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/525 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 362 constraints, problems are : Problem set: 0 solved, 2 unsolved in 685 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1273ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 190 ms.
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 147/147 places, 415/415 transitions.
RANDOM walk for 4000000 steps (128597 resets) in 10070 ms. (397 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (26522 resets) in 3106 ms. (1287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (26413 resets) in 3066 ms. (1304 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2848069 steps, run timeout after 12001 ms. (steps per millisecond=237 ) properties seen :0 out of 2
Probabilistic random walk after 2848069 steps, saw 677070 distinct states, run finished after 12001 ms. (steps per millisecond=237 ) properties seen :0
[2025-05-31 08:23:46] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:23:46] [INFO ] Invariant cache hit.
[2025-05-31 08:23:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 76/80 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 76/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/324 variables, 80/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 111/435 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/436 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 79/515 variables, 39/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/515 variables, 39/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 08:23:47] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/515 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 9/524 variables, 5/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/524 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/524 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 1/525 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 724 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 76/80 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 76/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/324 variables, 80/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 111/435 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 21/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 08:23:47] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 08:23:47] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/436 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 79/515 variables, 39/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 39/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/515 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/515 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/515 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 9/524 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/524 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/524 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/524 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/525 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/525 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/525 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 362 constraints, problems are : Problem set: 0 solved, 2 unsolved in 761 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1500ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 159 ms.
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 14 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 147/147 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2025-05-31 08:23:48] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:23:48] [INFO ] Invariant cache hit.
[2025-05-31 08:23:48] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-31 08:23:48] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:23:48] [INFO ] Invariant cache hit.
[2025-05-31 08:23:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 08:23:49] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
[2025-05-31 08:23:49] [INFO ] Redundant transitions in 45 ms returned []
Running 409 sub problems to find dead transitions.
[2025-05-31 08:23:49] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:23:49] [INFO ] Invariant cache hit.
[2025-05-31 08:23:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-05-31 08:23:53] [INFO ] Deduced a trap composed of 50 places in 234 ms of which 3 ms to minimize.
[2025-05-31 08:23:53] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2025-05-31 08:23:54] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2025-05-31 08:23:54] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2025-05-31 08:23:54] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2025-05-31 08:23:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
[2025-05-31 08:23:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 378/525 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 56/364 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-05-31 08:24:07] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 7 ms to minimize.
[2025-05-31 08:24:07] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2025-05-31 08:24:07] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 367 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30015 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 378/525 variables, 147/311 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 56/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 409/776 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 776 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 10/10 constraints]
After SMT, in 60735ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61742 ms. Remains : 147/147 places, 415/415 transitions.
RANDOM walk for 400000 steps (12871 resets) in 2958 ms. (135 steps per ms) remains 2/4 properties
Running SMT prover for 2 properties.
[2025-05-31 08:24:51] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:24:51] [INFO ] Invariant cache hit.
[2025-05-31 08:24:51] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:24:51] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 08:24:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 08:24:51] [INFO ] After 22ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:24:51] [INFO ] After 103ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:24:51] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:24:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:24:51] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 08:24:51] [INFO ] After 52ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:24:51] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:24:51] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 4000000 steps (128188 resets) in 10494 ms. (381 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (26623 resets) in 2669 ms. (1498 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000001 steps (26647 resets) in 2679 ms. (1492 steps per ms) remains 1/2 properties
[2025-05-31 08:24:56] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:24:56] [INFO ] Invariant cache hit.
[2025-05-31 08:24:56] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/162 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/346 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/347 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 158/505 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 78/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 38/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/523 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/523 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/523 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/523 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/525 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/525 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/525 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/162 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/346 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/347 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 08:24:56] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 158/505 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 78/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 38/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/523 variables, 10/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/523 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/523 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/523 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/525 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/525 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 147/147 places, 415/415 transitions.
RANDOM walk for 4000000 steps (128821 resets) in 8413 ms. (475 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (26615 resets) in 2673 ms. (1495 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2199321 steps, run timeout after 6001 ms. (steps per millisecond=366 ) properties seen :0 out of 1
Probabilistic random walk after 2199321 steps, saw 526167 distinct states, run finished after 6001 ms. (steps per millisecond=366 ) properties seen :0
[2025-05-31 08:25:05] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:25:05] [INFO ] Invariant cache hit.
[2025-05-31 08:25:05] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/162 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/346 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/347 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 158/505 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 78/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 38/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/523 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/523 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/523 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/523 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/525 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/525 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/525 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/162 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/346 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/347 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 08:25:06] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 158/505 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 78/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 38/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/523 variables, 10/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/523 variables, 10/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/523 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/523 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/525 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/525 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 147/147 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2025-05-31 08:25:06] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:25:06] [INFO ] Invariant cache hit.
[2025-05-31 08:25:06] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-31 08:25:06] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:25:06] [INFO ] Invariant cache hit.
[2025-05-31 08:25:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 08:25:07] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2025-05-31 08:25:07] [INFO ] Redundant transitions in 14 ms returned []
Running 409 sub problems to find dead transitions.
[2025-05-31 08:25:07] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:25:07] [INFO ] Invariant cache hit.
[2025-05-31 08:25:07] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-05-31 08:25:10] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 3 ms to minimize.
[2025-05-31 08:25:10] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2025-05-31 08:25:10] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2025-05-31 08:25:11] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2025-05-31 08:25:11] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2025-05-31 08:25:11] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2025-05-31 08:25:11] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 378/525 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 56/364 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2025-05-31 08:25:21] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2025-05-31 08:25:21] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2025-05-31 08:25:21] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 367 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30024 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 378/525 variables, 147/311 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 56/367 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 409/776 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 776 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 10/10 constraints]
After SMT, in 60723ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61644 ms. Remains : 147/147 places, 415/415 transitions.
RANDOM walk for 400000 steps (12696 resets) in 1333 ms. (299 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2025-05-31 08:26:08] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2025-05-31 08:26:08] [INFO ] Invariant cache hit.
[2025-05-31 08:26:08] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 08:26:08] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-05-31 08:26:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 08:26:08] [INFO ] After 40ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:26:08] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:26:08] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:26:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:26:08] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-31 08:26:08] [INFO ] After 33ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:26:09] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 08:26:09] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1247 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (280 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3773 steps, run visited all 1 properties in 19 ms. (steps per millisecond=198 )
Probabilistic random walk after 3773 steps, saw 1815 distinct states, run finished after 28 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 120 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 118 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 118 transition count 219
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 118 transition count 204
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 109 transition count 201
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 109 transition count 201
Applied a total of 45 rules in 82 ms. Remains 109 /147 variables (removed 38) and now considering 201/415 (removed 214) transitions.
Running SMT prover for 1 properties.
[2025-05-31 08:26:09] [INFO ] Flow matrix only has 199 transitions (discarded 2 similar events)
// Phase 1: matrix 199 rows 109 cols
[2025-05-31 08:26:09] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 08:26:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:26:09] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 08:26:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:26:09] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 08:26:09] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 08:26:09] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 495 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 284696 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-11

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 169
TRANSITIONS: 508
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1883
NUPN UNITS: 14
LOADING TIME: 0.68

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

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

Process ID: 805
MODEL NAME: /home/mcc/execution/model
169 places, 508 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiLiveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748679986127

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

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