Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r564-tall-171734907800172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FireWire-PT-14, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907800172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717361907115

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:58:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:58:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:58:28] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 20:58:28] [INFO ] Transformed 205 places.
[2024-06-02 20:58:28] [INFO ] Transformed 610 transitions.
[2024-06-02 20:58:28] [INFO ] Found NUPN structural information;
[2024-06-02 20:58:28] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 189 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 205/205 places, 610/610 transitions.
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 205 transition count 539
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 71 place count 205 transition count 536
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 202 transition count 536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 199 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 196 transition count 539
Applied a total of 89 rules in 64 ms. Remains 196 /205 variables (removed 9) and now considering 539/610 (removed 71) transitions.
[2024-06-02 20:58:28] [INFO ] Flow matrix only has 491 transitions (discarded 48 similar events)
// Phase 1: matrix 491 rows 196 cols
[2024-06-02 20:58:28] [INFO ] Computed 10 invariants in 48 ms
[2024-06-02 20:58:28] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-02 20:58:28] [INFO ] Flow matrix only has 491 transitions (discarded 48 similar events)
[2024-06-02 20:58:28] [INFO ] Invariant cache hit.
[2024-06-02 20:58:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 20:58:29] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [19, 80, 141]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 979 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 193/205 places, 539/610 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 539/539 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1065 ms. Remains : 193/205 places, 539/610 transitions.
Discarding 156 transitions out of 539. Remains 383
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1255 resets) in 2466 ms. (16 steps per ms) remains 169/382 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 28 ms. (13 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
[2024-06-02 20:58:30] [INFO ] Flow matrix only has 491 transitions (discarded 48 similar events)
// Phase 1: matrix 491 rows 193 cols
[2024-06-02 20:58:30] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 20:58:30] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 74/193 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 74/200 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 20:58:32] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 10 ms to minimize.
[2024-06-02 20:58:32] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:58:32] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:58:32] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:58:33] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:58:33] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 20:58:34] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 169 unsolved
(s93 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 1.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 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.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 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 169 unsolved
SMT process timed out in 5377ms, After SMT, problems are : Problem set: 0 solved, 169 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 193 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 193 transition count 521
Applied a total of 18 rules in 49 ms. Remains 193 /193 variables (removed 0) and now considering 521/539 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 193/193 places, 521/539 transitions.
RANDOM walk for 4000000 steps (124511 resets) in 33513 ms. (119 steps per ms) remains 88/169 properties
BEST_FIRST walk for 400003 steps (2800 resets) in 1050 ms. (380 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400003 steps (160 resets) in 1386 ms. (288 steps per ms) remains 87/88 properties
BEST_FIRST walk for 400004 steps (2669 resets) in 860 ms. (464 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400004 steps (3829 resets) in 1118 ms. (357 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400004 steps (2802 resets) in 1127 ms. (354 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400003 steps (120 resets) in 1397 ms. (286 steps per ms) remains 86/87 properties
BEST_FIRST walk for 400002 steps (2695 resets) in 843 ms. (473 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (3857 resets) in 871 ms. (458 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 879 ms. (454 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (162 resets) in 1262 ms. (316 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (2663 resets) in 700 ms. (570 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (3841 resets) in 741 ms. (539 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (2765 resets) in 686 ms. (582 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (165 resets) in 1201 ms. (332 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2669 resets) in 704 ms. (567 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (3861 resets) in 668 ms. (597 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2836 resets) in 679 ms. (588 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (182 resets) in 1322 ms. (302 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2669 resets) in 702 ms. (568 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (3817 resets) in 674 ms. (592 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2744 resets) in 679 ms. (588 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400001 steps (197 resets) in 1472 ms. (271 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2653 resets) in 691 ms. (578 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2805 resets) in 677 ms. (589 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (2802 resets) in 687 ms. (581 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2716 resets) in 681 ms. (586 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (2642 resets) in 690 ms. (578 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (2803 resets) in 727 ms. (549 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (2725 resets) in 726 ms. (550 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (2670 resets) in 716 ms. (557 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (3808 resets) in 706 ms. (565 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2698 resets) in 695 ms. (574 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400001 steps (88 resets) in 1654 ms. (241 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (2674 resets) in 695 ms. (574 steps per ms) remains 84/86 properties
BEST_FIRST walk for 400004 steps (3829 resets) in 685 ms. (583 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (2775 resets) in 693 ms. (576 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400002 steps (203 resets) in 1263 ms. (316 steps per ms) remains 83/84 properties
BEST_FIRST walk for 400002 steps (2675 resets) in 714 ms. (559 steps per ms) remains 79/83 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 678 ms. (589 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2797 resets) in 678 ms. (589 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (191 resets) in 1054 ms. (379 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2681 resets) in 748 ms. (534 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3778 resets) in 695 ms. (574 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2717 resets) in 689 ms. (579 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (337 resets) in 807 ms. (495 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2649 resets) in 729 ms. (547 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3821 resets) in 684 ms. (583 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2787 resets) in 686 ms. (582 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (102 resets) in 1643 ms. (243 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2713 resets) in 668 ms. (597 steps per ms) remains 78/79 properties
BEST_FIRST walk for 400004 steps (3789 resets) in 651 ms. (613 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (2776 resets) in 679 ms. (588 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (229 resets) in 1070 ms. (373 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (2824 resets) in 693 ms. (576 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (2681 resets) in 704 ms. (567 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (3820 resets) in 687 ms. (581 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (2670 resets) in 701 ms. (569 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (143 resets) in 1160 ms. (344 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (2715 resets) in 724 ms. (551 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (3832 resets) in 693 ms. (576 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (2846 resets) in 689 ms. (579 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (152 resets) in 1349 ms. (296 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400001 steps (2694 resets) in 665 ms. (600 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (3852 resets) in 649 ms. (615 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (2750 resets) in 671 ms. (595 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (107 resets) in 1083 ms. (369 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (2632 resets) in 717 ms. (557 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (3880 resets) in 688 ms. (580 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (2808 resets) in 691 ms. (578 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (179 resets) in 1319 ms. (303 steps per ms) remains 77/78 properties
BEST_FIRST walk for 400003 steps (2654 resets) in 711 ms. (561 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (3813 resets) in 670 ms. (596 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400002 steps (2739 resets) in 655 ms. (609 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (175 resets) in 1467 ms. (272 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2752 resets) in 682 ms. (585 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (3813 resets) in 654 ms. (610 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2777 resets) in 654 ms. (610 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (130 resets) in 1107 ms. (361 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2761 resets) in 716 ms. (557 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 685 ms. (583 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400003 steps (2769 resets) in 686 ms. (582 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400003 steps (2771 resets) in 677 ms. (589 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2637 resets) in 648 ms. (616 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2700 resets) in 668 ms. (597 steps per ms) remains 75/76 properties
[2024-06-02 20:59:08] [INFO ] Flow matrix only has 487 transitions (discarded 34 similar events)
// Phase 1: matrix 487 rows 193 cols
[2024-06-02 20:59:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:59:08] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 127/179 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 127/183 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:59:09] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-06-02 20:59:10] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 9/188 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 20:59:10] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-06-02 20:59:10] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:59:10] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 485/673 variables, 188/389 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 74/463 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 13 (OVERLAPS) 7/680 variables, 5/468 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/680 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/680 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 16 (OVERLAPS) 0/680 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 680/680 variables, and 473 constraints, problems are : Problem set: 0 solved, 75 unsolved in 7835 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 127/179 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 127/183 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 9/188 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 20:59:17] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 485/673 variables, 188/390 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 74/464 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 75/539 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 20:59:20] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-02 20:59:21] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:59:22] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/673 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/673 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 17 (OVERLAPS) 7/680 variables, 5/547 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/680 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/680 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 20 (OVERLAPS) 0/680 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 680/680 variables, and 552 constraints, problems are : Problem set: 0 solved, 75 unsolved in 25207 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 10/10 constraints]
After SMT, in 33169ms problems are : Problem set: 0 solved, 75 unsolved
Parikh walk visited 0 properties in 3843 ms.
Support contains 52 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 521/521 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 190 transition count 515
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 190 transition count 515
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 190 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 189 transition count 511
Applied a total of 10 rules in 40 ms. Remains 189 /193 variables (removed 4) and now considering 511/521 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 189/193 places, 511/521 transitions.
RANDOM walk for 4000000 steps (128627 resets) in 26136 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2826 resets) in 667 ms. (598 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (82 resets) in 1164 ms. (343 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (2655 resets) in 657 ms. (607 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (3883 resets) in 610 ms. (654 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2767 resets) in 630 ms. (633 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (364 resets) in 958 ms. (417 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2681 resets) in 665 ms. (600 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (3815 resets) in 610 ms. (654 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (2741 resets) in 630 ms. (633 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (145 resets) in 1362 ms. (293 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2622 resets) in 1112 ms. (359 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (3881 resets) in 1054 ms. (379 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2831 resets) in 833 ms. (479 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (330 resets) in 1164 ms. (343 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2706 resets) in 896 ms. (445 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (2821 resets) in 642 ms. (622 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2652 resets) in 642 ms. (622 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2799 resets) in 635 ms. (628 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2676 resets) in 642 ms. (622 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2702 resets) in 708 ms. (564 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2863 resets) in 633 ms. (630 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2711 resets) in 635 ms. (628 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400000 steps (2740 resets) in 643 ms. (621 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (3891 resets) in 617 ms. (647 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2800 resets) in 639 ms. (625 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (108 resets) in 1248 ms. (320 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2718 resets) in 787 ms. (507 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (3884 resets) in 707 ms. (564 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (2821 resets) in 661 ms. (604 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (95 resets) in 1416 ms. (282 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (2675 resets) in 822 ms. (486 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 685 ms. (583 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2825 resets) in 641 ms. (623 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (132 resets) in 1406 ms. (284 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2661 resets) in 653 ms. (611 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (3888 resets) in 614 ms. (650 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2785 resets) in 855 ms. (467 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (95 resets) in 1442 ms. (277 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (2669 resets) in 881 ms. (453 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (3896 resets) in 627 ms. (636 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (2786 resets) in 633 ms. (630 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (200 resets) in 1261 ms. (316 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2746 resets) in 811 ms. (492 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (3876 resets) in 696 ms. (573 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400001 steps (2777 resets) in 637 ms. (626 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400002 steps (194 resets) in 1334 ms. (299 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2779 resets) in 644 ms. (620 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2641 resets) in 639 ms. (625 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400003 steps (3863 resets) in 615 ms. (649 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (2729 resets) in 622 ms. (642 steps per ms) remains 75/75 properties
Interrupted probabilistic random walk after 7187429 steps, run timeout after 60001 ms. (steps per millisecond=119 ) properties seen :4 out of 75
Probabilistic random walk after 7187429 steps, saw 1884745 distinct states, run finished after 60023 ms. (steps per millisecond=119 ) properties seen :4
[2024-06-02 21:01:06] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:01:06] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:01:06] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 127/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:01:07] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:01:07] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:01:07] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 473/648 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 16/664 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 2/666 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 270 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7446 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 127/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 473/648 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 70/323 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 16/664 variables, 12/335 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:01:19] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:01:21] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:01:21] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:01:21] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 2/666 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 0/666 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 345 constraints, problems are : Problem set: 0 solved, 71 unsolved in 15770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 7/7 constraints]
After SMT, in 23346ms problems are : Problem set: 0 solved, 71 unsolved
Parikh walk visited 0 properties in 4507 ms.
Support contains 48 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.
RANDOM walk for 4000000 steps (128794 resets) in 25239 ms. (158 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400000 steps (2789 resets) in 633 ms. (630 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (243 resets) in 706 ms. (565 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2676 resets) in 628 ms. (635 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3890 resets) in 595 ms. (671 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2814 resets) in 619 ms. (645 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (422 resets) in 999 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 626 ms. (637 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (3868 resets) in 606 ms. (658 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2827 resets) in 603 ms. (662 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (287 resets) in 1030 ms. (387 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2624 resets) in 628 ms. (635 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3935 resets) in 588 ms. (679 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2813 resets) in 595 ms. (671 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (363 resets) in 919 ms. (434 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2670 resets) in 609 ms. (655 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2770 resets) in 606 ms. (658 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2682 resets) in 610 ms. (654 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2736 resets) in 609 ms. (655 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2670 resets) in 618 ms. (646 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2725 resets) in 613 ms. (651 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (3836 resets) in 608 ms. (656 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2739 resets) in 606 ms. (658 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (405 resets) in 685 ms. (583 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2709 resets) in 631 ms. (632 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3826 resets) in 587 ms. (680 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2782 resets) in 600 ms. (665 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (223 resets) in 1305 ms. (306 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2701 resets) in 645 ms. (619 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3845 resets) in 598 ms. (667 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2791 resets) in 610 ms. (654 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (386 resets) in 871 ms. (458 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2659 resets) in 633 ms. (630 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (3884 resets) in 604 ms. (661 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2852 resets) in 638 ms. (625 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (219 resets) in 1080 ms. (370 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2697 resets) in 643 ms. (621 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3823 resets) in 592 ms. (674 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2778 resets) in 607 ms. (657 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (231 resets) in 1060 ms. (377 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2675 resets) in 618 ms. (646 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3854 resets) in 603 ms. (662 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2844 resets) in 611 ms. (653 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (203 resets) in 1108 ms. (360 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2686 resets) in 604 ms. (661 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (3874 resets) in 591 ms. (675 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2796 resets) in 612 ms. (652 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (130 resets) in 1253 ms. (318 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2629 resets) in 762 ms. (524 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3832 resets) in 619 ms. (645 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2819 resets) in 599 ms. (666 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 5869103 steps, run timeout after 51001 ms. (steps per millisecond=115 ) properties seen :0 out of 71
Probabilistic random walk after 5869103 steps, saw 1525742 distinct states, run finished after 51002 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-02 21:02:42] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:02:42] [INFO ] Invariant cache hit.
[2024-06-02 21:02:42] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 127/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:02:43] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:02:43] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:02:43] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 473/648 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 16/664 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 2/666 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 270 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 127/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 473/648 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 70/323 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:02:51] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:02:52] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 16/664 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:02:59] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 2/666 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 0/666 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 346 constraints, problems are : Problem set: 0 solved, 71 unsolved in 20874 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints]
After SMT, in 28372ms problems are : Problem set: 0 solved, 71 unsolved
Parikh walk visited 0 properties in 3378 ms.
Support contains 48 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 34 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 34 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.
[2024-06-02 21:03:14] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:03:14] [INFO ] Invariant cache hit.
[2024-06-02 21:03:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 21:03:14] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:03:14] [INFO ] Invariant cache hit.
[2024-06-02 21:03:14] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:03:15] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-02 21:03:15] [INFO ] Redundant transitions in 34 ms returned []
Running 505 sub problems to find dead transitions.
[2024-06-02 21:03:15] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:03:15] [INFO ] Invariant cache hit.
[2024-06-02 21:03:15] [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
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 4 ms to minimize.
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:03:17] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:03:18] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:03:18] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 21:03:22] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 477/666 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/275 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 21:03:28] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:03:29] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 3 ms to minimize.
[2024-06-02 21:03:29] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:03:31] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:03:31] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 8 (OVERLAPS) 0/666 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 280 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30021 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: 13/13 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, 13/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 477/666 variables, 189/209 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 71/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 505/785 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 21:03:54] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-06-02 21:03:54] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:03:55] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 3/788 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 788 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30025 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: 16/16 constraints]
After SMT, in 60557ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60991 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 400000 steps (12767 resets) in 3991 ms. (100 steps per ms) remains 40/48 properties
Running SMT prover for 40 properties.
[2024-06-02 21:04:16] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:04:16] [INFO ] Invariant cache hit.
[2024-06-02 21:04:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:04:17] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :40
[2024-06-02 21:04:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:04:17] [INFO ] After 95ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :40
TRAPS : Iteration 0
[2024-06-02 21:04:18] [INFO ] After 1114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:40
[2024-06-02 21:04:18] [INFO ] After 1331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2024-06-02 21:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:04:18] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :40
[2024-06-02 21:04:18] [INFO ] After 106ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :40
TRAPS : Iteration 0
[2024-06-02 21:04:18] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:04:18] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:04:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-06-02 21:04:18] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 1
[2024-06-02 21:04:20] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:04:20] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:04:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
TRAPS : Iteration 2
[2024-06-02 21:04:21] [INFO ] After 3346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :40
[2024-06-02 21:04:21] [INFO ] After 3608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :40
RANDOM walk for 4000000 steps (128395 resets) in 25281 ms. (158 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2727 resets) in 632 ms. (631 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (102 resets) in 1356 ms. (294 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2643 resets) in 888 ms. (449 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3876 resets) in 839 ms. (476 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 893 ms. (447 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (404 resets) in 846 ms. (472 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2696 resets) in 900 ms. (443 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (3878 resets) in 876 ms. (456 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2807 resets) in 915 ms. (436 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (301 resets) in 1691 ms. (236 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2710 resets) in 1066 ms. (374 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3910 resets) in 1098 ms. (363 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2724 resets) in 1072 ms. (372 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (152 resets) in 1684 ms. (237 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2693 resets) in 1133 ms. (352 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (2699 resets) in 1014 ms. (394 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2665 resets) in 1096 ms. (364 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2852 resets) in 804 ms. (496 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2735 resets) in 1220 ms. (327 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2645 resets) in 997 ms. (400 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (3867 resets) in 1047 ms. (381 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 1071 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (231 resets) in 1705 ms. (234 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 1242 ms. (321 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400001 steps (3863 resets) in 992 ms. (402 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2752 resets) in 1051 ms. (380 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (254 resets) in 1628 ms. (245 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2680 resets) in 914 ms. (437 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3900 resets) in 1108 ms. (360 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2720 resets) in 1018 ms. (392 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (197 resets) in 1586 ms. (252 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2698 resets) in 1026 ms. (389 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3868 resets) in 1043 ms. (383 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2761 resets) in 1034 ms. (386 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (242 resets) in 1711 ms. (233 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2696 resets) in 1044 ms. (382 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (3875 resets) in 1045 ms. (382 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2740 resets) in 899 ms. (444 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (373 resets) in 1440 ms. (277 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2651 resets) in 1165 ms. (343 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3877 resets) in 1069 ms. (373 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2799 resets) in 922 ms. (433 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (265 resets) in 1599 ms. (250 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2658 resets) in 1201 ms. (332 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (3830 resets) in 1029 ms. (388 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (2804 resets) in 1151 ms. (347 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (178 resets) in 1616 ms. (247 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (2695 resets) in 1091 ms. (366 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (3890 resets) in 1029 ms. (388 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (2757 resets) in 1003 ms. (398 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 9289192 steps, run timeout after 84001 ms. (steps per millisecond=110 ) properties seen :0 out of 71
Probabilistic random walk after 9289192 steps, saw 2460802 distinct states, run finished after 84001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-02 21:06:14] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:06:14] [INFO ] Invariant cache hit.
[2024-06-02 21:06:14] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 127/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 473/648 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 16/664 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 2/666 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 270 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 127/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 473/648 variables, 175/182 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 70/323 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:06:23] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:06:23] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 16/664 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-06-02 21:06:30] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:06:31] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:06:31] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/664 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 14 (OVERLAPS) 2/666 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 0/666 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 346 constraints, problems are : Problem set: 0 solved, 71 unsolved in 20868 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints]
After SMT, in 28132ms problems are : Problem set: 0 solved, 71 unsolved
Parikh walk visited 0 properties in 2700 ms.
Support contains 48 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 9 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 10 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 7 ms. Remains 189 /189 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2024-06-02 21:06:45] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:06:45] [INFO ] Invariant cache hit.
[2024-06-02 21:06:45] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:06:45] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:06:45] [INFO ] Invariant cache hit.
[2024-06-02 21:06:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:06:45] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 21:06:45] [INFO ] Redundant transitions in 11 ms returned []
Running 505 sub problems to find dead transitions.
[2024-06-02 21:06:45] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:06:45] [INFO ] Invariant cache hit.
[2024-06-02 21:06:45] [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
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:06:48] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:06:49] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 21:06:53] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 477/666 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/275 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 21:06:59] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:06:59] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:06:59] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:07:02] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:07:02] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/280 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 280 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30021 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: 13/13 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, 13/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 477/666 variables, 189/209 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 71/280 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 505/785 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 21:07:25] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:07:25] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:07:25] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 3/788 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 788 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: 16/16 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60876 ms. Remains : 189/189 places, 511/511 transitions.
RANDOM walk for 400000 steps (12921 resets) in 2636 ms. (151 steps per ms) remains 39/48 properties
Running SMT prover for 39 properties.
[2024-06-02 21:07:47] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:07:47] [INFO ] Invariant cache hit.
[2024-06-02 21:07:47] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:07:47] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39
[2024-06-02 21:07:47] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:07:47] [INFO ] After 84ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :39
TRAPS : Iteration 0
[2024-06-02 21:07:48] [INFO ] After 1027ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:39
[2024-06-02 21:07:48] [INFO ] After 1206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2024-06-02 21:07:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:07:48] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2024-06-02 21:07:48] [INFO ] After 99ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :39
TRAPS : Iteration 0
[2024-06-02 21:07:48] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:07:48] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:07:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-06-02 21:07:49] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:07:49] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:07:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-06-02 21:07:49] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:07:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
TRAPS : Iteration 1
[2024-06-02 21:07:50] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:07:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
TRAPS : Iteration 2
[2024-06-02 21:07:51] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:07:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
TRAPS : Iteration 3
[2024-06-02 21:07:52] [INFO ] After 4250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :39
[2024-06-02 21:07:53] [INFO ] After 4541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :39
RANDOM walk for 96 steps (1 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1290 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (276 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1221291 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 1
Probabilistic random walk after 1221291 steps, saw 336058 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
[2024-06-02 21:07:56] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
[2024-06-02 21:07:56] [INFO ] Invariant cache hit.
[2024-06-02 21:07:56] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 224 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 219 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 473ms 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 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 65 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 65 ms. Remains : 159/189 places, 441/511 transitions.
RANDOM walk for 40000 steps (1306 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1315353 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1315353 steps, saw 385722 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
[2024-06-02 21:07:59] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 159 cols
[2024-06-02 21:07:59] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:07:59] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 186 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 189 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 391ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 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 12 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 12 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.
[2024-06-02 21:08:00] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 21:08:00] [INFO ] Invariant cache hit.
[2024-06-02 21:08:00] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 21:08:00] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 21:08:00] [INFO ] Invariant cache hit.
[2024-06-02 21:08:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 21:08:00] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 21:08:00] [INFO ] Redundant transitions in 10 ms returned []
Running 435 sub problems to find dead transitions.
[2024-06-02 21:08:00] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 21:08:00] [INFO ] Invariant cache hit.
[2024-06-02 21:08:00] [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
[2024-06-02 21:08:02] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:08:02] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:08:02] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:08:02] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:08:02] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:08:03] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:08:03] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:08:03] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:08:04] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:08:04] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:08:04] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:08:04] [INFO ] Deduced a trap composed of 103 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:08:04] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 21:08:05] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (OVERLAPS) 404/563 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 61/241 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:08:12] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 21:08:16] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:08:16] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 435 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 245 constraints, problems are : Problem set: 0 solved, 435 unsolved in 27440 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]
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, 18/25 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/563 variables, 159/184 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 435/680 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 21:08:38] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/681 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 681 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30022 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: 19/19 constraints]
After SMT, in 57778ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 57782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58245 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 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 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 37 ms. Remains 121 /159 variables (removed 38) and now considering 221/441 (removed 220) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:08:58] [INFO ] Flow matrix only has 219 transitions (discarded 2 similar events)
// Phase 1: matrix 219 rows 121 cols
[2024-06-02 21:08:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:08:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:08:58] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:08:58] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 21:08:58] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:08:58] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:08:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:08:58] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:08:58] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:08:58] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:08:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-06-02 21:08:58] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:08:58] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 388 ms.
RANDOM walk for 77 steps (1 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 2692 steps (90 resets) in 13 ms. (192 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1302 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (294 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1235321 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 1
Probabilistic random walk after 1235321 steps, saw 339746 distinct states, run finished after 3002 ms. (steps per millisecond=411 ) properties seen :0
[2024-06-02 21:09:01] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:09:01] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:09:01] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 177 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 215 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 414ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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 61 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 61 ms. Remains : 158/189 places, 438/511 transitions.
RANDOM walk for 40000 steps (1285 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (271 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1330817 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1330817 steps, saw 391157 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-02 21:09:05] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
// Phase 1: matrix 401 rows 158 cols
[2024-06-02 21:09:05] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:09:05] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 186 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 200 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 400ms 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 6 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 5 ms. Remains 158 /158 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-02 21:09:05] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2024-06-02 21:09:05] [INFO ] Invariant cache hit.
[2024-06-02 21:09:06] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 21:09:06] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2024-06-02 21:09:06] [INFO ] Invariant cache hit.
[2024-06-02 21:09:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:09:06] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-06-02 21:09:06] [INFO ] Redundant transitions in 4 ms returned []
Running 432 sub problems to find dead transitions.
[2024-06-02 21:09:06] [INFO ] Flow matrix only has 401 transitions (discarded 37 similar events)
[2024-06-02 21:09:06] [INFO ] Invariant cache hit.
[2024-06-02 21:09:06] [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
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:09:08] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:09:09] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:09:10] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 21:09:17] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 21:09:18] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:09:21] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 21:09:27] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 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: 14/14 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, 14/21 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 401/559 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 432/671 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 21:09:53] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/559 variables, 1/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 60357ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60841 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 25 ms. Remains 120 /158 variables (removed 38) and now considering 219/438 (removed 219) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:10:06] [INFO ] Flow matrix only has 217 transitions (discarded 2 similar events)
// Phase 1: matrix 217 rows 120 cols
[2024-06-02 21:10:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:10:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:06] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:10:06] [INFO ] After 69ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:10:06] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:10:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:10:07] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:10:07] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:10:07] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 294 ms.
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1269 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (275 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1216305 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :0 out of 1
Probabilistic random walk after 1216305 steps, saw 334690 distinct states, run finished after 3002 ms. (steps per millisecond=405 ) properties seen :0
[2024-06-02 21:10:10] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:10:10] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:10:10] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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 244 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 225 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 482ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 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 49 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 50 ms. Remains : 157/189 places, 436/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 (261 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1314532 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1314532 steps, saw 385455 distinct states, run finished after 3002 ms. (steps per millisecond=437 ) properties seen :0
[2024-06-02 21:10:13] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 157 cols
[2024-06-02 21:10:13] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:10:13] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 166 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 179 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 366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 4 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-06-02 21:10:14] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 21:10:14] [INFO ] Invariant cache hit.
[2024-06-02 21:10:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:10:14] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 21:10:14] [INFO ] Invariant cache hit.
[2024-06-02 21:10:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:10:14] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 21:10:14] [INFO ] Redundant transitions in 2 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 21:10:14] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 21:10:14] [INFO ] Invariant cache hit.
[2024-06-02 21:10:14] [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
[2024-06-02 21:10:16] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:10:16] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:10:16] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:10:16] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:10:16] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:10:17] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:10:17] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:10:17] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:10:17] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:10:18] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:10:26] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:10:26] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:10:26] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:10:29] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/556 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 21:10:34] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:10:34] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 240 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: 16/16 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, 16/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/180 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 430/670 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 670 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30012 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: 16/16 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60681 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 23 ms. Remains 119 /157 variables (removed 38) and now considering 217/436 (removed 219) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:11:14] [INFO ] Flow matrix only has 215 transitions (discarded 2 similar events)
// Phase 1: matrix 215 rows 119 cols
[2024-06-02 21:11:14] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 21:11:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:11:14] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:11:14] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:11:14] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 119 ms.
RANDOM walk for 40000 steps (1289 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (246 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1230249 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1230249 steps, saw 338202 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-02 21:11:17] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:11:17] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:11:17] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 194 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 214 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 428ms 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 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 37 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 37 ms. Remains : 156/189 places, 433/511 transitions.
RANDOM walk for 40000 steps (1308 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (260 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1345734 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1345734 steps, saw 396378 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-06-02 21:11:21] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
// Phase 1: matrix 396 rows 156 cols
[2024-06-02 21:11:21] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:11:21] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 179 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 174 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 374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 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 4 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 4 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 5 ms. Remains 156 /156 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-06-02 21:11:21] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2024-06-02 21:11:21] [INFO ] Invariant cache hit.
[2024-06-02 21:11:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 21:11:21] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2024-06-02 21:11:21] [INFO ] Invariant cache hit.
[2024-06-02 21:11:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 21:11:22] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 21:11:22] [INFO ] Redundant transitions in 4 ms returned []
Running 427 sub problems to find dead transitions.
[2024-06-02 21:11:22] [INFO ] Flow matrix only has 396 transitions (discarded 37 similar events)
[2024-06-02 21:11:22] [INFO ] Invariant cache hit.
[2024-06-02 21:11:22] [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
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:11:23] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:11:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:11:24] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:11:24] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:11:25] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:11:25] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:11:25] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:11:27] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 396/552 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:11:36] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:11:38] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:11:38] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/552 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 21:11:42] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/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
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 662 constraints, problems are : Problem set: 0 solved, 427 unsolved in 26620 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]
After SMT, in 56942ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 56947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57324 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 25 ms. Remains 118 /156 variables (removed 38) and now considering 215/433 (removed 218) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:12:19] [INFO ] Flow matrix only has 213 transitions (discarded 2 similar events)
// Phase 1: matrix 213 rows 118 cols
[2024-06-02 21:12:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:12:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:12:19] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:12:19] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:12:19] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 128 ms.
RANDOM walk for 40000 steps (1258 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (276 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1239980 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :0 out of 1
Probabilistic random walk after 1239980 steps, saw 341215 distinct states, run finished after 3001 ms. (steps per millisecond=413 ) properties seen :0
[2024-06-02 21:12:22] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:12:22] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:12:22] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 203 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 224 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 437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 35 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 36 ms. Remains : 155/189 places, 431/511 transitions.
RANDOM walk for 40000 steps (1286 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1353374 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :0 out of 1
Probabilistic random walk after 1353374 steps, saw 398009 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :0
[2024-06-02 21:12:25] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 155 cols
[2024-06-02 21:12:25] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:12:25] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 176 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 176 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 376ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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 4 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 4 ms. Remains 155 /155 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 21:12:26] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:12:26] [INFO ] Invariant cache hit.
[2024-06-02 21:12:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:12:26] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:12:26] [INFO ] Invariant cache hit.
[2024-06-02 21:12:26] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 21:12:26] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-06-02 21:12:26] [INFO ] Redundant transitions in 3 ms returned []
Running 425 sub problems to find dead transitions.
[2024-06-02 21:12:26] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:12:26] [INFO ] Invariant cache hit.
[2024-06-02 21:12:26] [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
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-02 21:12:28] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:12:29] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:12:29] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:12:29] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:12:30] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:12:30] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:12:30] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:12:30] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:12:32] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 394/549 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:12:35] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:12:47] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 10 (OVERLAPS) 0/549 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 238 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30022 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: 17/17 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, 17/24 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 394/549 variables, 155/179 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 59/238 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 425/663 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 663 constraints, problems are : Problem set: 0 solved, 425 unsolved in 28157 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: 17/17 constraints]
After SMT, in 58502ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 58506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58875 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 2 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 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 36 ms. Remains 117 /155 variables (removed 38) and now considering 213/431 (removed 218) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:13:25] [INFO ] Flow matrix only has 211 transitions (discarded 2 similar events)
// Phase 1: matrix 211 rows 117 cols
[2024-06-02 21:13:25] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:13:25] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:13:25] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:13:25] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:13:25] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
RANDOM walk for 40000 steps (1293 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (268 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1208072 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :0 out of 1
Probabilistic random walk after 1208072 steps, saw 332514 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
[2024-06-02 21:13:28] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:13:28] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:13:28] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 201 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 204 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 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 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 34 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 35 ms. Remains : 154/189 places, 428/511 transitions.
RANDOM walk for 40000 steps (1318 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1330224 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1330224 steps, saw 390886 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-02 21:13:31] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
// Phase 1: matrix 391 rows 154 cols
[2024-06-02 21:13:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:13:31] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 173 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 204 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 386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 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 6 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 6 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 4 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 21:13:32] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2024-06-02 21:13:32] [INFO ] Invariant cache hit.
[2024-06-02 21:13:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 21:13:32] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2024-06-02 21:13:32] [INFO ] Invariant cache hit.
[2024-06-02 21:13:32] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:13:32] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-06-02 21:13:32] [INFO ] Redundant transitions in 3 ms returned []
Running 422 sub problems to find dead transitions.
[2024-06-02 21:13:32] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2024-06-02 21:13:32] [INFO ] Invariant cache hit.
[2024-06-02 21:13:32] [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
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:13:35] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:13:35] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:13:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:13:35] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:13:36] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:13:36] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:13:37] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 391/545 variables, 154/173 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 58/231 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:13:43] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:13:47] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:13:47] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:13:49] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:13:49] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:13:50] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:13:52] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 10 (OVERLAPS) 0/545 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 238 constraints, problems are : Problem set: 0 solved, 422 unsolved in 29600 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: 19/19 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, 19/26 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:14:03] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 391/545 variables, 154/181 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 58/239 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 422/661 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:14:18] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/545 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/662 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 662 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30027 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: 21/21 constraints]
After SMT, in 59953ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 59957ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60280 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 0 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 19 ms. Remains 116 /154 variables (removed 38) and now considering 211/428 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:14:32] [INFO ] Flow matrix only has 209 transitions (discarded 2 similar events)
// Phase 1: matrix 209 rows 116 cols
[2024-06-02 21:14:32] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:14:32] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:14:32] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:14:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:14:32] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:14:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-06-02 21:14:32] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:14:32] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 254 ms.
RANDOM walk for 40000 steps (1297 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (286 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1253334 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1253334 steps, saw 345259 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2024-06-02 21:14:35] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:14:35] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:14:35] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 208 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 234 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 452ms 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 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 34 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 35 ms. Remains : 153/189 places, 426/511 transitions.
RANDOM walk for 40000 steps (1272 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (284 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1375021 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :0 out of 1
Probabilistic random walk after 1375021 steps, saw 403987 distinct states, run finished after 3002 ms. (steps per millisecond=458 ) properties seen :0
[2024-06-02 21:14:39] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 153 cols
[2024-06-02 21:14:39] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:14:39] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 176 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 170 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 356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 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.
[2024-06-02 21:14:39] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:14:39] [INFO ] Invariant cache hit.
[2024-06-02 21:14:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:14:39] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:14:39] [INFO ] Invariant cache hit.
[2024-06-02 21:14:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:14:40] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 21:14:40] [INFO ] Redundant transitions in 5 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:14:40] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:14:40] [INFO ] Invariant cache hit.
[2024-06-02 21:14:40] [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
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/542 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:14:48] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:14:59] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:14:59] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (OVERLAPS) 0/542 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 234 constraints, problems are : Problem set: 0 solved, 420 unsolved in 28871 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: 16/16 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, 16/23 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/542 variables, 153/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 58/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 420/654 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/542 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 654 constraints, problems are : Problem set: 0 solved, 420 unsolved in 26184 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: 16/16 constraints]
After SMT, in 55366ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 55372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55734 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 1 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 30 ms. Remains 115 /153 variables (removed 38) and now considering 209/426 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:15:35] [INFO ] Flow matrix only has 207 transitions (discarded 2 similar events)
// Phase 1: matrix 207 rows 115 cols
[2024-06-02 21:15:35] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:15:35] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:15:35] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:15:35] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:15:35] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 130 ms.
RANDOM walk for 40000 steps (1319 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1242719 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 1
Probabilistic random walk after 1242719 steps, saw 342069 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-06-02 21:15:38] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:15:38] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 21:15:38] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
[2024-06-02 21:15:38] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 1/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 Real declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 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: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/664 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/664 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/666 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 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: 1/1 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 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 33 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 33 ms. Remains : 152/189 places, 423/511 transitions.
RANDOM walk for 40000 steps (1247 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (276 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1364393 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1364393 steps, saw 401132 distinct states, run finished after 3002 ms. (steps per millisecond=454 ) properties seen :0
[2024-06-02 21:15:42] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
// Phase 1: matrix 386 rows 152 cols
[2024-06-02 21:15:42] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:15:42] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 152 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 179 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 342ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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 4 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 4 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 4 ms. Remains 152 /152 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-06-02 21:15:42] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2024-06-02 21:15:42] [INFO ] Invariant cache hit.
[2024-06-02 21:15:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:15:42] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2024-06-02 21:15:42] [INFO ] Invariant cache hit.
[2024-06-02 21:15:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:15:42] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 21:15:42] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 21:15:42] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2024-06-02 21:15:42] [INFO ] Invariant cache hit.
[2024-06-02 21:15:42] [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
[2024-06-02 21:15:44] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:15:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:15:44] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:15:44] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:15:44] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:15:45] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:15:45] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:15:45] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:15:45] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:15:46] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:15:46] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2024-06-02 21:15:46] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:15:46] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:15:49] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 386/538 variables, 152/173 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:15:56] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:15:57] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:15:58] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/538 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:16:02] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 11 (OVERLAPS) 0/538 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 234 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28235 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: 18/18 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, 18/25 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 386/538 variables, 152/177 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 57/234 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 417/651 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/538 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 651 constraints, problems are : Problem set: 0 solved, 417 unsolved in 29547 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: 18/18 constraints]
After SMT, in 58072ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58418 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 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 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 14 ms. Remains 114 /152 variables (removed 38) and now considering 207/423 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:16:41] [INFO ] Flow matrix only has 205 transitions (discarded 2 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-06-02 21:16:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:16:41] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:16:41] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:16:41] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:16:41] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:16:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:16:41] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:16:41] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:16:41] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 205 ms.
RANDOM walk for 40000 steps (1312 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1147332 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1147332 steps, saw 315262 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2024-06-02 21:16:44] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:16:44] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:16:44] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
[2024-06-02 21:16:44] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/648 variables, 1/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
All remaining problems are real, not stopping.
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 Real declared 666/666 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 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: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/648 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/664 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/664 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/664 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/666 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 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: 1/1 constraints]
After SMT, in 576ms 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 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 35 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 36 ms. Remains : 151/189 places, 421/511 transitions.
RANDOM walk for 40000 steps (1272 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (288 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1282063 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :0 out of 1
Probabilistic random walk after 1282063 steps, saw 376271 distinct states, run finished after 3016 ms. (steps per millisecond=425 ) properties seen :0
[2024-06-02 21:16:47] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2024-06-02 21:16:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:16:47] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 193 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 166 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 367ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 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 5 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 5 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 4 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 21:16:48] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:16:48] [INFO ] Invariant cache hit.
[2024-06-02 21:16:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 21:16:48] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:16:48] [INFO ] Invariant cache hit.
[2024-06-02 21:16:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:16:48] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 21:16:48] [INFO ] Redundant transitions in 3 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 21:16:48] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:16:48] [INFO ] Invariant cache hit.
[2024-06-02 21:16:48] [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
[2024-06-02 21:16:50] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:16:50] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:16:50] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:16:50] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:16:50] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:16:51] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:16:51] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:16:51] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:16:51] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:16:51] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:16:52] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:16:53] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 384/535 variables, 151/170 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:16:59] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:16:59] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:17:02] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 230 constraints, problems are : Problem set: 0 solved, 415 unsolved in 25981 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]
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, 15/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/535 variables, 151/173 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 415/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:17:31] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/535 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 646 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30040 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: 16/16 constraints]
After SMT, in 56362ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56727 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 2 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 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 18 ms. Remains 113 /151 variables (removed 38) and now considering 205/421 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:17:45] [INFO ] Flow matrix only has 203 transitions (discarded 2 similar events)
// Phase 1: matrix 203 rows 113 cols
[2024-06-02 21:17:45] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:17:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:17:45] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:17:45] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:17:45] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
RANDOM walk for 40000 steps (1299 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (279 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1251395 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1251395 steps, saw 344713 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2024-06-02 21:17:48] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:17:48] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:17:48] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 196 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 215 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 424ms 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 42 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 42 ms. Remains : 150/189 places, 418/511 transitions.
RANDOM walk for 40000 steps (1304 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (273 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1384356 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1384356 steps, saw 405893 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2024-06-02 21:17:51] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
// Phase 1: matrix 381 rows 150 cols
[2024-06-02 21:17:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:17:51] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 138 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 158 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 303ms 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 5 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 5 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 4 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-06-02 21:17:52] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 21:17:52] [INFO ] Invariant cache hit.
[2024-06-02 21:17:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:17:52] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 21:17:52] [INFO ] Invariant cache hit.
[2024-06-02 21:17:52] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:17:52] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 21:17:52] [INFO ] Redundant transitions in 2 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-02 21:17:52] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 21:17:52] [INFO ] Invariant cache hit.
[2024-06-02 21:17:52] [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
[2024-06-02 21:17:53] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:17:54] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:17:55] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:17:55] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:17:55] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:17:55] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 381/531 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 3 ms to minimize.
[2024-06-02 21:18:05] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:18:05] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/531 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 230 constraints, problems are : Problem set: 0 solved, 412 unsolved in 22305 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]
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, 17/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 381/531 variables, 150/174 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 412/642 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 21:18:30] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/531 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/643 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 643 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30021 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: 18/18 constraints]
After SMT, in 52618ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 52621ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52929 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 14 ms. Remains 112 /150 variables (removed 38) and now considering 203/418 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:18:45] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 112 cols
[2024-06-02 21:18:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:18:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:18:45] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:18:45] [INFO ] After 49ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:18:45] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 102 ms.
RANDOM walk for 40000 steps (1241 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (258 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1246863 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1246863 steps, saw 343319 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
[2024-06-02 21:18:48] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:18:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:48] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 195 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 207 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 413ms 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 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 50 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 50 ms. Remains : 149/189 places, 416/511 transitions.
RANDOM walk for 40000 steps (1298 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (266 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396143 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396143 steps, saw 410202 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-06-02 21:18:51] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 149 cols
[2024-06-02 21:18:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:18:51] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 156 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 148 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 324ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 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 3 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 3 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-02 21:18:51] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 21:18:51] [INFO ] Invariant cache hit.
[2024-06-02 21:18:52] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:18:52] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 21:18:52] [INFO ] Invariant cache hit.
[2024-06-02 21:18:52] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:18:52] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 21:18:52] [INFO ] Redundant transitions in 2 ms returned []
Running 410 sub problems to find dead transitions.
[2024-06-02 21:18:52] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 21:18:52] [INFO ] Invariant cache hit.
[2024-06-02 21:18:52] [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
[2024-06-02 21:18:53] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:18:53] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:18:55] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 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
[2024-06-02 21:19:02] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-06-02 21:19:03] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:19:05] [INFO ] Deduced a trap composed of 38 places in 36 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
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-06-02 21:19:11] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/528 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/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 30014 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
[2024-06-02 21:19:28] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 637 constraints, problems are : Problem set: 0 solved, 410 unsolved in 29686 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: 15/15 constraints]
After SMT, in 60011ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 60015ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60356 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 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 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 0 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 0 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 18 ms. Remains 111 /149 variables (removed 38) and now considering 201/416 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:19:52] [INFO ] Flow matrix only has 199 transitions (discarded 2 similar events)
// Phase 1: matrix 199 rows 111 cols
[2024-06-02 21:19:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:19:52] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:19:52] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:19:52] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:19:52] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 119 ms.
RANDOM walk for 40000 steps (1265 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1239290 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 1
Probabilistic random walk after 1239290 steps, saw 341000 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
[2024-06-02 21:19:55] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:19:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:19:55] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 197 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 216 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 423ms 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 34 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 34 ms. Remains : 148/189 places, 414/511 transitions.
RANDOM walk for 40000 steps (1271 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (271 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1390746 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1390746 steps, saw 408125 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
[2024-06-02 21:19:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
// Phase 1: matrix 377 rows 148 cols
[2024-06-02 21:19:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:19:59] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 152 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 153 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 323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 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 4 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 3 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 21:19:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 21:19:59] [INFO ] Invariant cache hit.
[2024-06-02 21:19:59] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:19:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 21:19:59] [INFO ] Invariant cache hit.
[2024-06-02 21:19:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:19:59] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 21:19:59] [INFO ] Redundant transitions in 2 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 21:19:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 21:19:59] [INFO ] Invariant cache hit.
[2024-06-02 21:19:59] [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
[2024-06-02 21:20:01] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:20:01] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:20:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:20:01] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:20:01] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:20:02] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:20:02] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:20:02] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:20:02] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:20:02] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:20:03] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 377/525 variables, 148/166 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 21:20:10] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:20:10] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:20:12] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:20:12] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/525 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 226 constraints, problems are : Problem set: 0 solved, 408 unsolved in 22227 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: 15/15 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, 15/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 377/525 variables, 148/170 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 408/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 21:20:27] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 635 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30010 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: 16/16 constraints]
After SMT, in 52510ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 52515ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52846 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 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 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 1 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 19 ms. Remains 110 /148 variables (removed 38) and now considering 200/414 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:20:52] [INFO ] Flow matrix only has 198 transitions (discarded 2 similar events)
// Phase 1: matrix 198 rows 110 cols
[2024-06-02 21:20:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:20:52] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 21:20:52] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:20:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:20:52] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:20:52] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:20:52] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
RANDOM walk for 40000 steps (1268 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (283 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1253422 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1253422 steps, saw 345281 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
[2024-06-02 21:20:55] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:20:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:20:55] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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 203 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 473ms 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 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 30 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 31 ms. Remains : 148/189 places, 414/511 transitions.
RANDOM walk for 40000 steps (1251 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1402260 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1402260 steps, saw 412130 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
[2024-06-02 21:20:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
// Phase 1: matrix 377 rows 148 cols
[2024-06-02 21:20:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:20:59] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 144 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 135 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 285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 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 3 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 3 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 3 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 21:20:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 21:20:59] [INFO ] Invariant cache hit.
[2024-06-02 21:20:59] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:20:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 21:20:59] [INFO ] Invariant cache hit.
[2024-06-02 21:20:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:20:59] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-02 21:20:59] [INFO ] Redundant transitions in 3 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 21:20:59] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 21:20:59] [INFO ] Invariant cache hit.
[2024-06-02 21:20:59] [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
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:21:02] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:21:02] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:21:02] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:21:02] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:21:03] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 21:21:04] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 16 places in 58 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
[2024-06-02 21:21:13] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:21:14] [INFO ] Deduced a trap composed of 38 places in 39 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
[2024-06-02 21:21:17] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 21:21:22] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:21:22] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 12 (OVERLAPS) 0/525 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 228 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30013 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: 17/17 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, 17/24 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 377/525 variables, 148/172 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 408/636 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 21:21:42] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/525 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/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 30012 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 60316ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60626 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 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 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 15 ms. Remains 110 /148 variables (removed 38) and now considering 200/414 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:21:59] [INFO ] Flow matrix only has 198 transitions (discarded 2 similar events)
// Phase 1: matrix 198 rows 110 cols
[2024-06-02 21:21:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:21:59] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:22:00] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:22:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:22:00] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:22:00] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:22:00] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 190 ms.
RANDOM walk for 40000 steps (1308 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (290 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1248341 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1248341 steps, saw 343789 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
[2024-06-02 21:22:03] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:22:03] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:22:03] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 193 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 184 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 387ms 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 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 32 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 32 ms. Remains : 149/189 places, 416/511 transitions.
RANDOM walk for 40000 steps (1297 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (277 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1402360 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1402360 steps, saw 412170 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
[2024-06-02 21:22:06] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 149 cols
[2024-06-02 21:22:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:22:06] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 172 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 162 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 341ms 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 3 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 3 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 3 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-02 21:22:06] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 21:22:06] [INFO ] Invariant cache hit.
[2024-06-02 21:22:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:22:07] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 21:22:07] [INFO ] Invariant cache hit.
[2024-06-02 21:22:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:22:07] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 21:22:07] [INFO ] Redundant transitions in 3 ms returned []
Running 410 sub problems to find dead transitions.
[2024-06-02 21:22:07] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2024-06-02 21:22:07] [INFO ] Invariant cache hit.
[2024-06-02 21:22:07] [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
[2024-06-02 21:22:08] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:22:08] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 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
[2024-06-02 21:22:15] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:22:16] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:22:17] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 225 constraints, problems are : Problem set: 0 solved, 410 unsolved in 17287 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: 13/13 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, 13/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-06-02 21:22:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 379/528 variables, 149/170 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 410/636 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 636 constraints, problems are : Problem set: 0 solved, 410 unsolved in 24444 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 42030ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 42034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42372 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 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 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 0 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 13 ms. Remains 111 /149 variables (removed 38) and now considering 201/416 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:22:49] [INFO ] Flow matrix only has 199 transitions (discarded 2 similar events)
// Phase 1: matrix 199 rows 111 cols
[2024-06-02 21:22:49] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 21:22:49] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:22:49] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:22:49] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 21:22:49] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:22:49] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:22:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:22:49] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:22:49] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:22:49] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:22:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-06-02 21:22:49] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:22:49] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
RANDOM walk for 40000 steps (1258 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (276 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1242533 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 1
Probabilistic random walk after 1242533 steps, saw 342016 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-06-02 21:22:52] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:22:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:22:52] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 184 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 193 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 383ms 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 31 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 31 ms. Remains : 150/189 places, 418/511 transitions.
RANDOM walk for 40000 steps (1269 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (265 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1385143 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1385143 steps, saw 406119 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2024-06-02 21:22:56] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
// Phase 1: matrix 381 rows 150 cols
[2024-06-02 21:22:56] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:22:56] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 165 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 149 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 318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 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 4 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 4 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 4 ms. Remains 150 /150 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-06-02 21:22:56] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 21:22:56] [INFO ] Invariant cache hit.
[2024-06-02 21:22:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:22:56] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 21:22:56] [INFO ] Invariant cache hit.
[2024-06-02 21:22:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:22:56] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 21:22:56] [INFO ] Redundant transitions in 6 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-02 21:22:56] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 21:22:56] [INFO ] Invariant cache hit.
[2024-06-02 21:22:56] [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
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 11 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:22:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:22:59] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-06-02 21:23:00] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:23:00] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 21:23:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 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
[2024-06-02 21:23:10] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:23:11] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:23:11] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:23:12] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/531 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 21:23:15] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 0/531 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 231 constraints, problems are : Problem set: 0 solved, 412 unsolved in 28393 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: 18/18 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, 18/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 381/531 variables, 150/175 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 412/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 21:23:42] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/531 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/644 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 644 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30018 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: 19/19 constraints]
After SMT, in 58719ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 58723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59082 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 14 ms. Remains 112 /150 variables (removed 38) and now considering 203/418 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:23:55] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 112 cols
[2024-06-02 21:23:55] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:23:55] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:23:55] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:23:55] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:23:55] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 120 ms.
RANDOM walk for 40000 steps (1273 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (267 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1244202 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 1
Probabilistic random walk after 1244202 steps, saw 342479 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-06-02 21:23:58] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:23:58] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:23:58] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 189 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 189 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 393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 28 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 28 ms. Remains : 151/189 places, 421/511 transitions.
RANDOM walk for 40000 steps (1297 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (257 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1387172 steps, run timeout after 3001 ms. (steps per millisecond=462 ) properties seen :0 out of 1
Probabilistic random walk after 1387172 steps, saw 406871 distinct states, run finished after 3001 ms. (steps per millisecond=462 ) properties seen :0
[2024-06-02 21:24:02] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 151 cols
[2024-06-02 21:24:02] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:24:02] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 171 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 150 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 336ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 5 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 5 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 4 ms. Remains 151 /151 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 21:24:02] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:24:02] [INFO ] Invariant cache hit.
[2024-06-02 21:24:02] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:24:02] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:24:02] [INFO ] Invariant cache hit.
[2024-06-02 21:24:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:24:02] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 21:24:02] [INFO ] Redundant transitions in 6 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 21:24:02] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:24:02] [INFO ] Invariant cache hit.
[2024-06-02 21:24:02] [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
[2024-06-02 21:24:04] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:24:04] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:24:04] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:24:04] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:24:05] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:24:06] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:24:06] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 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
[2024-06-02 21:24:12] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:24:15] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:24:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 229 constraints, problems are : Problem set: 0 solved, 415 unsolved in 21851 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: 14/14 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, 14/21 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/535 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 57/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 415/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 644 constraints, problems are : Problem set: 0 solved, 415 unsolved in 23313 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: 14/14 constraints]
After SMT, in 45470ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 45475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45820 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 14 ms. Remains 113 /151 variables (removed 38) and now considering 205/421 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:24:48] [INFO ] Flow matrix only has 203 transitions (discarded 2 similar events)
// Phase 1: matrix 203 rows 113 cols
[2024-06-02 21:24:48] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:24:48] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:24:48] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:24:48] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:24:48] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
RANDOM walk for 40000 steps (1343 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (277 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1247667 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1247667 steps, saw 343579 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
[2024-06-02 21:24:51] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:24:51] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:24:51] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 200 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 223 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 432ms 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 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 29 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 29 ms. Remains : 152/189 places, 423/511 transitions.
RANDOM walk for 40000 steps (1281 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (275 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1373024 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 1373024 steps, saw 403644 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
[2024-06-02 21:24:55] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
// Phase 1: matrix 386 rows 152 cols
[2024-06-02 21:24:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:24:55] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 169 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 168 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 353ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 3 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 3 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 3 ms. Remains 152 /152 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2024-06-02 21:24:55] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2024-06-02 21:24:55] [INFO ] Invariant cache hit.
[2024-06-02 21:24:55] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:24:55] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2024-06-02 21:24:55] [INFO ] Invariant cache hit.
[2024-06-02 21:24:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:24:55] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 21:24:55] [INFO ] Redundant transitions in 4 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 21:24:55] [INFO ] Flow matrix only has 386 transitions (discarded 37 similar events)
[2024-06-02 21:24:55] [INFO ] Invariant cache hit.
[2024-06-02 21:24:55] [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
[2024-06-02 21:24:57] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:24:57] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:24:57] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:24:57] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:24:57] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:24:58] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:24:58] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:24:58] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:24:59] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:24:59] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:24:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:25:00] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:25:01] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 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
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:25:10] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:25:11] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/538 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:25:14] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 11 (OVERLAPS) 0/538 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 232 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28941 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]
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, 16/23 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 386/538 variables, 152/175 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 417/649 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 21:25:38] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/538 variables, 1/650 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 650 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30060 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: 17/17 constraints]
After SMT, in 59302ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 59307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59618 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 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 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 14 ms. Remains 114 /152 variables (removed 38) and now considering 207/423 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:25:55] [INFO ] Flow matrix only has 205 transitions (discarded 2 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-06-02 21:25:55] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:25:55] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:25:55] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:25:55] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:25:55] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:25:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:25:55] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:25:55] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:25:55] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
RANDOM walk for 40000 steps (1295 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1243485 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :0 out of 1
Probabilistic random walk after 1243485 steps, saw 342285 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
[2024-06-02 21:25:58] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:25:58] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:25:58] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 213 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 194 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 418ms 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 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 33 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 33 ms. Remains : 153/189 places, 426/511 transitions.
RANDOM walk for 40000 steps (1287 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (283 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1364630 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1364630 steps, saw 401223 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
[2024-06-02 21:26:01] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 153 cols
[2024-06-02 21:26:01] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:26:01] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 177 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 155 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 348ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 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.
[2024-06-02 21:26:02] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:26:02] [INFO ] Invariant cache hit.
[2024-06-02 21:26:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 21:26:02] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:26:02] [INFO ] Invariant cache hit.
[2024-06-02 21:26:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:26:02] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 21:26:02] [INFO ] Redundant transitions in 2 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:26:02] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:26:02] [INFO ] Invariant cache hit.
[2024-06-02 21:26:02] [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
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:26:05] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:26:05] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:26:05] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:26:05] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/542 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:26:11] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:26:16] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:26:16] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 232 constraints, problems are : Problem set: 0 solved, 420 unsolved in 24092 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: 14/14 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, 14/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:26:28] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 389/542 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 58/233 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 420/653 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 653 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30016 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 54395ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 54398ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54707 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 15 ms. Remains 115 /153 variables (removed 38) and now considering 209/426 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:26:56] [INFO ] Flow matrix only has 207 transitions (discarded 2 similar events)
// Phase 1: matrix 207 rows 115 cols
[2024-06-02 21:26:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:26:56] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:26:56] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:26:56] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:26:56] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 109 ms.
RANDOM walk for 40000 steps (1303 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (277 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1249469 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1249469 steps, saw 344150 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2024-06-02 21:26:59] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:26:59] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:26:59] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 173 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 209 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 391ms 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 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 34 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 34 ms. Remains : 154/189 places, 428/511 transitions.
RANDOM walk for 40000 steps (1269 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (288 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1358723 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :0 out of 1
Probabilistic random walk after 1358723 steps, saw 399247 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
[2024-06-02 21:27:03] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
// Phase 1: matrix 391 rows 154 cols
[2024-06-02 21:27:03] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:27:03] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 173 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 157 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 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 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 4 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 5 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 4 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 21:27:03] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2024-06-02 21:27:03] [INFO ] Invariant cache hit.
[2024-06-02 21:27:03] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:27:03] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2024-06-02 21:27:03] [INFO ] Invariant cache hit.
[2024-06-02 21:27:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:27:04] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-06-02 21:27:04] [INFO ] Redundant transitions in 4 ms returned []
Running 422 sub problems to find dead transitions.
[2024-06-02 21:27:04] [INFO ] Flow matrix only has 391 transitions (discarded 37 similar events)
[2024-06-02 21:27:04] [INFO ] Invariant cache hit.
[2024-06-02 21:27:04] [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
[2024-06-02 21:27:05] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:27:05] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 21:27:05] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:27:06] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:27:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:27:06] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 21:27:06] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:27:07] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:27:09] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:27:11] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 391/545 variables, 154/174 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:27:19] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:27:20] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/545 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-02 21:27:23] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 11 (OVERLAPS) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 235 constraints, problems are : Problem set: 0 solved, 422 unsolved in 29611 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: 16/16 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, 16/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 391/545 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 422/657 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 657 constraints, problems are : Problem set: 0 solved, 422 unsolved in 25294 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: 16/16 constraints]
After SMT, in 55219ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 55223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55534 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 0 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 0 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 13 ms. Remains 116 /154 variables (removed 38) and now considering 211/428 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:27:59] [INFO ] Flow matrix only has 209 transitions (discarded 2 similar events)
// Phase 1: matrix 209 rows 116 cols
[2024-06-02 21:27:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:27:59] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:27:59] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:27:59] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 21:27:59] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:59] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:27:59] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:27:59] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:27:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:27:59] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
[2024-06-02 21:27:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
TRAPS : Iteration 1
[2024-06-02 21:27:59] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:27:59] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 338 ms.
RANDOM walk for 40000 steps (1298 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (268 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1236863 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 1
Probabilistic random walk after 1236863 steps, saw 340266 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
[2024-06-02 21:28:02] [INFO ] Flow matrix only has 477 transitions (discarded 34 similar events)
// Phase 1: matrix 477 rows 189 cols
[2024-06-02 21:28:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:28:02] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 217 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 196 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 420ms 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 30 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 30 ms. Remains : 155/189 places, 431/511 transitions.
RANDOM walk for 40000 steps (1311 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (266 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1332198 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1332198 steps, saw 391665 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-02 21:28:06] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 155 cols
[2024-06-02 21:28:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:28:06] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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
All remaining problems are real, not stopping.
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 158 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 163 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 331ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 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 5 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 5 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.
[2024-06-02 21:28:06] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:28:06] [INFO ] Invariant cache hit.
[2024-06-02 21:28:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:28:06] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:28:06] [INFO ] Invariant cache hit.
[2024-06-02 21:28:06] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 21:28:06] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-02 21:28:06] [INFO ] Redundant transitions in 2 ms returned []
Running 425 sub problems to find dead transitions.
[2024-06-02 21:28:06] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:28:06] [INFO ] Invariant cache hit.
[2024-06-02 21:28:06] [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
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:28:09] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:28:09] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:28:09] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:28:10] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:28:10] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:28:12] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 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
[2024-06-02 21:28:15] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:28:17] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:28:23] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:28:23] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:28:23] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 425 unsolved

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-14"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-14, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r564-tall-171734907800172"
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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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