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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748681993940

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 08:59:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 08:59:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:59:56] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2025-05-31 08:59:56] [INFO ] Transformed 205 places.
[2025-05-31 08:59:56] [INFO ] Transformed 610 transitions.
[2025-05-31 08:59:56] [INFO ] Found NUPN structural information;
[2025-05-31 08:59:56] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 433 ms.
Structural test allowed to assert that 14 places are NOT stable. Took 12 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
RANDOM walk for 40000 steps (1196 resets) in 3902 ms. (10 steps per ms) remains 64/191 properties
BEST_FIRST walk for 4002 steps (19 resets) in 62 ms. (63 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (25 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (26 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (20 resets) in 52 ms. (75 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (26 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (23 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (27 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (23 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (25 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (23 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (23 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (23 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (26 resets) in 13 ms. (285 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (23 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 59/64 properties
BEST_FIRST walk for 4002 steps (22 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (26 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (25 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (23 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 63 ms. (62 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (25 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (25 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (18 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (23 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (24 resets) in 62 ms. (63 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
[2025-05-31 08:59:58] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2025-05-31 08:59:58] [INFO ] Computed 10 invariants in 25 ms
[2025-05-31 08:59:58] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 131/190 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 131/199 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 12/202 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 500/702 variables, 202/414 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 72/486 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 3/705 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/705 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 1/706 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/706 variables, and 493 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5085 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 131/190 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 131/199 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-31 09:00:04] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 27 ms to minimize.
[2025-05-31 09:00:04] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2025-05-31 09:00:04] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2025-05-31 09:00:04] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2025-05-31 09:00:04] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2025-05-31 09:00:05] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 12/202 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 12/218 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-31 09:00:05] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 500/702 variables, 202/421 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 72/493 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 59/552 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-05-31 09:00:07] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/706 variables, and 553 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5015 ms.
Refiners :[Domain max(s): 202/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/205 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 8/8 constraints]
After SMT, in 10283ms problems are : Problem set: 0 solved, 59 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 199 transition count 527
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 199 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 199 transition count 524
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 196 transition count 530
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 196 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 196 transition count 515
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 195 transition count 514
Applied a total of 40 rules in 246 ms. Remains 195 /205 variables (removed 10) and now considering 514/539 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 195/205 places, 514/539 transitions.
RANDOM walk for 4000000 steps (128831 resets) in 32393 ms. (123 steps per ms) remains 41/59 properties
BEST_FIRST walk for 400003 steps (2719 resets) in 668 ms. (597 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2631 resets) in 655 ms. (609 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2699 resets) in 699 ms. (571 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2731 resets) in 657 ms. (607 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2723 resets) in 664 ms. (601 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2719 resets) in 662 ms. (603 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2747 resets) in 659 ms. (606 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2733 resets) in 659 ms. (606 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2707 resets) in 652 ms. (612 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2715 resets) in 659 ms. (606 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2696 resets) in 653 ms. (611 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2677 resets) in 661 ms. (604 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 658 ms. (606 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2781 resets) in 661 ms. (604 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2737 resets) in 653 ms. (611 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2787 resets) in 653 ms. (611 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2735 resets) in 656 ms. (608 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2739 resets) in 655 ms. (609 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2719 resets) in 732 ms. (545 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2735 resets) in 876 ms. (456 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2736 resets) in 741 ms. (539 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2683 resets) in 676 ms. (590 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2668 resets) in 662 ms. (603 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2696 resets) in 660 ms. (605 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400002 steps (2761 resets) in 648 ms. (616 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2726 resets) in 653 ms. (611 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2734 resets) in 649 ms. (615 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2760 resets) in 641 ms. (623 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2747 resets) in 651 ms. (613 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2707 resets) in 653 ms. (611 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2722 resets) in 652 ms. (612 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2669 resets) in 656 ms. (608 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2740 resets) in 657 ms. (607 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (2731 resets) in 648 ms. (616 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2733 resets) in 650 ms. (614 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2762 resets) in 650 ms. (614 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2675 resets) in 645 ms. (619 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (2690 resets) in 646 ms. (618 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2765 resets) in 663 ms. (602 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (2766 resets) in 682 ms. (585 steps per ms) remains 40/40 properties
[2025-05-31 09:00:24] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 195 cols
[2025-05-31 09:00:24] [INFO ] Computed 10 invariants in 4 ms
[2025-05-31 09:00:24] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 126/166 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 463/629 variables, 166/171 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/670 variables, 24/195 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 71/268 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 3/673 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 2/675 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 0/675 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 276 constraints, problems are : Problem set: 0 solved, 40 unsolved in 4109 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 126/166 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2025-05-31 09:00:29] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2025-05-31 09:00:29] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 463/629 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 41/670 variables, 24/199 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 71/272 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 38/310 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/670 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 3/673 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (OVERLAPS) 2/675 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2025-05-31 09:00:34] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/675 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/675 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (OVERLAPS) 0/675 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 319 constraints, problems are : Problem set: 0 solved, 40 unsolved in 9523 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 13682ms problems are : Problem set: 0 solved, 40 unsolved
Fused 40 Parikh solutions to 39 different solutions.
Parikh walk visited 0 properties in 2284 ms.
Support contains 40 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 514/514 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 512
Applied a total of 4 rules in 35 ms. Remains 193 /195 variables (removed 2) and now considering 512/514 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 193/195 places, 512/514 transitions.
RANDOM walk for 4000000 steps (128550 resets) in 27756 ms. (144 steps per ms) remains 37/40 properties
BEST_FIRST walk for 400001 steps (2757 resets) in 653 ms. (611 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2751 resets) in 645 ms. (619 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2745 resets) in 644 ms. (620 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2743 resets) in 640 ms. (624 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2706 resets) in 653 ms. (611 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2772 resets) in 781 ms. (511 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2774 resets) in 850 ms. (470 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2726 resets) in 770 ms. (518 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2779 resets) in 891 ms. (448 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2714 resets) in 869 ms. (459 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2766 resets) in 856 ms. (466 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2673 resets) in 1047 ms. (381 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2730 resets) in 798 ms. (500 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 640 ms. (624 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 636 ms. (627 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2722 resets) in 630 ms. (633 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2739 resets) in 639 ms. (625 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2728 resets) in 641 ms. (623 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2703 resets) in 635 ms. (628 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2760 resets) in 646 ms. (618 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2740 resets) in 651 ms. (613 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2742 resets) in 641 ms. (623 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 648 ms. (616 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2736 resets) in 636 ms. (627 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2692 resets) in 641 ms. (623 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2755 resets) in 645 ms. (619 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2712 resets) in 635 ms. (628 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2753 resets) in 643 ms. (621 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2816 resets) in 634 ms. (629 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2737 resets) in 644 ms. (620 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2746 resets) in 637 ms. (626 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2762 resets) in 643 ms. (621 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 649 ms. (615 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2655 resets) in 632 ms. (631 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2719 resets) in 648 ms. (616 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2723 resets) in 635 ms. (628 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2780 resets) in 643 ms. (621 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 4072564 steps, run timeout after 45001 ms. (steps per millisecond=90 ) properties seen :0 out of 37
Probabilistic random walk after 4072564 steps, saw 1032871 distinct states, run finished after 45012 ms. (steps per millisecond=90 ) properties seen :0
[2025-05-31 09:01:41] [INFO ] Flow matrix only has 478 transitions (discarded 34 similar events)
// Phase 1: matrix 478 rows 193 cols
[2025-05-31 09:01:41] [INFO ] Computed 10 invariants in 2 ms
[2025-05-31 09:01:41] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 48/666 variables, 29/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 71/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 2/668 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 3/671 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/671 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/671 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 274 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2585 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 48/666 variables, 29/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 71/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/666 variables, 37/304 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 2/668 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 3/671 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:01:46] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2025-05-31 09:01:46] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/671 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (OVERLAPS) 0/671 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 313 constraints, problems are : Problem set: 0 solved, 37 unsolved in 4749 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 2/2 constraints]
After SMT, in 7366ms problems are : Problem set: 0 solved, 37 unsolved
Parikh walk visited 0 properties in 847 ms.
Support contains 37 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 512/512 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 511
Applied a total of 2 rules in 22 ms. Remains 192 /193 variables (removed 1) and now considering 511/512 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 192/193 places, 511/512 transitions.
RANDOM walk for 4000000 steps (128078 resets) in 27209 ms. (147 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2709 resets) in 658 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2701 resets) in 656 ms. (608 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2739 resets) in 664 ms. (601 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 657 ms. (607 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2719 resets) in 654 ms. (610 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2784 resets) in 658 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2773 resets) in 687 ms. (581 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2709 resets) in 665 ms. (600 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2692 resets) in 668 ms. (597 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2754 resets) in 653 ms. (611 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2796 resets) in 662 ms. (603 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2730 resets) in 659 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2715 resets) in 660 ms. (605 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2736 resets) in 671 ms. (595 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2755 resets) in 649 ms. (615 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2774 resets) in 659 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2716 resets) in 659 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2774 resets) in 659 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2771 resets) in 659 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2675 resets) in 660 ms. (605 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 655 ms. (609 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2694 resets) in 658 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2742 resets) in 661 ms. (604 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2716 resets) in 658 ms. (606 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2671 resets) in 655 ms. (609 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2721 resets) in 657 ms. (607 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (2664 resets) in 655 ms. (609 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2714 resets) in 652 ms. (612 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2752 resets) in 667 ms. (598 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2772 resets) in 657 ms. (607 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2718 resets) in 660 ms. (605 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2720 resets) in 652 ms. (612 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2711 resets) in 660 ms. (605 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (2744 resets) in 656 ms. (608 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2705 resets) in 653 ms. (611 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2737 resets) in 652 ms. (612 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2741 resets) in 662 ms. (603 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 3624063 steps, run timeout after 42001 ms. (steps per millisecond=86 ) properties seen :0 out of 37
Probabilistic random walk after 3624063 steps, saw 920791 distinct states, run finished after 42001 ms. (steps per millisecond=86 ) properties seen :0
[2025-05-31 09:02:45] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 192 cols
[2025-05-31 09:02:45] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 09:02:45] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 47/665 variables, 29/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 71/268 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/666 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 3/669 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 273 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3764 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 47/665 variables, 29/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 71/268 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 37/305 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/666 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 3/669 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:02:53] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2025-05-31 09:02:53] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2025-05-31 09:02:53] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-05-31 09:02:53] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:02:55] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2025-05-31 09:02:55] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/669 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/669 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 0/669 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 316 constraints, problems are : Problem set: 0 solved, 37 unsolved in 9711 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 6/6 constraints]
After SMT, in 13514ms problems are : Problem set: 0 solved, 37 unsolved
Parikh walk visited 0 properties in 815 ms.
Support contains 37 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 511/511 transitions.
Applied a total of 0 rules in 19 ms. Remains 192 /192 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 192/192 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 511/511 transitions.
Applied a total of 0 rules in 18 ms. Remains 192 /192 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2025-05-31 09:03:00] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:03:00] [INFO ] Invariant cache hit.
[2025-05-31 09:03:00] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-31 09:03:00] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:03:00] [INFO ] Invariant cache hit.
[2025-05-31 09:03:00] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:03:01] [INFO ] Implicit Places using invariants and state equation in 791 ms returned [18, 78, 138]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1035 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/192 places, 511/511 transitions.
Applied a total of 0 rules in 19 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1074 ms. Remains : 189/192 places, 511/511 transitions.
RANDOM walk for 4000000 steps (128652 resets) in 28038 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2670 resets) in 624 ms. (640 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2691 resets) in 616 ms. (648 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2764 resets) in 628 ms. (635 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2775 resets) in 619 ms. (645 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2683 resets) in 620 ms. (644 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 618 ms. (646 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 624 ms. (640 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2796 resets) in 618 ms. (646 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2713 resets) in 631 ms. (632 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2748 resets) in 628 ms. (635 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2794 resets) in 623 ms. (641 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2714 resets) in 622 ms. (642 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2688 resets) in 618 ms. (646 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 620 ms. (644 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2748 resets) in 628 ms. (635 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2693 resets) in 623 ms. (641 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2760 resets) in 631 ms. (632 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2712 resets) in 620 ms. (644 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (2745 resets) in 613 ms. (651 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2707 resets) in 617 ms. (647 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2785 resets) in 620 ms. (644 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2729 resets) in 618 ms. (646 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2704 resets) in 624 ms. (640 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2768 resets) in 623 ms. (641 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2789 resets) in 622 ms. (642 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2760 resets) in 629 ms. (634 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2733 resets) in 622 ms. (642 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2734 resets) in 876 ms. (456 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2749 resets) in 925 ms. (431 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2744 resets) in 635 ms. (628 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2700 resets) in 617 ms. (647 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2754 resets) in 635 ms. (628 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 634 ms. (629 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2682 resets) in 620 ms. (644 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2739 resets) in 634 ms. (629 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2728 resets) in 628 ms. (635 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2743 resets) in 627 ms. (636 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 4217279 steps, run timeout after 42001 ms. (steps per millisecond=100 ) properties seen :0 out of 37
Probabilistic random walk after 4217279 steps, saw 1070132 distinct states, run finished after 42003 ms. (steps per millisecond=100 ) properties seen :0
[2025-05-31 09:03:57] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:03:57] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:03:57] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 44/662 variables, 26/188 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 71/262 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/663 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 3/666 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 44/662 variables, 26/188 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 71/262 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/663 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 3/666 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:04:03] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2025-05-31 09:04:03] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:04:03] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
[2025-05-31 09:04:04] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2025-05-31 09:04:04] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 0/666 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 309 constraints, problems are : Problem set: 0 solved, 37 unsolved in 6615 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 5/5 constraints]
After SMT, in 9022ms problems are : Problem set: 0 solved, 37 unsolved
Parikh walk visited 0 properties in 777 ms.
Support contains 37 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2025-05-31 09:04:07] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:04:07] [INFO ] Invariant cache hit.
[2025-05-31 09:04:07] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-05-31 09:04:07] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:04:07] [INFO ] Invariant cache hit.
[2025-05-31 09:04:07] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:04:08] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2025-05-31 09:04:08] [INFO ] Redundant transitions in 32 ms returned []
Running 505 sub problems to find dead transitions.
[2025-05-31 09:04:08] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:04:08] [INFO ] Invariant cache hit.
[2025-05-31 09:04:08] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:04:11] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:04:11] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2025-05-31 09:04:12] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2025-05-31 09:04:12] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 2 ms to minimize.
[2025-05-31 09:04:12] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 3 ms to minimize.
[2025-05-31 09:04:12] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2025-05-31 09:04:14] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 477/666 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 71/274 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:04:26] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2025-05-31 09:04:30] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2025-05-31 09:04:30] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 277 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:04:42] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2025-05-31 09:04:42] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 477/666 variables, 189/208 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/279 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 505/784 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:04:52] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2025-05-31 09:04:52] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2025-05-31 09:04:53] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 3/787 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 787 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 15/15 constraints]
After SMT, in 61070ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 61081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61821 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 400000 steps (12814 resets) in 4972 ms. (80 steps per ms) remains 37/37 properties
Running SMT prover for 37 properties.
[2025-05-31 09:05:10] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:05:10] [INFO ] Invariant cache hit.
[2025-05-31 09:05:10] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:05:11] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :37
[2025-05-31 09:05:11] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:05:11] [INFO ] After 156ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 09:05:12] [INFO ] After 1642ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:37
[2025-05-31 09:05:13] [INFO ] After 2114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2025-05-31 09:05:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-31 09:05:13] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
[2025-05-31 09:05:13] [INFO ] After 243ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 09:05:13] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 3 ms to minimize.
[2025-05-31 09:05:13] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2025-05-31 09:05:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2025-05-31 09:05:15] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-05-31 09:05:15] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-05-31 09:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
TRAPS : Iteration 1
[2025-05-31 09:05:17] [INFO ] After 3687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
[2025-05-31 09:05:17] [INFO ] After 4321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
RANDOM walk for 4000000 steps (128534 resets) in 28178 ms. (141 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (2767 resets) in 1111 ms. (359 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2688 resets) in 1198 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2734 resets) in 1389 ms. (287 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2701 resets) in 1519 ms. (263 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2742 resets) in 1089 ms. (366 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2721 resets) in 1349 ms. (296 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2773 resets) in 1158 ms. (345 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2762 resets) in 1141 ms. (350 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2750 resets) in 1561 ms. (256 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2664 resets) in 1258 ms. (317 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2777 resets) in 1743 ms. (229 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2712 resets) in 1603 ms. (249 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2722 resets) in 1096 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (2659 resets) in 1639 ms. (243 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2757 resets) in 1104 ms. (361 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2706 resets) in 1165 ms. (343 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2723 resets) in 1191 ms. (335 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2753 resets) in 1207 ms. (331 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2650 resets) in 1422 ms. (281 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2678 resets) in 1484 ms. (269 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2692 resets) in 1507 ms. (265 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2723 resets) in 1131 ms. (353 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2719 resets) in 1589 ms. (251 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2788 resets) in 1193 ms. (335 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2764 resets) in 1505 ms. (265 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2813 resets) in 1114 ms. (358 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2751 resets) in 1477 ms. (270 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2750 resets) in 1127 ms. (354 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2762 resets) in 1223 ms. (326 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2737 resets) in 1129 ms. (353 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2700 resets) in 1118 ms. (357 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2698 resets) in 1705 ms. (234 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (2765 resets) in 1480 ms. (270 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2699 resets) in 1165 ms. (343 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2734 resets) in 1030 ms. (387 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 1144 ms. (349 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (2679 resets) in 1156 ms. (345 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 6499527 steps, run timeout after 90001 ms. (steps per millisecond=72 ) properties seen :0 out of 37
Probabilistic random walk after 6499527 steps, saw 1700598 distinct states, run finished after 90003 ms. (steps per millisecond=72 ) properties seen :0
[2025-05-31 09:07:17] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:07:17] [INFO ] Invariant cache hit.
[2025-05-31 09:07:17] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 44/662 variables, 26/188 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 71/262 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/663 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 3/666 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3786 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 122/159 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 459/618 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 44/662 variables, 26/188 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 71/262 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 37/299 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/663 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 3/666 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:07:25] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:07:25] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2025-05-31 09:07:25] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2025-05-31 09:07:25] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/666 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/666 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 09:07:27] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2025-05-31 09:07:27] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/666 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/666 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (OVERLAPS) 0/666 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 310 constraints, problems are : Problem set: 0 solved, 37 unsolved in 8491 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 6/6 constraints]
After SMT, in 12304ms problems are : Problem set: 0 solved, 37 unsolved
Parikh walk visited 0 properties in 899 ms.
Support contains 37 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 13 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 189/189 places, 511/511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2025-05-31 09:07:30] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:07:30] [INFO ] Invariant cache hit.
[2025-05-31 09:07:30] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-31 09:07:30] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:07:30] [INFO ] Invariant cache hit.
[2025-05-31 09:07:30] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:07:31] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2025-05-31 09:07:31] [INFO ] Redundant transitions in 5 ms returned []
Running 505 sub problems to find dead transitions.
[2025-05-31 09:07:31] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:07:31] [INFO ] Invariant cache hit.
[2025-05-31 09:07:31] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:07:34] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2025-05-31 09:07:34] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2025-05-31 09:07:34] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2025-05-31 09:07:34] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 2 ms to minimize.
[2025-05-31 09:07:34] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2025-05-31 09:07:34] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2025-05-31 09:07:35] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 477/666 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 71/274 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:07:47] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-05-31 09:07:51] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2025-05-31 09:07:51] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 277 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:08:05] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2025-05-31 09:08:05] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 477/666 variables, 189/208 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/279 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 505/784 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2025-05-31 09:08:16] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2025-05-31 09:08:16] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2025-05-31 09:08:16] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 3/787 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 787 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 15/15 constraints]
After SMT, in 60586ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61212 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 400000 steps (12928 resets) in 3972 ms. (100 steps per ms) remains 37/37 properties
Running SMT prover for 37 properties.
[2025-05-31 09:08:33] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:08:33] [INFO ] Invariant cache hit.
[2025-05-31 09:08:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:08:33] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :37
[2025-05-31 09:08:33] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-31 09:08:33] [INFO ] After 132ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 09:08:34] [INFO ] After 1298ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:37
[2025-05-31 09:08:34] [INFO ] After 1620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2025-05-31 09:08:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:08:35] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
[2025-05-31 09:08:35] [INFO ] After 159ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :37
TRAPS : Iteration 0
[2025-05-31 09:08:35] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2025-05-31 09:08:35] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2025-05-31 09:08:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2025-05-31 09:08:36] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2025-05-31 09:08:36] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2025-05-31 09:08:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
TRAPS : Iteration 1
[2025-05-31 09:08:37] [INFO ] After 2447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
[2025-05-31 09:08:37] [INFO ] After 2909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
RANDOM walk for 40000 steps (1292 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (274 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 857038 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 1
Probabilistic random walk after 857038 steps, saw 236743 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
[2025-05-31 09:08:40] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2025-05-31 09:08:40] [INFO ] Invariant cache hit.
[2025-05-31 09:08:40] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 507
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 507
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 185 transition count 501
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 185 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 183 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 183 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 491
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 491
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 481
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 449
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 163 transition count 453
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 161 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 161 transition count 445
Applied a total of 64 rules in 102 ms. Remains 161 /189 variables (removed 28) and now considering 445/511 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 161/189 places, 445/511 transitions.
RANDOM walk for 40000 steps (1253 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (281 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 936696 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 936696 steps, saw 273789 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2025-05-31 09:08:44] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
// Phase 1: matrix 409 rows 161 cols
[2025-05-31 09:08:44] [INFO ] Computed 7 invariants in 5 ms
[2025-05-31 09:08:44] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/392 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/393 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/552 variables, 79/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 38/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/568 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/570 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/570 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/392 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/393 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/552 variables, 79/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 38/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/568 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/570 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/570 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/570 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 445/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 161/161 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2025-05-31 09:08:45] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2025-05-31 09:08:45] [INFO ] Invariant cache hit.
[2025-05-31 09:08:45] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-31 09:08:45] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2025-05-31 09:08:45] [INFO ] Invariant cache hit.
[2025-05-31 09:08:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 09:08:45] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2025-05-31 09:08:45] [INFO ] Redundant transitions in 3 ms returned []
Running 439 sub problems to find dead transitions.
[2025-05-31 09:08:45] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2025-05-31 09:08:45] [INFO ] Invariant cache hit.
[2025-05-31 09:08:45] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:08:48] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2025-05-31 09:08:48] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 3 ms to minimize.
[2025-05-31 09:08:48] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2025-05-31 09:08:49] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2025-05-31 09:08:49] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2025-05-31 09:08:49] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2025-05-31 09:08:50] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2025-05-31 09:08:51] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 409/570 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:09:06] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2025-05-31 09:09:06] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/570 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 239 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 409/570 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 439/678 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:09:23] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2025-05-31 09:09:29] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 680 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 12/12 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61195 ms. Remains : 161/161 places, 445/445 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 161 vertex of which 31 / 161 are part of one of the 5 SCC in 5 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 147 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 134 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 134 transition count 289
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 13 place count 133 transition count 288
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 14 place count 133 transition count 287
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 16 place count 132 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 131 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 131 transition count 241
Free-agglomeration rule applied 8 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 131 transition count 228
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 37 place count 123 transition count 225
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 42 place count 123 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 123 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 122 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 122 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 122 transition count 223
Applied a total of 46 rules in 73 ms. Remains 122 /161 variables (removed 39) and now considering 223/445 (removed 222) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:09:46] [INFO ] Flow matrix only has 221 transitions (discarded 2 similar events)
// Phase 1: matrix 221 rows 122 cols
[2025-05-31 09:09:46] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:09:46] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:09:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 40 ms returned sat
[2025-05-31 09:09:46] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:09:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 5 ms to minimize.
[2025-05-31 09:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2025-05-31 09:09:46] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:09:46] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 524 ms.
RANDOM walk for 40000 steps (1286 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (275 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 868846 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :0 out of 1
Probabilistic random walk after 868846 steps, saw 239830 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
[2025-05-31 09:09:49] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:09:49] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:09:49] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 184 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 184 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 180 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 180 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 447
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 162 transition count 453
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 66 place count 159 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 159 transition count 441
Applied a total of 72 rules in 69 ms. Remains 159 /189 variables (removed 30) and now considering 441/511 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 159/189 places, 441/511 transitions.
RANDOM walk for 40000 steps (1284 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (262 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 932411 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :0 out of 1
Probabilistic random walk after 932411 steps, saw 273530 distinct states, run finished after 3004 ms. (steps per millisecond=310 ) properties seen :0
[2025-05-31 09:09:53] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 159 cols
[2025-05-31 09:09:53] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:09:53] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/385 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/386 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/545 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/561 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/563 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/563 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/385 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/545 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/545 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/561 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/561 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/563 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2025-05-31 09:09:54] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:09:54] [INFO ] Invariant cache hit.
[2025-05-31 09:09:54] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-31 09:09:54] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:09:54] [INFO ] Invariant cache hit.
[2025-05-31 09:09:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 09:09:54] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2025-05-31 09:09:54] [INFO ] Redundant transitions in 3 ms returned []
Running 435 sub problems to find dead transitions.
[2025-05-31 09:09:54] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:09:54] [INFO ] Invariant cache hit.
[2025-05-31 09:09:54] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:09:57] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
[2025-05-31 09:09:57] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2025-05-31 09:09:57] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2025-05-31 09:09:58] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2025-05-31 09:09:58] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2025-05-31 09:09:58] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2025-05-31 09:09:58] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2025-05-31 09:09:58] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2025-05-31 09:09:59] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2025-05-31 09:10:00] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2025-05-31 09:10:00] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/563 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 61/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:10:08] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
[2025-05-31 09:10:10] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:10:11] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2025-05-31 09:10:15] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2025-05-31 09:10:15] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 3.0 4.0))
(s14 (/ 1.0 4.0))
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 243 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:10:28] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:10:30] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (OVERLAPS) 404/563 variables, 159/184 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 435/680 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 680 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 18/18 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61224 ms. Remains : 159/159 places, 441/441 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 239
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 130 transition count 224
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 121 transition count 221
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 121 transition count 221
Applied a total of 46 rules in 39 ms. Remains 121 /159 variables (removed 38) and now considering 221/441 (removed 220) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:10:55] [INFO ] Flow matrix only has 219 transitions (discarded 2 similar events)
// Phase 1: matrix 219 rows 121 cols
[2025-05-31 09:10:55] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:10:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:10:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:10:55] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:10:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2025-05-31 09:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2025-05-31 09:10:55] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:10:55] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 345 ms.
RANDOM walk for 40000 steps (1292 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (285 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 829325 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 829325 steps, saw 228378 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2025-05-31 09:10:58] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:10:58] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:10:58] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 486
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 444
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 161 transition count 450
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 68 place count 158 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 438
Applied a total of 74 rules in 53 ms. Remains 158 /189 variables (removed 31) and now considering 438/511 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 158/189 places, 438/511 transitions.
RANDOM walk for 40000 steps (1270 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (267 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 904199 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 904199 steps, saw 264499 distinct states, run finished after 3004 ms. (steps per millisecond=300 ) properties seen :0
[2025-05-31 09:11:02] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 158 cols
[2025-05-31 09:11:02] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:11:02] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/541 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/557 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/559 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/541 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/557 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/559 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/559 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-05-31 09:11:03] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:11:03] [INFO ] Invariant cache hit.
[2025-05-31 09:11:03] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-31 09:11:03] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:11:03] [INFO ] Invariant cache hit.
[2025-05-31 09:11:03] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 09:11:03] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2025-05-31 09:11:03] [INFO ] Redundant transitions in 4 ms returned []
Running 432 sub problems to find dead transitions.
[2025-05-31 09:11:03] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:11:03] [INFO ] Invariant cache hit.
[2025-05-31 09:11:03] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:11:07] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 4 ms to minimize.
[2025-05-31 09:11:07] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2025-05-31 09:11:07] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 3 ms to minimize.
[2025-05-31 09:11:08] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2025-05-31 09:11:08] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 2 ms to minimize.
[2025-05-31 09:11:08] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:11:09] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 2 ms to minimize.
[2025-05-31 09:11:09] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2025-05-31 09:11:11] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 3 ms to minimize.
[2025-05-31 09:11:11] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:11:12] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:11:16] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 401/559 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:11:33] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 238 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 432/670 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:11:53] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2025-05-31 09:11:53] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 672 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints]
After SMT, in 60599ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61227 ms. Remains : 158/158 places, 438/438 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 158 vertex of which 29 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 132 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 130 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 129 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 237
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 129 transition count 222
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 120 transition count 219
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 120 transition count 219
Applied a total of 46 rules in 43 ms. Remains 120 /158 variables (removed 38) and now considering 219/438 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:12:04] [INFO ] Flow matrix only has 217 transitions (discarded 2 similar events)
// Phase 1: matrix 217 rows 120 cols
[2025-05-31 09:12:04] [INFO ] Computed 7 invariants in 3 ms
[2025-05-31 09:12:04] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:12:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 09:12:04] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:12:04] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:12:04] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 341 ms.
RANDOM walk for 40000 steps (1236 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (261 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 771109 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 771109 steps, saw 212133 distinct states, run finished after 3002 ms. (steps per millisecond=256 ) properties seen :0
[2025-05-31 09:12:07] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:12:07] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:12:07] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 484
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 160 transition count 448
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 70 place count 157 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 157 transition count 436
Applied a total of 76 rules in 54 ms. Remains 157 /189 variables (removed 32) and now considering 436/511 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 157/189 places, 436/511 transitions.
RANDOM walk for 40000 steps (1279 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (285 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 834365 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 834365 steps, saw 245846 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2025-05-31 09:12:11] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 157 cols
[2025-05-31 09:12:11] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:12:11] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/378 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/379 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/538 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/554 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/556 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/378 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/379 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/538 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/554 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/556 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/157 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2025-05-31 09:12:12] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 09:12:12] [INFO ] Invariant cache hit.
[2025-05-31 09:12:12] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-31 09:12:12] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 09:12:12] [INFO ] Invariant cache hit.
[2025-05-31 09:12:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 09:12:12] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2025-05-31 09:12:12] [INFO ] Redundant transitions in 3 ms returned []
Running 430 sub problems to find dead transitions.
[2025-05-31 09:12:12] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 09:12:12] [INFO ] Invariant cache hit.
[2025-05-31 09:12:12] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 09:12:15] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2025-05-31 09:12:15] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2025-05-31 09:12:15] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 1 ms to minimize.
[2025-05-31 09:12:16] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 2 ms to minimize.
[2025-05-31 09:12:16] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
[2025-05-31 09:12:16] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2025-05-31 09:12:16] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2025-05-31 09:12:16] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
[2025-05-31 09:12:17] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2025-05-31 09:12:17] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2025-05-31 09:12:18] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2025-05-31 09:12:18] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 09:12:32] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2025-05-31 09:12:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/556 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/556 variables, and 238 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/178 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 430/668 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 09:12:58] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 669 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61088 ms. Remains : 157/157 places, 436/436 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 157 vertex of which 29 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 131 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 130 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 130 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 129 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 128 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 128 transition count 235
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 128 transition count 220
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 119 transition count 217
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 119 transition count 217
Applied a total of 46 rules in 30 ms. Remains 119 /157 variables (removed 38) and now considering 217/436 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:13:13] [INFO ] Flow matrix only has 215 transitions (discarded 2 similar events)
// Phase 1: matrix 215 rows 119 cols
[2025-05-31 09:13:13] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:13:13] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:13:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 09:13:13] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:13:13] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:13:13] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 276 ms.
RANDOM walk for 40000 steps (1285 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 880792 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 1
Probabilistic random walk after 880792 steps, saw 242420 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2025-05-31 09:13:16] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:13:16] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:13:16] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 439
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 159 transition count 445
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 156 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 156 transition count 433
Applied a total of 78 rules in 54 ms. Remains 156 /189 variables (removed 33) and now considering 433/511 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 156/189 places, 433/511 transitions.
RANDOM walk for 40000 steps (1267 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 899339 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 1
Probabilistic random walk after 899339 steps, saw 262972 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
[2025-05-31 09:13:20] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
// Phase 1: matrix 396 rows 156 cols
[2025-05-31 09:13:20] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:13:20] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/374 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/375 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/534 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/550 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/552 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/374 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/375 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/534 variables, 79/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/550 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/552 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/552 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 433/433 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2025-05-31 09:13:21] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:13:21] [INFO ] Invariant cache hit.
[2025-05-31 09:13:21] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-31 09:13:21] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:13:21] [INFO ] Invariant cache hit.
[2025-05-31 09:13:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 09:13:21] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2025-05-31 09:13:21] [INFO ] Redundant transitions in 4 ms returned []
Running 427 sub problems to find dead transitions.
[2025-05-31 09:13:21] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:13:21] [INFO ] Invariant cache hit.
[2025-05-31 09:13:21] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:13:24] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2025-05-31 09:13:24] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2025-05-31 09:13:24] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2025-05-31 09:13:24] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2025-05-31 09:13:24] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2025-05-31 09:13:25] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 3 ms to minimize.
[2025-05-31 09:13:25] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-05-31 09:13:25] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2025-05-31 09:13:26] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2025-05-31 09:13:27] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2025-05-31 09:13:27] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2025-05-31 09:13:27] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 396/552 variables, 156/175 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:13:39] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2025-05-31 09:13:39] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
[2025-05-31 09:13:41] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2025-05-31 09:13:42] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/552 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:13:49] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2025-05-31 09:13:49] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 240 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 396/552 variables, 156/181 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 59/240 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 427/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:14:06] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 668 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 19/19 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61099 ms. Remains : 156/156 places, 433/433 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 138 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 233
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 218
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 215
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 215
Applied a total of 46 rules in 27 ms. Remains 118 /156 variables (removed 38) and now considering 215/433 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:14:22] [INFO ] Flow matrix only has 213 transitions (discarded 2 similar events)
// Phase 1: matrix 213 rows 118 cols
[2025-05-31 09:14:22] [INFO ] Computed 7 invariants in 0 ms
[2025-05-31 09:14:22] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:14:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:14:22] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:14:22] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-05-31 09:14:22] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2025-05-31 09:14:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
TRAPS : Iteration 1
[2025-05-31 09:14:22] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:14:22] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 377 ms.
RANDOM walk for 40000 steps (1304 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 872349 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 872349 steps, saw 240469 distinct states, run finished after 3002 ms. (steps per millisecond=290 ) properties seen :0
[2025-05-31 09:14:25] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:14:25] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:14:25] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 158 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 74 place count 155 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 155 transition count 431
Applied a total of 80 rules in 45 ms. Remains 155 /189 variables (removed 34) and now considering 431/511 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 155/189 places, 431/511 transitions.
RANDOM walk for 40000 steps (1263 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (290 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 939867 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 939867 steps, saw 276014 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2025-05-31 09:14:29] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 155 cols
[2025-05-31 09:14:29] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:14:29] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/371 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/531 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/547 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/549 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/549 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/371 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/531 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/547 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/549 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/549 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 431/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 431/431 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2025-05-31 09:14:29] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:14:29] [INFO ] Invariant cache hit.
[2025-05-31 09:14:30] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 09:14:30] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:14:30] [INFO ] Invariant cache hit.
[2025-05-31 09:14:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 09:14:30] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2025-05-31 09:14:30] [INFO ] Redundant transitions in 4 ms returned []
Running 425 sub problems to find dead transitions.
[2025-05-31 09:14:30] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:14:30] [INFO ] Invariant cache hit.
[2025-05-31 09:14:30] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:14:33] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2025-05-31 09:14:33] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 3 ms to minimize.
[2025-05-31 09:14:33] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2025-05-31 09:14:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-05-31 09:14:34] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2025-05-31 09:14:35] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2025-05-31 09:14:35] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2025-05-31 09:14:36] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:14:36] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2025-05-31 09:14:38] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 394/549 variables, 155/172 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:14:46] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:14:52] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-05-31 09:14:55] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2025-05-31 09:14:55] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2025-05-31 09:14:55] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:15:00] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30401ms, After SMT, problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 30406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31041 ms. Remains : 155/155 places, 431/431 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 138 edges and 155 vertex of which 29 / 155 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 129 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 128 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 127 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 126 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 126 transition count 231
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 126 transition count 216
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 117 transition count 213
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 117 transition count 213
Applied a total of 46 rules in 22 ms. Remains 117 /155 variables (removed 38) and now considering 213/431 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:15:00] [INFO ] Flow matrix only has 211 transitions (discarded 2 similar events)
// Phase 1: matrix 211 rows 117 cols
[2025-05-31 09:15:00] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:15:01] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:15:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:15:01] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:15:01] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-05-31 09:15:01] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-05-31 09:15:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
TRAPS : Iteration 1
[2025-05-31 09:15:01] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:15:01] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 351 ms.
RANDOM walk for 40000 steps (1229 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 886096 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 886096 steps, saw 243985 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2025-05-31 09:15:04] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:15:04] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:15:04] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 438
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 434
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 157 transition count 440
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 76 place count 154 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 154 transition count 428
Applied a total of 82 rules in 41 ms. Remains 154 /189 variables (removed 35) and now considering 428/511 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 154/189 places, 428/511 transitions.
RANDOM walk for 40000 steps (1273 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (243 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 971068 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 971068 steps, saw 284620 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2025-05-31 09:15:08] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
// Phase 1: matrix 391 rows 154 cols
[2025-05-31 09:15:08] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:15:08] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/181 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/367 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/527 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/543 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/181 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/367 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/368 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/527 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 38/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/543 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/545 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/545 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 8 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 154/154 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2025-05-31 09:15:08] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 09:15:08] [INFO ] Invariant cache hit.
[2025-05-31 09:15:08] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-31 09:15:08] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 09:15:08] [INFO ] Invariant cache hit.
[2025-05-31 09:15:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 09:15:09] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2025-05-31 09:15:09] [INFO ] Redundant transitions in 4 ms returned []
Running 422 sub problems to find dead transitions.
[2025-05-31 09:15:09] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2025-05-31 09:15:09] [INFO ] Invariant cache hit.
[2025-05-31 09:15:09] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:15:12] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 3 ms to minimize.
[2025-05-31 09:15:12] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 09:15:12] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 3 ms to minimize.
[2025-05-31 09:15:13] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-05-31 09:15:13] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2025-05-31 09:15:13] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2025-05-31 09:15:13] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2025-05-31 09:15:14] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2025-05-31 09:15:14] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2025-05-31 09:15:15] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
[2025-05-31 09:15:15] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:15:16] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2025-05-31 09:15:17] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2025-05-31 09:15:17] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:15:20] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 391/545 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 58/234 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:15:30] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2025-05-31 09:15:36] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2025-05-31 09:15:36] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 237 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 391/545 variables, 154/179 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/237 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 422/659 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 659 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 18/18 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61324 ms. Remains : 154/154 places, 428/428 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 154 vertex of which 29 / 154 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 283
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 128 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 127 transition count 273
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 127 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 126 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 125 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 125 transition count 229
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 125 transition count 214
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 116 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 116 transition count 211
Applied a total of 46 rules in 30 ms. Remains 116 /154 variables (removed 38) and now considering 211/428 (removed 217) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:16:09] [INFO ] Flow matrix only has 209 transitions (discarded 2 similar events)
// Phase 1: matrix 209 rows 116 cols
[2025-05-31 09:16:09] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:16:10] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:16:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:16:10] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:16:10] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-05-31 09:16:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-05-31 09:16:10] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2025-05-31 09:16:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
TRAPS : Iteration 1
[2025-05-31 09:16:10] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:16:10] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 513 ms.
RANDOM walk for 40000 steps (1271 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (288 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 817212 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 817212 steps, saw 224836 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2025-05-31 09:16:13] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:16:13] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:16:13] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 156 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 156 transition count 432
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 69 place count 156 transition count 438
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 78 place count 153 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 153 transition count 426
Applied a total of 84 rules in 56 ms. Remains 153 /189 variables (removed 36) and now considering 426/511 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 153/189 places, 426/511 transitions.
RANDOM walk for 40000 steps (1266 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (262 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 905860 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 905860 steps, saw 265067 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2025-05-31 09:16:17] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 153 cols
[2025-05-31 09:16:17] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:16:17] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/364 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/524 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/540 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/542 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/542 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/542 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/364 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/365 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/524 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/540 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/540 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/542 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/542 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/542 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 426/426 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 153/153 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 426/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2025-05-31 09:16:17] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2025-05-31 09:16:17] [INFO ] Invariant cache hit.
[2025-05-31 09:16:17] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-31 09:16:17] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2025-05-31 09:16:17] [INFO ] Invariant cache hit.
[2025-05-31 09:16:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-31 09:16:18] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2025-05-31 09:16:18] [INFO ] Redundant transitions in 5 ms returned []
Running 420 sub problems to find dead transitions.
[2025-05-31 09:16:18] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2025-05-31 09:16:18] [INFO ] Invariant cache hit.
[2025-05-31 09:16:18] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:16:22] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 3 ms to minimize.
[2025-05-31 09:16:22] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-05-31 09:16:22] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2025-05-31 09:16:23] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2025-05-31 09:16:23] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
[2025-05-31 09:16:24] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2025-05-31 09:16:24] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2025-05-31 09:16:25] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 2 ms to minimize.
[2025-05-31 09:16:25] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-05-31 09:16:26] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 2 ms to minimize.
[2025-05-31 09:16:26] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:16:29] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 389/542 variables, 153/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 58/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/542 variables, and 230 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/542 variables, 153/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 58/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 420/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:17:02] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2025-05-31 09:17:06] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-31 09:17:17] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 653 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 15/15 constraints]
After SMT, in 60640ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60648ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61514 ms. Remains : 153/153 places, 426/426 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 153 vertex of which 29 / 153 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 281
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 127 transition count 272
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 126 transition count 271
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 126 transition count 270
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 125 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 124 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 227
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 124 transition count 212
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 115 transition count 209
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 115 transition count 209
Applied a total of 46 rules in 18 ms. Remains 115 /153 variables (removed 38) and now considering 209/426 (removed 217) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:17:19] [INFO ] Flow matrix only has 207 transitions (discarded 2 similar events)
// Phase 1: matrix 207 rows 115 cols
[2025-05-31 09:17:19] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:17:19] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:17:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 09:17:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:17:19] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-05-31 09:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2025-05-31 09:17:19] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:17:19] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 267 ms.
RANDOM walk for 40000 steps (1305 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (292 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 905103 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 905103 steps, saw 248875 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2025-05-31 09:17:22] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:17:22] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:17:22] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 433
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 155 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 155 transition count 429
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 155 transition count 435
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 80 place count 152 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 152 transition count 423
Applied a total of 86 rules in 65 ms. Remains 152 /189 variables (removed 37) and now considering 423/511 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 152/189 places, 423/511 transitions.
RANDOM walk for 40000 steps (1291 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (286 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 940567 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 940567 steps, saw 276259 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2025-05-31 09:17:26] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
// Phase 1: matrix 386 rows 152 cols
[2025-05-31 09:17:26] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:17:26] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/174 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/360 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/361 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/520 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/536 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/538 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/174 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/360 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/361 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/520 variables, 79/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/520 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/520 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/536 variables, 10/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/538 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/538 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/538 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 423/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 152/152 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 423/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2025-05-31 09:17:26] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2025-05-31 09:17:26] [INFO ] Invariant cache hit.
[2025-05-31 09:17:27] [INFO ] Implicit Places using invariants in 271 ms returned []
[2025-05-31 09:17:27] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2025-05-31 09:17:27] [INFO ] Invariant cache hit.
[2025-05-31 09:17:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 09:17:27] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2025-05-31 09:17:27] [INFO ] Redundant transitions in 6 ms returned []
Running 417 sub problems to find dead transitions.
[2025-05-31 09:17:27] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2025-05-31 09:17:27] [INFO ] Invariant cache hit.
[2025-05-31 09:17:27] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:17:31] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 3 ms to minimize.
[2025-05-31 09:17:31] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 3 ms to minimize.
[2025-05-31 09:17:31] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-05-31 09:17:31] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2025-05-31 09:17:32] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:17:32] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2025-05-31 09:17:33] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 2 ms to minimize.
[2025-05-31 09:17:34] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-05-31 09:17:35] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:17:35] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 3 ms to minimize.
[2025-05-31 09:17:36] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 2 ms to minimize.
[2025-05-31 09:17:37] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:17:39] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 386/538 variables, 152/172 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 57/229 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:17:55] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 230 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 386/538 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 417/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2025-05-31 09:18:12] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2025-05-31 09:18:14] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 16/16 constraints]
After SMT, in 60589ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61539 ms. Remains : 152/152 places, 423/423 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 152 vertex of which 29 / 152 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 278
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 126 transition count 269
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 125 transition count 268
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 125 transition count 267
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 124 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 123 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 123 transition count 225
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 123 transition count 210
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 114 transition count 207
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 114 transition count 207
Applied a total of 46 rules in 35 ms. Remains 114 /152 variables (removed 38) and now considering 207/423 (removed 216) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:18:28] [INFO ] Flow matrix only has 205 transitions (discarded 2 similar events)
// Phase 1: matrix 205 rows 114 cols
[2025-05-31 09:18:28] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:18:28] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:18:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:18:28] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:18:28] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:18:28] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 311 ms.
RANDOM walk for 40000 steps (1272 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (283 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 844954 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 1
Probabilistic random walk after 844954 steps, saw 233114 distinct states, run finished after 3004 ms. (steps per millisecond=281 ) properties seen :0
[2025-05-31 09:18:31] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:18:31] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:18:31] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 563ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 156 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 156 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 154 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 154 transition count 427
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 154 transition count 433
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 82 place count 151 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 151 transition count 421
Applied a total of 88 rules in 67 ms. Remains 151 /189 variables (removed 38) and now considering 421/511 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 151/189 places, 421/511 transitions.
RANDOM walk for 40000 steps (1303 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (259 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 901675 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 1
Probabilistic random walk after 901675 steps, saw 263656 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
[2025-05-31 09:18:35] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2025-05-31 09:18:35] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:18:35] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 128/171 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/357 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/358 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/517 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/517 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/517 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/517 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/533 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/535 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/535 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 128/171 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/357 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/358 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/517 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/517 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/517 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/533 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/533 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/533 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/535 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/535 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 151/151 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2025-05-31 09:18:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 09:18:36] [INFO ] Invariant cache hit.
[2025-05-31 09:18:36] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-05-31 09:18:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 09:18:36] [INFO ] Invariant cache hit.
[2025-05-31 09:18:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 09:18:37] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2025-05-31 09:18:37] [INFO ] Redundant transitions in 5 ms returned []
Running 415 sub problems to find dead transitions.
[2025-05-31 09:18:37] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2025-05-31 09:18:37] [INFO ] Invariant cache hit.
[2025-05-31 09:18:37] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:18:40] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 3 ms to minimize.
[2025-05-31 09:18:40] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 2 ms to minimize.
[2025-05-31 09:18:41] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2025-05-31 09:18:41] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:18:42] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 2 ms to minimize.
[2025-05-31 09:18:42] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2025-05-31 09:18:43] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 3 ms to minimize.
[2025-05-31 09:18:43] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2025-05-31 09:18:43] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-05-31 09:18:44] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 6 ms to minimize.
[2025-05-31 09:18:44] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/535 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 57/226 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:19:00] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2025-05-31 09:19:02] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/535 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 228 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/535 variables, 151/171 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 57/228 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 415/643 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:19:21] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2025-05-31 09:19:37] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 15/15 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61425 ms. Remains : 151/151 places, 421/421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 276
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 125 transition count 267
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 124 transition count 266
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 124 transition count 265
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 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 223
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 122 transition count 208
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 113 transition count 205
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 113 transition count 205
Applied a total of 46 rules in 32 ms. Remains 113 /151 variables (removed 38) and now considering 205/421 (removed 216) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:19:37] [INFO ] Flow matrix only has 203 transitions (discarded 2 similar events)
// Phase 1: matrix 203 rows 113 cols
[2025-05-31 09:19:37] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:19:37] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:19:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:19:37] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:19:37] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:19:37] [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 308 ms.
RANDOM walk for 40000 steps (1300 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (276 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 819730 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 819730 steps, saw 225722 distinct states, run finished after 3004 ms. (steps per millisecond=272 ) properties seen :0
[2025-05-31 09:19:41] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:19:41] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:19:41] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 155 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 155 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 153 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 153 transition count 424
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 153 transition count 430
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 84 place count 150 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 150 transition count 418
Applied a total of 90 rules in 67 ms. Remains 150 /189 variables (removed 39) and now considering 418/511 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 150/189 places, 418/511 transitions.
RANDOM walk for 40000 steps (1312 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 903594 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 903594 steps, saw 264327 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2025-05-31 09:19:44] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
// Phase 1: matrix 381 rows 150 cols
[2025-05-31 09:19:44] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:19:44] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/167 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/353 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/354 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/513 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/529 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/531 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/167 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/353 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/354 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/513 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/513 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/529 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/531 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/531 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 418/418 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 150/150 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2025-05-31 09:19:45] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2025-05-31 09:19:45] [INFO ] Invariant cache hit.
[2025-05-31 09:19:45] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-31 09:19:45] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2025-05-31 09:19:45] [INFO ] Invariant cache hit.
[2025-05-31 09:19:45] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 09:19:46] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2025-05-31 09:19:46] [INFO ] Redundant transitions in 5 ms returned []
Running 412 sub problems to find dead transitions.
[2025-05-31 09:19:46] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2025-05-31 09:19:46] [INFO ] Invariant cache hit.
[2025-05-31 09:19:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:19:49] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2025-05-31 09:19:49] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 3 ms to minimize.
[2025-05-31 09:19:50] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2025-05-31 09:19:50] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:19:51] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 2 ms to minimize.
[2025-05-31 09:19:51] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2025-05-31 09:19:51] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 3 ms to minimize.
[2025-05-31 09:19:51] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2025-05-31 09:19:52] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2025-05-31 09:19:52] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2025-05-31 09:19:52] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-05-31 09:19:53] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:19:55] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 381/531 variables, 150/170 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:20:14] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2025-05-31 09:20:14] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/531 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/531 variables, and 228 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 381/531 variables, 150/172 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 412/640 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2025-05-31 09:20:26] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-05-31 09:20:31] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/531 variables, and 642 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61478 ms. Remains : 150/150 places, 418/418 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 150 vertex of which 29 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 273
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 124 transition count 264
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 123 transition count 263
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 123 transition count 262
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 122 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 221
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 121 transition count 206
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 112 transition count 203
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 112 transition count 203
Applied a total of 46 rules in 25 ms. Remains 112 /150 variables (removed 38) and now considering 203/418 (removed 215) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:20:46] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 112 cols
[2025-05-31 09:20:46] [INFO ] Computed 7 invariants in 4 ms
[2025-05-31 09:20:47] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:20:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 09:20:47] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:20:47] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:20:47] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 316 ms.
RANDOM walk for 40000 steps (1252 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (264 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 847137 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :0 out of 1
Probabilistic random walk after 847137 steps, saw 233807 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
[2025-05-31 09:20:50] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:20:50] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:20:50] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 156 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 156 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 154 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 154 transition count 426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 152 transition count 422
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 152 transition count 422
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 152 transition count 428
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 86 place count 149 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 149 transition count 416
Applied a total of 92 rules in 35 ms. Remains 149 /189 variables (removed 40) and now considering 416/511 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 149/189 places, 416/511 transitions.
RANDOM walk for 40000 steps (1303 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (251 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1010096 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 1
Probabilistic random walk after 1010096 steps, saw 295941 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
[2025-05-31 09:20:53] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 149 cols
[2025-05-31 09:20:53] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:20:53] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/164 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/350 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/351 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/510 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/526 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/528 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/164 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/350 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/351 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/510 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/526 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/528 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 149/149 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2025-05-31 09:20:54] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2025-05-31 09:20:54] [INFO ] Invariant cache hit.
[2025-05-31 09:20:54] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-31 09:20:54] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2025-05-31 09:20:54] [INFO ] Invariant cache hit.
[2025-05-31 09:20:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 09:20:55] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2025-05-31 09:20:55] [INFO ] Redundant transitions in 3 ms returned []
Running 410 sub problems to find dead transitions.
[2025-05-31 09:20:55] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2025-05-31 09:20:55] [INFO ] Invariant cache hit.
[2025-05-31 09:20:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:20:57] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 2 ms to minimize.
[2025-05-31 09:20:57] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2025-05-31 09:20:57] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2025-05-31 09:20:57] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2025-05-31 09:20:57] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2025-05-31 09:20:58] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2025-05-31 09:20:58] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2025-05-31 09:20:58] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2025-05-31 09:20:59] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 2 ms to minimize.
[2025-05-31 09:21:00] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/166 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:21:09] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:21:14] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2025-05-31 09:21:15] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2025-05-31 09:21:24] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 226 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/170 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 410/636 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 636 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 14/14 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61085 ms. Remains : 149/149 places, 416/416 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 149 vertex of which 29 / 149 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 123 transition count 271
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 123 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 122 transition count 261
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 122 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 121 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 120 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 120 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 120 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 111 transition count 201
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 111 transition count 201
Applied a total of 46 rules in 38 ms. Remains 111 /149 variables (removed 38) and now considering 201/416 (removed 215) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:21:55] [INFO ] Flow matrix only has 199 transitions (discarded 2 similar events)
// Phase 1: matrix 199 rows 111 cols
[2025-05-31 09:21:55] [INFO ] Computed 7 invariants in 6 ms
[2025-05-31 09:21:55] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:21:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:21:55] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:21:55] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2025-05-31 09:21:55] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2025-05-31 09:21:55] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2025-05-31 09:21:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
TRAPS : Iteration 1
[2025-05-31 09:21:55] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:21:55] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 504 ms.
RANDOM walk for 40000 steps (1254 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (275 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 821599 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 821599 steps, saw 226190 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2025-05-31 09:21:59] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:21:59] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:21:59] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 156 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 156 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 153 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 153 transition count 424
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 151 transition count 420
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 151 transition count 420
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 79 place count 151 transition count 426
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 88 place count 148 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 148 transition count 414
Applied a total of 94 rules in 74 ms. Remains 148 /189 variables (removed 41) and now considering 414/511 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 148/189 places, 414/511 transitions.
RANDOM walk for 40000 steps (1301 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (254 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 938053 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 938053 steps, saw 275425 distinct states, run finished after 3004 ms. (steps per millisecond=312 ) properties seen :0
[2025-05-31 09:22:02] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
// Phase 1: matrix 377 rows 148 cols
[2025-05-31 09:22:02] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:22:02] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/161 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/347 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/348 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/507 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/523 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/525 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/525 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/525 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/161 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/347 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/348 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/507 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/523 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/525 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/525 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/525 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2025-05-31 09:22:03] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2025-05-31 09:22:03] [INFO ] Invariant cache hit.
[2025-05-31 09:22:03] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-31 09:22:03] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2025-05-31 09:22:03] [INFO ] Invariant cache hit.
[2025-05-31 09:22:03] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 09:22:04] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2025-05-31 09:22:04] [INFO ] Redundant transitions in 5 ms returned []
Running 408 sub problems to find dead transitions.
[2025-05-31 09:22:04] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2025-05-31 09:22:04] [INFO ] Invariant cache hit.
[2025-05-31 09:22:04] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2025-05-31 09:22:06] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 3 ms to minimize.
[2025-05-31 09:22:06] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2025-05-31 09:22:06] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
[2025-05-31 09:22:06] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2025-05-31 09:22:07] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2025-05-31 09:22:07] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2025-05-31 09:22:08] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2025-05-31 09:22:08] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2025-05-31 09:22:08] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2025-05-31 09:22:09] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2025-05-31 09:22:12] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2025-05-31 09:22:15] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 377/525 variables, 148/167 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2025-05-31 09:22:28] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2025-05-31 09:22:30] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/525 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 225 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 377/525 variables, 148/169 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 408/633 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2025-05-31 09:22:44] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-05-31 09:22:55] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2025-05-31 09:22:55] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2025-05-31 09:22:56] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 637 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 18/18 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61168 ms. Remains : 148/148 places, 414/414 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 148 vertex of which 29 / 148 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 269
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 122 transition count 260
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 121 transition count 259
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 121 transition count 258
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 120 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 119 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 119 transition count 218
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 119 transition count 203
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 110 transition count 200
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 110 transition count 200
Applied a total of 46 rules in 32 ms. Remains 110 /148 variables (removed 38) and now considering 200/414 (removed 214) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:23:04] [INFO ] Flow matrix only has 198 transitions (discarded 2 similar events)
// Phase 1: matrix 198 rows 110 cols
[2025-05-31 09:23:04] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:23:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:23:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:23:04] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:23:04] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:23:04] [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 314 ms.
RANDOM walk for 40000 steps (1267 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (294 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 824537 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 1
Probabilistic random walk after 824537 steps, saw 226846 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2025-05-31 09:23:08] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:23:08] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:23:08] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 507
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 507
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 185 transition count 501
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 185 transition count 501
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 183 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 183 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 491
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 491
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 481
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 449
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 163 transition count 453
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 161 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 161 transition count 445
Applied a total of 64 rules in 69 ms. Remains 161 /189 variables (removed 28) and now considering 445/511 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 161/189 places, 445/511 transitions.
RANDOM walk for 40000 steps (1298 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (287 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 941637 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941637 steps, saw 272248 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2025-05-31 09:23:11] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
// Phase 1: matrix 409 rows 161 cols
[2025-05-31 09:23:11] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:23:11] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/392 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/393 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/552 variables, 79/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 38/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/568 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/570 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/570 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/570 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/392 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/393 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/552 variables, 79/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 38/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/568 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/570 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/570 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/570 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 445/445 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 161/161 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 445/445 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2025-05-31 09:23:12] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2025-05-31 09:23:12] [INFO ] Invariant cache hit.
[2025-05-31 09:23:12] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-31 09:23:12] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2025-05-31 09:23:12] [INFO ] Invariant cache hit.
[2025-05-31 09:23:12] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 09:23:13] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2025-05-31 09:23:13] [INFO ] Redundant transitions in 6 ms returned []
Running 439 sub problems to find dead transitions.
[2025-05-31 09:23:13] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2025-05-31 09:23:13] [INFO ] Invariant cache hit.
[2025-05-31 09:23:13] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:23:16] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:23:17] [INFO ] Deduced a trap composed of 61 places in 212 ms of which 3 ms to minimize.
[2025-05-31 09:23:17] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 2 ms to minimize.
[2025-05-31 09:23:17] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2025-05-31 09:23:18] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 2 ms to minimize.
[2025-05-31 09:23:19] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2025-05-31 09:23:20] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 2 ms to minimize.
[2025-05-31 09:23:20] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 409/570 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:23:38] [INFO ] Deduced a trap composed of 58 places in 193 ms of which 4 ms to minimize.
[2025-05-31 09:23:38] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 3 ms to minimize.
[2025-05-31 09:23:43] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 240 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:23:45] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 2 ms to minimize.
[2025-05-31 09:23:45] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 3 ms to minimize.
[2025-05-31 09:23:45] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 409/570 variables, 161/182 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 61/243 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 439/682 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2025-05-31 09:23:59] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 683 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 15/15 constraints]
After SMT, in 60658ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61605 ms. Remains : 161/161 places, 445/445 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 161 vertex of which 31 / 161 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 147 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 134 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 134 transition count 289
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 13 place count 133 transition count 288
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 14 place count 133 transition count 287
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 16 place count 132 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 131 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 131 transition count 241
Free-agglomeration rule applied 8 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 131 transition count 228
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 37 place count 123 transition count 225
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 42 place count 123 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 123 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 122 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 122 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 122 transition count 223
Applied a total of 46 rules in 36 ms. Remains 122 /161 variables (removed 39) and now considering 223/445 (removed 222) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:24:14] [INFO ] Flow matrix only has 221 transitions (discarded 2 similar events)
// Phase 1: matrix 221 rows 122 cols
[2025-05-31 09:24:14] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:24:14] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:24:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 09:24:14] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:24:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2025-05-31 09:24:14] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2025-05-31 09:24:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
TRAPS : Iteration 1
[2025-05-31 09:24:14] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:24:14] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 354 ms.
RANDOM walk for 40000 steps (1291 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (268 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 890263 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 1
Probabilistic random walk after 890263 steps, saw 245204 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
[2025-05-31 09:24:17] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:24:17] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:24:17] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 686ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 184 transition count 499
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 184 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 180 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 180 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 447
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 162 transition count 453
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 66 place count 159 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 159 transition count 441
Applied a total of 72 rules in 80 ms. Remains 159 /189 variables (removed 30) and now considering 441/511 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 159/189 places, 441/511 transitions.
RANDOM walk for 40000 steps (1264 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 872029 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 872029 steps, saw 255795 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2025-05-31 09:24:21] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 159 cols
[2025-05-31 09:24:21] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:24:21] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/385 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/386 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/545 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/561 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/563 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/563 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/385 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/545 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/545 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/561 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/561 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/563 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 159/159 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2025-05-31 09:24:22] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:24:22] [INFO ] Invariant cache hit.
[2025-05-31 09:24:22] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-31 09:24:22] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:24:22] [INFO ] Invariant cache hit.
[2025-05-31 09:24:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-31 09:24:23] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2025-05-31 09:24:23] [INFO ] Redundant transitions in 5 ms returned []
Running 435 sub problems to find dead transitions.
[2025-05-31 09:24:23] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2025-05-31 09:24:23] [INFO ] Invariant cache hit.
[2025-05-31 09:24:23] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:24:26] [INFO ] Deduced a trap composed of 59 places in 222 ms of which 3 ms to minimize.
[2025-05-31 09:24:26] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2025-05-31 09:24:27] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 2 ms to minimize.
[2025-05-31 09:24:27] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2025-05-31 09:24:27] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 3 ms to minimize.
[2025-05-31 09:24:27] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2025-05-31 09:24:28] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 2 ms to minimize.
[2025-05-31 09:24:30] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2025-05-31 09:24:31] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 3 ms to minimize.
[2025-05-31 09:24:31] [INFO ] Deduced a trap composed of 104 places in 211 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/563 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:24:41] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:24:52] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 239 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:24:57] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:25:00] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (OVERLAPS) 404/563 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 435/676 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2025-05-31 09:25:16] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2025-05-31 09:25:19] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 678 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 16/16 constraints]
After SMT, in 60699ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61651 ms. Remains : 159/159 places, 441/441 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 131 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 239
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 130 transition count 224
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 121 transition count 221
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 121 transition count 221
Applied a total of 46 rules in 22 ms. Remains 121 /159 variables (removed 38) and now considering 221/441 (removed 220) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:25:23] [INFO ] Flow matrix only has 219 transitions (discarded 2 similar events)
// Phase 1: matrix 219 rows 121 cols
[2025-05-31 09:25:23] [INFO ] Computed 7 invariants in 0 ms
[2025-05-31 09:25:23] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:25:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 09:25:23] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:25:23] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2025-05-31 09:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2025-05-31 09:25:23] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:25:23] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 249 ms.
RANDOM walk for 40000 steps (1285 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (279 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 869971 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :0 out of 1
Probabilistic random walk after 869971 steps, saw 240051 distinct states, run finished after 3004 ms. (steps per millisecond=289 ) properties seen :0
[2025-05-31 09:25:27] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:25:27] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:25:27] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 486
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 444
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 161 transition count 450
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 68 place count 158 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 438
Applied a total of 74 rules in 70 ms. Remains 158 /189 variables (removed 31) and now considering 438/511 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 158/189 places, 438/511 transitions.
RANDOM walk for 40000 steps (1274 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (275 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 861402 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 1
Probabilistic random walk after 861402 steps, saw 252528 distinct states, run finished after 3004 ms. (steps per millisecond=286 ) properties seen :0
[2025-05-31 09:25:30] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 158 cols
[2025-05-31 09:25:30] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:25:30] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/541 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/557 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/559 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/381 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/382 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/541 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/557 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/559 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/559 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 158/158 places, 438/438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 438/438 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2025-05-31 09:25:31] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:25:31] [INFO ] Invariant cache hit.
[2025-05-31 09:25:31] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-31 09:25:31] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:25:31] [INFO ] Invariant cache hit.
[2025-05-31 09:25:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 09:25:32] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2025-05-31 09:25:32] [INFO ] Redundant transitions in 5 ms returned []
Running 432 sub problems to find dead transitions.
[2025-05-31 09:25:32] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2025-05-31 09:25:32] [INFO ] Invariant cache hit.
[2025-05-31 09:25:32] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:25:35] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 3 ms to minimize.
[2025-05-31 09:25:36] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 2 ms to minimize.
[2025-05-31 09:25:36] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2025-05-31 09:25:36] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 2 ms to minimize.
[2025-05-31 09:25:36] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2025-05-31 09:25:37] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 09:25:37] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2025-05-31 09:25:38] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2025-05-31 09:25:39] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 2 ms to minimize.
[2025-05-31 09:25:40] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2025-05-31 09:25:40] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-05-31 09:25:40] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2025-05-31 09:25:40] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:25:54] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-05-31 09:25:55] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2025-05-31 09:26:00] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/559 variables, and 241 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/181 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 432/673 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 673 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 16/16 constraints]
After SMT, in 60727ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61579 ms. Remains : 158/158 places, 438/438 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 158 vertex of which 29 / 158 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 132 transition count 284
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 131 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 130 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 129 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 237
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 129 transition count 222
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 120 transition count 219
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 120 transition count 219
Applied a total of 46 rules in 35 ms. Remains 120 /158 variables (removed 38) and now considering 219/438 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:26:32] [INFO ] Flow matrix only has 217 transitions (discarded 2 similar events)
// Phase 1: matrix 217 rows 120 cols
[2025-05-31 09:26:32] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:26:32] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:26:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 09:26:33] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:26:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2025-05-31 09:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 1
[2025-05-31 09:26:33] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:26:33] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 399 ms.
RANDOM walk for 40000 steps (1261 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (256 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 842488 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 1
Probabilistic random walk after 842488 steps, saw 232418 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2025-05-31 09:26:36] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:26:36] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:26:36] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 484
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 160 transition count 448
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 70 place count 157 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 157 transition count 436
Applied a total of 76 rules in 71 ms. Remains 157 /189 variables (removed 32) and now considering 436/511 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 157/189 places, 436/511 transitions.
RANDOM walk for 40000 steps (1300 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (275 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 804700 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 804700 steps, saw 238089 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2025-05-31 09:26:40] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 157 cols
[2025-05-31 09:26:40] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:26:40] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/378 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/379 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/538 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/554 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/556 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/378 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/379 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/538 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/554 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/556 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 157/157 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2025-05-31 09:26:40] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 09:26:40] [INFO ] Invariant cache hit.
[2025-05-31 09:26:41] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-31 09:26:41] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 09:26:41] [INFO ] Invariant cache hit.
[2025-05-31 09:26:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 09:26:41] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2025-05-31 09:26:41] [INFO ] Redundant transitions in 6 ms returned []
Running 430 sub problems to find dead transitions.
[2025-05-31 09:26:41] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2025-05-31 09:26:41] [INFO ] Invariant cache hit.
[2025-05-31 09:26:41] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 09:26:45] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 3 ms to minimize.
[2025-05-31 09:26:45] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 3 ms to minimize.
[2025-05-31 09:26:46] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 2 ms to minimize.
[2025-05-31 09:26:46] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2025-05-31 09:26:46] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2025-05-31 09:26:47] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2025-05-31 09:26:47] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-05-31 09:26:48] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2025-05-31 09:26:48] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2025-05-31 09:26:49] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2025-05-31 09:26:49] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 09:27:03] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2025-05-31 09:27:11] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/556 variables, and 237 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/177 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 430/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 667 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 13/13 constraints]
After SMT, in 60675ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61581 ms. Remains : 157/157 places, 436/436 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 157 vertex of which 29 / 157 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 131 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 130 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 130 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 129 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 128 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 128 transition count 235
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 128 transition count 220
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 119 transition count 217
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 119 transition count 217
Applied a total of 46 rules in 36 ms. Remains 119 /157 variables (removed 38) and now considering 217/436 (removed 219) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:27:42] [INFO ] Flow matrix only has 215 transitions (discarded 2 similar events)
// Phase 1: matrix 215 rows 119 cols
[2025-05-31 09:27:42] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:27:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:27:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:27:42] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:27:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2025-05-31 09:27:42] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2025-05-31 09:27:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
TRAPS : Iteration 1
[2025-05-31 09:27:42] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:27:42] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 398 ms.
RANDOM walk for 40000 steps (1306 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (293 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 733313 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 733313 steps, saw 202194 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2025-05-31 09:27:45] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:27:45] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:27:45] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 439
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 159 transition count 445
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 156 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 156 transition count 433
Applied a total of 78 rules in 61 ms. Remains 156 /189 variables (removed 33) and now considering 433/511 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 156/189 places, 433/511 transitions.
RANDOM walk for 40000 steps (1338 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (261 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 814934 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :0 out of 1
Probabilistic random walk after 814934 steps, saw 240496 distinct states, run finished after 3002 ms. (steps per millisecond=271 ) properties seen :0
[2025-05-31 09:27:49] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
// Phase 1: matrix 396 rows 156 cols
[2025-05-31 09:27:49] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:27:49] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/374 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/375 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/534 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/550 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/552 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/374 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/375 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/534 variables, 79/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/534 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/534 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/550 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/552 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/552 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 156/156 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2025-05-31 09:27:50] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:27:50] [INFO ] Invariant cache hit.
[2025-05-31 09:27:50] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-31 09:27:50] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:27:50] [INFO ] Invariant cache hit.
[2025-05-31 09:27:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 09:27:51] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2025-05-31 09:27:51] [INFO ] Redundant transitions in 6 ms returned []
Running 427 sub problems to find dead transitions.
[2025-05-31 09:27:51] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2025-05-31 09:27:51] [INFO ] Invariant cache hit.
[2025-05-31 09:27:51] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:27:54] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2025-05-31 09:27:55] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2025-05-31 09:27:55] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 2 ms to minimize.
[2025-05-31 09:27:55] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 2 ms to minimize.
[2025-05-31 09:27:55] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2025-05-31 09:27:56] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2025-05-31 09:27:57] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2025-05-31 09:27:58] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2025-05-31 09:27:59] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 396/552 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:28:10] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:28:14] [INFO ] Deduced a trap composed of 96 places in 181 ms of which 3 ms to minimize.
[2025-05-31 09:28:15] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 3 ms to minimize.
[2025-05-31 09:28:19] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 235 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (OVERLAPS) 396/552 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 59/235 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 427/662 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2025-05-31 09:28:36] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 663 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 14/14 constraints]
After SMT, in 60692ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60700ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61637 ms. Remains : 156/156 places, 433/433 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 138 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 233
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 218
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 215
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 215
Applied a total of 46 rules in 23 ms. Remains 118 /156 variables (removed 38) and now considering 215/433 (removed 218) transitions.
Running SMT prover for 1 properties.
[2025-05-31 09:28:51] [INFO ] Flow matrix only has 213 transitions (discarded 2 similar events)
// Phase 1: matrix 213 rows 118 cols
[2025-05-31 09:28:51] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:28:51] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 09:28:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 09:28:51] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 09:28:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2025-05-31 09:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2025-05-31 09:28:52] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 09:28:52] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
RANDOM walk for 40000 steps (1231 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (281 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 781192 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 1
Probabilistic random walk after 781192 steps, saw 214926 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
[2025-05-31 09:28:55] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2025-05-31 09:28:55] [INFO ] Computed 7 invariants in 1 ms
[2025-05-31 09:28:55] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/648 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/664 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/664 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/666 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/666 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 236/442 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/648 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/648 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/664 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/666 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/666 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 511/511 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 490
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 490
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 475
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 158 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 74 place count 155 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 155 transition count 431
Applied a total of 80 rules in 105 ms. Remains 155 /189 variables (removed 34) and now considering 431/511 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 155/189 places, 431/511 transitions.
RANDOM walk for 40000 steps (1310 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (274 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 886494 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 886494 steps, saw 260015 distinct states, run finished after 3005 ms. (steps per millisecond=295 ) properties seen :0
[2025-05-31 09:28:59] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 155 cols
[2025-05-31 09:28:59] [INFO ] Computed 7 invariants in 2 ms
[2025-05-31 09:28:59] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/371 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/531 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/547 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/547 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/549 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/549 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/371 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/531 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/547 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/547 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/549 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/549 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 696ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 431/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 431/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2025-05-31 09:28:59] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:28:59] [INFO ] Invariant cache hit.
[2025-05-31 09:29:00] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-31 09:29:00] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:29:00] [INFO ] Invariant cache hit.
[2025-05-31 09:29:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-31 09:29:00] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2025-05-31 09:29:00] [INFO ] Redundant transitions in 5 ms returned []
Running 425 sub problems to find dead transitions.
[2025-05-31 09:29:00] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2025-05-31 09:29:00] [INFO ] Invariant cache hit.
[2025-05-31 09:29:00] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:29:04] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2025-05-31 09:29:04] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 3 ms to minimize.
[2025-05-31 09:29:04] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-05-31 09:29:04] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-05-31 09:29:05] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2025-05-31 09:29:06] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 3 ms to minimize.
[2025-05-31 09:29:06] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2025-05-31 09:29:07] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2025-05-31 09:29:08] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:29:11] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 2 ms to minimize.
[2025-05-31 09:29:11] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:29:14] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 394/549 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:29:30] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 234 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 394/549 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 425/659 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2025-05-31 09:29:49] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2025-05-31 09:29:53] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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