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-171734905900202.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-20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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 1717352838185

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:27:19] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-02 18:27:19] [INFO ] Transformed 626 places.
[2024-06-02 18:27:19] [INFO ] Transformed 1031 transitions.
[2024-06-02 18:27:19] [INFO ] Found NUPN structural information;
[2024-06-02 18:27:19] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 222 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 602 transition count 900
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 260 place count 481 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 261 place count 480 transition count 898
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 261 place count 480 transition count 882
Deduced a syphon composed of 16 places in 17 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 293 place count 464 transition count 882
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 2 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 587 place count 317 transition count 735
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 590 place count 317 transition count 732
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 680 place count 272 transition count 1039
Applied a total of 680 rules in 144 ms. Remains 272 /626 variables (removed 354) and now considering 1039/1031 (removed -8) transitions.
[2024-06-02 18:27:19] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
// Phase 1: matrix 986 rows 272 cols
[2024-06-02 18:27:19] [INFO ] Computed 10 invariants in 28 ms
[2024-06-02 18:27:20] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-06-02 18:27:20] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
[2024-06-02 18:27:20] [INFO ] Invariant cache hit.
[2024-06-02 18:27:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-02 18:27:21] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
Running 1012 sub problems to find dead transitions.
[2024-06-02 18:27:21] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
[2024-06-02 18:27:21] [INFO ] Invariant cache hit.
[2024-06-02 18:27:21] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 271/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-06-02 18:27:37] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 15 ms to minimize.
[2024-06-02 18:27:37] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 3 ms to minimize.
[2024-06-02 18:27:37] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2024-06-02 18:27:38] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:27:38] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:27:38] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 2 ms to minimize.
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 169 places in 179 ms of which 12 ms to minimize.
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 189 places in 142 ms of which 2 ms to minimize.
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 179 places in 135 ms of which 1 ms to minimize.
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2024-06-02 18:27:39] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 2 ms to minimize.
[2024-06-02 18:27:40] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-06-02 18:27:40] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:27:40] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:27:41] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:27:41] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:27:41] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:27:41] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 18/300 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 189 places in 161 ms of which 2 ms to minimize.
[2024-06-02 18:27:47] [INFO ] Deduced a trap composed of 189 places in 153 ms of which 2 ms to minimize.
[2024-06-02 18:27:48] [INFO ] Deduced a trap composed of 199 places in 155 ms of which 2 ms to minimize.
[2024-06-02 18:27:49] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 272/1258 variables, and 304 constraints, problems are : Problem set: 0 solved, 1012 unsolved in 30047 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/272 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 1012/1012 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1012 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 271/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 22/304 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 6 (OVERLAPS) 985/1257 variables, 272/576 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1257 variables, 18/594 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 1012/1606 constraints. Problems are: Problem set: 0 solved, 1012 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1257/1258 variables, and 1606 constraints, problems are : Problem set: 0 solved, 1012 unsolved in 30030 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 272/272 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 1012/1012 constraints, Known Traps: 22/22 constraints]
After SMT, in 61862ms problems are : Problem set: 0 solved, 1012 unsolved
Search for dead transitions found 0 dead transitions in 61897ms
Starting structural reductions in LIVENESS mode, iteration 1 : 272/626 places, 1039/1031 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63763 ms. Remains : 272/626 places, 1039/1031 transitions.
Discarding 473 transitions out of 1039. Remains 566
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1523 resets) in 4315 ms. (9 steps per ms) remains 441/565 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 441/441 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 441/441 properties
[2024-06-02 18:28:24] [INFO ] Flow matrix only has 986 transitions (discarded 53 similar events)
[2024-06-02 18:28:24] [INFO ] Invariant cache hit.
[2024-06-02 18:28:24] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 21/263 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 21/273 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/1258 variables, and 273 constraints, problems are : Problem set: 0 solved, 441 unsolved in 5019 ms.
Refiners :[Domain max(s): 263/272 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/272 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 21/263 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 21/273 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 1 ms to minimize.
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 179 places in 139 ms of which 1 ms to minimize.
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 1 ms to minimize.
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 189 places in 143 ms of which 2 ms to minimize.
[2024-06-02 18:28:34] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 2 ms to minimize.
[2024-06-02 18:28:35] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2024-06-02 18:28:35] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:28:35] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 2 ms to minimize.
SMT process timed out in 10657ms, After SMT, problems are : Problem set: 0 solved, 441 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 242 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 1039/1039 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 272 transition count 1036
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 269 transition count 1033
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 269 transition count 1033
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 28 place count 269 transition count 1014
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 269 transition count 1002
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 269 transition count 996
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 263 transition count 996
Applied a total of 52 rules in 88 ms. Remains 263 /272 variables (removed 9) and now considering 996/1039 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 263/272 places, 996/1039 transitions.
RANDOM walk for 4000000 steps (124987 resets) in 63156 ms. (63 steps per ms) remains 226/441 properties
BEST_FIRST walk for 40004 steps (136 resets) in 148 ms. (268 steps per ms) remains 220/226 properties
BEST_FIRST walk for 40004 steps (245 resets) in 148 ms. (268 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40003 steps (130 resets) in 192 ms. (207 steps per ms) remains 216/220 properties
BEST_FIRST walk for 40003 steps (239 resets) in 199 ms. (200 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (136 resets) in 230 ms. (173 steps per ms) remains 213/216 properties
BEST_FIRST walk for 40004 steps (246 resets) in 220 ms. (181 steps per ms) remains 212/213 properties
BEST_FIRST walk for 40003 steps (134 resets) in 132 ms. (300 steps per ms) remains 208/212 properties
BEST_FIRST walk for 40003 steps (228 resets) in 129 ms. (307 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40002 steps (132 resets) in 146 ms. (272 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (242 resets) in 125 ms. (317 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40003 steps (129 resets) in 116 ms. (341 steps per ms) remains 205/208 properties
BEST_FIRST walk for 40002 steps (245 resets) in 137 ms. (289 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (131 resets) in 128 ms. (310 steps per ms) remains 200/205 properties
BEST_FIRST walk for 40003 steps (235 resets) in 106 ms. (373 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (242 resets) in 108 ms. (367 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (244 resets) in 106 ms. (373 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (127 resets) in 112 ms. (354 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40002 steps (235 resets) in 110 ms. (360 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (129 resets) in 113 ms. (350 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (251 resets) in 106 ms. (373 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (131 resets) in 110 ms. (360 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40003 steps (239 resets) in 138 ms. (287 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (125 resets) in 129 ms. (307 steps per ms) remains 199/200 properties
BEST_FIRST walk for 40004 steps (232 resets) in 106 ms. (373 steps per ms) remains 199/199 properties
BEST_FIRST walk for 40003 steps (131 resets) in 113 ms. (350 steps per ms) remains 198/199 properties
BEST_FIRST walk for 40003 steps (254 resets) in 108 ms. (367 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40003 steps (128 resets) in 111 ms. (357 steps per ms) remains 197/198 properties
BEST_FIRST walk for 40004 steps (234 resets) in 110 ms. (360 steps per ms) remains 196/197 properties
BEST_FIRST walk for 40004 steps (132 resets) in 114 ms. (347 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (230 resets) in 106 ms. (373 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (134 resets) in 109 ms. (363 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (238 resets) in 105 ms. (377 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (129 resets) in 111 ms. (357 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (238 resets) in 103 ms. (384 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (132 resets) in 108 ms. (367 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (244 resets) in 102 ms. (388 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (130 resets) in 109 ms. (363 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (235 resets) in 103 ms. (384 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (130 resets) in 111 ms. (357 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (245 resets) in 103 ms. (384 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (129 resets) in 111 ms. (357 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (251 resets) in 102 ms. (388 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (131 resets) in 111 ms. (357 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (247 resets) in 103 ms. (384 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (239 resets) in 101 ms. (392 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (243 resets) in 103 ms. (384 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (237 resets) in 100 ms. (396 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (236 resets) in 103 ms. (384 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40001 steps (241 resets) in 104 ms. (380 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (216 resets) in 105 ms. (377 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (233 resets) in 99 ms. (400 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (234 resets) in 98 ms. (404 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (241 resets) in 99 ms. (400 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (230 resets) in 100 ms. (396 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (237 resets) in 100 ms. (396 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40003 steps (126 resets) in 113 ms. (350 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40002 steps (127 resets) in 113 ms. (350 steps per ms) remains 195/196 properties
BEST_FIRST walk for 40003 steps (132 resets) in 113 ms. (350 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (129 resets) in 110 ms. (360 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (129 resets) in 113 ms. (350 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (251 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (237 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (254 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (235 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (226 resets) in 103 ms. (384 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (241 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (248 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (243 resets) in 102 ms. (388 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (244 resets) in 109 ms. (363 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (238 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (237 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (242 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (236 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (249 resets) in 103 ms. (384 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (245 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (247 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (246 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (231 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (238 resets) in 102 ms. (388 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (237 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (246 resets) in 103 ms. (384 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (249 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (232 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (235 resets) in 109 ms. (363 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (230 resets) in 103 ms. (384 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (236 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (244 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40001 steps (242 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (255 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (254 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (233 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (239 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (243 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (255 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (237 resets) in 103 ms. (384 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (249 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (240 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (227 resets) in 104 ms. (380 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (239 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (244 resets) in 109 ms. (363 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (235 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40002 steps (232 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (248 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (258 resets) in 105 ms. (377 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (243 resets) in 106 ms. (373 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40003 steps (245 resets) in 107 ms. (370 steps per ms) remains 195/195 properties
[2024-06-02 18:28:56] [INFO ] Flow matrix only has 945 transitions (discarded 51 similar events)
// Phase 1: matrix 945 rows 263 cols
[2024-06-02 18:28:56] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:28:56] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 116/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 5 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:28:59] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 2 ms to minimize.
[2024-06-02 18:28:59] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:28:59] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:29:00] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 2 ms to minimize.
[2024-06-02 18:29:00] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 945/1199 variables, 254/275 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1199 variables, 21/296 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1199 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 9/1208 variables, 9/305 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/1208 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 305 constraints, problems are : Problem set: 0 solved, 195 unsolved in 33009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 116/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 945/1199 variables, 254/275 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1199 variables, 21/296 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1199 variables, 183/479 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1199 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 9/1208 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 12/500 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1208 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 500 constraints, problems are : Problem set: 0 solved, 195 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints]
After SMT, in 78271ms problems are : Problem set: 0 solved, 195 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 996/996 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 729
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 257 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 254 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 254 transition count 718
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 29 place count 254 transition count 709
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 254 transition count 704
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 39 place count 249 transition count 704
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 48 place count 249 transition count 695
Applied a total of 48 rules in 68 ms. Remains 249 /263 variables (removed 14) and now considering 695/996 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 249/263 places, 695/996 transitions.
RANDOM walk for 4000000 steps (119826 resets) in 53928 ms. (74 steps per ms) remains 176/195 properties
BEST_FIRST walk for 40004 steps (87 resets) in 108 ms. (367 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40003 steps (237 resets) in 104 ms. (380 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40003 steps (92 resets) in 107 ms. (370 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40003 steps (231 resets) in 104 ms. (380 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40004 steps (89 resets) in 109 ms. (363 steps per ms) remains 175/176 properties
BEST_FIRST walk for 40004 steps (241 resets) in 106 ms. (373 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (94 resets) in 109 ms. (363 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (251 resets) in 104 ms. (380 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (90 resets) in 108 ms. (367 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (231 resets) in 108 ms. (367 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40002 steps (92 resets) in 109 ms. (363 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (238 resets) in 107 ms. (370 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (89 resets) in 114 ms. (347 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40002 steps (234 resets) in 110 ms. (360 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (92 resets) in 113 ms. (350 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (236 resets) in 105 ms. (377 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (89 resets) in 111 ms. (357 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (234 resets) in 110 ms. (360 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (92 resets) in 113 ms. (350 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40002 steps (240 resets) in 106 ms. (373 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (92 resets) in 110 ms. (360 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (238 resets) in 107 ms. (370 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (98 resets) in 111 ms. (357 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (243 resets) in 108 ms. (367 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (87 resets) in 109 ms. (363 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (230 resets) in 105 ms. (377 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40002 steps (86 resets) in 112 ms. (354 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (227 resets) in 106 ms. (373 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (92 resets) in 111 ms. (357 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (231 resets) in 106 ms. (373 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (92 resets) in 108 ms. (367 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (244 resets) in 106 ms. (373 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40002 steps (89 resets) in 111 ms. (357 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (245 resets) in 103 ms. (384 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40002 steps (94 resets) in 110 ms. (360 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (239 resets) in 106 ms. (373 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (90 resets) in 112 ms. (354 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (246 resets) in 105 ms. (377 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (229 resets) in 103 ms. (384 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (242 resets) in 145 ms. (273 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (217 resets) in 118 ms. (336 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (232 resets) in 98 ms. (404 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (226 resets) in 103 ms. (384 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40001 steps (237 resets) in 101 ms. (392 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (225 resets) in 99 ms. (400 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (229 resets) in 100 ms. (396 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (204 resets) in 98 ms. (404 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (239 resets) in 100 ms. (396 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (225 resets) in 98 ms. (404 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40004 steps (89 resets) in 144 ms. (275 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (89 resets) in 168 ms. (236 steps per ms) remains 175/175 properties
BEST_FIRST walk for 40003 steps (91 resets) in 152 ms. (261 steps per ms) remains 174/175 properties
BEST_FIRST walk for 40001 steps (230 resets) in 234 ms. (170 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (239 resets) in 135 ms. (294 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (241 resets) in 216 ms. (184 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (232 resets) in 128 ms. (310 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (236 resets) in 203 ms. (196 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (227 resets) in 178 ms. (223 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (241 resets) in 169 ms. (235 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (223 resets) in 202 ms. (197 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (229 resets) in 167 ms. (238 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (235 resets) in 147 ms. (270 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (228 resets) in 166 ms. (239 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (240 resets) in 141 ms. (281 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (230 resets) in 151 ms. (263 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (239 resets) in 166 ms. (239 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (232 resets) in 186 ms. (213 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (235 resets) in 196 ms. (203 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (237 resets) in 169 ms. (235 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (240 resets) in 150 ms. (264 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (226 resets) in 185 ms. (215 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (220 resets) in 138 ms. (287 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (229 resets) in 177 ms. (224 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (237 resets) in 151 ms. (263 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (232 resets) in 164 ms. (242 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (241 resets) in 155 ms. (256 steps per ms) remains 173/174 properties
BEST_FIRST walk for 40003 steps (231 resets) in 144 ms. (275 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (229 resets) in 153 ms. (259 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (226 resets) in 179 ms. (222 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (230 resets) in 174 ms. (228 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (236 resets) in 167 ms. (238 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (228 resets) in 155 ms. (256 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (223 resets) in 158 ms. (251 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (234 resets) in 181 ms. (219 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (229 resets) in 152 ms. (261 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (238 resets) in 156 ms. (254 steps per ms) remains 172/173 properties
BEST_FIRST walk for 40004 steps (228 resets) in 197 ms. (202 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (240 resets) in 203 ms. (196 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (246 resets) in 192 ms. (207 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (229 resets) in 152 ms. (261 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (250 resets) in 243 ms. (163 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (248 resets) in 244 ms. (163 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (234 resets) in 165 ms. (240 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (258 resets) in 223 ms. (178 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (239 resets) in 122 ms. (325 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (238 resets) in 204 ms. (195 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40002 steps (236 resets) in 155 ms. (256 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (237 resets) in 171 ms. (232 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (239 resets) in 230 ms. (173 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (232 resets) in 235 ms. (169 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (241 resets) in 243 ms. (163 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (236 resets) in 167 ms. (238 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (233 resets) in 178 ms. (223 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (230 resets) in 134 ms. (296 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (247 resets) in 259 ms. (153 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (251 resets) in 165 ms. (240 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (239 resets) in 159 ms. (250 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40002 steps (233 resets) in 173 ms. (229 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (237 resets) in 223 ms. (178 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (228 resets) in 148 ms. (268 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (231 resets) in 171 ms. (232 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (250 resets) in 162 ms. (245 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (233 resets) in 200 ms. (199 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (240 resets) in 194 ms. (205 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (223 resets) in 292 ms. (136 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (238 resets) in 178 ms. (223 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (240 resets) in 154 ms. (258 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40002 steps (196 resets) in 139 ms. (285 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (203 resets) in 159 ms. (250 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (203 resets) in 126 ms. (314 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (186 resets) in 128 ms. (310 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40002 steps (204 resets) in 171 ms. (232 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (207 resets) in 158 ms. (251 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (228 resets) in 191 ms. (208 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (243 resets) in 200 ms. (199 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (235 resets) in 193 ms. (206 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40002 steps (228 resets) in 143 ms. (277 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (234 resets) in 152 ms. (261 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (228 resets) in 198 ms. (201 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (243 resets) in 154 ms. (258 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40002 steps (245 resets) in 185 ms. (215 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (237 resets) in 119 ms. (333 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40003 steps (224 resets) in 170 ms. (233 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (205 resets) in 171 ms. (232 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (194 resets) in 100 ms. (396 steps per ms) remains 172/172 properties
[2024-06-02 18:30:38] [INFO ] Flow matrix only has 676 transitions (discarded 19 similar events)
// Phase 1: matrix 676 rows 249 cols
[2024-06-02 18:30:38] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 18:30:38] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 123/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 18:30:39] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:30:39] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:30:39] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:30:39] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:30:39] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:30:40] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-06-02 18:30:41] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 18:30:42] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 676/916 variables, 240/262 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 14/276 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 9/925 variables, 9/285 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/925 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 285 constraints, problems are : Problem set: 0 solved, 172 unsolved in 19833 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 123/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 676/916 variables, 240/262 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 14/276 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 163/439 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 9/925 variables, 9/448 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 9/457 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/925 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 457 constraints, problems are : Problem set: 0 solved, 172 unsolved in 68074 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 12/12 constraints]
After SMT, in 88082ms problems are : Problem set: 0 solved, 172 unsolved
Parikh walk visited 0 properties in 30203 ms.
Support contains 117 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 695/695 transitions.
Applied a total of 0 rules in 15 ms. Remains 249 /249 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 249/249 places, 695/695 transitions.
RANDOM walk for 4000000 steps (119511 resets) in 78436 ms. (50 steps per ms) remains 165/172 properties
BEST_FIRST walk for 40004 steps (93 resets) in 146 ms. (272 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (233 resets) in 186 ms. (213 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (84 resets) in 265 ms. (150 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (234 resets) in 255 ms. (156 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (91 resets) in 210 ms. (189 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (240 resets) in 164 ms. (242 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (90 resets) in 201 ms. (198 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (225 resets) in 141 ms. (281 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (90 resets) in 207 ms. (192 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (240 resets) in 221 ms. (180 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (91 resets) in 124 ms. (320 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (238 resets) in 207 ms. (192 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (92 resets) in 145 ms. (274 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (232 resets) in 188 ms. (211 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (91 resets) in 160 ms. (248 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (239 resets) in 139 ms. (285 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (91 resets) in 167 ms. (238 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (240 resets) in 125 ms. (317 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (87 resets) in 136 ms. (291 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (238 resets) in 185 ms. (215 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (94 resets) in 200 ms. (199 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (234 resets) in 183 ms. (217 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (88 resets) in 123 ms. (322 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (237 resets) in 164 ms. (242 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (87 resets) in 117 ms. (339 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (237 resets) in 269 ms. (148 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (92 resets) in 172 ms. (231 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (252 resets) in 192 ms. (207 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (90 resets) in 226 ms. (176 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (229 resets) in 107 ms. (370 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (88 resets) in 229 ms. (173 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (226 resets) in 265 ms. (150 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (90 resets) in 211 ms. (188 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (230 resets) in 193 ms. (206 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (89 resets) in 156 ms. (254 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (230 resets) in 245 ms. (162 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (234 resets) in 251 ms. (158 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (235 resets) in 205 ms. (194 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (249 resets) in 141 ms. (281 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (229 resets) in 211 ms. (188 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (234 resets) in 145 ms. (273 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (216 resets) in 193 ms. (206 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (230 resets) in 184 ms. (216 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (223 resets) in 205 ms. (194 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (227 resets) in 243 ms. (163 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (216 resets) in 153 ms. (259 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (224 resets) in 216 ms. (184 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (91 resets) in 275 ms. (144 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (91 resets) in 208 ms. (191 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (90 resets) in 182 ms. (218 steps per ms) remains 165/165 properties
Interrupted probabilistic random walk after 5272291 steps, run timeout after 69001 ms. (steps per millisecond=76 ) properties seen :37 out of 165
Probabilistic random walk after 5272291 steps, saw 1733268 distinct states, run finished after 69011 ms. (steps per millisecond=76 ) properties seen :37
[2024-06-02 18:34:09] [INFO ] Flow matrix only has 676 transitions (discarded 19 similar events)
[2024-06-02 18:34:09] [INFO ] Invariant cache hit.
[2024-06-02 18:34:09] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 152/235 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 18:34:09] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:34:09] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 4 ms to minimize.
[2024-06-02 18:34:09] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-06-02 18:34:10] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:34:11] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 676/911 variables, 235/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 14/270 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 14/925 variables, 14/284 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/925 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 284 constraints, problems are : Problem set: 0 solved, 128 unsolved in 13433 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 152/235 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 676/911 variables, 235/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 14/270 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 124/394 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 14/925 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 0/925 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 412 constraints, problems are : Problem set: 0 solved, 128 unsolved in 32802 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
After SMT, in 46358ms problems are : Problem set: 0 solved, 128 unsolved
Parikh walk visited 0 properties in 30196 ms.
Support contains 83 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 695/695 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 236 transition count 679
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 236 transition count 679
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 236 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 41 place count 233 transition count 667
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 231 transition count 665
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 231 transition count 665
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 231 transition count 659
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 67 place count 231 transition count 643
Applied a total of 67 rules in 45 ms. Remains 231 /249 variables (removed 18) and now considering 643/695 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 231/249 places, 643/695 transitions.
RANDOM walk for 4000000 steps (124414 resets) in 61340 ms. (65 steps per ms) remains 125/128 properties
BEST_FIRST walk for 40002 steps (93 resets) in 133 ms. (298 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (240 resets) in 108 ms. (367 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (88 resets) in 223 ms. (178 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (227 resets) in 157 ms. (253 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (97 resets) in 189 ms. (210 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (243 resets) in 83 ms. (476 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (98 resets) in 183 ms. (217 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (239 resets) in 144 ms. (275 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (93 resets) in 140 ms. (283 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (248 resets) in 185 ms. (215 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (97 resets) in 136 ms. (292 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (240 resets) in 171 ms. (232 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (240 resets) in 85 ms. (465 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (88 resets) in 94 ms. (421 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (243 resets) in 161 ms. (246 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (86 resets) in 162 ms. (245 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (236 resets) in 119 ms. (333 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (86 resets) in 97 ms. (408 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40001 steps (234 resets) in 162 ms. (245 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (87 resets) in 146 ms. (272 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (239 resets) in 118 ms. (336 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (97 resets) in 205 ms. (194 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (239 resets) in 180 ms. (221 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (234 resets) in 130 ms. (305 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (97 resets) in 224 ms. (177 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (245 resets) in 110 ms. (360 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (86 resets) in 174 ms. (228 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (244 resets) in 172 ms. (231 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (92 resets) in 341 ms. (116 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (248 resets) in 94 ms. (421 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40001 steps (93 resets) in 237 ms. (168 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (231 resets) in 116 ms. (341 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (89 resets) in 143 ms. (277 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (239 resets) in 123 ms. (322 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (240 resets) in 174 ms. (228 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (234 resets) in 179 ms. (222 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (237 resets) in 137 ms. (289 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (235 resets) in 164 ms. (242 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (239 resets) in 84 ms. (470 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (222 resets) in 182 ms. (218 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (87 resets) in 149 ms. (266 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (85 resets) in 164 ms. (242 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (91 resets) in 144 ms. (275 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (240 resets) in 134 ms. (296 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (236 resets) in 179 ms. (222 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (250 resets) in 138 ms. (287 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (248 resets) in 161 ms. (246 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (241 resets) in 123 ms. (322 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40001 steps (245 resets) in 134 ms. (296 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (243 resets) in 156 ms. (254 steps per ms) remains 125/125 properties
Interrupted probabilistic random walk after 4702035 steps, run timeout after 57001 ms. (steps per millisecond=82 ) properties seen :0 out of 125
Probabilistic random walk after 4702035 steps, saw 1550885 distinct states, run finished after 57002 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-02 18:36:41] [INFO ] Flow matrix only has 632 transitions (discarded 11 similar events)
// Phase 1: matrix 632 rows 231 cols
[2024-06-02 18:36:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:36:41] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 136/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 18:36:42] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:36:42] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:36:42] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:36:42] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 4/220 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 18:36:45] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 18:36:46] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 632/852 variables, 220/240 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 73/313 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 11/863 variables, 11/324 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/863 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/863 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 863/863 variables, and 324 constraints, problems are : Problem set: 0 solved, 125 unsolved in 13527 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 231/231 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 136/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 4/220 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 632/852 variables, 220/240 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 73/313 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 121/434 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 11/863 variables, 11/445 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/863 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/863 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 14 (OVERLAPS) 0/863 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 863/863 variables, and 449 constraints, problems are : Problem set: 0 solved, 125 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 231/231 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 10/10 constraints]
After SMT, in 43776ms problems are : Problem set: 0 solved, 125 unsolved
Parikh walk visited 0 properties in 27499 ms.
Support contains 80 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 643/643 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 642
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 642
Applied a total of 2 rules in 13 ms. Remains 230 /231 variables (removed 1) and now considering 642/643 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 230/231 places, 642/643 transitions.
RANDOM walk for 4000000 steps (124733 resets) in 68188 ms. (58 steps per ms) remains 124/125 properties
BEST_FIRST walk for 40003 steps (92 resets) in 104 ms. (380 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (235 resets) in 174 ms. (228 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (95 resets) in 94 ms. (421 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (246 resets) in 203 ms. (196 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (94 resets) in 184 ms. (216 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (252 resets) in 147 ms. (270 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (94 resets) in 128 ms. (310 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (242 resets) in 139 ms. (285 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (95 resets) in 149 ms. (266 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (247 resets) in 156 ms. (254 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (94 resets) in 103 ms. (384 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (241 resets) in 154 ms. (258 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (222 resets) in 165 ms. (240 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (85 resets) in 160 ms. (248 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (238 resets) in 190 ms. (209 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (93 resets) in 182 ms. (218 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (241 resets) in 151 ms. (263 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (92 resets) in 125 ms. (317 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (234 resets) in 115 ms. (344 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (91 resets) in 94 ms. (421 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (255 resets) in 167 ms. (238 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (92 resets) in 209 ms. (190 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (226 resets) in 153 ms. (259 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (257 resets) in 125 ms. (317 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (91 resets) in 171 ms. (232 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (251 resets) in 146 ms. (272 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (88 resets) in 172 ms. (231 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (243 resets) in 176 ms. (226 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (88 resets) in 176 ms. (226 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (251 resets) in 156 ms. (254 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (94 resets) in 174 ms. (228 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (228 resets) in 185 ms. (215 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (89 resets) in 123 ms. (322 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (249 resets) in 202 ms. (197 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (244 resets) in 141 ms. (281 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (260 resets) in 129 ms. (307 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (227 resets) in 119 ms. (333 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (227 resets) in 115 ms. (344 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (227 resets) in 129 ms. (307 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (246 resets) in 163 ms. (243 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (90 resets) in 141 ms. (281 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (91 resets) in 124 ms. (320 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40002 steps (89 resets) in 160 ms. (248 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (232 resets) in 155 ms. (256 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (235 resets) in 155 ms. (256 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (248 resets) in 139 ms. (285 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (237 resets) in 157 ms. (253 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (246 resets) in 115 ms. (344 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (244 resets) in 148 ms. (268 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40004 steps (262 resets) in 157 ms. (253 steps per ms) remains 124/124 properties
Interrupted probabilistic random walk after 4977859 steps, run timeout after 63001 ms. (steps per millisecond=79 ) properties seen :0 out of 124
Probabilistic random walk after 4977859 steps, saw 1625679 distinct states, run finished after 63002 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-02 18:39:17] [INFO ] Flow matrix only has 631 transitions (discarded 11 similar events)
// Phase 1: matrix 631 rows 230 cols
[2024-06-02 18:39:17] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:39:17] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 136/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 18:39:18] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:39:18] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:39:18] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-02 18:39:18] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:39:18] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:39:19] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2024-06-02 18:39:19] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:39:19] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 3/219 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 631/850 variables, 219/237 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 73/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 11/861 variables, 11/321 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 18:39:27] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:39:27] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/861 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 323 constraints, problems are : Problem set: 0 solved, 124 unsolved in 15611 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 136/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 3/219 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 18:39:34] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 631/850 variables, 219/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 73/313 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 120/433 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 11/861 variables, 11/444 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 448 constraints, problems are : Problem set: 0 solved, 124 unsolved in 35965 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 11/11 constraints]
After SMT, in 51704ms problems are : Problem set: 0 solved, 124 unsolved
Fused 124 Parikh solutions to 123 different solutions.
Parikh walk visited 0 properties in 14838 ms.
Support contains 80 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 642/642 transitions.
Applied a total of 0 rules in 9 ms. Remains 230 /230 variables (removed 0) and now considering 642/642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 230/230 places, 642/642 transitions.
RANDOM walk for 4000000 steps (124543 resets) in 58604 ms. (68 steps per ms) remains 123/124 properties
BEST_FIRST walk for 40002 steps (88 resets) in 123 ms. (322 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (237 resets) in 151 ms. (263 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (88 resets) in 124 ms. (320 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (237 resets) in 144 ms. (275 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (89 resets) in 146 ms. (272 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (244 resets) in 117 ms. (339 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (87 resets) in 237 ms. (168 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (243 resets) in 130 ms. (305 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (93 resets) in 119 ms. (333 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (240 resets) in 117 ms. (339 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (92 resets) in 229 ms. (173 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (229 resets) in 122 ms. (325 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (245 resets) in 148 ms. (268 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (88 resets) in 175 ms. (227 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (233 resets) in 111 ms. (357 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (95 resets) in 100 ms. (396 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (239 resets) in 181 ms. (219 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (93 resets) in 162 ms. (245 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (229 resets) in 129 ms. (307 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (91 resets) in 204 ms. (195 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (228 resets) in 118 ms. (336 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (92 resets) in 197 ms. (202 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (231 resets) in 111 ms. (357 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (243 resets) in 84 ms. (470 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (90 resets) in 185 ms. (215 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (243 resets) in 135 ms. (294 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (94 resets) in 116 ms. (341 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (239 resets) in 83 ms. (476 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (90 resets) in 174 ms. (228 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (253 resets) in 107 ms. (370 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (90 resets) in 149 ms. (266 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (239 resets) in 206 ms. (193 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (86 resets) in 204 ms. (195 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (235 resets) in 172 ms. (231 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (239 resets) in 133 ms. (298 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (240 resets) in 93 ms. (425 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (240 resets) in 194 ms. (205 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (229 resets) in 113 ms. (350 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (228 resets) in 112 ms. (354 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (233 resets) in 123 ms. (322 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (93 resets) in 213 ms. (186 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (89 resets) in 188 ms. (211 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (90 resets) in 138 ms. (287 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (247 resets) in 85 ms. (465 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (245 resets) in 125 ms. (317 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (242 resets) in 164 ms. (242 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (238 resets) in 191 ms. (208 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (234 resets) in 151 ms. (263 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (241 resets) in 125 ms. (317 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (247 resets) in 165 ms. (240 steps per ms) remains 123/123 properties
Interrupted probabilistic random walk after 4702955 steps, run timeout after 54001 ms. (steps per millisecond=87 ) properties seen :0 out of 123
Probabilistic random walk after 4702955 steps, saw 1551157 distinct states, run finished after 54001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-02 18:41:36] [INFO ] Flow matrix only has 631 transitions (discarded 11 similar events)
[2024-06-02 18:41:36] [INFO ] Invariant cache hit.
[2024-06-02 18:41:36] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 134/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:41:37] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:41:38] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2024-06-02 18:41:38] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 7/219 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 631/850 variables, 219/235 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 11/861 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/861 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 319 constraints, problems are : Problem set: 0 solved, 123 unsolved in 13581 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 134/212 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 7/219 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 631/850 variables, 219/235 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/850 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/850 variables, 119/427 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:41:54] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 11/861 variables, 11/441 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 445 constraints, problems are : Problem set: 0 solved, 123 unsolved in 52410 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 230/230 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints]
After SMT, in 66114ms problems are : Problem set: 0 solved, 123 unsolved
Parikh walk visited 0 properties in 16488 ms.
Support contains 78 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 642/642 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 641
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 641
Applied a total of 2 rules in 22 ms. Remains 229 /230 variables (removed 1) and now considering 641/642 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 229/230 places, 641/642 transitions.
RANDOM walk for 4000000 steps (124514 resets) in 59428 ms. (67 steps per ms) remains 120/123 properties
BEST_FIRST walk for 40003 steps (95 resets) in 127 ms. (312 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (230 resets) in 122 ms. (325 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (92 resets) in 130 ms. (305 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (232 resets) in 212 ms. (187 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (86 resets) in 181 ms. (219 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (238 resets) in 121 ms. (327 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (89 resets) in 131 ms. (303 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (233 resets) in 206 ms. (193 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (92 resets) in 190 ms. (209 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (228 resets) in 114 ms. (347 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (90 resets) in 109 ms. (363 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (237 resets) in 190 ms. (209 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (231 resets) in 143 ms. (277 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (91 resets) in 136 ms. (292 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (224 resets) in 147 ms. (270 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (92 resets) in 191 ms. (208 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (238 resets) in 156 ms. (254 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (89 resets) in 155 ms. (256 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (246 resets) in 183 ms. (217 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (89 resets) in 140 ms. (283 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (234 resets) in 133 ms. (298 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (89 resets) in 231 ms. (172 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (235 resets) in 109 ms. (363 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (253 resets) in 145 ms. (273 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (91 resets) in 178 ms. (223 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (255 resets) in 161 ms. (246 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (91 resets) in 140 ms. (283 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (241 resets) in 173 ms. (229 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (89 resets) in 130 ms. (305 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (228 resets) in 154 ms. (258 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (92 resets) in 169 ms. (235 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (240 resets) in 120 ms. (330 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (88 resets) in 173 ms. (229 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (246 resets) in 180 ms. (221 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (251 resets) in 173 ms. (229 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (250 resets) in 119 ms. (333 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (231 resets) in 154 ms. (258 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (233 resets) in 127 ms. (312 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (232 resets) in 199 ms. (200 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (236 resets) in 163 ms. (243 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40001 steps (91 resets) in 205 ms. (194 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (90 resets) in 143 ms. (277 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (89 resets) in 161 ms. (246 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (254 resets) in 163 ms. (243 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (251 resets) in 162 ms. (245 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (252 resets) in 128 ms. (310 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (229 resets) in 132 ms. (300 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (233 resets) in 190 ms. (209 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (251 resets) in 86 ms. (459 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40001 steps (227 resets) in 206 ms. (193 steps per ms) remains 120/120 properties
Interrupted probabilistic random walk after 4626674 steps, run timeout after 57001 ms. (steps per millisecond=81 ) properties seen :0 out of 120
Probabilistic random walk after 4626674 steps, saw 1526506 distinct states, run finished after 57001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-02 18:44:15] [INFO ] Flow matrix only has 630 transitions (discarded 11 similar events)
// Phase 1: matrix 630 rows 229 cols
[2024-06-02 18:44:15] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:44:15] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 132/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:44:16] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:44:16] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:44:16] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:44:16] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 10/218 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:44:18] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:44:18] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 630/848 variables, 218/234 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 73/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 11/859 variables, 11/318 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/859 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/859 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 318 constraints, problems are : Problem set: 0 solved, 120 unsolved in 12967 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 132/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 10/218 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:44:30] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 630/848 variables, 218/235 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 73/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 116/424 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 11/859 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/859 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 439 constraints, problems are : Problem set: 0 solved, 120 unsolved in 28790 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 229/229 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints]
After SMT, in 41880ms problems are : Problem set: 0 solved, 120 unsolved
Parikh walk visited 0 properties in 13254 ms.
Support contains 76 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 641/641 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 228 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 640
Applied a total of 2 rules in 18 ms. Remains 228 /229 variables (removed 1) and now considering 640/641 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 228/229 places, 640/641 transitions.
RANDOM walk for 4000000 steps (124650 resets) in 61064 ms. (65 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (95 resets) in 91 ms. (434 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (256 resets) in 156 ms. (254 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (88 resets) in 214 ms. (186 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (237 resets) in 173 ms. (229 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (86 resets) in 143 ms. (277 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (236 resets) in 111 ms. (357 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (87 resets) in 203 ms. (196 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (244 resets) in 154 ms. (258 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (89 resets) in 117 ms. (339 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (252 resets) in 197 ms. (202 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (87 resets) in 177 ms. (224 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (235 resets) in 85 ms. (465 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (234 resets) in 212 ms. (187 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (94 resets) in 141 ms. (281 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (241 resets) in 176 ms. (226 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (87 resets) in 165 ms. (240 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (240 resets) in 134 ms. (296 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (93 resets) in 124 ms. (320 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (232 resets) in 131 ms. (303 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (90 resets) in 160 ms. (248 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (224 resets) in 99 ms. (400 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (93 resets) in 184 ms. (216 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (246 resets) in 105 ms. (377 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (230 resets) in 120 ms. (330 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (92 resets) in 138 ms. (287 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (229 resets) in 123 ms. (322 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (91 resets) in 116 ms. (341 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (244 resets) in 187 ms. (212 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (93 resets) in 192 ms. (207 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (243 resets) in 149 ms. (266 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (90 resets) in 150 ms. (264 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (241 resets) in 77 ms. (512 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (91 resets) in 97 ms. (408 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (235 resets) in 133 ms. (298 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (237 resets) in 175 ms. (227 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (241 resets) in 167 ms. (238 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (218 resets) in 144 ms. (275 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (226 resets) in 155 ms. (256 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (239 resets) in 95 ms. (416 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40001 steps (230 resets) in 205 ms. (194 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (91 resets) in 185 ms. (215 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (91 resets) in 114 ms. (347 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (89 resets) in 125 ms. (317 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (235 resets) in 153 ms. (259 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (235 resets) in 161 ms. (246 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (256 resets) in 202 ms. (197 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40002 steps (238 resets) in 145 ms. (273 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (240 resets) in 126 ms. (314 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40004 steps (237 resets) in 142 ms. (279 steps per ms) remains 120/120 properties
BEST_FIRST walk for 40003 steps (244 resets) in 129 ms. (307 steps per ms) remains 120/120 properties
Interrupted probabilistic random walk after 4490822 steps, run timeout after 54001 ms. (steps per millisecond=83 ) properties seen :0 out of 120
Probabilistic random walk after 4490822 steps, saw 1476163 distinct states, run finished after 54004 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-02 18:46:23] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
// Phase 1: matrix 629 rows 228 cols
[2024-06-02 18:46:23] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:46:23] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 132/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:46:24] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:46:24] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:46:24] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:46:24] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 9/217 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 629/846 variables, 217/231 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 73/304 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 11/857 variables, 11/315 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/857 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/857 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 315 constraints, problems are : Problem set: 0 solved, 120 unsolved in 13494 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 132/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 9/217 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-02 18:46:38] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:46:38] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:46:38] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 629/846 variables, 217/234 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 73/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 116/423 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 11/857 variables, 11/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/857 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/857 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/857 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 438 constraints, problems are : Problem set: 0 solved, 120 unsolved in 32735 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints]
After SMT, in 46359ms problems are : Problem set: 0 solved, 120 unsolved
Parikh walk visited 0 properties in 18107 ms.
Support contains 76 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 640/640 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 228/228 places, 640/640 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2024-06-02 18:47:28] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:47:28] [INFO ] Invariant cache hit.
[2024-06-02 18:47:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:47:28] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:47:28] [INFO ] Invariant cache hit.
[2024-06-02 18:47:28] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 18:47:28] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-06-02 18:47:28] [INFO ] Redundant transitions in 33 ms returned []
Running 632 sub problems to find dead transitions.
[2024-06-02 18:47:28] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:47:28] [INFO ] Invariant cache hit.
[2024-06-02 18:47:28] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 18:47:34] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:47:34] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:47:34] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:47:35] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:47:35] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2024-06-02 18:47:35] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:47:36] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:47:37] [INFO ] Deduced a trap composed of 161 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 18:47:40] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (OVERLAPS) 629/857 variables, 228/249 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 73/322 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/857 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 857/857 variables, and 322 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 629/857 variables, 228/249 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/857 variables, 73/322 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 632/954 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 954 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 11/11 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60786ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61321 ms. Remains : 228/228 places, 640/640 transitions.
RANDOM walk for 400000 steps (12493 resets) in 5846 ms. (68 steps per ms) remains 59/76 properties
Running SMT prover for 59 properties.
[2024-06-02 18:48:31] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:48:31] [INFO ] Invariant cache hit.
[2024-06-02 18:48:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 18:48:31] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :59
[2024-06-02 18:48:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 18:48:32] [INFO ] After 132ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :0 sat :59
TRAPS : Iteration 0
[2024-06-02 18:48:33] [INFO ] After 1904ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:59
[2024-06-02 18:48:33] [INFO ] After 2163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:59
[2024-06-02 18:48:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:48:34] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :59
[2024-06-02 18:48:34] [INFO ] After 154ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :59
TRAPS : Iteration 0
[2024-06-02 18:48:35] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:48:35] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-06-02 18:48:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2024-06-02 18:48:35] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2024-06-02 18:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
TRAPS : Iteration 1
[2024-06-02 18:48:36] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 2
[2024-06-02 18:48:39] [INFO ] After 5630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :59
[2024-06-02 18:48:39] [INFO ] After 5988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :59
RANDOM walk for 4000000 steps (124738 resets) in 55080 ms. (72 steps per ms) remains 117/120 properties
BEST_FIRST walk for 40004 steps (88 resets) in 124 ms. (320 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (243 resets) in 126 ms. (314 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (89 resets) in 156 ms. (254 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (239 resets) in 134 ms. (296 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (88 resets) in 126 ms. (314 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (240 resets) in 183 ms. (217 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (89 resets) in 130 ms. (305 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (243 resets) in 97 ms. (408 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (90 resets) in 162 ms. (245 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (248 resets) in 132 ms. (300 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (87 resets) in 116 ms. (341 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (241 resets) in 107 ms. (370 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (249 resets) in 164 ms. (242 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (92 resets) in 155 ms. (256 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (232 resets) in 80 ms. (493 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (95 resets) in 122 ms. (325 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (245 resets) in 197 ms. (202 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (93 resets) in 202 ms. (197 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (244 resets) in 187 ms. (212 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (89 resets) in 214 ms. (186 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (238 resets) in 149 ms. (266 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (87 resets) in 142 ms. (279 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (240 resets) in 113 ms. (350 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (232 resets) in 163 ms. (243 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (90 resets) in 145 ms. (274 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (244 resets) in 135 ms. (294 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (87 resets) in 169 ms. (235 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (231 resets) in 150 ms. (264 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (92 resets) in 116 ms. (341 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (245 resets) in 158 ms. (251 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (90 resets) in 169 ms. (235 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (235 resets) in 150 ms. (264 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (95 resets) in 207 ms. (192 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (244 resets) in 110 ms. (360 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (240 resets) in 154 ms. (258 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (244 resets) in 142 ms. (279 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (243 resets) in 145 ms. (274 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (242 resets) in 115 ms. (344 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (239 resets) in 144 ms. (275 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (227 resets) in 117 ms. (339 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (90 resets) in 148 ms. (268 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (88 resets) in 122 ms. (325 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (91 resets) in 154 ms. (258 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (247 resets) in 148 ms. (268 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (244 resets) in 110 ms. (360 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (245 resets) in 153 ms. (259 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (260 resets) in 114 ms. (347 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (237 resets) in 141 ms. (281 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (235 resets) in 146 ms. (272 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (247 resets) in 147 ms. (270 steps per ms) remains 117/117 properties
Interrupted probabilistic random walk after 4401088 steps, run timeout after 54001 ms. (steps per millisecond=81 ) properties seen :0 out of 117
Probabilistic random walk after 4401088 steps, saw 1444090 distinct states, run finished after 54001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-02 18:49:51] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:49:51] [INFO ] Invariant cache hit.
[2024-06-02 18:49:51] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 134/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 9/217 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:49:54] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:49:54] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 629/846 variables, 217/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 73/306 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 11/857 variables, 11/317 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/857 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 317 constraints, problems are : Problem set: 0 solved, 117 unsolved in 15122 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 134/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 9/217 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:50:08] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 629/846 variables, 217/234 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 73/307 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 113/420 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 11/857 variables, 11/431 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/857 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/857 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 15 (OVERLAPS) 0/857 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 435 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30430 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints]
After SMT, in 45666ms problems are : Problem set: 0 solved, 117 unsolved
Parikh walk visited 0 properties in 17111 ms.
Support contains 74 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Applied a total of 0 rules in 28 ms. Remains 228 /228 variables (removed 0) and now considering 640/640 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 228/228 places, 640/640 transitions.
RANDOM walk for 4000000 steps (124850 resets) in 55407 ms. (72 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (94 resets) in 124 ms. (320 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (249 resets) in 97 ms. (408 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (95 resets) in 163 ms. (243 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (232 resets) in 77 ms. (512 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (91 resets) in 159 ms. (250 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (232 resets) in 117 ms. (338 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (86 resets) in 192 ms. (207 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (240 resets) in 93 ms. (425 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (89 resets) in 145 ms. (273 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (248 resets) in 113 ms. (350 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (93 resets) in 149 ms. (266 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (237 resets) in 108 ms. (367 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (237 resets) in 168 ms. (236 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (92 resets) in 117 ms. (339 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (244 resets) in 127 ms. (312 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (97 resets) in 179 ms. (222 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (240 resets) in 78 ms. (506 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (92 resets) in 94 ms. (421 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (248 resets) in 124 ms. (320 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (88 resets) in 177 ms. (224 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (241 resets) in 111 ms. (357 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (90 resets) in 233 ms. (170 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (255 resets) in 182 ms. (218 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (251 resets) in 77 ms. (512 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (87 resets) in 160 ms. (248 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (242 resets) in 148 ms. (268 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (89 resets) in 152 ms. (261 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (247 resets) in 157 ms. (253 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (93 resets) in 127 ms. (312 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (243 resets) in 172 ms. (231 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (89 resets) in 126 ms. (314 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (237 resets) in 142 ms. (279 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (89 resets) in 113 ms. (350 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (251 resets) in 198 ms. (201 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (245 resets) in 167 ms. (238 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (234 resets) in 129 ms. (307 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (220 resets) in 94 ms. (421 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (229 resets) in 108 ms. (367 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (245 resets) in 144 ms. (275 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (238 resets) in 140 ms. (283 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (92 resets) in 152 ms. (261 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (92 resets) in 121 ms. (327 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (94 resets) in 110 ms. (360 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (225 resets) in 110 ms. (360 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (252 resets) in 155 ms. (256 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (249 resets) in 115 ms. (344 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (239 resets) in 202 ms. (197 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (254 resets) in 148 ms. (268 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (244 resets) in 143 ms. (277 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (236 resets) in 115 ms. (344 steps per ms) remains 117/117 properties
Interrupted probabilistic random walk after 4270390 steps, run timeout after 51001 ms. (steps per millisecond=83 ) properties seen :0 out of 117
Probabilistic random walk after 4270390 steps, saw 1399856 distinct states, run finished after 51001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-02 18:52:03] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:52:03] [INFO ] Invariant cache hit.
[2024-06-02 18:52:03] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 134/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:52:03] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:52:03] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:52:04] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:52:04] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 9/217 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:52:05] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-02 18:52:05] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 629/846 variables, 217/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 73/306 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 11/857 variables, 11/317 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/857 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 317 constraints, problems are : Problem set: 0 solved, 117 unsolved in 14998 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 134/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 9/217 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:52:19] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 629/846 variables, 217/234 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 73/307 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 113/420 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 11/857 variables, 11/431 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/857 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/857 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 15 (OVERLAPS) 0/857 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 435 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30222 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints]
After SMT, in 45331ms problems are : Problem set: 0 solved, 117 unsolved
Parikh walk visited 0 properties in 13228 ms.
Support contains 74 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Applied a total of 0 rules in 17 ms. Remains 228 /228 variables (removed 0) and now considering 640/640 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 228/228 places, 640/640 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2024-06-02 18:53:01] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:53:01] [INFO ] Invariant cache hit.
[2024-06-02 18:53:01] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:53:01] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:53:01] [INFO ] Invariant cache hit.
[2024-06-02 18:53:01] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 18:53:02] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-06-02 18:53:02] [INFO ] Redundant transitions in 8 ms returned []
Running 632 sub problems to find dead transitions.
[2024-06-02 18:53:02] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:53:02] [INFO ] Invariant cache hit.
[2024-06-02 18:53:02] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:53:09] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2024-06-02 18:53:09] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:53:09] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:53:10] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2024-06-02 18:53:10] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:53:11] [INFO ] Deduced a trap composed of 161 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 18:53:14] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (OVERLAPS) 629/857 variables, 228/249 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 73/322 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/857 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 857/857 variables, and 322 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 629/857 variables, 228/249 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/857 variables, 73/322 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 632/954 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 954 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 11/11 constraints]
After SMT, in 60826ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60832ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61370 ms. Remains : 228/228 places, 640/640 transitions.
RANDOM walk for 400000 steps (12486 resets) in 3725 ms. (107 steps per ms) remains 58/74 properties
Running SMT prover for 58 properties.
[2024-06-02 18:54:04] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:54:04] [INFO ] Invariant cache hit.
[2024-06-02 18:54:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 18:54:04] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :58
[2024-06-02 18:54:04] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 18:54:04] [INFO ] After 151ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :0 sat :58
TRAPS : Iteration 0
[2024-06-02 18:54:06] [INFO ] After 1841ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:58
[2024-06-02 18:54:06] [INFO ] After 2078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:58
[2024-06-02 18:54:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:54:06] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :58
[2024-06-02 18:54:06] [INFO ] After 155ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :58
TRAPS : Iteration 0
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:54:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
TRAPS : Iteration 1
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
TRAPS : Iteration 2
[2024-06-02 18:54:11] [INFO ] After 5332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :58
[2024-06-02 18:54:11] [INFO ] After 5697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :58
RANDOM walk for 71 steps (1 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1224 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (241 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 943286 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 1
Probabilistic random walk after 943286 steps, saw 302405 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
[2024-06-02 18:54:15] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
[2024-06-02 18:54:15] [INFO ] Invariant cache hit.
[2024-06-02 18:54:15] [INFO ] State equation strengthened by 73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/857 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/857 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/857 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 0 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 629/842 variables, 213/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 73/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/857 variables, 15/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/857 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/857 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 214 transition count 620
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 211 transition count 602
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 209 transition count 598
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 209 transition count 598
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 207 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 207 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 205 transition count 588
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 205 transition count 588
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 203 transition count 582
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 203 transition count 582
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 578
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 199 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 199 transition count 572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 197 transition count 568
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 197 transition count 568
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 195 transition count 562
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 195 transition count 562
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 193 transition count 558
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 193 transition count 558
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 191 transition count 554
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 191 transition count 554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 189 transition count 550
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 189 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 189 transition count 548
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 87 place count 189 transition count 541
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 94 place count 182 transition count 541
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 178 transition count 537
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 178 transition count 537
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 178 transition count 534
Applied a total of 105 rules in 61 ms. Remains 178 /228 variables (removed 50) and now considering 534/640 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 178/228 places, 534/640 transitions.
RANDOM walk for 40000 steps (1337 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (261 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1198200 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :0 out of 1
Probabilistic random walk after 1198200 steps, saw 341763 distinct states, run finished after 3001 ms. (steps per millisecond=399 ) properties seen :0
[2024-06-02 18:54:19] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
// Phase 1: matrix 523 rows 178 cols
[2024-06-02 18:54:19] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:54:19] [INFO ] State equation strengthened by 98 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:54:19] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 523/689 variables, 166/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 98/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/701 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/701 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/701 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:54:19] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:54:19] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 523/689 variables, 166/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/701 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/701 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/701 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 701/701 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 178/178 places, 534/534 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2024-06-02 18:54:19] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
[2024-06-02 18:54:19] [INFO ] Invariant cache hit.
[2024-06-02 18:54:19] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:54:19] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
[2024-06-02 18:54:19] [INFO ] Invariant cache hit.
[2024-06-02 18:54:20] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 18:54:20] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-06-02 18:54:20] [INFO ] Redundant transitions in 4 ms returned []
Running 526 sub problems to find dead transitions.
[2024-06-02 18:54:20] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
[2024-06-02 18:54:20] [INFO ] Invariant cache hit.
[2024-06-02 18:54:20] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:54:24] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:54:25] [INFO ] Deduced a trap composed of 122 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (OVERLAPS) 523/701 variables, 178/195 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 98/293 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (OVERLAPS) 0/701 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 526 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 293 constraints, problems are : Problem set: 0 solved, 526 unsolved in 21659 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 526 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 132 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (OVERLAPS) 523/701 variables, 178/197 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 98/295 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 526/821 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 821 constraints, problems are : Problem set: 0 solved, 526 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 9/9 constraints]
After SMT, in 52220ms problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 52225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52753 ms. Remains : 178/178 places, 534/534 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 178 vertex of which 29 / 178 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 356
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 356
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 150 transition count 341
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 24 place count 149 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 149 transition count 313
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 149 transition count 307
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 143 transition count 304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 143 transition count 301
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 140 transition count 301
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 3 with 2 rules applied. Total rules applied 74 place count 139 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 139 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 3 with 2 rules applied. Total rules applied 77 place count 138 transition count 298
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 137 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 137 transition count 260
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 137 transition count 257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 134 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 134 transition count 251
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 134 transition count 248
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 131 transition count 248
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 131 transition count 248
Applied a total of 103 rules in 57 ms. Remains 131 /178 variables (removed 47) and now considering 248/534 (removed 286) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:55:12] [INFO ] Flow matrix only has 244 transitions (discarded 4 similar events)
// Phase 1: matrix 244 rows 131 cols
[2024-06-02 18:55:12] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:55:12] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 18:55:12] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:55:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:55:12] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:55:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:55:12] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:55:12] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:55:12] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 280 ms.
RANDOM walk for 147 steps (2 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1244 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (248 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 875695 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 1
Probabilistic random walk after 875695 steps, saw 288147 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
[2024-06-02 18:55:15] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
// Phase 1: matrix 629 rows 228 cols
[2024-06-02 18:55:15] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 18:55:15] [INFO ] State equation strengthened by 73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:55:16] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:55:16] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/857 variables, 15/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/857 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/857 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/857 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/857 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 214 transition count 620
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 208 transition count 596
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 206 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 206 transition count 590
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 204 transition count 586
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 204 transition count 586
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 580
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 580
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 200 transition count 576
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 200 transition count 576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 198 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 198 transition count 570
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 196 transition count 566
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 196 transition count 566
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 194 transition count 560
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 194 transition count 560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 192 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 192 transition count 556
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 190 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 190 transition count 552
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 188 transition count 548
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 188 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 188 transition count 546
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 89 place count 188 transition count 539
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 96 place count 181 transition count 539
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 177 transition count 535
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 177 transition count 535
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 177 transition count 532
Applied a total of 107 rules in 63 ms. Remains 177 /228 variables (removed 51) and now considering 532/640 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 177/228 places, 532/640 transitions.
RANDOM walk for 40000 steps (1324 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (265 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1155041 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :0 out of 1
Probabilistic random walk after 1155041 steps, saw 328595 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :0
[2024-06-02 18:55:19] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
// Phase 1: matrix 521 rows 177 cols
[2024-06-02 18:55:19] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:55:19] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:55:19] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:55:19] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 521/686 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 98/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/698 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/698 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:55:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-06-02 18:55:20] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 521/686 variables, 165/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 98/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/698 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/698 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 532/532 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 177/177 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 532/532 transitions.
Applied a total of 0 rules in 6 ms. Remains 177 /177 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2024-06-02 18:55:20] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-02 18:55:20] [INFO ] Invariant cache hit.
[2024-06-02 18:55:20] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:55:20] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-02 18:55:20] [INFO ] Invariant cache hit.
[2024-06-02 18:55:20] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 18:55:20] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-06-02 18:55:20] [INFO ] Redundant transitions in 3 ms returned []
Running 524 sub problems to find dead transitions.
[2024-06-02 18:55:20] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-02 18:55:20] [INFO ] Invariant cache hit.
[2024-06-02 18:55:20] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-02 18:55:24] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:55:24] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:55:25] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:55:25] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:55:25] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-06-02 18:55:25] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:55:26] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 521/698 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 98/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 0/698 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 292 constraints, problems are : Problem set: 0 solved, 524 unsolved in 20860 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 521/698 variables, 177/194 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 98/292 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 524/816 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/698 variables, and 816 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 7/7 constraints]
After SMT, in 51523ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 51529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52050 ms. Remains : 177/177 places, 532/532 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 177 vertex of which 29 / 177 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 354
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 149 transition count 339
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 24 place count 148 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 148 transition count 311
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 148 transition count 305
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 142 transition count 302
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 142 transition count 299
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 139 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 3 with 2 rules applied. Total rules applied 74 place count 138 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 138 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 3 with 2 rules applied. Total rules applied 77 place count 137 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 136 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 136 transition count 258
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 136 transition count 255
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 133 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 133 transition count 249
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 133 transition count 246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 130 transition count 246
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 130 transition count 246
Applied a total of 103 rules in 44 ms. Remains 130 /177 variables (removed 47) and now considering 246/532 (removed 286) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:56:12] [INFO ] Flow matrix only has 242 transitions (discarded 4 similar events)
// Phase 1: matrix 242 rows 130 cols
[2024-06-02 18:56:12] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:56:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:12] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:56:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:56:12] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:56:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:56:12] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:56:12] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:56:12] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 251 ms.
RANDOM walk for 40000 steps (1217 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (226 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 858332 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 1
Probabilistic random walk after 858332 steps, saw 283131 distinct states, run finished after 3002 ms. (steps per millisecond=285 ) properties seen :0
[2024-06-02 18:56:15] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
// Phase 1: matrix 629 rows 228 cols
[2024-06-02 18:56:15] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:56:15] [INFO ] State equation strengthened by 73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:56:15] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:56:15] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/857 variables, 15/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/857 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/857 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/857 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/857 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 214 transition count 620
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 205 transition count 587
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 203 transition count 583
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 203 transition count 583
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 577
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 577
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 199 transition count 573
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 199 transition count 573
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 197 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 197 transition count 567
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 195 transition count 563
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 195 transition count 563
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 193 transition count 557
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 193 transition count 557
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 191 transition count 553
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 191 transition count 553
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 189 transition count 549
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 189 transition count 549
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 187 transition count 545
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 187 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 187 transition count 543
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 91 place count 187 transition count 536
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 98 place count 180 transition count 536
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 176 transition count 532
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 176 transition count 532
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 176 transition count 529
Applied a total of 109 rules in 87 ms. Remains 176 /228 variables (removed 52) and now considering 529/640 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 176/228 places, 529/640 transitions.
RANDOM walk for 40000 steps (1380 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (252 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1126462 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :0 out of 1
Probabilistic random walk after 1126462 steps, saw 318292 distinct states, run finished after 3002 ms. (steps per millisecond=375 ) properties seen :0
[2024-06-02 18:56:19] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
// Phase 1: matrix 518 rows 176 cols
[2024-06-02 18:56:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:56:19] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:56:19] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 518/682 variables, 164/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 97/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/694 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/694 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:56:19] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:56:19] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 518/682 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 97/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/694 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/694 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 694/694 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 529/529 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 176/176 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 529/529 transitions.
Applied a total of 0 rules in 9 ms. Remains 176 /176 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-06-02 18:56:20] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-02 18:56:20] [INFO ] Invariant cache hit.
[2024-06-02 18:56:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:56:20] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-02 18:56:20] [INFO ] Invariant cache hit.
[2024-06-02 18:56:20] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 18:56:20] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-06-02 18:56:20] [INFO ] Redundant transitions in 5 ms returned []
Running 521 sub problems to find dead transitions.
[2024-06-02 18:56:20] [INFO ] Flow matrix only has 518 transitions (discarded 11 similar events)
[2024-06-02 18:56:20] [INFO ] Invariant cache hit.
[2024-06-02 18:56:20] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-02 18:56:24] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:56:24] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:56:24] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:56:24] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:56:24] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 122 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:56:26] [INFO ] Deduced a trap composed of 130 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (OVERLAPS) 518/694 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 97/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (OVERLAPS) 0/694 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 293 constraints, problems are : Problem set: 0 solved, 521 unsolved in 21380 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-02 18:56:44] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (OVERLAPS) 518/694 variables, 176/197 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 97/294 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 521/815 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 694/694 variables, and 815 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 11/11 constraints]
After SMT, in 51990ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 51995ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52448 ms. Remains : 176/176 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 118 edges and 176 vertex of which 29 / 176 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 351
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 148 transition count 336
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 24 place count 147 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 147 transition count 308
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 147 transition count 302
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 141 transition count 299
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 141 transition count 296
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 138 transition count 296
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 3 with 2 rules applied. Total rules applied 74 place count 137 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 137 transition count 294
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 3 with 2 rules applied. Total rules applied 77 place count 136 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 135 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 135 transition count 256
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 135 transition count 253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 132 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 132 transition count 247
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 132 transition count 244
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 129 transition count 244
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 129 transition count 244
Applied a total of 103 rules in 56 ms. Remains 129 /176 variables (removed 47) and now considering 244/529 (removed 285) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:57:12] [INFO ] Flow matrix only has 240 transitions (discarded 4 similar events)
// Phase 1: matrix 240 rows 129 cols
[2024-06-02 18:57:12] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:57:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:57:12] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:57:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:57:12] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:57:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 18:57:12] [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:57:12] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:57:12] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 303 ms.
RANDOM walk for 40000 steps (1260 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (237 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 896006 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 1
Probabilistic random walk after 896006 steps, saw 293719 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2024-06-02 18:57:15] [INFO ] Flow matrix only has 629 transitions (discarded 11 similar events)
// Phase 1: matrix 629 rows 228 cols
[2024-06-02 18:57:15] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:57:15] [INFO ] State equation strengthened by 73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:57:15] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:57:16] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/857 variables, 15/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/857 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/857 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 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) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/213 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 629/842 variables, 213/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 73/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/857 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/857 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 640/640 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 214 transition count 620
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 214 transition count 620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 211 transition count 602
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 211 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 208 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 208 transition count 596
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 205 transition count 587
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 205 transition count 587
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 202 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 202 transition count 581
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 200 transition count 575
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 200 transition count 575
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 198 transition count 571
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 198 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 196 transition count 565
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 196 transition count 565
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 194 transition count 561
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 194 transition count 561
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 192 transition count 555
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 192 transition count 555
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 190 transition count 551
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 190 transition count 551
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 188 transition count 547
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 188 transition count 547
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 186 transition count 543
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 186 transition count 543
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 186 transition count 541
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 93 place count 186 transition count 534
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 100 place count 179 transition count 534
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 175 transition count 530
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 175 transition count 530
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 175 transition count 527
Applied a total of 111 rules in 47 ms. Remains 175 /228 variables (removed 53) and now considering 527/640 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 175/228 places, 527/640 transitions.
RANDOM walk for 40000 steps (1364 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (254 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
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-20, 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-171734905900202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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