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.r560-tall-171734905900197.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 greatspnxred
Input is FireWire-PT-19, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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 1717352602191

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:23:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:23:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:23:23] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 18:23:23] [INFO ] Transformed 602 places.
[2024-06-02 18:23:23] [INFO ] Transformed 944 transitions.
[2024-06-02 18:23:23] [INFO ] Found NUPN structural information;
[2024-06-02 18:23:23] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 216 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 494 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 6 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 186 rules applied. Total rules applied 187 place count 577 transition count 750
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 180 rules applied. Total rules applied 367 place count 400 transition count 747
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 369 place count 398 transition count 747
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 369 place count 398 transition count 738
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 387 place count 389 transition count 738
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 647 place count 259 transition count 608
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -255
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 741 place count 212 transition count 863
Applied a total of 741 rules in 126 ms. Remains 212 /602 variables (removed 390) and now considering 863/944 (removed 81) transitions.
[2024-06-02 18:23:23] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
// Phase 1: matrix 809 rows 212 cols
[2024-06-02 18:23:23] [INFO ] Computed 10 invariants in 26 ms
[2024-06-02 18:23:24] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
[2024-06-02 18:23:24] [INFO ] Invariant cache hit.
[2024-06-02 18:23:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-02 18:23:24] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-06-02 18:23:24] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
[2024-06-02 18:23:24] [INFO ] Invariant cache hit.
[2024-06-02 18:23:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 15 ms to minimize.
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:23:36] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:23:36] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-06-02 18:23:37] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 6 (OVERLAPS) 808/1020 variables, 212/440 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 95/535 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1021 variables, and 535 constraints, problems are : Problem set: 0 solved, 847 unsolved in 30058 ms.
Refiners :[Domain max(s): 212/212 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 95/96 constraints, PredecessorRefiner: 847/847 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 847 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 6 (OVERLAPS) 808/1020 variables, 212/440 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 95/535 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1020 variables, 847/1382 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-06-02 18:24:21] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1021 variables, and 1383 constraints, problems are : Problem set: 0 solved, 847 unsolved in 30027 ms.
Refiners :[Domain max(s): 212/212 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, ReadFeed: 95/96 constraints, PredecessorRefiner: 847/847 constraints, Known Traps: 7/7 constraints]
After SMT, in 61649ms problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 61681ms
Starting structural reductions in LIVENESS mode, iteration 1 : 212/602 places, 863/944 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62959 ms. Remains : 212/602 places, 863/944 transitions.
Discarding 419 transitions out of 863. Remains 444
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2229 resets) in 2403 ms. (16 steps per ms) remains 336/443 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 336/336 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 336/336 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 336/336 properties
[2024-06-02 18:24:27] [INFO ] Flow matrix only has 809 transitions (discarded 54 similar events)
[2024-06-02 18:24:27] [INFO ] Invariant cache hit.
[2024-06-02 18:24:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 18/202 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 18:24:31] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 15 ms to minimize.
[2024-06-02 18:24:32] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:24:32] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/1021 variables, and 215 constraints, problems are : Problem set: 0 solved, 336 unsolved in 5014 ms.
Refiners :[Domain max(s): 202/212 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/212 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 184/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 18/202 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 18:24:35] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 1 ms to minimize.
[2024-06-02 18:24:35] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:24:36] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/1021 variables, and 218 constraints, problems are : Problem set: 0 solved, 336 unsolved in 5017 ms.
Refiners :[Domain max(s): 202/212 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/212 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/336 constraints, Known Traps: 6/6 constraints]
After SMT, in 10526ms problems are : Problem set: 0 solved, 336 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 184 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 863/863 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 212 transition count 850
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 209 transition count 844
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 209 transition count 844
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 209 transition count 836
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 208 transition count 843
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 2 with 120 rules applied. Total rules applied 149 place count 208 transition count 723
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 155 place count 208 transition count 717
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 161 place count 202 transition count 717
Applied a total of 161 rules in 111 ms. Remains 202 /212 variables (removed 10) and now considering 717/863 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 202/212 places, 717/863 transitions.
RANDOM walk for 4000000 steps (159348 resets) in 53385 ms. (74 steps per ms) remains 92/336 properties
BEST_FIRST walk for 400004 steps (2878 resets) in 1045 ms. (382 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400003 steps (1623 resets) in 1379 ms. (289 steps per ms) remains 71/92 properties
BEST_FIRST walk for 400003 steps (2882 resets) in 1136 ms. (351 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (1637 resets) in 842 ms. (474 steps per ms) remains 70/71 properties
BEST_FIRST walk for 400003 steps (1629 resets) in 795 ms. (502 steps per ms) remains 69/70 properties
BEST_FIRST walk for 400003 steps (2888 resets) in 733 ms. (544 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (1610 resets) in 780 ms. (512 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2918 resets) in 774 ms. (516 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (1622 resets) in 1138 ms. (351 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2889 resets) in 760 ms. (525 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (1624 resets) in 807 ms. (495 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2884 resets) in 1035 ms. (386 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2897 resets) in 732 ms. (545 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400002 steps (2906 resets) in 1053 ms. (379 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (2909 resets) in 853 ms. (468 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400003 steps (2871 resets) in 729 ms. (547 steps per ms) remains 68/69 properties
BEST_FIRST walk for 400004 steps (2897 resets) in 739 ms. (540 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2899 resets) in 740 ms. (539 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2894 resets) in 983 ms. (406 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (2903 resets) in 733 ms. (544 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (2890 resets) in 735 ms. (543 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (2919 resets) in 759 ms. (526 steps per ms) remains 67/68 properties
BEST_FIRST walk for 400003 steps (2900 resets) in 1095 ms. (364 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2794 resets) in 926 ms. (431 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2881 resets) in 787 ms. (507 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2895 resets) in 743 ms. (537 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400002 steps (2880 resets) in 805 ms. (496 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2933 resets) in 734 ms. (544 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2851 resets) in 1003 ms. (398 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2917 resets) in 1110 ms. (360 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2900 resets) in 1078 ms. (370 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (2654 resets) in 1054 ms. (379 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400003 steps (2788 resets) in 713 ms. (560 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400004 steps (2861 resets) in 969 ms. (412 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400003 steps (2908 resets) in 735 ms. (543 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400002 steps (2897 resets) in 763 ms. (523 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (2895 resets) in 794 ms. (503 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (2869 resets) in 731 ms. (546 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (2908 resets) in 1108 ms. (360 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400003 steps (2888 resets) in 763 ms. (523 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2652 resets) in 684 ms. (583 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (2721 resets) in 753 ms. (530 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2871 resets) in 726 ms. (550 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2873 resets) in 698 ms. (572 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2897 resets) in 704 ms. (567 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2902 resets) in 837 ms. (477 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (2905 resets) in 730 ms. (547 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (2871 resets) in 738 ms. (541 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (2906 resets) in 721 ms. (554 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2564 resets) in 720 ms. (554 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (1617 resets) in 842 ms. (474 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2913 resets) in 845 ms. (472 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2483 resets) in 750 ms. (532 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (2084 resets) in 1116 ms. (358 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400002 steps (2864 resets) in 1072 ms. (372 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (1612 resets) in 960 ms. (416 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2886 resets) in 702 ms. (568 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2522 resets) in 833 ms. (479 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2468 resets) in 777 ms. (514 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (1618 resets) in 750 ms. (532 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2871 resets) in 727 ms. (549 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (2476 resets) in 751 ms. (531 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2497 resets) in 737 ms. (542 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (2514 resets) in 718 ms. (556 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (2867 resets) in 683 ms. (584 steps per ms) remains 62/63 properties
[2024-06-02 18:25:11] [INFO ] Flow matrix only has 674 transitions (discarded 43 similar events)
// Phase 1: matrix 674 rows 202 cols
[2024-06-02 18:25:11] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:25:11] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 133/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-02 18:25:12] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-06-02 18:25:12] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-02 18:25:13] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 15/196 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-02 18:25:13] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:25:13] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:25:13] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 674/870 variables, 196/212 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/870 variables, 77/289 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/870 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 6/876 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 0/876 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 876/876 variables, and 295 constraints, problems are : Problem set: 0 solved, 62 unsolved in 7263 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 133/181 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 15/196 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 674/870 variables, 196/212 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/870 variables, 77/289 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/870 variables, 59/348 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/870 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 6/876 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/876 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/876 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 876/876 variables, and 357 constraints, problems are : Problem set: 0 solved, 62 unsolved in 10594 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 6/6 constraints]
After SMT, in 17924ms problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 0 properties in 30158 ms.
Support contains 48 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 717/717 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 194 transition count 609
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 194 transition count 609
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 29 place count 194 transition count 596
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 40 place count 194 transition count 585
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 51 place count 183 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 2 with 66 rules applied. Total rules applied 117 place count 183 transition count 519
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 183 transition count 519
Applied a total of 123 rules in 55 ms. Remains 183 /202 variables (removed 19) and now considering 519/717 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 183/202 places, 519/717 transitions.
RANDOM walk for 4000000 steps (146649 resets) in 24406 ms. (163 steps per ms) remains 49/62 properties
BEST_FIRST walk for 400003 steps (2885 resets) in 548 ms. (728 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (1263 resets) in 591 ms. (675 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (1258 resets) in 568 ms. (702 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (2869 resets) in 519 ms. (769 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (1278 resets) in 572 ms. (698 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (2878 resets) in 518 ms. (770 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400003 steps (2903 resets) in 521 ms. (766 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (2943 resets) in 531 ms. (751 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400003 steps (2930 resets) in 526 ms. (759 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (2874 resets) in 530 ms. (753 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (2895 resets) in 512 ms. (779 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (2873 resets) in 514 ms. (776 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (2919 resets) in 521 ms. (766 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (2882 resets) in 519 ms. (769 steps per ms) remains 44/47 properties
BEST_FIRST walk for 400004 steps (2822 resets) in 501 ms. (796 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2862 resets) in 527 ms. (757 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2888 resets) in 507 ms. (787 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (2935 resets) in 505 ms. (790 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2867 resets) in 509 ms. (784 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2933 resets) in 494 ms. (808 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (2918 resets) in 503 ms. (793 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (2512 resets) in 464 ms. (860 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2826 resets) in 506 ms. (788 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (2913 resets) in 518 ms. (770 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2953 resets) in 518 ms. (770 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (2897 resets) in 509 ms. (784 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (2936 resets) in 519 ms. (769 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400001 steps (2910 resets) in 500 ms. (798 steps per ms) remains 42/44 properties
BEST_FIRST walk for 400004 steps (2948 resets) in 490 ms. (814 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2525 resets) in 455 ms. (877 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2762 resets) in 476 ms. (838 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2933 resets) in 497 ms. (803 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2898 resets) in 511 ms. (781 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2930 resets) in 503 ms. (793 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2920 resets) in 511 ms. (781 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2944 resets) in 506 ms. (788 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2926 resets) in 503 ms. (793 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (2386 resets) in 449 ms. (888 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (2868 resets) in 503 ms. (793 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (2894 resets) in 496 ms. (804 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (1259 resets) in 558 ms. (715 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (908 resets) in 597 ms. (668 steps per ms) remains 42/42 properties
[2024-06-02 18:26:12] [INFO ] Flow matrix only has 500 transitions (discarded 19 similar events)
// Phase 1: matrix 500 rows 183 cols
[2024-06-02 18:26:12] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:26:12] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 129/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-02 18:26:13] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:26:13] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:26:13] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 9/177 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-02 18:26:13] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:26:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 500/677 variables, 177/192 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 65/257 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 6/683 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/683 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/683 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 683/683 variables, and 263 constraints, problems are : Problem set: 0 solved, 42 unsolved in 3980 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 129/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 9/177 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 500/677 variables, 177/192 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 65/257 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 39/296 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 6/683 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/683 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/683 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/683 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-02 18:26:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/683 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/683 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (OVERLAPS) 0/683 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 683/683 variables, and 307 constraints, problems are : Problem set: 0 solved, 42 unsolved in 9032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 7/7 constraints]
After SMT, in 13056ms problems are : Problem set: 0 solved, 42 unsolved
Fused 42 Parikh solutions to 40 different solutions.
Parikh walk visited 1 properties in 15926 ms.
Support contains 39 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 519/519 transitions.
Applied a total of 0 rules in 28 ms. Remains 183 /183 variables (removed 0) and now considering 519/519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 183/183 places, 519/519 transitions.
RANDOM walk for 4000000 steps (147004 resets) in 21642 ms. (184 steps per ms) remains 39/41 properties
BEST_FIRST walk for 400003 steps (2926 resets) in 518 ms. (770 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 534 ms. (747 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (1267 resets) in 525 ms. (760 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2905 resets) in 486 ms. (821 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (1242 resets) in 547 ms. (729 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2904 resets) in 504 ms. (792 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2923 resets) in 494 ms. (808 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (2956 resets) in 496 ms. (804 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2911 resets) in 489 ms. (816 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2897 resets) in 488 ms. (818 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2915 resets) in 489 ms. (816 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2889 resets) in 502 ms. (795 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2888 resets) in 493 ms. (809 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2874 resets) in 503 ms. (793 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2804 resets) in 482 ms. (828 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2924 resets) in 493 ms. (809 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2957 resets) in 500 ms. (798 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2898 resets) in 503 ms. (793 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2907 resets) in 507 ms. (787 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (2907 resets) in 500 ms. (798 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (2963 resets) in 495 ms. (806 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (2541 resets) in 440 ms. (907 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2852 resets) in 474 ms. (842 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2886 resets) in 501 ms. (796 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2905 resets) in 507 ms. (787 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400001 steps (2921 resets) in 512 ms. (779 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (2931 resets) in 495 ms. (806 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (2903 resets) in 499 ms. (800 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400003 steps (2935 resets) in 491 ms. (813 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2546 resets) in 436 ms. (915 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2803 resets) in 467 ms. (854 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400001 steps (2915 resets) in 492 ms. (811 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2955 resets) in 492 ms. (811 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (2942 resets) in 615 ms. (649 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (2952 resets) in 506 ms. (788 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2426 resets) in 427 ms. (934 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2867 resets) in 507 ms. (787 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (2888 resets) in 509 ms. (784 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (841 resets) in 600 ms. (665 steps per ms) remains 38/38 properties
Interrupted probabilistic random walk after 3764823 steps, run timeout after 33001 ms. (steps per millisecond=114 ) properties seen :25 out of 38
Probabilistic random walk after 3764823 steps, saw 1326639 distinct states, run finished after 33005 ms. (steps per millisecond=114 ) properties seen :25
[2024-06-02 18:27:26] [INFO ] Flow matrix only has 500 transitions (discarded 19 similar events)
[2024-06-02 18:27:26] [INFO ] Invariant cache hit.
[2024-06-02 18:27:26] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 149/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 9/177 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:27:26] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 500/677 variables, 177/190 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 65/255 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 6/683 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/683 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/683 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 683/683 variables, and 261 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 149/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 9/177 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:27:27] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 500/677 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 65/256 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 10/266 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/677 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 6/683 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/683 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 18:27:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/683 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/683 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/683 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 683/683 variables, and 276 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 2925ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 10123 ms.
Support contains 19 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 519/519 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 179 transition count 509
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 179 transition count 509
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 179 transition count 505
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 25 place count 175 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 43 place count 175 transition count 478
Applied a total of 43 rules in 29 ms. Remains 175 /183 variables (removed 8) and now considering 478/519 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 175/183 places, 478/519 transitions.
RANDOM walk for 4000000 steps (157791 resets) in 15785 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (29758 resets) in 4814 ms. (830 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (30265 resets) in 4498 ms. (889 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (29820 resets) in 3688 ms. (1084 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (29298 resets) in 3563 ms. (1122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (26237 resets) in 3343 ms. (1196 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000003 steps (29292 resets) in 3459 ms. (1156 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4000004 steps (29829 resets) in 3352 ms. (1192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (29871 resets) in 3417 ms. (1170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (29794 resets) in 3369 ms. (1186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (30140 resets) in 3328 ms. (1201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (26428 resets) in 3047 ms. (1312 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000004 steps (28186 resets) in 3153 ms. (1268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (29741 resets) in 3291 ms. (1215 steps per ms) remains 9/9 properties
[2024-06-02 18:27:57] [INFO ] Flow matrix only has 422 transitions (discarded 56 similar events)
// Phase 1: matrix 422 rows 175 cols
[2024-06-02 18:27:57] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:27:57] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 99/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 57/169 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:27:58] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:27:58] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:27:58] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 422/591 variables, 169/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 70/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/597 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/597 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 258 constraints, problems are : Problem set: 0 solved, 9 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 99/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 57/169 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 422/591 variables, 169/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/591 variables, 70/252 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 6/597 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/597 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 267 constraints, problems are : Problem set: 0 solved, 9 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 1664ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1728 ms.
Support contains 13 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 478/478 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 175 transition count 473
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 170 transition count 473
Applied a total of 10 rules in 16 ms. Remains 170 /175 variables (removed 5) and now considering 473/478 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/175 places, 473/478 transitions.
RANDOM walk for 4000000 steps (162653 resets) in 12617 ms. (317 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (31202 resets) in 3213 ms. (1244 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (31176 resets) in 3169 ms. (1261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (31186 resets) in 3160 ms. (1265 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31185 resets) in 3150 ms. (1269 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (31231 resets) in 3176 ms. (1259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31505 resets) in 3151 ms. (1269 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (29514 resets) in 3038 ms. (1316 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (31203 resets) in 3176 ms. (1259 steps per ms) remains 8/8 properties
[2024-06-02 18:28:11] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
// Phase 1: matrix 417 rows 170 cols
[2024-06-02 18:28:11] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:28:11] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 95/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 58/164 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:28:11] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 417/581 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 70/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/587 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/587 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 254 constraints, problems are : Problem set: 0 solved, 8 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 95/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 58/164 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:28:12] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 417/581 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 70/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 6/587 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/587 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 263 constraints, problems are : Problem set: 0 solved, 8 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 1706ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3400 ms.
Support contains 11 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 473/473 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 170/170 places, 473/473 transitions.
RANDOM walk for 4000000 steps (162417 resets) in 12550 ms. (318 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (31209 resets) in 3151 ms. (1269 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31188 resets) in 3132 ms. (1276 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31139 resets) in 3337 ms. (1198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31364 resets) in 3330 ms. (1200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (31189 resets) in 3343 ms. (1196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (31425 resets) in 3343 ms. (1196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (29498 resets) in 3143 ms. (1272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31129 resets) in 3364 ms. (1188 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 4173031 steps, run timeout after 30001 ms. (steps per millisecond=139 ) properties seen :0 out of 8
Probabilistic random walk after 4173031 steps, saw 1535832 distinct states, run finished after 30001 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-02 18:28:57] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
[2024-06-02 18:28:57] [INFO ] Invariant cache hit.
[2024-06-02 18:28:57] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 95/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 58/164 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:28:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 417/581 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/587 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/587 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 252 constraints, problems are : Problem set: 0 solved, 8 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 95/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 58/164 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 417/581 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 70/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 7/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 6/587 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/587 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 261 constraints, problems are : Problem set: 0 solved, 8 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1473 ms.
Support contains 11 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 473/473 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 170/170 places, 473/473 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 473/473 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 473/473 (removed 0) transitions.
[2024-06-02 18:29:00] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
[2024-06-02 18:29:00] [INFO ] Invariant cache hit.
[2024-06-02 18:29:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:29:00] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
[2024-06-02 18:29:00] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 18:29:01] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-06-02 18:29:01] [INFO ] Redundant transitions in 61 ms returned []
Running 455 sub problems to find dead transitions.
[2024-06-02 18:29:01] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 18:29:04] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:29:04] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:29:04] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:29:04] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:29:05] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:29:05] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:29:06] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 417/587 variables, 170/187 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 70/257 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/587 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 257 constraints, problems are : Problem set: 0 solved, 455 unsolved in 18826 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 417/587 variables, 170/187 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 70/257 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 455/712 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 18:29:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 18:29:43] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 714 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 9/9 constraints]
After SMT, in 49161ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 49169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49812 ms. Remains : 170/170 places, 473/473 transitions.
RANDOM walk for 400000 steps (16260 resets) in 2767 ms. (144 steps per ms) remains 7/11 properties
Running SMT prover for 7 properties.
[2024-06-02 18:29:51] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
[2024-06-02 18:29:51] [INFO ] Invariant cache hit.
[2024-06-02 18:29:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:29:51] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2024-06-02 18:29:51] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 18:29:51] [INFO ] After 39ms SMT Verify possible using 70 Read/Feed constraints in real domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-02 18:29:51] [INFO ] After 198ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 18:29:51] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 18:29:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:29:51] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 18:29:51] [INFO ] After 55ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-02 18:29:52] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-02 18:29:52] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
RANDOM walk for 4000000 steps (162168 resets) in 15959 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31132 resets) in 4082 ms. (979 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31182 resets) in 3706 ms. (1079 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (31160 resets) in 3071 ms. (1302 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000003 steps (31340 resets) in 2991 ms. (1336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (31209 resets) in 2998 ms. (1333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (31468 resets) in 2976 ms. (1343 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (31159 resets) in 3006 ms. (1330 steps per ms) remains 7/7 properties
[2024-06-02 18:30:04] [INFO ] Flow matrix only has 417 transitions (discarded 56 similar events)
[2024-06-02 18:30:04] [INFO ] Invariant cache hit.
[2024-06-02 18:30:04] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 51/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 104/164 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:30:04] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:30:04] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 417/581 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/587 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/587 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 252 constraints, problems are : Problem set: 0 solved, 7 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 51/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 104/164 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 417/581 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 6/587 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/587 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 587/587 variables, and 259 constraints, problems are : Problem set: 0 solved, 7 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 971 ms.
Support contains 9 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 473/473 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 472
Applied a total of 2 rules in 14 ms. Remains 169 /170 variables (removed 1) and now considering 472/473 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 169/170 places, 472/473 transitions.
RANDOM walk for 4000000 steps (162687 resets) in 11568 ms. (345 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (31118 resets) in 2950 ms. (1355 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000004 steps (31198 resets) in 2868 ms. (1394 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (31205 resets) in 2861 ms. (1397 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (31238 resets) in 2888 ms. (1384 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (31181 resets) in 2760 ms. (1448 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (31536 resets) in 2721 ms. (1469 steps per ms) remains 5/5 properties
[2024-06-02 18:30:15] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
// Phase 1: matrix 416 rows 169 cols
[2024-06-02 18:30:15] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:30:15] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 103/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:30:15] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:30:15] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/585 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 251 constraints, problems are : Problem set: 0 solved, 5 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 103/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/585 variables, 6/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/585 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 256 constraints, problems are : Problem set: 0 solved, 5 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1088ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1436 ms.
Support contains 7 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 169/169 places, 472/472 transitions.
RANDOM walk for 4000000 steps (162291 resets) in 10148 ms. (394 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (31141 resets) in 2814 ms. (1420 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (31204 resets) in 2801 ms. (1427 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (31321 resets) in 2778 ms. (1439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (31259 resets) in 2815 ms. (1420 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (31680 resets) in 2805 ms. (1425 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 3236611 steps, run timeout after 21001 ms. (steps per millisecond=154 ) properties seen :0 out of 5
Probabilistic random walk after 3236611 steps, saw 1201066 distinct states, run finished after 21001 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-02 18:30:46] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
[2024-06-02 18:30:46] [INFO ] Invariant cache hit.
[2024-06-02 18:30:46] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 103/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:30:46] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/585 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 250 constraints, problems are : Problem set: 0 solved, 5 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 103/163 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:30:46] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:30:46] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:30:46] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 416/579 variables, 163/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 70/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/585 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/585 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 258 constraints, problems are : Problem set: 0 solved, 5 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1202ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 307 ms.
Support contains 7 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Applied a total of 0 rules in 19 ms. Remains 169 /169 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 169/169 places, 472/472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Applied a total of 0 rules in 9 ms. Remains 169 /169 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2024-06-02 18:30:47] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
[2024-06-02 18:30:47] [INFO ] Invariant cache hit.
[2024-06-02 18:30:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:30:47] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
[2024-06-02 18:30:47] [INFO ] Invariant cache hit.
[2024-06-02 18:30:47] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 18:30:48] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-06-02 18:30:48] [INFO ] Redundant transitions in 27 ms returned []
Running 454 sub problems to find dead transitions.
[2024-06-02 18:30:48] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
[2024-06-02 18:30:48] [INFO ] Invariant cache hit.
[2024-06-02 18:30:48] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-06-02 18:30:50] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:30:50] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:30:51] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:30:52] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:30:52] [INFO ] Deduced a trap composed of 127 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 416/585 variables, 169/186 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 70/256 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-06-02 18:30:59] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 8 (OVERLAPS) 0/585 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 454 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 257 constraints, problems are : Problem set: 0 solved, 454 unsolved in 24350 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 416/585 variables, 169/187 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 70/257 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 454/711 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-06-02 18:31:26] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-06-02 18:31:37] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 713 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 10/10 constraints]
After SMT, in 54676ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 54681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55147 ms. Remains : 169/169 places, 472/472 transitions.
RANDOM walk for 400000 steps (16222 resets) in 965 ms. (414 steps per ms) remains 4/7 properties
Running SMT prover for 4 properties.
[2024-06-02 18:31:43] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
[2024-06-02 18:31:43] [INFO ] Invariant cache hit.
[2024-06-02 18:31:43] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:31:43] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-06-02 18:31:43] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 18:31:43] [INFO ] After 33ms SMT Verify possible using 70 Read/Feed constraints in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 18:31:43] [INFO ] After 116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 18:31:43] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 18:31:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:31:43] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 18:31:43] [INFO ] After 27ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 18:31:43] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 18:31:43] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
RANDOM walk for 4854 steps (204 resets) in 28 ms. (167 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1631 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (306 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1005191 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1005191 steps, saw 368285 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-06-02 18:31:46] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
[2024-06-02 18:31:46] [INFO ] Invariant cache hit.
[2024-06-02 18:31:46] [INFO ] State equation strengthened by 70 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:31:46] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/585 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 250 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 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) 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:31:47] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 416/579 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 70/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/585 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/585 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 566ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 167 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 167 transition count 467
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 167 transition count 465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 165 transition count 465
Applied a total of 8 rules in 18 ms. Remains 165 /169 variables (removed 4) and now considering 465/472 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 165/169 places, 465/472 transitions.
RANDOM walk for 40000 steps (1676 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (311 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1066254 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :0 out of 1
Probabilistic random walk after 1066254 steps, saw 371014 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
[2024-06-02 18:31:50] [INFO ] Flow matrix only has 409 transitions (discarded 56 similar events)
// Phase 1: matrix 409 rows 165 cols
[2024-06-02 18:31:50] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 18:31:50] [INFO ] State equation strengthened by 94 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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:31:50] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 409/568 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/574 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/574 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 409/568 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/574 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 465/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 165/165 places, 465/465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 465/465 transitions.
Applied a total of 0 rules in 6 ms. Remains 165 /165 variables (removed 0) and now considering 465/465 (removed 0) transitions.
[2024-06-02 18:31:50] [INFO ] Flow matrix only has 409 transitions (discarded 56 similar events)
[2024-06-02 18:31:50] [INFO ] Invariant cache hit.
[2024-06-02 18:31:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:31:50] [INFO ] Flow matrix only has 409 transitions (discarded 56 similar events)
[2024-06-02 18:31:50] [INFO ] Invariant cache hit.
[2024-06-02 18:31:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:31:51] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-02 18:31:51] [INFO ] Redundant transitions in 33 ms returned []
Running 447 sub problems to find dead transitions.
[2024-06-02 18:31:51] [INFO ] Flow matrix only has 409 transitions (discarded 56 similar events)
[2024-06-02 18:31:51] [INFO ] Invariant cache hit.
[2024-06-02 18:31:51] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:31:54] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:31:55] [INFO ] Deduced a trap composed of 125 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 409/574 variables, 165/182 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 94/276 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 276 constraints, problems are : Problem set: 0 solved, 447 unsolved in 18887 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 409/574 variables, 165/182 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 94/276 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 447/723 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 18:32:22] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 18:32:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 18:32:39] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 726 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 10/10 constraints]
After SMT, in 49233ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 49237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49843 ms. Remains : 165/165 places, 465/465 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 165 vertex of which 29 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 115 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 131 transition count 317
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 131 transition count 317
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 39 place count 131 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 130 transition count 296
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 127 transition count 299
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 56 place count 127 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 127 transition count 275
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 127 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 124 transition count 272
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 120 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 120 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 120 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 119 transition count 260
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 118 transition count 227
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 118 transition count 227
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 118 transition count 221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 108 place count 112 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 112 transition count 215
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 117 place count 112 transition count 212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 120 place count 109 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 126 place count 109 transition count 212
Applied a total of 126 rules in 59 ms. Remains 109 /165 variables (removed 56) and now considering 212/465 (removed 253) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:32:40] [INFO ] Flow matrix only has 208 transitions (discarded 4 similar events)
// Phase 1: matrix 208 rows 109 cols
[2024-06-02 18:32:40] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:32:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:32:40] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:32:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-02 18:32:40] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:32:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:32:40] [INFO ] After 29ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:32:40] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:32:40] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
RANDOM walk for 464 steps (15 resets) in 5 ms. (77 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1618 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (309 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1007992 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 1
Probabilistic random walk after 1007992 steps, saw 369373 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-06-02 18:32:43] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
// Phase 1: matrix 416 rows 169 cols
[2024-06-02 18:32:43] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:32:43] [INFO ] State equation strengthened by 70 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:32:43] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/585 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 416/579 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/585 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/585 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 253 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 469
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 168 transition count 466
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 165 transition count 466
Applied a total of 8 rules in 27 ms. Remains 165 /169 variables (removed 4) and now considering 466/472 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 165/169 places, 466/472 transitions.
RANDOM walk for 40000 steps (1669 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (320 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1033532 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1033532 steps, saw 359508 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2024-06-02 18:32:47] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
// Phase 1: matrix 410 rows 165 cols
[2024-06-02 18:32:47] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:32:47] [INFO ] State equation strengthened by 94 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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:32:47] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 410/569 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/575 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/575 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 410/569 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/575 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/575 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 466/466 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 165/165 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 466/466 transitions.
Applied a total of 0 rules in 7 ms. Remains 165 /165 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2024-06-02 18:32:47] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
[2024-06-02 18:32:47] [INFO ] Invariant cache hit.
[2024-06-02 18:32:48] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:32:48] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
[2024-06-02 18:32:48] [INFO ] Invariant cache hit.
[2024-06-02 18:32:48] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:32:48] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-06-02 18:32:48] [INFO ] Redundant transitions in 32 ms returned []
Running 448 sub problems to find dead transitions.
[2024-06-02 18:32:48] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
[2024-06-02 18:32:48] [INFO ] Invariant cache hit.
[2024-06-02 18:32:48] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:32:52] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:32:52] [INFO ] Deduced a trap composed of 125 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:32:52] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 410/575 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 94/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/575 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 277 constraints, problems are : Problem set: 0 solved, 448 unsolved in 19061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 410/575 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 94/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 448/725 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 18:33:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:33:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/575 variables, and 727 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 10/10 constraints]
After SMT, in 49401ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 49406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50002 ms. Remains : 165/165 places, 466/466 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 165 vertex of which 29 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 115 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 131 transition count 318
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 131 transition count 318
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 39 place count 131 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 130 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 127 transition count 300
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 56 place count 127 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 127 transition count 276
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 127 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 124 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 120 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 120 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 120 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 5 with 2 rules applied. Total rules applied 94 place count 119 transition count 261
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 118 transition count 227
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 118 transition count 227
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 118 transition count 221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 108 place count 112 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 112 transition count 215
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 117 place count 112 transition count 212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 120 place count 109 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 126 place count 109 transition count 212
Applied a total of 126 rules in 41 ms. Remains 109 /165 variables (removed 56) and now considering 212/466 (removed 254) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:33:37] [INFO ] Flow matrix only has 208 transitions (discarded 4 similar events)
// Phase 1: matrix 208 rows 109 cols
[2024-06-02 18:33:37] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:33:38] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:33:38] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:33:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:33:38] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:33:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:33:38] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:33:38] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:33:38] [INFO ] After 92ms 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 40000 steps (1637 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (313 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1010473 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 1
Probabilistic random walk after 1010473 steps, saw 370295 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
[2024-06-02 18:33:41] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
// Phase 1: matrix 416 rows 169 cols
[2024-06-02 18:33:41] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:33:41] [INFO ] State equation strengthened by 70 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/585 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 416/579 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/585 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/585 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 253 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 469
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 168 transition count 466
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 165 transition count 466
Applied a total of 8 rules in 19 ms. Remains 165 /169 variables (removed 4) and now considering 466/472 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 165/169 places, 466/472 transitions.
RANDOM walk for 40000 steps (1658 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (304 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1068784 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1068784 steps, saw 371926 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
[2024-06-02 18:33:44] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
// Phase 1: matrix 410 rows 165 cols
[2024-06-02 18:33:44] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:33:44] [INFO ] State equation strengthened by 94 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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:33:45] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 410/569 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/575 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/575 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 410/569 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 94/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/575 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/575 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 466/466 transitions.
Applied a total of 0 rules in 10 ms. Remains 165 /165 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 165/165 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 466/466 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2024-06-02 18:33:45] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
[2024-06-02 18:33:45] [INFO ] Invariant cache hit.
[2024-06-02 18:33:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 18:33:45] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
[2024-06-02 18:33:45] [INFO ] Invariant cache hit.
[2024-06-02 18:33:45] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:33:45] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-02 18:33:45] [INFO ] Redundant transitions in 29 ms returned []
Running 448 sub problems to find dead transitions.
[2024-06-02 18:33:45] [INFO ] Flow matrix only has 410 transitions (discarded 56 similar events)
[2024-06-02 18:33:45] [INFO ] Invariant cache hit.
[2024-06-02 18:33:45] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:33:49] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 125 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:33:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 410/575 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 94/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/575 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 277 constraints, problems are : Problem set: 0 solved, 448 unsolved in 19272 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 410/575 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 94/277 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 448/725 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-02 18:34:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:34:17] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/575 variables, and 727 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 10/10 constraints]
After SMT, in 49595ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 49600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50177 ms. Remains : 165/165 places, 466/466 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 165 vertex of which 29 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 115 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 131 transition count 318
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 131 transition count 318
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 39 place count 131 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 130 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 127 transition count 300
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 56 place count 127 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 127 transition count 276
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 127 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 124 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 120 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 120 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 120 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 5 with 2 rules applied. Total rules applied 94 place count 119 transition count 261
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 118 transition count 227
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 118 transition count 227
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 118 transition count 221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 108 place count 112 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 112 transition count 215
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 117 place count 112 transition count 212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 120 place count 109 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 126 place count 109 transition count 212
Applied a total of 126 rules in 45 ms. Remains 109 /165 variables (removed 56) and now considering 212/466 (removed 254) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:34:35] [INFO ] Flow matrix only has 208 transitions (discarded 4 similar events)
// Phase 1: matrix 208 rows 109 cols
[2024-06-02 18:34:35] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:34:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:34:35] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 18:34:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:34:35] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:34:35] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:34:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:34:35] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:34:35] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:34:35] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:34:35] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 228 ms.
RANDOM walk for 40000 steps (1622 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (297 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1007599 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 1
Probabilistic random walk after 1007599 steps, saw 369213 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-06-02 18:34:38] [INFO ] Flow matrix only has 416 transitions (discarded 56 similar events)
// Phase 1: matrix 416 rows 169 cols
[2024-06-02 18:34:38] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:34:38] [INFO ] State equation strengthened by 70 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:34:38] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:34:38] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 416/579 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 70/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/585 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 118/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:34:39] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 416/579 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/585 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/585 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 253 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 642ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 472/472 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 470
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 168 transition count 467
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 165 transition count 467
Applied a total of 8 rules in 12 ms. Remains 165 /169 variables (removed 4) and now considering 467/472 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 165/169 places, 467/472 transitions.
RANDOM walk for 40000 steps (1650 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (320 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1065365 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :0 out of 1
Probabilistic random walk after 1065365 steps, saw 370683 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
[2024-06-02 18:34:42] [INFO ] Flow matrix only has 411 transitions (discarded 56 similar events)
// Phase 1: matrix 411 rows 165 cols
[2024-06-02 18:34:42] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:34:42] [INFO ] State equation strengthened by 95 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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:34:42] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 411/570 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 95/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/576 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 95/95 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) 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) 116/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 411/570 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 95/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/576 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/576 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 576/576 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 467/467 transitions.
Applied a total of 0 rules in 6 ms. Remains 165 /165 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 165/165 places, 467/467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 467/467 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2024-06-02 18:34:42] [INFO ] Flow matrix only has 411 transitions (discarded 56 similar events)
[2024-06-02 18:34:42] [INFO ] Invariant cache hit.
[2024-06-02 18:34:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:34:43] [INFO ] Flow matrix only has 411 transitions (discarded 56 similar events)
[2024-06-02 18:34:43] [INFO ] Invariant cache hit.
[2024-06-02 18:34:43] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 18:34:43] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-06-02 18:34:43] [INFO ] Redundant transitions in 30 ms returned []
Running 449 sub problems to find dead transitions.
[2024-06-02 18:34:43] [INFO ] Flow matrix only has 411 transitions (discarded 56 similar events)
[2024-06-02 18:34:43] [INFO ] Invariant cache hit.
[2024-06-02 18:34:43] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:34:46] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:34:47] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:34:47] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:34:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 411/576 variables, 165/186 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 95/281 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 7 (OVERLAPS) 0/576 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 449 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 281 constraints, problems are : Problem set: 0 solved, 449 unsolved in 19571 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (OVERLAPS) 411/576 variables, 165/186 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 95/281 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 449/730 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-02 18:35:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 731 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 12/12 constraints]
After SMT, in 49892ms problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 49896ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50494 ms. Remains : 165/165 places, 467/467 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 165 vertex of which 29 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 115 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 131 transition count 319
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 131 transition count 319
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 39 place count 131 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 130 transition count 298
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 127 transition count 301
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 56 place count 127 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 127 transition count 277
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 127 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 124 transition count 274
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 120 transition count 270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 120 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 120 transition count 263
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 5 with 2 rules applied. Total rules applied 94 place count 119 transition count 262
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 118 transition count 228
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 118 transition count 228
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 118 transition count 222
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 108 place count 112 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 112 transition count 216
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 117 place count 112 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 120 place count 109 transition count 213
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 126 place count 109 transition count 213
Applied a total of 126 rules in 27 ms. Remains 109 /165 variables (removed 56) and now considering 213/467 (removed 254) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:35:33] [INFO ] Flow matrix only has 209 transitions (discarded 4 similar events)
// Phase 1: matrix 209 rows 109 cols
[2024-06-02 18:35:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:35:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:35:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:35:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:35:33] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:35:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:35:33] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:35:33] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:35:33] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 202 ms.
RANDOM walk for 338 steps (7 resets) in 5 ms. (56 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 134 edges and 169 vertex of which 29 / 169 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 115 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 135 transition count 324
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 135 transition count 324
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 39 place count 135 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 134 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 131 transition count 306
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 56 place count 131 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 131 transition count 282
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 131 transition count 279
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 128 transition count 279
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 124 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 124 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 124 transition count 268
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 5 with 2 rules applied. Total rules applied 94 place count 123 transition count 267
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 100 place count 123 transition count 261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 106 place count 117 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 112 place count 117 transition count 255
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 115 place count 117 transition count 252
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 118 place count 114 transition count 252
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 121 place count 114 transition count 252
Applied a total of 121 rules in 26 ms. Remains 114 /169 variables (removed 55) and now considering 252/472 (removed 220) transitions.
Running SMT prover for 5 properties.
[2024-06-02 18:35:33] [INFO ] Flow matrix only has 248 transitions (discarded 4 similar events)
// Phase 1: matrix 248 rows 114 cols
[2024-06-02 18:35:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:35:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:35:33] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 18:35:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:35:33] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 18:35:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:35:34] [INFO ] After 53ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 18:35:34] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 18:35:34] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 503 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :5 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 5 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 730825 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-19

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 602
TRANSITIONS: 944
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2776
NUPN UNITS: 25
LOADING TIME: 0.482

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

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

Process ID: 1224
MODEL NAME: /home/mcc/execution/model
602 places, 944 transitions.

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

BK_STOP 1717353977860

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-19"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-19, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905900197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.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 ;