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.r166-smll-171636274400112.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 EisenbergMcGuire-PT-07, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274400112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 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 1716481706312

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 16:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:28:28] [INFO ] Load time of PNML (sax parser for PT used): 456 ms
[2024-05-23 16:28:28] [INFO ] Transformed 553 places.
[2024-05-23 16:28:28] [INFO ] Transformed 1960 transitions.
[2024-05-23 16:28:28] [INFO ] Found NUPN structural information;
[2024-05-23 16:28:28] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 805 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 546 transition count 1799
Deduced a syphon composed of 154 places in 20 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 392 transition count 1799
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 350 transition count 1757
Applied a total of 406 rules in 268 ms. Remains 350 /553 variables (removed 203) and now considering 1757/1960 (removed 203) transitions.
[2024-05-23 16:28:29] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
// Phase 1: matrix 798 rows 350 cols
[2024-05-23 16:28:29] [INFO ] Computed 22 invariants in 34 ms
[2024-05-23 16:28:30] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-23 16:28:30] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-05-23 16:28:30] [INFO ] Invariant cache hit.
[2024-05-23 16:28:30] [INFO ] State equation strengthened by 472 read => feed constraints.
[2024-05-23 16:28:33] [INFO ] Implicit Places using invariants and state equation in 3091 ms returned []
Implicit Place search using SMT with State Equation took 4201 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2024-05-23 16:28:33] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-05-23 16:28:33] [INFO ] Invariant cache hit.
[2024-05-23 16:28:33] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-05-23 16:28:52] [INFO ] Deduced a trap composed of 3 places in 510 ms of which 43 ms to minimize.
[2024-05-23 16:28:52] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 3 ms to minimize.
[2024-05-23 16:28:53] [INFO ] Deduced a trap composed of 3 places in 718 ms of which 15 ms to minimize.
[2024-05-23 16:28:53] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:28:53] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:28:53] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 3 ms to minimize.
[2024-05-23 16:28:54] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 20 ms to minimize.
[2024-05-23 16:28:59] [INFO ] Deduced a trap composed of 119 places in 342 ms of which 8 ms to minimize.
[2024-05-23 16:28:59] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 3 ms to minimize.
[2024-05-23 16:28:59] [INFO ] Deduced a trap composed of 92 places in 330 ms of which 3 ms to minimize.
[2024-05-23 16:29:00] [INFO ] Deduced a trap composed of 78 places in 329 ms of which 4 ms to minimize.
[2024-05-23 16:29:00] [INFO ] Deduced a trap composed of 87 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:29:00] [INFO ] Deduced a trap composed of 81 places in 334 ms of which 4 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 3 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 65 places in 333 ms of which 3 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 107 places in 326 ms of which 4 ms to minimize.
[2024-05-23 16:29:02] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 4 ms to minimize.
[2024-05-23 16:29:02] [INFO ] Deduced a trap composed of 75 places in 299 ms of which 3 ms to minimize.
[2024-05-23 16:29:02] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 4 ms to minimize.
[2024-05-23 16:29:03] [INFO ] Deduced a trap composed of 78 places in 351 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 392 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30088 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 1750/1750 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-05-23 16:29:13] [INFO ] Deduced a trap composed of 94 places in 298 ms of which 3 ms to minimize.
[2024-05-23 16:29:13] [INFO ] Deduced a trap composed of 85 places in 285 ms of which 4 ms to minimize.
[2024-05-23 16:29:13] [INFO ] Deduced a trap composed of 80 places in 301 ms of which 4 ms to minimize.
[2024-05-23 16:29:14] [INFO ] Deduced a trap composed of 82 places in 349 ms of which 4 ms to minimize.
[2024-05-23 16:29:14] [INFO ] Deduced a trap composed of 91 places in 347 ms of which 4 ms to minimize.
[2024-05-23 16:29:14] [INFO ] Deduced a trap composed of 96 places in 335 ms of which 4 ms to minimize.
[2024-05-23 16:29:15] [INFO ] Deduced a trap composed of 63 places in 316 ms of which 4 ms to minimize.
[2024-05-23 16:29:15] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 4 ms to minimize.
[2024-05-23 16:29:16] [INFO ] Deduced a trap composed of 69 places in 342 ms of which 4 ms to minimize.
[2024-05-23 16:29:16] [INFO ] Deduced a trap composed of 83 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:29:16] [INFO ] Deduced a trap composed of 46 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:29:17] [INFO ] Deduced a trap composed of 83 places in 325 ms of which 3 ms to minimize.
[2024-05-23 16:29:17] [INFO ] Deduced a trap composed of 83 places in 302 ms of which 4 ms to minimize.
[2024-05-23 16:29:17] [INFO ] Deduced a trap composed of 67 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:29:18] [INFO ] Deduced a trap composed of 64 places in 301 ms of which 6 ms to minimize.
[2024-05-23 16:29:18] [INFO ] Deduced a trap composed of 69 places in 321 ms of which 4 ms to minimize.
[2024-05-23 16:29:18] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 6 ms to minimize.
[2024-05-23 16:29:19] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:29:19] [INFO ] Deduced a trap composed of 86 places in 321 ms of which 3 ms to minimize.
[2024-05-23 16:29:19] [INFO ] Deduced a trap composed of 75 places in 303 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2024-05-23 16:29:26] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 4 ms to minimize.
[2024-05-23 16:29:26] [INFO ] Deduced a trap composed of 91 places in 332 ms of which 4 ms to minimize.
[2024-05-23 16:29:26] [INFO ] Deduced a trap composed of 81 places in 323 ms of which 3 ms to minimize.
[2024-05-23 16:29:27] [INFO ] Deduced a trap composed of 88 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:29:27] [INFO ] Deduced a trap composed of 82 places in 299 ms of which 4 ms to minimize.
[2024-05-23 16:29:27] [INFO ] Deduced a trap composed of 66 places in 321 ms of which 3 ms to minimize.
[2024-05-23 16:29:28] [INFO ] Deduced a trap composed of 85 places in 345 ms of which 3 ms to minimize.
[2024-05-23 16:29:28] [INFO ] Deduced a trap composed of 91 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:29:29] [INFO ] Deduced a trap composed of 86 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:29:29] [INFO ] Deduced a trap composed of 77 places in 361 ms of which 4 ms to minimize.
[2024-05-23 16:29:29] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 5 ms to minimize.
[2024-05-23 16:29:30] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:29:30] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:29:30] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:29:31] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 4 ms to minimize.
[2024-05-23 16:29:31] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 31 ms to minimize.
[2024-05-23 16:29:31] [INFO ] Deduced a trap composed of 101 places in 278 ms of which 4 ms to minimize.
[2024-05-23 16:29:32] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:29:32] [INFO ] Deduced a trap composed of 89 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:29:32] [INFO ] Deduced a trap composed of 77 places in 282 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1148 variables, and 432 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30061 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 0/1750 constraints, Known Traps: 60/60 constraints]
After SMT, in 61806ms problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 61872ms
Starting structural reductions in LIVENESS mode, iteration 1 : 350/553 places, 1757/1960 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 66427 ms. Remains : 350/553 places, 1757/1960 transitions.
Initial state reduction rules removed 7 formulas.
RANDOM walk for 40000 steps (8 resets) in 8501 ms. (4 steps per ms) remains 1392/1750 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1392/1392 properties
[2024-05-23 16:29:38] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-05-23 16:29:38] [INFO ] Invariant cache hit.
[2024-05-23 16:29:38] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 263/263 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
SMT process timed out in 6346ms, After SMT, problems are : Problem set: 0 solved, 1392 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 263 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Applied a total of 0 rules in 241 ms. Remains 350 /350 variables (removed 0) and now considering 1757/1757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 350/350 places, 1757/1757 transitions.
RANDOM walk for 1133540 steps (0 resets) in 120004 ms. (9 steps per ms) remains 1366/1392 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1365/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1365/1365 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1365/1365 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1365/1365 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1364/1365 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1363/1364 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1363/1363 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1363/1363 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1361/1363 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1361/1361 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1360/1361 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1360/1360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1359/1360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1359/1359 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1358/1359 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1357/1358 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1354/1357 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1354/1354 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1353/1354 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1353/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1351/1353 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1350/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1348/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1345/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1340/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1337/1340 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1336/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1336/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1336 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1335/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1335 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1331/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1330/1331 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1327/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1326/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1325/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1324/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1323/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1323/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 1320/1323 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1320/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1320 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1318/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1318/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1317/1318 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1317/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1316/1317 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1316/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1316 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1315/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1314/1314 properties
Probabilistic random walk after 1000000 steps, saw 578750 distinct states, run finished after 59561 ms. (steps per millisecond=16 ) properties seen :337
[2024-05-23 16:31:22] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2024-05-23 16:31:22] [INFO ] Invariant cache hit.
[2024-05-23 16:31:22] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 3 (OVERLAPS) 180/350 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 180/365 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 977 unsolved
[2024-05-23 16:31:46] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 6 ms to minimize.
[2024-05-23 16:31:47] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2024-05-23 16:31:47] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 3 ms to minimize.
[2024-05-23 16:31:47] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 4 ms to minimize.
[2024-05-23 16:31:47] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 4 ms to minimize.
[2024-05-23 16:31:49] [INFO ] Deduced a trap composed of 76 places in 342 ms of which 6 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 99 places in 475 ms of which 6 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 102 places in 396 ms of which 5 ms to minimize.
[2024-05-23 16:31:51] [INFO ] Deduced a trap composed of 83 places in 509 ms of which 5 ms to minimize.
[2024-05-23 16:31:51] [INFO ] Deduced a trap composed of 73 places in 396 ms of which 4 ms to minimize.
[2024-05-23 16:31:52] [INFO ] Deduced a trap composed of 51 places in 462 ms of which 18 ms to minimize.
[2024-05-23 16:31:52] [INFO ] Deduced a trap composed of 105 places in 384 ms of which 5 ms to minimize.
[2024-05-23 16:31:53] [INFO ] Deduced a trap composed of 96 places in 391 ms of which 5 ms to minimize.
[2024-05-23 16:31:53] [INFO ] Deduced a trap composed of 93 places in 391 ms of which 5 ms to minimize.
[2024-05-23 16:31:54] [INFO ] Deduced a trap composed of 87 places in 388 ms of which 5 ms to minimize.
[2024-05-23 16:31:54] [INFO ] Deduced a trap composed of 95 places in 387 ms of which 5 ms to minimize.
[2024-05-23 16:31:54] [INFO ] Deduced a trap composed of 95 places in 378 ms of which 5 ms to minimize.
[2024-05-23 16:31:55] [INFO ] Deduced a trap composed of 73 places in 388 ms of which 5 ms to minimize.
[2024-05-23 16:31:55] [INFO ] Deduced a trap composed of 86 places in 374 ms of which 3 ms to minimize.
[2024-05-23 16:31:56] [INFO ] Deduced a trap composed of 3 places in 459 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 977 unsolved
[2024-05-23 16:32:06] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 4 ms to minimize.
[2024-05-23 16:32:07] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 394 constraints, problems are : Problem set: 0 solved, 977 unsolved in 45032 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 977/977 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 977 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 3 (OVERLAPS) 180/350 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 180/365 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 22/394 constraints. Problems are: Problem set: 0 solved, 977 unsolved
[2024-05-23 16:32:20] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 5 ms to minimize.
[2024-05-23 16:32:21] [INFO ] Deduced a trap composed of 26 places in 481 ms of which 5 ms to minimize.
[2024-05-23 16:32:21] [INFO ] Deduced a trap composed of 27 places in 507 ms of which 5 ms to minimize.
[2024-05-23 16:32:22] [INFO ] Deduced a trap composed of 16 places in 488 ms of which 5 ms to minimize.
[2024-05-23 16:32:22] [INFO ] Deduced a trap composed of 3 places in 461 ms of which 5 ms to minimize.
[2024-05-23 16:32:23] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 5 ms to minimize.
[2024-05-23 16:32:23] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:32:23] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:32:24] [INFO ] Deduced a trap composed of 82 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:32:24] [INFO ] Deduced a trap composed of 121 places in 365 ms of which 4 ms to minimize.
[2024-05-23 16:32:24] [INFO ] Deduced a trap composed of 117 places in 315 ms of which 4 ms to minimize.
[2024-05-23 16:32:25] [INFO ] Deduced a trap composed of 85 places in 372 ms of which 4 ms to minimize.
[2024-05-23 16:32:25] [INFO ] Deduced a trap composed of 99 places in 384 ms of which 5 ms to minimize.
[2024-05-23 16:32:26] [INFO ] Deduced a trap composed of 109 places in 412 ms of which 5 ms to minimize.
[2024-05-23 16:32:28] [INFO ] Deduced a trap composed of 82 places in 501 ms of which 5 ms to minimize.
[2024-05-23 16:32:28] [INFO ] Deduced a trap composed of 80 places in 493 ms of which 5 ms to minimize.
[2024-05-23 16:32:29] [INFO ] Deduced a trap composed of 66 places in 485 ms of which 5 ms to minimize.
[2024-05-23 16:32:30] [INFO ] Deduced a trap composed of 57 places in 536 ms of which 5 ms to minimize.
[2024-05-23 16:32:30] [INFO ] Deduced a trap composed of 3 places in 535 ms of which 5 ms to minimize.
[2024-05-23 16:32:31] [INFO ] Deduced a trap composed of 64 places in 499 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 977 unsolved
[2024-05-23 16:32:33] [INFO ] Deduced a trap composed of 73 places in 476 ms of which 6 ms to minimize.
[2024-05-23 16:32:33] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 3 ms to minimize.
[2024-05-23 16:32:33] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:32:33] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:32:33] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-23 16:32:34] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:32:34] [INFO ] Deduced a trap composed of 3 places in 571 ms of which 6 ms to minimize.
[2024-05-23 16:32:35] [INFO ] Deduced a trap composed of 92 places in 552 ms of which 6 ms to minimize.
[2024-05-23 16:32:35] [INFO ] Deduced a trap composed of 76 places in 576 ms of which 6 ms to minimize.
[2024-05-23 16:32:36] [INFO ] Deduced a trap composed of 99 places in 559 ms of which 6 ms to minimize.
[2024-05-23 16:32:36] [INFO ] Deduced a trap composed of 76 places in 525 ms of which 6 ms to minimize.
[2024-05-23 16:32:37] [INFO ] Deduced a trap composed of 74 places in 457 ms of which 5 ms to minimize.
[2024-05-23 16:32:37] [INFO ] Deduced a trap composed of 78 places in 466 ms of which 5 ms to minimize.
[2024-05-23 16:32:38] [INFO ] Deduced a trap composed of 93 places in 493 ms of which 5 ms to minimize.
[2024-05-23 16:32:38] [INFO ] Deduced a trap composed of 70 places in 471 ms of which 5 ms to minimize.
[2024-05-23 16:32:39] [INFO ] Deduced a trap composed of 69 places in 474 ms of which 5 ms to minimize.
[2024-05-23 16:32:39] [INFO ] Deduced a trap composed of 62 places in 480 ms of which 5 ms to minimize.
[2024-05-23 16:32:40] [INFO ] Deduced a trap composed of 51 places in 396 ms of which 5 ms to minimize.
[2024-05-23 16:32:40] [INFO ] Deduced a trap composed of 93 places in 414 ms of which 4 ms to minimize.
[2024-05-23 16:32:41] [INFO ] Deduced a trap composed of 79 places in 527 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 977 unsolved
[2024-05-23 16:32:44] [INFO ] Deduced a trap composed of 96 places in 505 ms of which 5 ms to minimize.
[2024-05-23 16:32:45] [INFO ] Deduced a trap composed of 76 places in 532 ms of which 5 ms to minimize.
[2024-05-23 16:32:45] [INFO ] Deduced a trap composed of 103 places in 551 ms of which 6 ms to minimize.
[2024-05-23 16:32:46] [INFO ] Deduced a trap composed of 80 places in 532 ms of which 6 ms to minimize.
[2024-05-23 16:32:46] [INFO ] Deduced a trap composed of 69 places in 534 ms of which 6 ms to minimize.
[2024-05-23 16:32:47] [INFO ] Deduced a trap composed of 76 places in 513 ms of which 6 ms to minimize.
[2024-05-23 16:32:48] [INFO ] Deduced a trap composed of 84 places in 546 ms of which 6 ms to minimize.
[2024-05-23 16:32:48] [INFO ] Deduced a trap composed of 99 places in 393 ms of which 3 ms to minimize.
[2024-05-23 16:32:49] [INFO ] Deduced a trap composed of 78 places in 517 ms of which 7 ms to minimize.
[2024-05-23 16:32:49] [INFO ] Deduced a trap composed of 63 places in 538 ms of which 5 ms to minimize.
[2024-05-23 16:32:50] [INFO ] Deduced a trap composed of 66 places in 509 ms of which 5 ms to minimize.
[2024-05-23 16:32:51] [INFO ] Deduced a trap composed of 87 places in 530 ms of which 7 ms to minimize.
[2024-05-23 16:32:52] [INFO ] Deduced a trap composed of 83 places in 534 ms of which 5 ms to minimize.
[2024-05-23 16:32:52] [INFO ] Deduced a trap composed of 71 places in 482 ms of which 5 ms to minimize.
[2024-05-23 16:32:53] [INFO ] Deduced a trap composed of 88 places in 479 ms of which 5 ms to minimize.
SMT process timed out in 90975ms, After SMT, problems are : Problem set: 0 solved, 977 unsolved
Fused 977 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 170 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 342 transition count 1701
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 342 transition count 1701
Applied a total of 16 rules in 161 ms. Remains 342 /350 variables (removed 8) and now considering 1701/1757 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 342/350 places, 1701/1757 transitions.
RANDOM walk for 1554931 steps (4 resets) in 120004 ms. (12 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 977/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 975/977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 974/974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 974/974 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 54853 ms. (steps per millisecond=18 ) properties seen :22
[2024-05-23 16:34:19] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-05-23 16:34:19] [INFO ] Computed 22 invariants in 7 ms
[2024-05-23 16:34:20] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:34:47] [INFO ] Deduced a trap composed of 50 places in 527 ms of which 6 ms to minimize.
[2024-05-23 16:34:48] [INFO ] Deduced a trap composed of 72 places in 503 ms of which 6 ms to minimize.
[2024-05-23 16:34:48] [INFO ] Deduced a trap composed of 3 places in 522 ms of which 5 ms to minimize.
[2024-05-23 16:34:49] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 5 ms to minimize.
[2024-05-23 16:34:49] [INFO ] Deduced a trap composed of 28 places in 510 ms of which 6 ms to minimize.
[2024-05-23 16:34:50] [INFO ] Deduced a trap composed of 67 places in 546 ms of which 8 ms to minimize.
[2024-05-23 16:34:50] [INFO ] Deduced a trap composed of 39 places in 531 ms of which 5 ms to minimize.
[2024-05-23 16:34:51] [INFO ] Deduced a trap composed of 17 places in 503 ms of which 6 ms to minimize.
[2024-05-23 16:34:51] [INFO ] Deduced a trap composed of 96 places in 507 ms of which 5 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 5 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 6 ms to minimize.
[2024-05-23 16:34:53] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 5 ms to minimize.
[2024-05-23 16:34:53] [INFO ] Deduced a trap composed of 92 places in 524 ms of which 6 ms to minimize.
[2024-05-23 16:34:54] [INFO ] Deduced a trap composed of 78 places in 478 ms of which 6 ms to minimize.
[2024-05-23 16:34:54] [INFO ] Deduced a trap composed of 90 places in 484 ms of which 5 ms to minimize.
[2024-05-23 16:34:55] [INFO ] Deduced a trap composed of 80 places in 385 ms of which 3 ms to minimize.
[2024-05-23 16:34:55] [INFO ] Deduced a trap composed of 72 places in 408 ms of which 4 ms to minimize.
[2024-05-23 16:34:56] [INFO ] Deduced a trap composed of 59 places in 450 ms of which 6 ms to minimize.
[2024-05-23 16:34:56] [INFO ] Deduced a trap composed of 129 places in 339 ms of which 4 ms to minimize.
[2024-05-23 16:34:56] [INFO ] Deduced a trap composed of 3 places in 483 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 55 places in 398 ms of which 5 ms to minimize.
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 25 places in 346 ms of which 4 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 100 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 86 places in 403 ms of which 4 ms to minimize.
[2024-05-23 16:34:59] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:35:00] [INFO ] Deduced a trap composed of 86 places in 402 ms of which 3 ms to minimize.
[2024-05-23 16:35:00] [INFO ] Deduced a trap composed of 85 places in 363 ms of which 3 ms to minimize.
[2024-05-23 16:35:00] [INFO ] Deduced a trap composed of 117 places in 336 ms of which 3 ms to minimize.
[2024-05-23 16:35:01] [INFO ] Deduced a trap composed of 111 places in 357 ms of which 3 ms to minimize.
[2024-05-23 16:35:01] [INFO ] Deduced a trap composed of 86 places in 368 ms of which 4 ms to minimize.
[2024-05-23 16:35:02] [INFO ] Deduced a trap composed of 96 places in 501 ms of which 5 ms to minimize.
[2024-05-23 16:35:02] [INFO ] Deduced a trap composed of 78 places in 516 ms of which 5 ms to minimize.
[2024-05-23 16:35:03] [INFO ] Deduced a trap composed of 105 places in 583 ms of which 6 ms to minimize.
[2024-05-23 16:35:03] [INFO ] Deduced a trap composed of 102 places in 547 ms of which 6 ms to minimize.
[2024-05-23 16:35:04] [INFO ] Deduced a trap composed of 25 places in 538 ms of which 5 ms to minimize.
[2024-05-23 16:35:05] [INFO ] Deduced a trap composed of 95 places in 489 ms of which 6 ms to minimize.
[2024-05-23 16:35:05] [INFO ] Deduced a trap composed of 70 places in 499 ms of which 5 ms to minimize.
[2024-05-23 16:35:06] [INFO ] Deduced a trap composed of 95 places in 483 ms of which 5 ms to minimize.
[2024-05-23 16:35:06] [INFO ] Deduced a trap composed of 91 places in 492 ms of which 5 ms to minimize.
[2024-05-23 16:35:07] [INFO ] Deduced a trap composed of 76 places in 492 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:35:10] [INFO ] Deduced a trap composed of 25 places in 524 ms of which 6 ms to minimize.
[2024-05-23 16:35:10] [INFO ] Deduced a trap composed of 102 places in 522 ms of which 5 ms to minimize.
[2024-05-23 16:35:11] [INFO ] Deduced a trap composed of 83 places in 450 ms of which 5 ms to minimize.
[2024-05-23 16:35:11] [INFO ] Deduced a trap composed of 82 places in 414 ms of which 4 ms to minimize.
[2024-05-23 16:35:11] [INFO ] Deduced a trap composed of 87 places in 463 ms of which 5 ms to minimize.
[2024-05-23 16:35:12] [INFO ] Deduced a trap composed of 86 places in 403 ms of which 5 ms to minimize.
[2024-05-23 16:35:12] [INFO ] Deduced a trap composed of 112 places in 457 ms of which 5 ms to minimize.
[2024-05-23 16:35:13] [INFO ] Deduced a trap composed of 83 places in 428 ms of which 5 ms to minimize.
[2024-05-23 16:35:13] [INFO ] Deduced a trap composed of 87 places in 448 ms of which 5 ms to minimize.
[2024-05-23 16:35:14] [INFO ] Deduced a trap composed of 108 places in 444 ms of which 5 ms to minimize.
[2024-05-23 16:35:14] [INFO ] Deduced a trap composed of 93 places in 434 ms of which 5 ms to minimize.
[2024-05-23 16:35:15] [INFO ] Deduced a trap composed of 76 places in 501 ms of which 6 ms to minimize.
[2024-05-23 16:35:15] [INFO ] Deduced a trap composed of 22 places in 535 ms of which 6 ms to minimize.
[2024-05-23 16:35:16] [INFO ] Deduced a trap composed of 70 places in 496 ms of which 5 ms to minimize.
[2024-05-23 16:35:16] [INFO ] Deduced a trap composed of 100 places in 452 ms of which 5 ms to minimize.
[2024-05-23 16:35:17] [INFO ] Deduced a trap composed of 82 places in 433 ms of which 5 ms to minimize.
[2024-05-23 16:35:17] [INFO ] Deduced a trap composed of 87 places in 464 ms of which 6 ms to minimize.
[2024-05-23 16:35:18] [INFO ] Deduced a trap composed of 85 places in 443 ms of which 5 ms to minimize.
[2024-05-23 16:35:18] [INFO ] Deduced a trap composed of 94 places in 455 ms of which 6 ms to minimize.
[2024-05-23 16:35:19] [INFO ] Deduced a trap composed of 88 places in 483 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:35:32] [INFO ] Deduced a trap composed of 78 places in 480 ms of which 6 ms to minimize.
[2024-05-23 16:35:33] [INFO ] Deduced a trap composed of 61 places in 515 ms of which 5 ms to minimize.
[2024-05-23 16:35:33] [INFO ] Deduced a trap composed of 88 places in 469 ms of which 6 ms to minimize.
[2024-05-23 16:35:34] [INFO ] Deduced a trap composed of 71 places in 523 ms of which 6 ms to minimize.
[2024-05-23 16:35:34] [INFO ] Deduced a trap composed of 70 places in 527 ms of which 6 ms to minimize.
[2024-05-23 16:35:35] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2024-05-23 16:35:35] [INFO ] Deduced a trap composed of 120 places in 530 ms of which 5 ms to minimize.
[2024-05-23 16:35:36] [INFO ] Deduced a trap composed of 101 places in 496 ms of which 5 ms to minimize.
SMT process timed out in 76157ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Fused 952 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 107 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 1640790 steps (4 resets) in 120004 ms. (13 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 58130 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-23 16:37:05] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:37:05] [INFO ] Invariant cache hit.
[2024-05-23 16:37:05] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:37:33] [INFO ] Deduced a trap composed of 50 places in 533 ms of which 6 ms to minimize.
[2024-05-23 16:37:33] [INFO ] Deduced a trap composed of 20 places in 507 ms of which 5 ms to minimize.
[2024-05-23 16:37:34] [INFO ] Deduced a trap composed of 23 places in 468 ms of which 5 ms to minimize.
[2024-05-23 16:37:34] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 5 ms to minimize.
[2024-05-23 16:37:35] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:37:35] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 3 ms to minimize.
[2024-05-23 16:37:35] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:37:36] [INFO ] Deduced a trap composed of 45 places in 320 ms of which 3 ms to minimize.
[2024-05-23 16:37:36] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:37:36] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 3 ms to minimize.
[2024-05-23 16:37:36] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:37:37] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 4 ms to minimize.
[2024-05-23 16:37:37] [INFO ] Deduced a trap composed of 80 places in 315 ms of which 4 ms to minimize.
[2024-05-23 16:37:38] [INFO ] Deduced a trap composed of 79 places in 327 ms of which 4 ms to minimize.
[2024-05-23 16:37:38] [INFO ] Deduced a trap composed of 77 places in 275 ms of which 4 ms to minimize.
[2024-05-23 16:37:38] [INFO ] Deduced a trap composed of 81 places in 328 ms of which 3 ms to minimize.
[2024-05-23 16:37:39] [INFO ] Deduced a trap composed of 83 places in 329 ms of which 3 ms to minimize.
[2024-05-23 16:37:39] [INFO ] Deduced a trap composed of 70 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:37:39] [INFO ] Deduced a trap composed of 96 places in 308 ms of which 3 ms to minimize.
[2024-05-23 16:37:40] [INFO ] Deduced a trap composed of 69 places in 317 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:37:41] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2024-05-23 16:37:42] [INFO ] Deduced a trap composed of 85 places in 312 ms of which 4 ms to minimize.
[2024-05-23 16:37:42] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:37:43] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:37:43] [INFO ] Deduced a trap composed of 94 places in 334 ms of which 4 ms to minimize.
[2024-05-23 16:37:43] [INFO ] Deduced a trap composed of 107 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:37:44] [INFO ] Deduced a trap composed of 101 places in 320 ms of which 4 ms to minimize.
[2024-05-23 16:37:44] [INFO ] Deduced a trap composed of 94 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:37:44] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 4 ms to minimize.
[2024-05-23 16:37:45] [INFO ] Deduced a trap composed of 87 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:37:45] [INFO ] Deduced a trap composed of 72 places in 357 ms of which 4 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 80 places in 335 ms of which 3 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 75 places in 348 ms of which 4 ms to minimize.
[2024-05-23 16:37:46] [INFO ] Deduced a trap composed of 95 places in 342 ms of which 3 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 96 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 100 places in 328 ms of which 3 ms to minimize.
[2024-05-23 16:37:47] [INFO ] Deduced a trap composed of 88 places in 235 ms of which 3 ms to minimize.
[2024-05-23 16:37:48] [INFO ] Deduced a trap composed of 94 places in 333 ms of which 4 ms to minimize.
[2024-05-23 16:37:48] [INFO ] Deduced a trap composed of 86 places in 318 ms of which 3 ms to minimize.
[2024-05-23 16:37:48] [INFO ] Deduced a trap composed of 94 places in 401 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 77 places in 337 ms of which 4 ms to minimize.
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 4 ms to minimize.
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 52 places in 318 ms of which 4 ms to minimize.
[2024-05-23 16:37:50] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:37:51] [INFO ] Deduced a trap composed of 124 places in 316 ms of which 4 ms to minimize.
[2024-05-23 16:37:51] [INFO ] Deduced a trap composed of 108 places in 317 ms of which 4 ms to minimize.
[2024-05-23 16:37:51] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 3 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:37:52] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 4 ms to minimize.
[2024-05-23 16:37:53] [INFO ] Deduced a trap composed of 83 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:37:53] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 4 ms to minimize.
[2024-05-23 16:37:53] [INFO ] Deduced a trap composed of 81 places in 303 ms of which 3 ms to minimize.
[2024-05-23 16:37:53] [INFO ] Deduced a trap composed of 94 places in 234 ms of which 3 ms to minimize.
[2024-05-23 16:37:54] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 3 ms to minimize.
[2024-05-23 16:37:54] [INFO ] Deduced a trap composed of 92 places in 227 ms of which 3 ms to minimize.
[2024-05-23 16:37:54] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 3 ms to minimize.
[2024-05-23 16:37:55] [INFO ] Deduced a trap composed of 94 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:37:55] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 3 ms to minimize.
[2024-05-23 16:37:55] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:38:04] [INFO ] Deduced a trap composed of 77 places in 311 ms of which 4 ms to minimize.
[2024-05-23 16:38:04] [INFO ] Deduced a trap composed of 87 places in 345 ms of which 3 ms to minimize.
[2024-05-23 16:38:05] [INFO ] Deduced a trap composed of 110 places in 281 ms of which 4 ms to minimize.
[2024-05-23 16:38:05] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:38:06] [INFO ] Deduced a trap composed of 72 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:38:06] [INFO ] Deduced a trap composed of 79 places in 228 ms of which 3 ms to minimize.
[2024-05-23 16:38:06] [INFO ] Deduced a trap composed of 90 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:38:07] [INFO ] Deduced a trap composed of 103 places in 239 ms of which 3 ms to minimize.
[2024-05-23 16:38:07] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 3 ms to minimize.
[2024-05-23 16:38:07] [INFO ] Deduced a trap composed of 77 places in 247 ms of which 5 ms to minimize.
[2024-05-23 16:38:08] [INFO ] Deduced a trap composed of 97 places in 281 ms of which 4 ms to minimize.
[2024-05-23 16:38:08] [INFO ] Deduced a trap composed of 87 places in 279 ms of which 3 ms to minimize.
[2024-05-23 16:38:08] [INFO ] Deduced a trap composed of 96 places in 286 ms of which 4 ms to minimize.
[2024-05-23 16:38:09] [INFO ] Deduced a trap composed of 77 places in 281 ms of which 3 ms to minimize.
[2024-05-23 16:38:09] [INFO ] Deduced a trap composed of 112 places in 290 ms of which 4 ms to minimize.
[2024-05-23 16:38:09] [INFO ] Deduced a trap composed of 94 places in 326 ms of which 4 ms to minimize.
[2024-05-23 16:38:10] [INFO ] Deduced a trap composed of 104 places in 325 ms of which 4 ms to minimize.
[2024-05-23 16:38:10] [INFO ] Deduced a trap composed of 102 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:38:10] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:38:11] [INFO ] Deduced a trap composed of 91 places in 397 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:38:12] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:38:13] [INFO ] Deduced a trap composed of 34 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:38:13] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 4 ms to minimize.
[2024-05-23 16:38:13] [INFO ] Deduced a trap composed of 83 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:38:14] [INFO ] Deduced a trap composed of 85 places in 327 ms of which 3 ms to minimize.
[2024-05-23 16:38:14] [INFO ] Deduced a trap composed of 62 places in 291 ms of which 3 ms to minimize.
[2024-05-23 16:38:15] [INFO ] Deduced a trap composed of 66 places in 301 ms of which 4 ms to minimize.
[2024-05-23 16:38:15] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:38:16] [INFO ] Deduced a trap composed of 93 places in 325 ms of which 4 ms to minimize.
[2024-05-23 16:38:16] [INFO ] Deduced a trap composed of 81 places in 263 ms of which 2 ms to minimize.
[2024-05-23 16:38:16] [INFO ] Deduced a trap composed of 79 places in 274 ms of which 3 ms to minimize.
[2024-05-23 16:38:16] [INFO ] Deduced a trap composed of 91 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:38:17] [INFO ] Deduced a trap composed of 78 places in 311 ms of which 3 ms to minimize.
[2024-05-23 16:38:17] [INFO ] Deduced a trap composed of 65 places in 323 ms of which 4 ms to minimize.
[2024-05-23 16:38:18] [INFO ] Deduced a trap composed of 85 places in 318 ms of which 3 ms to minimize.
[2024-05-23 16:38:18] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:38:18] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:38:18] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 3 ms to minimize.
[2024-05-23 16:38:19] [INFO ] Deduced a trap composed of 63 places in 365 ms of which 4 ms to minimize.
[2024-05-23 16:38:19] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:38:20] [INFO ] Deduced a trap composed of 83 places in 323 ms of which 3 ms to minimize.
[2024-05-23 16:38:21] [INFO ] Deduced a trap composed of 81 places in 318 ms of which 3 ms to minimize.
[2024-05-23 16:38:21] [INFO ] Deduced a trap composed of 89 places in 313 ms of which 4 ms to minimize.
[2024-05-23 16:38:21] [INFO ] Deduced a trap composed of 85 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:38:22] [INFO ] Deduced a trap composed of 95 places in 301 ms of which 4 ms to minimize.
[2024-05-23 16:38:22] [INFO ] Deduced a trap composed of 68 places in 334 ms of which 3 ms to minimize.
[2024-05-23 16:38:22] [INFO ] Deduced a trap composed of 80 places in 336 ms of which 4 ms to minimize.
[2024-05-23 16:38:23] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 3 ms to minimize.
[2024-05-23 16:38:23] [INFO ] Deduced a trap composed of 74 places in 385 ms of which 4 ms to minimize.
[2024-05-23 16:38:24] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:38:25] [INFO ] Deduced a trap composed of 72 places in 367 ms of which 3 ms to minimize.
[2024-05-23 16:38:25] [INFO ] Deduced a trap composed of 105 places in 421 ms of which 4 ms to minimize.
[2024-05-23 16:38:26] [INFO ] Deduced a trap composed of 82 places in 377 ms of which 3 ms to minimize.
[2024-05-23 16:38:26] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:38:26] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:38:27] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 3 ms to minimize.
[2024-05-23 16:38:27] [INFO ] Deduced a trap composed of 70 places in 316 ms of which 3 ms to minimize.
[2024-05-23 16:38:28] [INFO ] Deduced a trap composed of 85 places in 272 ms of which 4 ms to minimize.
[2024-05-23 16:38:28] [INFO ] Deduced a trap composed of 79 places in 286 ms of which 3 ms to minimize.
[2024-05-23 16:38:28] [INFO ] Deduced a trap composed of 96 places in 292 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 952 unsolved in 90029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 120/142 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:38:44] [INFO ] Deduced a trap composed of 72 places in 274 ms of which 4 ms to minimize.
[2024-05-23 16:38:44] [INFO ] Deduced a trap composed of 87 places in 312 ms of which 4 ms to minimize.
[2024-05-23 16:38:45] [INFO ] Deduced a trap composed of 94 places in 303 ms of which 4 ms to minimize.
[2024-05-23 16:38:45] [INFO ] Deduced a trap composed of 81 places in 300 ms of which 6 ms to minimize.
[2024-05-23 16:38:45] [INFO ] Deduced a trap composed of 77 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:38:46] [INFO ] Deduced a trap composed of 83 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:38:46] [INFO ] Deduced a trap composed of 86 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:38:46] [INFO ] Deduced a trap composed of 80 places in 297 ms of which 3 ms to minimize.
[2024-05-23 16:38:47] [INFO ] Deduced a trap composed of 69 places in 300 ms of which 3 ms to minimize.
[2024-05-23 16:38:47] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 4 ms to minimize.
[2024-05-23 16:38:47] [INFO ] Deduced a trap composed of 104 places in 283 ms of which 3 ms to minimize.
[2024-05-23 16:38:48] [INFO ] Deduced a trap composed of 100 places in 304 ms of which 3 ms to minimize.
[2024-05-23 16:38:48] [INFO ] Deduced a trap composed of 85 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:38:48] [INFO ] Deduced a trap composed of 95 places in 294 ms of which 3 ms to minimize.
[2024-05-23 16:38:49] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 4 ms to minimize.
[2024-05-23 16:38:49] [INFO ] Deduced a trap composed of 87 places in 258 ms of which 3 ms to minimize.
[2024-05-23 16:38:49] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 3 ms to minimize.
[2024-05-23 16:38:50] [INFO ] Deduced a trap composed of 85 places in 384 ms of which 4 ms to minimize.
[2024-05-23 16:38:50] [INFO ] Deduced a trap composed of 70 places in 364 ms of which 3 ms to minimize.
[2024-05-23 16:38:51] [INFO ] Deduced a trap composed of 94 places in 358 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:38:53] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 3 ms to minimize.
[2024-05-23 16:38:54] [INFO ] Deduced a trap composed of 100 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:38:54] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 4 ms to minimize.
[2024-05-23 16:38:54] [INFO ] Deduced a trap composed of 87 places in 325 ms of which 4 ms to minimize.
[2024-05-23 16:38:55] [INFO ] Deduced a trap composed of 80 places in 247 ms of which 3 ms to minimize.
[2024-05-23 16:38:56] [INFO ] Deduced a trap composed of 64 places in 319 ms of which 3 ms to minimize.
[2024-05-23 16:38:56] [INFO ] Deduced a trap composed of 49 places in 327 ms of which 4 ms to minimize.
[2024-05-23 16:38:56] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:38:57] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 5 ms to minimize.
[2024-05-23 16:38:57] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:38:57] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:38:58] [INFO ] Deduced a trap composed of 58 places in 304 ms of which 3 ms to minimize.
[2024-05-23 16:38:58] [INFO ] Deduced a trap composed of 76 places in 328 ms of which 4 ms to minimize.
[2024-05-23 16:38:58] [INFO ] Deduced a trap composed of 91 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:38:59] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 7 ms to minimize.
[2024-05-23 16:38:59] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 4 ms to minimize.
[2024-05-23 16:38:59] [INFO ] Deduced a trap composed of 88 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:39:00] [INFO ] Deduced a trap composed of 83 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:39:00] [INFO ] Deduced a trap composed of 91 places in 300 ms of which 4 ms to minimize.
[2024-05-23 16:39:01] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:39:02] [INFO ] Deduced a trap composed of 71 places in 278 ms of which 4 ms to minimize.
[2024-05-23 16:39:03] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 4 ms to minimize.
[2024-05-23 16:39:03] [INFO ] Deduced a trap composed of 98 places in 292 ms of which 4 ms to minimize.
[2024-05-23 16:39:03] [INFO ] Deduced a trap composed of 91 places in 321 ms of which 4 ms to minimize.
[2024-05-23 16:39:04] [INFO ] Deduced a trap composed of 91 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:39:04] [INFO ] Deduced a trap composed of 27 places in 373 ms of which 4 ms to minimize.
[2024-05-23 16:39:05] [INFO ] Deduced a trap composed of 117 places in 359 ms of which 4 ms to minimize.
[2024-05-23 16:39:05] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 3 ms to minimize.
[2024-05-23 16:39:06] [INFO ] Deduced a trap composed of 74 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:39:06] [INFO ] Deduced a trap composed of 68 places in 319 ms of which 3 ms to minimize.
[2024-05-23 16:39:06] [INFO ] Deduced a trap composed of 83 places in 356 ms of which 4 ms to minimize.
[2024-05-23 16:39:07] [INFO ] Deduced a trap composed of 80 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:39:07] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 3 ms to minimize.
[2024-05-23 16:39:07] [INFO ] Deduced a trap composed of 89 places in 317 ms of which 4 ms to minimize.
[2024-05-23 16:39:08] [INFO ] Deduced a trap composed of 57 places in 297 ms of which 3 ms to minimize.
[2024-05-23 16:39:08] [INFO ] Deduced a trap composed of 72 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:39:08] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 4 ms to minimize.
[2024-05-23 16:39:08] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 4 ms to minimize.
[2024-05-23 16:39:09] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 3 ms to minimize.
[2024-05-23 16:39:10] [INFO ] Deduced a trap composed of 66 places in 316 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:39:12] [INFO ] Deduced a trap composed of 78 places in 303 ms of which 3 ms to minimize.
[2024-05-23 16:39:12] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 4 ms to minimize.
[2024-05-23 16:39:13] [INFO ] Deduced a trap composed of 85 places in 308 ms of which 4 ms to minimize.
[2024-05-23 16:39:13] [INFO ] Deduced a trap composed of 89 places in 320 ms of which 5 ms to minimize.
[2024-05-23 16:39:13] [INFO ] Deduced a trap composed of 105 places in 272 ms of which 3 ms to minimize.
[2024-05-23 16:39:14] [INFO ] Deduced a trap composed of 100 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:39:14] [INFO ] Deduced a trap composed of 87 places in 302 ms of which 3 ms to minimize.
[2024-05-23 16:39:15] [INFO ] Deduced a trap composed of 81 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:39:15] [INFO ] Deduced a trap composed of 76 places in 309 ms of which 3 ms to minimize.
[2024-05-23 16:39:15] [INFO ] Deduced a trap composed of 76 places in 283 ms of which 3 ms to minimize.
[2024-05-23 16:39:16] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 3 ms to minimize.
[2024-05-23 16:39:16] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:39:16] [INFO ] Deduced a trap composed of 81 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:39:17] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:39:17] [INFO ] Deduced a trap composed of 87 places in 287 ms of which 4 ms to minimize.
[2024-05-23 16:39:18] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 4 ms to minimize.
[2024-05-23 16:39:18] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 3 ms to minimize.
[2024-05-23 16:39:19] [INFO ] Deduced a trap composed of 107 places in 323 ms of which 4 ms to minimize.
[2024-05-23 16:39:19] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-23 16:39:20] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:39:22] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2024-05-23 16:39:22] [INFO ] Deduced a trap composed of 81 places in 298 ms of which 3 ms to minimize.
[2024-05-23 16:39:23] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 6 ms to minimize.
[2024-05-23 16:39:23] [INFO ] Deduced a trap composed of 67 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:39:23] [INFO ] Deduced a trap composed of 64 places in 296 ms of which 3 ms to minimize.
[2024-05-23 16:39:24] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 3 ms to minimize.
[2024-05-23 16:39:24] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 3 ms to minimize.
[2024-05-23 16:39:24] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 2 ms to minimize.
[2024-05-23 16:39:25] [INFO ] Deduced a trap composed of 57 places in 300 ms of which 3 ms to minimize.
[2024-05-23 16:39:25] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 3 ms to minimize.
[2024-05-23 16:39:26] [INFO ] Deduced a trap composed of 67 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:39:26] [INFO ] Deduced a trap composed of 48 places in 261 ms of which 3 ms to minimize.
[2024-05-23 16:39:26] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:39:27] [INFO ] Deduced a trap composed of 112 places in 219 ms of which 3 ms to minimize.
[2024-05-23 16:39:27] [INFO ] Deduced a trap composed of 75 places in 296 ms of which 3 ms to minimize.
[2024-05-23 16:39:27] [INFO ] Deduced a trap composed of 61 places in 294 ms of which 4 ms to minimize.
[2024-05-23 16:39:28] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 3 ms to minimize.
[2024-05-23 16:39:29] [INFO ] Deduced a trap composed of 85 places in 252 ms of which 3 ms to minimize.
[2024-05-23 16:39:29] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:39:29] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:39:33] [INFO ] Deduced a trap composed of 59 places in 268 ms of which 3 ms to minimize.
[2024-05-23 16:39:34] [INFO ] Deduced a trap composed of 94 places in 297 ms of which 3 ms to minimize.
[2024-05-23 16:39:34] [INFO ] Deduced a trap composed of 81 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:39:34] [INFO ] Deduced a trap composed of 89 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:39:34] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 3 ms to minimize.
[2024-05-23 16:39:35] [INFO ] Deduced a trap composed of 76 places in 294 ms of which 4 ms to minimize.
[2024-05-23 16:39:35] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 4 ms to minimize.
[2024-05-23 16:39:35] [INFO ] Deduced a trap composed of 79 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:39:36] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:39:36] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:39:36] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 3 ms to minimize.
[2024-05-23 16:39:37] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:39:37] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 4 ms to minimize.
[2024-05-23 16:39:37] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:39:38] [INFO ] Deduced a trap composed of 84 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:39:38] [INFO ] Deduced a trap composed of 84 places in 261 ms of which 3 ms to minimize.
[2024-05-23 16:39:38] [INFO ] Deduced a trap composed of 72 places in 279 ms of which 3 ms to minimize.
[2024-05-23 16:39:39] [INFO ] Deduced a trap composed of 80 places in 276 ms of which 3 ms to minimize.
[2024-05-23 16:39:39] [INFO ] Deduced a trap composed of 79 places in 266 ms of which 4 ms to minimize.
[2024-05-23 16:39:39] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:39:43] [INFO ] Deduced a trap composed of 86 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:39:44] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 3 ms to minimize.
[2024-05-23 16:39:44] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:39:44] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 4 ms to minimize.
[2024-05-23 16:39:45] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:39:45] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 4 ms to minimize.
[2024-05-23 16:39:45] [INFO ] Deduced a trap composed of 71 places in 276 ms of which 3 ms to minimize.
[2024-05-23 16:39:45] [INFO ] Deduced a trap composed of 74 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:39:46] [INFO ] Deduced a trap composed of 75 places in 274 ms of which 3 ms to minimize.
[2024-05-23 16:39:46] [INFO ] Deduced a trap composed of 54 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:39:46] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:39:47] [INFO ] Deduced a trap composed of 69 places in 285 ms of which 3 ms to minimize.
[2024-05-23 16:39:47] [INFO ] Deduced a trap composed of 74 places in 300 ms of which 4 ms to minimize.
[2024-05-23 16:39:47] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 4 ms to minimize.
[2024-05-23 16:39:48] [INFO ] Deduced a trap composed of 66 places in 323 ms of which 3 ms to minimize.
[2024-05-23 16:39:48] [INFO ] Deduced a trap composed of 81 places in 285 ms of which 3 ms to minimize.
[2024-05-23 16:39:49] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:39:49] [INFO ] Deduced a trap composed of 80 places in 264 ms of which 3 ms to minimize.
[2024-05-23 16:39:49] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 4 ms to minimize.
[2024-05-23 16:39:49] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:39:53] [INFO ] Deduced a trap composed of 81 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:39:54] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:39:55] [INFO ] Deduced a trap composed of 61 places in 298 ms of which 4 ms to minimize.
[2024-05-23 16:39:55] [INFO ] Deduced a trap composed of 54 places in 307 ms of which 3 ms to minimize.
[2024-05-23 16:39:55] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 3 ms to minimize.
[2024-05-23 16:39:56] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 3 ms to minimize.
[2024-05-23 16:39:56] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 4 ms to minimize.
[2024-05-23 16:39:57] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 3 ms to minimize.
[2024-05-23 16:39:57] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 3 ms to minimize.
[2024-05-23 16:39:58] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:39:58] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:39:59] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:40:00] [INFO ] Deduced a trap composed of 80 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:40:00] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:40:00] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-05-23 16:40:01] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:40:01] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 3 ms to minimize.
[2024-05-23 16:40:01] [INFO ] Deduced a trap composed of 70 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:40:01] [INFO ] Deduced a trap composed of 75 places in 303 ms of which 3 ms to minimize.
[2024-05-23 16:40:02] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-05-23 16:40:05] [INFO ] Deduced a trap composed of 78 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 303 constraints, problems are : Problem set: 0 solved, 952 unsolved in 90028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 281/281 constraints]
After SMT, in 180655ms problems are : Problem set: 0 solved, 952 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 113 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 125 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-05-23 16:40:06] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:40:06] [INFO ] Invariant cache hit.
[2024-05-23 16:40:06] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-23 16:40:06] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:40:06] [INFO ] Invariant cache hit.
[2024-05-23 16:40:07] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-05-23 16:40:07] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2024-05-23 16:40:08] [INFO ] Redundant transitions in 118 ms returned []
Running 1694 sub problems to find dead transitions.
[2024-05-23 16:40:08] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:40:08] [INFO ] Invariant cache hit.
[2024-05-23 16:40:08] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-05-23 16:40:23] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2024-05-23 16:40:23] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:40:23] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:40:23] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-23 16:40:23] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:40:23] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:40:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:40:24] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:40:24] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 2 ms to minimize.
[2024-05-23 16:40:27] [INFO ] Deduced a trap composed of 54 places in 321 ms of which 3 ms to minimize.
[2024-05-23 16:40:28] [INFO ] Deduced a trap composed of 66 places in 316 ms of which 4 ms to minimize.
[2024-05-23 16:40:28] [INFO ] Deduced a trap composed of 74 places in 307 ms of which 3 ms to minimize.
[2024-05-23 16:40:28] [INFO ] Deduced a trap composed of 64 places in 318 ms of which 3 ms to minimize.
[2024-05-23 16:40:29] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:40:29] [INFO ] Deduced a trap composed of 70 places in 328 ms of which 3 ms to minimize.
[2024-05-23 16:40:29] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:40:30] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:40:30] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 3 ms to minimize.
[2024-05-23 16:40:31] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 4 ms to minimize.
[2024-05-23 16:40:31] [INFO ] Deduced a trap composed of 70 places in 285 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-05-23 16:40:35] [INFO ] Deduced a trap composed of 60 places in 311 ms of which 4 ms to minimize.
[2024-05-23 16:40:36] [INFO ] Deduced a trap composed of 63 places in 312 ms of which 3 ms to minimize.
[2024-05-23 16:40:36] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:40:36] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 4 ms to minimize.
[2024-05-23 16:40:37] [INFO ] Deduced a trap composed of 77 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:40:37] [INFO ] Deduced a trap composed of 74 places in 335 ms of which 31 ms to minimize.
[2024-05-23 16:40:38] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 3 ms to minimize.
[2024-05-23 16:40:38] [INFO ] Deduced a trap composed of 106 places in 319 ms of which 3 ms to minimize.
[2024-05-23 16:40:38] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:40:39] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 3 ms to minimize.
SMT process timed out in 31071ms, After SMT, problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 31090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32914 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 10932 ms. (36 steps per ms) remains 70/161 properties
Running SMT prover for 70 properties.
[2024-05-23 16:40:42] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:40:42] [INFO ] Invariant cache hit.
[2024-05-23 16:40:42] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-23 16:40:42] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-23 16:40:43] [INFO ] After 441ms SMT Verify possible using state equation in real domain returned unsat :0 sat :70
[2024-05-23 16:40:43] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-05-23 16:40:43] [INFO ] After 505ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :70
TRAPS : Iteration 0
[2024-05-23 16:40:47] [INFO ] After 4265ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:70
[2024-05-23 16:40:47] [INFO ] After 4968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:70
[2024-05-23 16:40:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-23 16:40:47] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-23 16:40:48] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :70
[2024-05-23 16:40:48] [INFO ] After 632ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :70
TRAPS : Iteration 0
[2024-05-23 16:40:49] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 4 ms to minimize.
[2024-05-23 16:40:49] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 4 ms to minimize.
[2024-05-23 16:40:49] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:40:50] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:40:50] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 3 ms to minimize.
[2024-05-23 16:40:50] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:40:50] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 3 ms to minimize.
[2024-05-23 16:40:50] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2024-05-23 16:40:51] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:40:51] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-23 16:40:51] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:40:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2401 ms
[2024-05-23 16:40:51] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-05-23 16:40:51] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 2 ms to minimize.
[2024-05-23 16:40:52] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
[2024-05-23 16:40:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 741 ms
[2024-05-23 16:40:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-23 16:40:52] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-23 16:40:52] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-23 16:40:52] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-23 16:40:53] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-05-23 16:40:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-23 16:40:54] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2024-05-23 16:40:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-23 16:40:54] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:40:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-23 16:40:54] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:40:54] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:40:55] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:40:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2024-05-23 16:40:55] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:40:55] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:40:55] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:40:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 472 ms
[2024-05-23 16:40:56] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:40:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
TRAPS : Iteration 1
[2024-05-23 16:40:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-23 16:40:59] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-23 16:40:59] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:40:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-23 16:41:00] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:41:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 2
[2024-05-23 16:41:03] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:41:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-23 16:41:03] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 4 ms to minimize.
[2024-05-23 16:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2024-05-23 16:41:04] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-23 16:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-05-23 16:41:04] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 3
[2024-05-23 16:41:06] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-23 16:41:09] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 4
[2024-05-23 16:41:13] [INFO ] After 25443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :70
[2024-05-23 16:41:14] [INFO ] After 26714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :70
RANDOM walk for 643750 steps (0 resets) in 120006 ms. (5 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 951/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 951/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 950/951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 146 ms. (27 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 950/950 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 71049 ms. (steps per millisecond=14 ) properties seen :0
[2024-05-23 16:42:58] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:42:58] [INFO ] Invariant cache hit.
[2024-05-23 16:42:58] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:43:18] [INFO ] Deduced a trap composed of 50 places in 306 ms of which 4 ms to minimize.
[2024-05-23 16:43:18] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 4 ms to minimize.
[2024-05-23 16:43:19] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:43:19] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 4 ms to minimize.
[2024-05-23 16:43:19] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:43:19] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-23 16:43:19] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-23 16:43:20] [INFO ] Deduced a trap composed of 75 places in 257 ms of which 2 ms to minimize.
[2024-05-23 16:43:20] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:43:20] [INFO ] Deduced a trap composed of 79 places in 282 ms of which 3 ms to minimize.
[2024-05-23 16:43:21] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:43:21] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 4 ms to minimize.
[2024-05-23 16:43:21] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 2 ms to minimize.
[2024-05-23 16:43:21] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 2 ms to minimize.
[2024-05-23 16:43:22] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 3 ms to minimize.
[2024-05-23 16:43:22] [INFO ] Deduced a trap composed of 89 places in 295 ms of which 4 ms to minimize.
[2024-05-23 16:43:23] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 4 ms to minimize.
[2024-05-23 16:43:23] [INFO ] Deduced a trap composed of 89 places in 305 ms of which 3 ms to minimize.
[2024-05-23 16:43:24] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:43:24] [INFO ] Deduced a trap composed of 61 places in 295 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:43:25] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:43:26] [INFO ] Deduced a trap composed of 75 places in 315 ms of which 3 ms to minimize.
[2024-05-23 16:43:26] [INFO ] Deduced a trap composed of 74 places in 323 ms of which 4 ms to minimize.
[2024-05-23 16:43:26] [INFO ] Deduced a trap composed of 75 places in 318 ms of which 4 ms to minimize.
[2024-05-23 16:43:27] [INFO ] Deduced a trap composed of 78 places in 313 ms of which 4 ms to minimize.
[2024-05-23 16:43:27] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:43:27] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:43:28] [INFO ] Deduced a trap composed of 80 places in 307 ms of which 4 ms to minimize.
[2024-05-23 16:43:28] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:43:28] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:43:28] [INFO ] Deduced a trap composed of 74 places in 333 ms of which 3 ms to minimize.
[2024-05-23 16:43:29] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 3 ms to minimize.
[2024-05-23 16:43:29] [INFO ] Deduced a trap composed of 76 places in 315 ms of which 3 ms to minimize.
[2024-05-23 16:43:29] [INFO ] Deduced a trap composed of 77 places in 306 ms of which 4 ms to minimize.
[2024-05-23 16:43:30] [INFO ] Deduced a trap composed of 76 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:43:31] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 4 ms to minimize.
[2024-05-23 16:43:31] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 3 ms to minimize.
[2024-05-23 16:43:31] [INFO ] Deduced a trap composed of 63 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:43:32] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:43:32] [INFO ] Deduced a trap composed of 47 places in 308 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:43:33] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:43:33] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 3 ms to minimize.
[2024-05-23 16:43:33] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 2 ms to minimize.
[2024-05-23 16:43:34] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 3 ms to minimize.
[2024-05-23 16:43:34] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-05-23 16:43:34] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 3 ms to minimize.
[2024-05-23 16:43:34] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:43:34] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
[2024-05-23 16:43:35] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:43:35] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 3 ms to minimize.
[2024-05-23 16:43:35] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 3 ms to minimize.
[2024-05-23 16:43:36] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:43:36] [INFO ] Deduced a trap composed of 63 places in 276 ms of which 3 ms to minimize.
[2024-05-23 16:43:36] [INFO ] Deduced a trap composed of 28 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:43:37] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:43:37] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 3 ms to minimize.
[2024-05-23 16:43:37] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 3 ms to minimize.
[2024-05-23 16:43:38] [INFO ] Deduced a trap composed of 81 places in 329 ms of which 3 ms to minimize.
[2024-05-23 16:43:38] [INFO ] Deduced a trap composed of 63 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:43:38] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:43:47] [INFO ] Deduced a trap composed of 18 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:43:47] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:43:48] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:43:48] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:43:49] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 4 ms to minimize.
[2024-05-23 16:43:49] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 3 ms to minimize.
[2024-05-23 16:43:50] [INFO ] Deduced a trap composed of 66 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:43:50] [INFO ] Deduced a trap composed of 78 places in 305 ms of which 3 ms to minimize.
[2024-05-23 16:43:50] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 3 ms to minimize.
[2024-05-23 16:43:51] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:43:51] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 4 ms to minimize.
[2024-05-23 16:43:51] [INFO ] Deduced a trap composed of 63 places in 302 ms of which 3 ms to minimize.
[2024-05-23 16:43:52] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 3 ms to minimize.
[2024-05-23 16:43:52] [INFO ] Deduced a trap composed of 48 places in 323 ms of which 3 ms to minimize.
[2024-05-23 16:43:52] [INFO ] Deduced a trap composed of 66 places in 328 ms of which 3 ms to minimize.
[2024-05-23 16:43:53] [INFO ] Deduced a trap composed of 65 places in 317 ms of which 3 ms to minimize.
[2024-05-23 16:43:53] [INFO ] Deduced a trap composed of 48 places in 301 ms of which 4 ms to minimize.
[2024-05-23 16:43:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:43:54] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:43:54] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:43:56] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:43:57] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:43:57] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:43:57] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:43:57] [INFO ] Deduced a trap composed of 80 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:43:58] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:43:58] [INFO ] Deduced a trap composed of 70 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:43:58] [INFO ] Deduced a trap composed of 79 places in 296 ms of which 4 ms to minimize.
[2024-05-23 16:43:59] [INFO ] Deduced a trap composed of 71 places in 301 ms of which 3 ms to minimize.
[2024-05-23 16:43:59] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 4 ms to minimize.
[2024-05-23 16:43:59] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 3 ms to minimize.
[2024-05-23 16:44:00] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 3 ms to minimize.
[2024-05-23 16:44:00] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-05-23 16:44:01] [INFO ] Deduced a trap composed of 60 places in 304 ms of which 3 ms to minimize.
[2024-05-23 16:44:01] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 3 ms to minimize.
[2024-05-23 16:44:01] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 3 ms to minimize.
[2024-05-23 16:44:01] [INFO ] Deduced a trap composed of 77 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:44:02] [INFO ] Deduced a trap composed of 76 places in 335 ms of which 3 ms to minimize.
[2024-05-23 16:44:02] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 2 ms to minimize.
[2024-05-23 16:44:03] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:44:05] [INFO ] Deduced a trap composed of 83 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:44:06] [INFO ] Deduced a trap composed of 111 places in 280 ms of which 4 ms to minimize.
[2024-05-23 16:44:06] [INFO ] Deduced a trap composed of 100 places in 276 ms of which 3 ms to minimize.
[2024-05-23 16:44:06] [INFO ] Deduced a trap composed of 94 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:44:07] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 3 ms to minimize.
[2024-05-23 16:44:07] [INFO ] Deduced a trap composed of 86 places in 266 ms of which 3 ms to minimize.
[2024-05-23 16:44:07] [INFO ] Deduced a trap composed of 56 places in 333 ms of which 3 ms to minimize.
[2024-05-23 16:44:08] [INFO ] Deduced a trap composed of 96 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:44:08] [INFO ] Deduced a trap composed of 81 places in 286 ms of which 3 ms to minimize.
[2024-05-23 16:44:09] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 3 ms to minimize.
[2024-05-23 16:44:09] [INFO ] Deduced a trap composed of 71 places in 300 ms of which 3 ms to minimize.
[2024-05-23 16:44:09] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 3 ms to minimize.
[2024-05-23 16:44:09] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 3 ms to minimize.
[2024-05-23 16:44:10] [INFO ] Deduced a trap composed of 84 places in 307 ms of which 3 ms to minimize.
[2024-05-23 16:44:10] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 3 ms to minimize.
[2024-05-23 16:44:11] [INFO ] Deduced a trap composed of 79 places in 304 ms of which 3 ms to minimize.
[2024-05-23 16:44:11] [INFO ] Deduced a trap composed of 85 places in 283 ms of which 3 ms to minimize.
[2024-05-23 16:44:12] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 3 ms to minimize.
[2024-05-23 16:44:12] [INFO ] Deduced a trap composed of 91 places in 309 ms of which 3 ms to minimize.
[2024-05-23 16:44:12] [INFO ] Deduced a trap composed of 88 places in 314 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:44:24] [INFO ] Deduced a trap composed of 84 places in 300 ms of which 3 ms to minimize.
[2024-05-23 16:44:24] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 3 ms to minimize.
[2024-05-23 16:44:24] [INFO ] Deduced a trap composed of 81 places in 283 ms of which 3 ms to minimize.
[2024-05-23 16:44:25] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 3 ms to minimize.
[2024-05-23 16:44:26] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
[2024-05-23 16:44:26] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-23 16:44:26] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-23 16:44:28] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 4 ms to minimize.
[2024-05-23 16:44:28] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:44:28] [INFO ] Deduced a trap composed of 57 places in 303 ms of which 3 ms to minimize.
[2024-05-23 16:44:29] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:44:31] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-05-23 16:44:31] [INFO ] Deduced a trap composed of 78 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:44:31] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 4 ms to minimize.
[2024-05-23 16:44:32] [INFO ] Deduced a trap composed of 78 places in 281 ms of which 3 ms to minimize.
[2024-05-23 16:44:32] [INFO ] Deduced a trap composed of 82 places in 235 ms of which 3 ms to minimize.
[2024-05-23 16:44:32] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:44:33] [INFO ] Deduced a trap composed of 84 places in 253 ms of which 2 ms to minimize.
[2024-05-23 16:44:33] [INFO ] Deduced a trap composed of 67 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:44:33] [INFO ] Deduced a trap composed of 69 places in 318 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:44:37] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 3 ms to minimize.
[2024-05-23 16:44:37] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 4 ms to minimize.
[2024-05-23 16:44:38] [INFO ] Deduced a trap composed of 117 places in 290 ms of which 3 ms to minimize.
[2024-05-23 16:44:38] [INFO ] Deduced a trap composed of 98 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:44:38] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:44:39] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 3 ms to minimize.
[2024-05-23 16:44:39] [INFO ] Deduced a trap composed of 93 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:44:40] [INFO ] Deduced a trap composed of 73 places in 315 ms of which 3 ms to minimize.
[2024-05-23 16:44:40] [INFO ] Deduced a trap composed of 91 places in 317 ms of which 4 ms to minimize.
[2024-05-23 16:44:41] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 3 ms to minimize.
[2024-05-23 16:44:42] [INFO ] Deduced a trap composed of 65 places in 323 ms of which 3 ms to minimize.
[2024-05-23 16:44:42] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 3 ms to minimize.
[2024-05-23 16:44:43] [INFO ] Deduced a trap composed of 83 places in 317 ms of which 3 ms to minimize.
[2024-05-23 16:44:43] [INFO ] Deduced a trap composed of 72 places in 288 ms of which 4 ms to minimize.
[2024-05-23 16:44:43] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-23 16:44:44] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 4 ms to minimize.
[2024-05-23 16:44:44] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 3 ms to minimize.
SMT process timed out in 105848ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Fused 950 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 73 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 670127 steps (0 resets) in 120010 ms. (5 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 950/950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 950/950 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 69581 ms. (steps per millisecond=14 ) properties seen :0
[2024-05-23 16:46:25] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:46:25] [INFO ] Invariant cache hit.
[2024-05-23 16:46:25] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:46:45] [INFO ] Deduced a trap composed of 50 places in 325 ms of which 4 ms to minimize.
[2024-05-23 16:46:45] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 6 ms to minimize.
[2024-05-23 16:46:46] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 3 ms to minimize.
[2024-05-23 16:46:46] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 4 ms to minimize.
[2024-05-23 16:46:46] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:46:46] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:46:46] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:46:47] [INFO ] Deduced a trap composed of 75 places in 248 ms of which 3 ms to minimize.
[2024-05-23 16:46:47] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:46:47] [INFO ] Deduced a trap composed of 79 places in 288 ms of which 3 ms to minimize.
[2024-05-23 16:46:48] [INFO ] Deduced a trap composed of 73 places in 254 ms of which 3 ms to minimize.
[2024-05-23 16:46:48] [INFO ] Deduced a trap composed of 72 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:46:48] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:46:48] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 3 ms to minimize.
[2024-05-23 16:46:49] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 4 ms to minimize.
[2024-05-23 16:46:49] [INFO ] Deduced a trap composed of 89 places in 280 ms of which 4 ms to minimize.
[2024-05-23 16:46:50] [INFO ] Deduced a trap composed of 65 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:46:50] [INFO ] Deduced a trap composed of 89 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:46:50] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 4 ms to minimize.
[2024-05-23 16:46:51] [INFO ] Deduced a trap composed of 61 places in 288 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:46:52] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:46:53] [INFO ] Deduced a trap composed of 75 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:46:53] [INFO ] Deduced a trap composed of 74 places in 309 ms of which 3 ms to minimize.
[2024-05-23 16:46:53] [INFO ] Deduced a trap composed of 75 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:46:54] [INFO ] Deduced a trap composed of 78 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:46:54] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 3 ms to minimize.
[2024-05-23 16:46:54] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 4 ms to minimize.
[2024-05-23 16:46:55] [INFO ] Deduced a trap composed of 80 places in 316 ms of which 4 ms to minimize.
[2024-05-23 16:46:55] [INFO ] Deduced a trap composed of 76 places in 307 ms of which 4 ms to minimize.
[2024-05-23 16:46:55] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:46:55] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 3 ms to minimize.
[2024-05-23 16:46:56] [INFO ] Deduced a trap composed of 62 places in 321 ms of which 4 ms to minimize.
[2024-05-23 16:46:56] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 4 ms to minimize.
[2024-05-23 16:46:56] [INFO ] Deduced a trap composed of 77 places in 315 ms of which 3 ms to minimize.
[2024-05-23 16:46:57] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:46:57] [INFO ] Deduced a trap composed of 93 places in 306 ms of which 4 ms to minimize.
[2024-05-23 16:46:58] [INFO ] Deduced a trap composed of 64 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:46:58] [INFO ] Deduced a trap composed of 63 places in 306 ms of which 4 ms to minimize.
[2024-05-23 16:46:58] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 4 ms to minimize.
[2024-05-23 16:46:59] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:47:00] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:47:00] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 2 ms to minimize.
[2024-05-23 16:47:00] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 3 ms to minimize.
[2024-05-23 16:47:00] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 2 ms to minimize.
[2024-05-23 16:47:01] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 2 ms to minimize.
[2024-05-23 16:47:01] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-23 16:47:01] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:47:01] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:47:01] [INFO ] Deduced a trap composed of 84 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:47:02] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 3 ms to minimize.
[2024-05-23 16:47:02] [INFO ] Deduced a trap composed of 70 places in 261 ms of which 3 ms to minimize.
[2024-05-23 16:47:02] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 4 ms to minimize.
[2024-05-23 16:47:03] [INFO ] Deduced a trap composed of 63 places in 285 ms of which 3 ms to minimize.
[2024-05-23 16:47:03] [INFO ] Deduced a trap composed of 28 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:47:03] [INFO ] Deduced a trap composed of 28 places in 311 ms of which 3 ms to minimize.
[2024-05-23 16:47:04] [INFO ] Deduced a trap composed of 86 places in 311 ms of which 3 ms to minimize.
[2024-05-23 16:47:04] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:47:04] [INFO ] Deduced a trap composed of 81 places in 299 ms of which 3 ms to minimize.
[2024-05-23 16:47:05] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 4 ms to minimize.
[2024-05-23 16:47:05] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:47:14] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 3 ms to minimize.
[2024-05-23 16:47:14] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:47:14] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:47:15] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:47:15] [INFO ] Deduced a trap composed of 77 places in 251 ms of which 4 ms to minimize.
[2024-05-23 16:47:16] [INFO ] Deduced a trap composed of 76 places in 243 ms of which 3 ms to minimize.
[2024-05-23 16:47:16] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:47:17] [INFO ] Deduced a trap composed of 78 places in 313 ms of which 4 ms to minimize.
[2024-05-23 16:47:17] [INFO ] Deduced a trap composed of 73 places in 298 ms of which 3 ms to minimize.
[2024-05-23 16:47:17] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:47:18] [INFO ] Deduced a trap composed of 72 places in 316 ms of which 3 ms to minimize.
[2024-05-23 16:47:18] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 3 ms to minimize.
[2024-05-23 16:47:18] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 3 ms to minimize.
[2024-05-23 16:47:19] [INFO ] Deduced a trap composed of 48 places in 328 ms of which 4 ms to minimize.
[2024-05-23 16:47:19] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:47:19] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 4 ms to minimize.
[2024-05-23 16:47:20] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 4 ms to minimize.
[2024-05-23 16:47:20] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:47:20] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:47:21] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:47:23] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2024-05-23 16:47:23] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:47:24] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2024-05-23 16:47:24] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:47:24] [INFO ] Deduced a trap composed of 80 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:47:25] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2024-05-23 16:47:25] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:47:25] [INFO ] Deduced a trap composed of 79 places in 292 ms of which 3 ms to minimize.
[2024-05-23 16:47:26] [INFO ] Deduced a trap composed of 71 places in 294 ms of which 3 ms to minimize.
[2024-05-23 16:47:26] [INFO ] Deduced a trap composed of 58 places in 297 ms of which 3 ms to minimize.
[2024-05-23 16:47:26] [INFO ] Deduced a trap composed of 64 places in 295 ms of which 3 ms to minimize.
[2024-05-23 16:47:27] [INFO ] Deduced a trap composed of 57 places in 258 ms of which 3 ms to minimize.
[2024-05-23 16:47:27] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 3 ms to minimize.
[2024-05-23 16:47:28] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:47:28] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 3 ms to minimize.
[2024-05-23 16:47:28] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 3 ms to minimize.
[2024-05-23 16:47:28] [INFO ] Deduced a trap composed of 77 places in 321 ms of which 3 ms to minimize.
[2024-05-23 16:47:29] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 3 ms to minimize.
[2024-05-23 16:47:29] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 2 ms to minimize.
[2024-05-23 16:47:30] [INFO ] Deduced a trap composed of 97 places in 286 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:47:32] [INFO ] Deduced a trap composed of 83 places in 325 ms of which 3 ms to minimize.
[2024-05-23 16:47:33] [INFO ] Deduced a trap composed of 111 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:47:33] [INFO ] Deduced a trap composed of 100 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:47:33] [INFO ] Deduced a trap composed of 94 places in 273 ms of which 2 ms to minimize.
[2024-05-23 16:47:34] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 3 ms to minimize.
[2024-05-23 16:47:34] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 3 ms to minimize.
[2024-05-23 16:47:34] [INFO ] Deduced a trap composed of 56 places in 327 ms of which 3 ms to minimize.
[2024-05-23 16:47:35] [INFO ] Deduced a trap composed of 96 places in 285 ms of which 3 ms to minimize.
[2024-05-23 16:47:35] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:47:36] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 3 ms to minimize.
[2024-05-23 16:47:36] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 4 ms to minimize.
[2024-05-23 16:47:36] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:47:36] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 3 ms to minimize.
[2024-05-23 16:47:37] [INFO ] Deduced a trap composed of 84 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:47:37] [INFO ] Deduced a trap composed of 65 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:47:38] [INFO ] Deduced a trap composed of 79 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:47:38] [INFO ] Deduced a trap composed of 85 places in 301 ms of which 3 ms to minimize.
[2024-05-23 16:47:39] [INFO ] Deduced a trap composed of 49 places in 330 ms of which 3 ms to minimize.
[2024-05-23 16:47:39] [INFO ] Deduced a trap composed of 91 places in 348 ms of which 4 ms to minimize.
[2024-05-23 16:47:39] [INFO ] Deduced a trap composed of 88 places in 315 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:47:51] [INFO ] Deduced a trap composed of 84 places in 286 ms of which 3 ms to minimize.
[2024-05-23 16:47:51] [INFO ] Deduced a trap composed of 79 places in 268 ms of which 9 ms to minimize.
[2024-05-23 16:47:52] [INFO ] Deduced a trap composed of 81 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:47:52] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 3 ms to minimize.
[2024-05-23 16:47:53] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 2 ms to minimize.
[2024-05-23 16:47:53] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-05-23 16:47:53] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-23 16:47:55] [INFO ] Deduced a trap composed of 61 places in 279 ms of which 3 ms to minimize.
[2024-05-23 16:47:55] [INFO ] Deduced a trap composed of 59 places in 296 ms of which 3 ms to minimize.
[2024-05-23 16:47:56] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 3 ms to minimize.
[2024-05-23 16:47:56] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:47:58] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:47:59] [INFO ] Deduced a trap composed of 78 places in 291 ms of which 3 ms to minimize.
[2024-05-23 16:47:59] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:47:59] [INFO ] Deduced a trap composed of 78 places in 267 ms of which 7 ms to minimize.
[2024-05-23 16:47:59] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:48:00] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 2 ms to minimize.
[2024-05-23 16:48:00] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 3 ms to minimize.
[2024-05-23 16:48:00] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 3 ms to minimize.
[2024-05-23 16:48:01] [INFO ] Deduced a trap composed of 69 places in 315 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:48:04] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 3 ms to minimize.
[2024-05-23 16:48:05] [INFO ] Deduced a trap composed of 78 places in 267 ms of which 3 ms to minimize.
[2024-05-23 16:48:05] [INFO ] Deduced a trap composed of 117 places in 248 ms of which 3 ms to minimize.
[2024-05-23 16:48:05] [INFO ] Deduced a trap composed of 98 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:48:06] [INFO ] Deduced a trap composed of 65 places in 299 ms of which 3 ms to minimize.
[2024-05-23 16:48:06] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 3 ms to minimize.
[2024-05-23 16:48:07] [INFO ] Deduced a trap composed of 93 places in 281 ms of which 4 ms to minimize.
[2024-05-23 16:48:07] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 3 ms to minimize.
[2024-05-23 16:48:07] [INFO ] Deduced a trap composed of 91 places in 279 ms of which 4 ms to minimize.
[2024-05-23 16:48:08] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:48:10] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 4 ms to minimize.
[2024-05-23 16:48:10] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 4 ms to minimize.
[2024-05-23 16:48:10] [INFO ] Deduced a trap composed of 83 places in 313 ms of which 4 ms to minimize.
[2024-05-23 16:48:11] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:48:11] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-23 16:48:11] [INFO ] Deduced a trap composed of 67 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:48:12] [INFO ] Deduced a trap composed of 79 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:48:12] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 3 ms to minimize.
[2024-05-23 16:48:12] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 2 ms to minimize.
[2024-05-23 16:48:13] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 950 unsolved
[2024-05-23 16:48:15] [INFO ] Deduced a trap composed of 60 places in 288 ms of which 3 ms to minimize.
[2024-05-23 16:48:15] [INFO ] Deduced a trap composed of 58 places in 279 ms of which 3 ms to minimize.
[2024-05-23 16:48:15] [INFO ] Deduced a trap composed of 56 places in 300 ms of which 3 ms to minimize.
[2024-05-23 16:48:16] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 3 ms to minimize.
[2024-05-23 16:48:16] [INFO ] Deduced a trap composed of 76 places in 253 ms of which 3 ms to minimize.
[2024-05-23 16:48:16] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 3 ms to minimize.
[2024-05-23 16:48:17] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 3 ms to minimize.
[2024-05-23 16:48:18] [INFO ] Deduced a trap composed of 80 places in 248 ms of which 2 ms to minimize.
[2024-05-23 16:48:18] [INFO ] Deduced a trap composed of 57 places in 283 ms of which 3 ms to minimize.
[2024-05-23 16:48:19] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 3 ms to minimize.
[2024-05-23 16:48:21] [INFO ] Deduced a trap composed of 100 places in 325 ms of which 3 ms to minimize.
[2024-05-23 16:48:22] [INFO ] Deduced a trap composed of 112 places in 312 ms of which 4 ms to minimize.
[2024-05-23 16:48:22] [INFO ] Deduced a trap composed of 78 places in 287 ms of which 3 ms to minimize.
[2024-05-23 16:48:23] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:48:25] [INFO ] Deduced a trap composed of 118 places in 271 ms of which 6 ms to minimize.
[2024-05-23 16:48:26] [INFO ] Deduced a trap composed of 104 places in 252 ms of which 2 ms to minimize.
[2024-05-23 16:48:26] [INFO ] Deduced a trap composed of 98 places in 254 ms of which 3 ms to minimize.
SMT process timed out in 120850ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Fused 950 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 75 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 69 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-05-23 16:48:26] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:48:26] [INFO ] Invariant cache hit.
[2024-05-23 16:48:27] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-23 16:48:27] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:48:27] [INFO ] Invariant cache hit.
[2024-05-23 16:48:27] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-05-23 16:48:28] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2024-05-23 16:48:28] [INFO ] Redundant transitions in 141 ms returned []
Running 1694 sub problems to find dead transitions.
[2024-05-23 16:48:28] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:48:28] [INFO ] Invariant cache hit.
[2024-05-23 16:48:28] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-05-23 16:48:43] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:48:43] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-23 16:48:43] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2024-05-23 16:48:44] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:48:44] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:48:44] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:48:44] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:48:44] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:48:44] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:48:48] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:48:48] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:48:49] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:48:49] [INFO ] Deduced a trap composed of 64 places in 320 ms of which 3 ms to minimize.
[2024-05-23 16:48:49] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 3 ms to minimize.
[2024-05-23 16:48:50] [INFO ] Deduced a trap composed of 70 places in 329 ms of which 3 ms to minimize.
[2024-05-23 16:48:50] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 3 ms to minimize.
[2024-05-23 16:48:50] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:48:51] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 3 ms to minimize.
[2024-05-23 16:48:51] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 4 ms to minimize.
[2024-05-23 16:48:51] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2024-05-23 16:48:55] [INFO ] Deduced a trap composed of 60 places in 311 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 63 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 62 places in 294 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 68 places in 325 ms of which 4 ms to minimize.
[2024-05-23 16:48:57] [INFO ] Deduced a trap composed of 77 places in 304 ms of which 4 ms to minimize.
[2024-05-23 16:48:57] [INFO ] Deduced a trap composed of 74 places in 326 ms of which 3 ms to minimize.
[2024-05-23 16:48:58] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 3 ms to minimize.
[2024-05-23 16:48:58] [INFO ] Deduced a trap composed of 106 places in 308 ms of which 3 ms to minimize.
[2024-05-23 16:48:58] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:48:59] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 3 ms to minimize.
[2024-05-23 16:48:59] [INFO ] Deduced a trap composed of 79 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:48:59] [INFO ] Deduced a trap composed of 56 places in 324 ms of which 3 ms to minimize.
SMT process timed out in 31159ms, After SMT, problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 31178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33169 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 16272 ms. (24 steps per ms) remains 72/161 properties
Running SMT prover for 72 properties.
[2024-05-23 16:49:04] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:49:04] [INFO ] Invariant cache hit.
[2024-05-23 16:49:05] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 16:49:05] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-23 16:49:05] [INFO ] After 387ms SMT Verify possible using state equation in real domain returned unsat :0 sat :72
[2024-05-23 16:49:05] [INFO ] State equation strengthened by 424 read => feed constraints.
[2024-05-23 16:49:06] [INFO ] After 464ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :72
TRAPS : Iteration 0
[2024-05-23 16:49:09] [INFO ] After 4163ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:72
[2024-05-23 16:49:09] [INFO ] After 4747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:72
[2024-05-23 16:49:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-23 16:49:09] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-23 16:49:10] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :72
[2024-05-23 16:49:10] [INFO ] After 583ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :72
TRAPS : Iteration 0
[2024-05-23 16:49:11] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 3 ms to minimize.
[2024-05-23 16:49:11] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 3 ms to minimize.
[2024-05-23 16:49:11] [INFO ] Deduced a trap composed of 48 places in 350 ms of which 4 ms to minimize.
[2024-05-23 16:49:12] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 4 ms to minimize.
[2024-05-23 16:49:12] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:49:12] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 3 ms to minimize.
[2024-05-23 16:49:13] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:49:13] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:49:13] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 3 ms to minimize.
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 3 ms to minimize.
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 2 ms to minimize.
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:49:15] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2024-05-23 16:49:15] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:49:15] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-23 16:49:15] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4613 ms
[2024-05-23 16:49:15] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:49:15] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:49:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2024-05-23 16:49:16] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 3 ms to minimize.
[2024-05-23 16:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2024-05-23 16:49:16] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 3 ms to minimize.
[2024-05-23 16:49:16] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-23 16:49:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 472 ms
[2024-05-23 16:49:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-23 16:49:17] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:49:17] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-23 16:49:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2024-05-23 16:49:18] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-23 16:49:18] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-23 16:49:18] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:49:19] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:49:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2024-05-23 16:49:19] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2024-05-23 16:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-23 16:49:19] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 4 ms to minimize.
[2024-05-23 16:49:19] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:49:20] [INFO ] Deduced a trap composed of 113 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:49:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 942 ms
[2024-05-23 16:49:20] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:49:20] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-05-23 16:49:20] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-23 16:49:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2024-05-23 16:49:21] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-05-23 16:49:21] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:49:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2024-05-23 16:49:21] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:49:21] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:49:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2024-05-23 16:49:22] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:49:22] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-05-23 16:49:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2024-05-23 16:49:23] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
TRAPS : Iteration 1
[2024-05-23 16:49:24] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-23 16:49:26] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:49:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
TRAPS : Iteration 2
[2024-05-23 16:49:28] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:49:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-05-23 16:49:29] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:49:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
TRAPS : Iteration 3
[2024-05-23 16:49:35] [INFO ] After 24842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :72
[2024-05-23 16:49:35] [INFO ] After 26263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :72
RANDOM walk for 409 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/1 properties
RANDOM walk for 816 steps (0 resets) in 7 ms. (102 steps per ms) remains 0/1 properties
RANDOM walk for 1334 steps (0 resets) in 8 ms. (148 steps per ms) remains 0/1 properties
RANDOM walk for 841 steps (0 resets) in 7 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 1785 steps (0 resets) in 8 ms. (198 steps per ms) remains 0/1 properties
RANDOM walk for 1237 steps (0 resets) in 6 ms. (176 steps per ms) remains 0/1 properties
RANDOM walk for 2069 steps (0 resets) in 15 ms. (129 steps per ms) remains 0/1 properties
RANDOM walk for 1644 steps (0 resets) in 10 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 2480 steps (0 resets) in 10 ms. (225 steps per ms) remains 0/1 properties
RANDOM walk for 1941 steps (0 resets) in 8 ms. (215 steps per ms) remains 0/1 properties
RANDOM walk for 201 steps (0 resets) in 5 ms. (33 steps per ms) remains 0/1 properties
RANDOM walk for 2549 steps (0 resets) in 10 ms. (231 steps per ms) remains 0/1 properties
RANDOM walk for 1197 steps (0 resets) in 5 ms. (199 steps per ms) remains 0/1 properties
RANDOM walk for 1718 steps (0 resets) in 9 ms. (171 steps per ms) remains 0/1 properties
RANDOM walk for 2159 steps (0 resets) in 9 ms. (215 steps per ms) remains 0/1 properties
RANDOM walk for 2632 steps (0 resets) in 12 ms. (202 steps per ms) remains 0/1 properties
RANDOM walk for 69 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 454 steps (0 resets) in 6 ms. (64 steps per ms) remains 0/1 properties
RANDOM walk for 1723 steps (0 resets) in 9 ms. (172 steps per ms) remains 0/1 properties
RANDOM walk for 1975 steps (0 resets) in 8 ms. (219 steps per ms) remains 0/1 properties
RANDOM walk for 2453 steps (0 resets) in 12 ms. (188 steps per ms) remains 0/1 properties
RANDOM walk for 100 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 380 steps (0 resets) in 4 ms. (76 steps per ms) remains 0/1 properties
RANDOM walk for 949 steps (0 resets) in 6 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 2137 steps (0 resets) in 10 ms. (194 steps per ms) remains 0/1 properties
RANDOM walk for 2684 steps (0 resets) in 10 ms. (244 steps per ms) remains 0/1 properties
RANDOM walk for 103 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 629 steps (0 resets) in 6 ms. (89 steps per ms) remains 0/1 properties
RANDOM walk for 892 steps (0 resets) in 6 ms. (127 steps per ms) remains 0/1 properties
RANDOM walk for 1508 steps (0 resets) in 8 ms. (167 steps per ms) remains 0/1 properties
RANDOM walk for 2505 steps (0 resets) in 11 ms. (208 steps per ms) remains 0/1 properties
RANDOM walk for 108 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
RANDOM walk for 353 steps (0 resets) in 5 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 990 steps (0 resets) in 7 ms. (123 steps per ms) remains 0/1 properties
RANDOM walk for 1301 steps (0 resets) in 7 ms. (162 steps per ms) remains 0/1 properties
RANDOM walk for 1805 steps (0 resets) in 9 ms. (180 steps per ms) remains 0/1 properties
RANDOM walk for 969 steps (0 resets) in 6 ms. (138 steps per ms) remains 0/1 properties
RANDOM walk for 1297 steps (0 resets) in 8 ms. (144 steps per ms) remains 0/1 properties
RANDOM walk for 1882 steps (0 resets) in 9 ms. (188 steps per ms) remains 0/1 properties
RANDOM walk for 2142 steps (0 resets) in 9 ms. (214 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 30076 steps (7 resets) in 152 ms. (196 steps per ms) remains 0/1 properties
RANDOM walk for 390 steps (0 resets) in 6 ms. (55 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 990 steps (0 resets) in 7 ms. (123 steps per ms) remains 0/1 properties
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 1456 steps (0 resets) in 9 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 33 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 1894 steps (0 resets) in 11 ms. (157 steps per ms) remains 0/1 properties
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 2232 steps (0 resets) in 9 ms. (223 steps per ms) remains 0/1 properties
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 2529 steps (0 resets) in 10 ms. (229 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442280 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442280 steps, saw 263480 distinct states, run finished after 3010 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-23 16:49:39] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:49:39] [INFO ] Invariant cache hit.
[2024-05-23 16:49:39] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:41] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:49:41] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-05-23 16:49:41] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2153ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 53 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 10 ms.
RANDOM walk for 40000 steps (8 resets) in 724 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 435976 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 435976 steps, saw 259659 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2024-05-23 16:49:45] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:49:45] [INFO ] Invariant cache hit.
[2024-05-23 16:49:45] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:45] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:46] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 4 ms to minimize.
[2024-05-23 16:49:46] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:49:46] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-05-23 16:49:47] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:49:47] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:49:47] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:49:47] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2562ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 69 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 509832 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 509832 steps, saw 198188 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-23 16:49:50] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:49:50] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 16:49:51] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:51] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:51] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 187/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:52] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 2 ms to minimize.
[2024-05-23 16:49:52] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2024-05-23 16:49:52] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/518 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 294/812 variables, 204/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 187/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:52] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1813ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:49:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:49:52] [INFO ] Invariant cache hit.
[2024-05-23 16:49:53] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-23 16:49:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:49:53] [INFO ] Invariant cache hit.
[2024-05-23 16:49:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:49:55] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2024-05-23 16:49:55] [INFO ] Redundant transitions in 41 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:49:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:49:55] [INFO ] Invariant cache hit.
[2024-05-23 16:49:55] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:50:07] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 4 ms to minimize.
[2024-05-23 16:50:07] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:50:07] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:50:07] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:50:07] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2024-05-23 16:50:08] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:50:09] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:50:09] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:50:09] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:50:09] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 2 ms to minimize.
[2024-05-23 16:50:09] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 3 ms to minimize.
[2024-05-23 16:50:10] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 3 ms to minimize.
[2024-05-23 16:50:10] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:50:10] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:50:10] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 2 ms to minimize.
[2024-05-23 16:50:10] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 2 ms to minimize.
[2024-05-23 16:50:11] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 3 ms to minimize.
[2024-05-23 16:50:11] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:50:11] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:50:11] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:50:12] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:50:14] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:50:16] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-23 16:50:16] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-23 16:50:18] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-23 16:50:20] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-23 16:50:24] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 3 ms to minimize.
[2024-05-23 16:50:24] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 3 ms to minimize.
[2024-05-23 16:50:25] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-23 16:50:25] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:50:25] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-23 16:50:25] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:50:25] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 3 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 308/812 variables, and 55 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:50:33] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 2 ms to minimize.
[2024-05-23 16:50:34] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:50:34] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 3 ms to minimize.
[2024-05-23 16:50:34] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 2 ms to minimize.
[2024-05-23 16:50:35] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2024-05-23 16:50:35] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:50:35] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 2 ms to minimize.
[2024-05-23 16:50:35] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 3 ms to minimize.
[2024-05-23 16:50:36] [INFO ] Deduced a trap composed of 71 places in 229 ms of which 3 ms to minimize.
[2024-05-23 16:50:36] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:50:36] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 3 ms to minimize.
[2024-05-23 16:50:37] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:50:37] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 3 ms to minimize.
[2024-05-23 16:50:37] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:50:37] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 3 ms to minimize.
[2024-05-23 16:50:38] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:50:38] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 3 ms to minimize.
[2024-05-23 16:50:38] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 2 ms to minimize.
[2024-05-23 16:50:39] [INFO ] Deduced a trap composed of 56 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:50:39] [INFO ] Deduced a trap composed of 61 places in 243 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:50:41] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:50:43] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:50:45] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 2 ms to minimize.
[2024-05-23 16:50:47] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 3 ms to minimize.
[2024-05-23 16:50:47] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 2 ms to minimize.
[2024-05-23 16:50:48] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:50:50] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-23 16:50:51] [INFO ] Deduced a trap composed of 73 places in 233 ms of which 2 ms to minimize.
[2024-05-23 16:50:52] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 3 ms to minimize.
[2024-05-23 16:50:52] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-23 16:50:53] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:50:53] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 3 ms to minimize.
[2024-05-23 16:50:53] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 3 ms to minimize.
[2024-05-23 16:50:54] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:50:54] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2024-05-23 16:50:54] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:50:54] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:50:55] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 3 ms to minimize.
[2024-05-23 16:50:56] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 3 ms to minimize.
[2024-05-23 16:50:56] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 3 ms to minimize.
SMT process timed out in 61066ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61085ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63530 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 61 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2024-05-23 16:50:56] [INFO ] Computed 15 invariants in 0 ms
[2024-05-23 16:50:56] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 16:50:56] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:50:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:50:56] [INFO ] After 39ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:50:56] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:50:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 95 ms returned sat
[2024-05-23 16:50:57] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:50:57] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:50:57] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:50:57] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 982 ms.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440976 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440976 steps, saw 262682 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-23 16:51:00] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-05-23 16:51:00] [INFO ] Computed 22 invariants in 9 ms
[2024-05-23 16:51:00] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:01] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:51:01] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 2 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 2 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2024-05-23 16:51:02] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:51:03] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3026ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 62 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 219398 steps, run visited all 1 properties in 1331 ms. (steps per millisecond=164 )
Probabilistic random walk after 219398 steps, saw 108562 distinct states, run finished after 1337 ms. (steps per millisecond=164 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 96174 steps, run visited all 1 properties in 638 ms. (steps per millisecond=150 )
Probabilistic random walk after 96174 steps, saw 65378 distinct states, run finished after 639 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442592 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442592 steps, saw 263611 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-23 16:51:08] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:51:08] [INFO ] Invariant cache hit.
[2024-05-23 16:51:08] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:09] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:10] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 3 ms to minimize.
[2024-05-23 16:51:10] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-23 16:51:10] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-23 16:51:10] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:11] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1482 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2349ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 48 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26934 steps, run visited all 1 properties in 165 ms. (steps per millisecond=163 )
Probabilistic random walk after 26934 steps, saw 18143 distinct states, run finished after 165 ms. (steps per millisecond=163 ) properties seen :1
RANDOM walk for 13356 steps (2 resets) in 37 ms. (351 steps per ms) remains 0/1 properties
RANDOM walk for 291 steps (0 resets) in 4 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 42 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 450056 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 450056 steps, saw 267821 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-23 16:51:14] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:51:14] [INFO ] Invariant cache hit.
[2024-05-23 16:51:14] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:15] [INFO ] Deduced a trap composed of 80 places in 286 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:15] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2024-05-23 16:51:16] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:51:16] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:51:16] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:51:16] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:16] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1318 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2249ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 58 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 453024 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 453024 steps, saw 269131 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-23 16:51:19] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:51:19] [INFO ] Invariant cache hit.
[2024-05-23 16:51:19] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:20] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:20] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 3 ms to minimize.
[2024-05-23 16:51:21] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2024-05-23 16:51:21] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2024-05-23 16:51:21] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:51:21] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:51:21] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2108ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3747 steps, including 132 resets, run visited all 1 properties in 14 ms. (steps per millisecond=267 )
Parikh walk visited 1 properties in 14 ms.
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 128790 steps, run visited all 1 properties in 877 ms. (steps per millisecond=146 )
Probabilistic random walk after 128790 steps, saw 85754 distinct states, run finished after 878 ms. (steps per millisecond=146 ) properties seen :1
RANDOM walk for 65 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 172198 steps, run visited all 1 properties in 1134 ms. (steps per millisecond=151 )
Probabilistic random walk after 172198 steps, saw 111859 distinct states, run finished after 1134 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 90342 steps, run visited all 1 properties in 598 ms. (steps per millisecond=151 )
Probabilistic random walk after 90342 steps, saw 61693 distinct states, run finished after 598 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 30024 steps (6 resets) in 79 ms. (375 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33509 steps (7 resets) in 25 ms. (1288 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 229926 steps, run visited all 1 properties in 1524 ms. (steps per millisecond=150 )
Probabilistic random walk after 229926 steps, saw 146021 distinct states, run finished after 1524 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 452872 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 452872 steps, saw 269055 distinct states, run finished after 3003 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-23 16:51:29] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:51:29] [INFO ] Invariant cache hit.
[2024-05-23 16:51:29] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:30] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:31] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 4 ms to minimize.
[2024-05-23 16:51:31] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 3 ms to minimize.
[2024-05-23 16:51:31] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-05-23 16:51:31] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:51:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-23 16:51:31] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2392ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 47790 steps, run visited all 1 properties in 323 ms. (steps per millisecond=147 )
Probabilistic random walk after 47790 steps, saw 34076 distinct states, run finished after 328 ms. (steps per millisecond=145 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 451472 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451472 steps, saw 268605 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-23 16:51:35] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:51:35] [INFO ] Invariant cache hit.
[2024-05-23 16:51:35] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:35] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:36] [INFO ] Deduced a trap composed of 90 places in 302 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:36] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:51:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1669ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 50 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506960 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506960 steps, saw 197229 distinct states, run finished after 3003 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 16:51:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:51:40] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:51:40] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:40] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:51:41] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 38 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 37 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:51:41] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:51:41] [INFO ] Invariant cache hit.
[2024-05-23 16:51:42] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-23 16:51:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:51:42] [INFO ] Invariant cache hit.
[2024-05-23 16:51:42] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:51:43] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-23 16:51:43] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:51:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:51:43] [INFO ] Invariant cache hit.
[2024-05-23 16:51:43] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:51:56] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 4 ms to minimize.
[2024-05-23 16:51:56] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-05-23 16:51:56] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:51:57] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:51:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:51:57] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:51:58] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:51:58] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 2 ms to minimize.
[2024-05-23 16:51:58] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:51:58] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:51:59] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 2 ms to minimize.
[2024-05-23 16:51:59] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 3 ms to minimize.
[2024-05-23 16:51:59] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 2 ms to minimize.
[2024-05-23 16:51:59] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2024-05-23 16:51:59] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 3 ms to minimize.
[2024-05-23 16:52:00] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 2 ms to minimize.
[2024-05-23 16:52:00] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 3 ms to minimize.
[2024-05-23 16:52:00] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:52:00] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:52:00] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:52:01] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:52:03] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:52:05] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:52:07] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:52:09] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-23 16:52:13] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:52:13] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 9 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:52:14] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 55 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:52:23] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:52:23] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 2 ms to minimize.
[2024-05-23 16:52:23] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
[2024-05-23 16:52:23] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 2 ms to minimize.
[2024-05-23 16:52:24] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:52:24] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:52:24] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:52:24] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 3 ms to minimize.
[2024-05-23 16:52:25] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 3 ms to minimize.
[2024-05-23 16:52:25] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2024-05-23 16:52:25] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 6 ms to minimize.
[2024-05-23 16:52:26] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:52:26] [INFO ] Deduced a trap composed of 83 places in 238 ms of which 3 ms to minimize.
[2024-05-23 16:52:26] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-23 16:52:26] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 3 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:52:27] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 3 ms to minimize.
[2024-05-23 16:52:28] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:52:29] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 2 ms to minimize.
[2024-05-23 16:52:32] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-05-23 16:52:34] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 2 ms to minimize.
[2024-05-23 16:52:36] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 3 ms to minimize.
[2024-05-23 16:52:36] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 2 ms to minimize.
[2024-05-23 16:52:37] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-05-23 16:52:38] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-23 16:52:40] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 3 ms to minimize.
[2024-05-23 16:52:40] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 3 ms to minimize.
[2024-05-23 16:52:41] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-23 16:52:41] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:52:42] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2024-05-23 16:52:42] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 3 ms to minimize.
[2024-05-23 16:52:42] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-05-23 16:52:43] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2024-05-23 16:52:43] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:52:43] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:52:44] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:52:44] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 3 ms to minimize.
SMT process timed out in 60941ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63203 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 46 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2024-05-23 16:52:44] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:52:45] [INFO ] [Real]Absence check using 15 positive place invariants in 129 ms returned sat
[2024-05-23 16:52:45] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:52:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:52:45] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:52:45] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:52:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 16:52:45] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:52:45] [INFO ] After 33ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:52:45] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:52:45] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 788 ms.
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 364350 steps, run visited all 1 properties in 2454 ms. (steps per millisecond=148 )
Probabilistic random walk after 364350 steps, saw 222216 distinct states, run finished after 2454 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 113158 steps, run visited all 1 properties in 754 ms. (steps per millisecond=150 )
Probabilistic random walk after 113158 steps, saw 76084 distinct states, run finished after 754 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 37059 steps (8 resets) in 137 ms. (268 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22478 steps, run visited all 1 properties in 151 ms. (steps per millisecond=148 )
Probabilistic random walk after 22478 steps, saw 16711 distinct states, run finished after 151 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9766 steps, run visited all 1 properties in 68 ms. (steps per millisecond=143 )
Probabilistic random walk after 9766 steps, saw 7506 distinct states, run finished after 68 ms. (steps per millisecond=143 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69470 steps, run visited all 1 properties in 512 ms. (steps per millisecond=135 )
Probabilistic random walk after 69470 steps, saw 48247 distinct states, run finished after 512 ms. (steps per millisecond=135 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 156830 steps, run visited all 1 properties in 1037 ms. (steps per millisecond=151 )
Probabilistic random walk after 156830 steps, saw 102967 distinct states, run finished after 1037 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 137334 steps, run visited all 1 properties in 909 ms. (steps per millisecond=151 )
Probabilistic random walk after 137334 steps, saw 91235 distinct states, run finished after 909 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 65622 steps, run visited all 1 properties in 488 ms. (steps per millisecond=134 )
Probabilistic random walk after 65622 steps, saw 45757 distinct states, run finished after 488 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2966 steps, run visited all 1 properties in 23 ms. (steps per millisecond=128 )
Probabilistic random walk after 2966 steps, saw 2436 distinct states, run finished after 23 ms. (steps per millisecond=128 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2246 steps, run visited all 1 properties in 18 ms. (steps per millisecond=124 )
Probabilistic random walk after 2246 steps, saw 1845 distinct states, run finished after 18 ms. (steps per millisecond=124 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449984 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449984 steps, saw 267793 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-23 16:52:56] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-05-23 16:52:56] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 16:52:56] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:52:56] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:52:57] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1713ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 57 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 507152 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 507152 steps, saw 197342 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 16:53:00] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:53:00] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:53:00] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:01] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:01] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-23 16:53:02] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 51 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:53:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:53:02] [INFO ] Invariant cache hit.
[2024-05-23 16:53:03] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-23 16:53:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:53:03] [INFO ] Invariant cache hit.
[2024-05-23 16:53:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:53:05] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
[2024-05-23 16:53:05] [INFO ] Redundant transitions in 29 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:53:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:53:05] [INFO ] Invariant cache hit.
[2024-05-23 16:53:05] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:53:16] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:53:17] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:53:17] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:53:17] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:53:17] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-05-23 16:53:18] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:53:19] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-05-23 16:53:19] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 3 ms to minimize.
[2024-05-23 16:53:19] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 2 ms to minimize.
[2024-05-23 16:53:19] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 2 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 2 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:53:20] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:53:21] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:53:23] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:53:25] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:53:25] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 2 ms to minimize.
[2024-05-23 16:53:27] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:53:29] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:53:33] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:53:33] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 3 ms to minimize.
[2024-05-23 16:53:34] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-23 16:53:34] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2024-05-23 16:53:34] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:53:34] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:53:34] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:53:35] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:53:36] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 4 ms to minimize.
SMT process timed out in 30996ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31015ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33434 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 27 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2024-05-23 16:53:36] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:53:36] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 16:53:36] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:53:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:53:36] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:53:36] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:53:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-23 16:53:36] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:53:36] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:53:36] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:53:36] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 312 ms.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 454016 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 454016 steps, saw 269550 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-23 16:53:39] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-05-23 16:53:39] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:53:39] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:40] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:53:40] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-23 16:53:40] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:53:40] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1746ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 44 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 51886 steps, run visited all 1 properties in 311 ms. (steps per millisecond=166 )
Probabilistic random walk after 51886 steps, saw 32735 distinct states, run finished after 311 ms. (steps per millisecond=166 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 102246 steps, run visited all 1 properties in 677 ms. (steps per millisecond=151 )
Probabilistic random walk after 102246 steps, saw 69177 distinct states, run finished after 677 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 151782 steps, run visited all 1 properties in 1056 ms. (steps per millisecond=143 )
Probabilistic random walk after 151782 steps, saw 99847 distinct states, run finished after 1056 ms. (steps per millisecond=143 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69038 steps, run visited all 1 properties in 458 ms. (steps per millisecond=150 )
Probabilistic random walk after 69038 steps, saw 48014 distinct states, run finished after 459 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1366 steps, run visited all 1 properties in 13 ms. (steps per millisecond=105 )
Probabilistic random walk after 1366 steps, saw 1152 distinct states, run finished after 13 ms. (steps per millisecond=105 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 758 steps, run visited all 1 properties in 9 ms. (steps per millisecond=84 )
Probabilistic random walk after 758 steps, saw 651 distinct states, run finished after 10 ms. (steps per millisecond=75 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 72278 steps, run visited all 1 properties in 478 ms. (steps per millisecond=151 )
Probabilistic random walk after 72278 steps, saw 50032 distinct states, run finished after 478 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 49510 steps, run visited all 1 properties in 327 ms. (steps per millisecond=151 )
Probabilistic random walk after 49510 steps, saw 35268 distinct states, run finished after 328 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 23638 steps, run visited all 1 properties in 158 ms. (steps per millisecond=149 )
Probabilistic random walk after 23638 steps, saw 17572 distinct states, run finished after 158 ms. (steps per millisecond=149 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9014 steps, run visited all 1 properties in 62 ms. (steps per millisecond=145 )
Probabilistic random walk after 9014 steps, saw 6971 distinct states, run finished after 62 ms. (steps per millisecond=145 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10662 steps, run visited all 1 properties in 74 ms. (steps per millisecond=144 )
Probabilistic random walk after 10662 steps, saw 8235 distinct states, run finished after 74 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 28 ms. (steps per millisecond=137 )
Probabilistic random walk after 3854 steps, saw 3124 distinct states, run finished after 28 ms. (steps per millisecond=137 ) properties seen :1
RANDOM walk for 317 steps (0 resets) in 5 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 779 steps (0 resets) in 6 ms. (111 steps per ms) remains 0/1 properties
RANDOM walk for 1456 steps (0 resets) in 9 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 1665 steps (0 resets) in 8 ms. (185 steps per ms) remains 0/1 properties
RANDOM walk for 1879 steps (0 resets) in 8 ms. (208 steps per ms) remains 0/1 properties
RANDOM walk for 2340 steps (0 resets) in 10 ms. (212 steps per ms) remains 0/1 properties
RANDOM walk for 355 steps (0 resets) in 6 ms. (50 steps per ms) remains 0/1 properties
RANDOM walk for 639 steps (0 resets) in 6 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 1296 steps (0 resets) in 7 ms. (162 steps per ms) remains 0/1 properties
RANDOM walk for 1695 steps (0 resets) in 9 ms. (169 steps per ms) remains 0/1 properties
RANDOM walk for 2089 steps (0 resets) in 9 ms. (208 steps per ms) remains 0/1 properties
RANDOM walk for 2427 steps (0 resets) in 10 ms. (220 steps per ms) remains 0/1 properties
RANDOM walk for 2660 steps (0 resets) in 10 ms. (241 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 446336 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 446336 steps, saw 265736 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-23 16:53:49] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2024-05-23 16:53:49] [INFO ] Invariant cache hit.
[2024-05-23 16:53:49] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:53:50] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1336ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 44 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502800 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502800 steps, saw 196066 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 16:53:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:53:53] [INFO ] Computed 22 invariants in 2 ms
[2024-05-23 16:53:53] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:53] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 188/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 950ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 39 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:53:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:53:54] [INFO ] Invariant cache hit.
[2024-05-23 16:53:55] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-23 16:53:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:53:55] [INFO ] Invariant cache hit.
[2024-05-23 16:53:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:53:57] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
[2024-05-23 16:53:57] [INFO ] Redundant transitions in 29 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:53:57] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:53:57] [INFO ] Invariant cache hit.
[2024-05-23 16:53:57] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:54:08] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 3 ms to minimize.
[2024-05-23 16:54:09] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:54:09] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-05-23 16:54:09] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:54:09] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:54:09] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-23 16:54:10] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:54:10] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 3 ms to minimize.
[2024-05-23 16:54:10] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 2 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 60 places in 208 ms of which 2 ms to minimize.
[2024-05-23 16:54:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:54:12] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:54:12] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:54:12] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 3 ms to minimize.
[2024-05-23 16:54:12] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:54:13] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:54:13] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:54:13] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:54:17] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:54:17] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 3 ms to minimize.
[2024-05-23 16:54:19] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:54:21] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-23 16:54:25] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:54:26] [INFO ] Deduced a trap composed of 54 places in 487 ms of which 4 ms to minimize.
[2024-05-23 16:54:26] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 4 ms to minimize.
[2024-05-23 16:54:26] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:54:26] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-23 16:54:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:54:27] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 55 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:54:35] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:54:35] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 3 ms to minimize.
[2024-05-23 16:54:35] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 3 ms to minimize.
[2024-05-23 16:54:36] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 2 ms to minimize.
[2024-05-23 16:54:36] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:54:36] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:54:36] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 2 ms to minimize.
[2024-05-23 16:54:37] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2024-05-23 16:54:37] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 3 ms to minimize.
[2024-05-23 16:54:37] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:54:38] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:54:38] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 2 ms to minimize.
[2024-05-23 16:54:38] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 3 ms to minimize.
[2024-05-23 16:54:38] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 3 ms to minimize.
[2024-05-23 16:54:39] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:54:39] [INFO ] Deduced a trap composed of 52 places in 239 ms of which 2 ms to minimize.
[2024-05-23 16:54:39] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 3 ms to minimize.
[2024-05-23 16:54:39] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 2 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 3 ms to minimize.
[2024-05-23 16:54:40] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:54:42] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 2 ms to minimize.
[2024-05-23 16:54:45] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:54:46] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 3 ms to minimize.
[2024-05-23 16:54:48] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 3 ms to minimize.
[2024-05-23 16:54:48] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 3 ms to minimize.
[2024-05-23 16:54:49] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:54:51] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:54:53] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 3 ms to minimize.
[2024-05-23 16:54:53] [INFO ] Deduced a trap composed of 52 places in 262 ms of which 3 ms to minimize.
[2024-05-23 16:54:53] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 2 ms to minimize.
[2024-05-23 16:54:54] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 2 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 3 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:54:55] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:54:56] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 3 ms to minimize.
[2024-05-23 16:54:57] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 2 ms to minimize.
[2024-05-23 16:54:57] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 95 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 73/73 constraints]
After SMT, in 60825ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63268 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 20 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2024-05-23 16:54:57] [INFO ] Computed 15 invariants in 0 ms
[2024-05-23 16:54:58] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-23 16:54:58] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:54:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:54:58] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:54:58] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:54:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-23 16:54:58] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:54:58] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:54:58] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:54:58] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 295 ms.
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 448448 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 448448 steps, saw 266902 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-23 16:55:01] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-05-23 16:55:01] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:55:01] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:55:01] [INFO ] Deduced a trap composed of 78 places in 288 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:55:02] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2024-05-23 16:55:03] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 59 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506856 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506856 steps, saw 197168 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 16:55:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:55:06] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:55:06] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:55:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:55:07] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:55:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:55:07] [INFO ] Invariant cache hit.
[2024-05-23 16:55:08] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-05-23 16:55:08] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:55:08] [INFO ] Invariant cache hit.
[2024-05-23 16:55:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:55:09] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2024-05-23 16:55:09] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:55:09] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:55:09] [INFO ] Invariant cache hit.
[2024-05-23 16:55:09] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:55:21] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:55:22] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:55:22] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-05-23 16:55:23] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:55:23] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 3 ms to minimize.
[2024-05-23 16:55:23] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:55:23] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 2 ms to minimize.
[2024-05-23 16:55:24] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:55:24] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 2 ms to minimize.
[2024-05-23 16:55:24] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 2 ms to minimize.
[2024-05-23 16:55:24] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:55:24] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 2 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 2 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:55:25] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:55:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:55:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2024-05-23 16:55:30] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 2 ms to minimize.
[2024-05-23 16:55:30] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:55:32] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:55:34] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:55:38] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 3 ms to minimize.
[2024-05-23 16:55:38] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 3 ms to minimize.
[2024-05-23 16:55:38] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-05-23 16:55:38] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:55:39] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 3 ms to minimize.
[2024-05-23 16:55:40] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 3 ms to minimize.
[2024-05-23 16:55:40] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 57 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 35/57 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:55:47] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 2 ms to minimize.
[2024-05-23 16:55:48] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-05-23 16:55:49] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
[2024-05-23 16:55:49] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 2 ms to minimize.
[2024-05-23 16:55:50] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-05-23 16:55:50] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:55:50] [INFO ] Deduced a trap composed of 51 places in 254 ms of which 2 ms to minimize.
[2024-05-23 16:55:51] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2024-05-23 16:55:51] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 3 ms to minimize.
[2024-05-23 16:55:51] [INFO ] Deduced a trap composed of 94 places in 258 ms of which 3 ms to minimize.
[2024-05-23 16:55:52] [INFO ] Deduced a trap composed of 97 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:55:52] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 3 ms to minimize.
[2024-05-23 16:55:52] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 4 ms to minimize.
[2024-05-23 16:55:52] [INFO ] Deduced a trap composed of 70 places in 255 ms of which 3 ms to minimize.
[2024-05-23 16:55:53] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:55:53] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 3 ms to minimize.
[2024-05-23 16:55:53] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:55:53] [INFO ] Deduced a trap composed of 75 places in 243 ms of which 3 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 3 ms to minimize.
[2024-05-23 16:55:54] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 3 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:56:06] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-23 16:56:07] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:56:08] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 2 ms to minimize.
[2024-05-23 16:56:08] [INFO ] Deduced a trap composed of 84 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:56:08] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 3 ms to minimize.
[2024-05-23 16:56:09] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 2 ms to minimize.
[2024-05-23 16:56:09] [INFO ] Deduced a trap composed of 68 places in 253 ms of which 3 ms to minimize.
[2024-05-23 16:56:09] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:56:09] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 3 ms to minimize.
[2024-05-23 16:56:10] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 3 ms to minimize.
[2024-05-23 16:56:10] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 3 ms to minimize.
[2024-05-23 16:56:10] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 93 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 71/71 constraints]
After SMT, in 60886ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63176 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 20 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2024-05-23 16:56:10] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:56:10] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2024-05-23 16:56:10] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:56:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:56:10] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:56:10] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:56:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-05-23 16:56:11] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:56:11] [INFO ] After 52ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:56:11] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:56:11] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 479 ms.
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449000 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449000 steps, saw 267225 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-23 16:56:14] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2024-05-23 16:56:14] [INFO ] Computed 22 invariants in 2 ms
[2024-05-23 16:56:14] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:56:14] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:56:15] [INFO ] Deduced a trap composed of 102 places in 324 ms of which 4 ms to minimize.
[2024-05-23 16:56:15] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:56:15] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1727ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 42 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 508256 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 508256 steps, saw 197838 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-23 16:56:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:56:19] [INFO ] Computed 22 invariants in 1 ms
[2024-05-23 16:56:19] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:56:19] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:56:19] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:56:20] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:56:20] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/812 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1262ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 34 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:56:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:56:20] [INFO ] Invariant cache hit.
[2024-05-23 16:56:21] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-23 16:56:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:56:21] [INFO ] Invariant cache hit.
[2024-05-23 16:56:21] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:56:22] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2024-05-23 16:56:22] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:56:22] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:56:22] [INFO ] Invariant cache hit.
[2024-05-23 16:56:22] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:56:34] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 3 ms to minimize.
[2024-05-23 16:56:34] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:56:35] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 2 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 2 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 2 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-05-23 16:56:36] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 2 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 3 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 2 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 3 ms to minimize.
[2024-05-23 16:56:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 2 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:56:38] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:56:39] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:56:39] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:56:41] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2024-05-23 16:56:43] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:56:43] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-05-23 16:56:45] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:56:47] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:56:51] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:56:51] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 3 ms to minimize.
[2024-05-23 16:56:51] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-23 16:56:52] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:56:52] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:56:52] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:56:52] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 3 ms to minimize.
[2024-05-23 16:56:53] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 3 ms to minimize.
[2024-05-23 16:56:53] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 4 ms to minimize.
SMT process timed out in 30850ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 30865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33206 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 386 place count 91 transition count 193
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 393 place count 91 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 400 place count 91 transition count 179
Free-agglomeration rule applied 38 times.
Iterating global reduction 4 with 38 rules applied. Total rules applied 438 place count 91 transition count 141
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 476 place count 53 transition count 141
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 486 place count 53 transition count 141
Applied a total of 486 rules in 18 ms. Remains 53 /308 variables (removed 255) and now considering 141/1463 (removed 1322) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 53 cols
[2024-05-23 16:56:53] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:56:53] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 16:56:53] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:56:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:56:53] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:56:53] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:56:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 16:56:53] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:56:53] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:56:53] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:56:53] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 221 ms.
RANDOM walk for 1981 steps (0 resets) in 8 ms. (220 steps per ms) remains 0/1 properties
RANDOM walk for 353 steps (0 resets) in 6 ms. (50 steps per ms) remains 0/1 properties
RANDOM walk for 690 steps (0 resets) in 5 ms. (115 steps per ms) remains 0/1 properties
RANDOM walk for 1513 steps (0 resets) in 7 ms. (189 steps per ms) remains 0/1 properties
RANDOM walk for 1492 steps (0 resets) in 8 ms. (165 steps per ms) remains 0/1 properties
RANDOM walk for 2028 steps (0 resets) in 9 ms. (202 steps per ms) remains 0/1 properties
RANDOM walk for 1982 steps (0 resets) in 8 ms. (220 steps per ms) remains 0/1 properties
RANDOM walk for 2695 steps (0 resets) in 13 ms. (192 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10110 steps, run visited all 1 properties in 70 ms. (steps per millisecond=144 )
Probabilistic random walk after 10110 steps, saw 7778 distinct states, run finished after 70 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10118 steps, run visited all 1 properties in 101 ms. (steps per millisecond=100 )
Probabilistic random walk after 10118 steps, saw 7785 distinct states, run finished after 101 ms. (steps per millisecond=100 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10126 steps, run visited all 1 properties in 70 ms. (steps per millisecond=144 )
Probabilistic random walk after 10126 steps, saw 7792 distinct states, run finished after 70 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10134 steps, run visited all 1 properties in 69 ms. (steps per millisecond=146 )
Probabilistic random walk after 10134 steps, saw 7799 distinct states, run finished after 70 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10142 steps, run visited all 1 properties in 70 ms. (steps per millisecond=144 )
Probabilistic random walk after 10142 steps, saw 7806 distinct states, run finished after 70 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46862 steps, run visited all 1 properties in 311 ms. (steps per millisecond=150 )
Probabilistic random walk after 46862 steps, saw 33349 distinct states, run finished after 315 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13662 steps, run visited all 1 properties in 93 ms. (steps per millisecond=146 )
Probabilistic random walk after 13662 steps, saw 10321 distinct states, run finished after 93 ms. (steps per millisecond=146 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46838 steps, run visited all 1 properties in 311 ms. (steps per millisecond=150 )
Probabilistic random walk after 46838 steps, saw 33328 distinct states, run finished after 312 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46846 steps, run visited all 1 properties in 310 ms. (steps per millisecond=151 )
Probabilistic random walk after 46846 steps, saw 33335 distinct states, run finished after 314 ms. (steps per millisecond=149 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46854 steps, run visited all 1 properties in 310 ms. (steps per millisecond=151 )
Probabilistic random walk after 46854 steps, saw 33342 distinct states, run finished after 310 ms. (steps per millisecond=151 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16942 steps, run visited all 1 properties in 114 ms. (steps per millisecond=148 )
Probabilistic random walk after 16942 steps, saw 12667 distinct states, run finished after 114 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16950 steps, run visited all 1 properties in 114 ms. (steps per millisecond=148 )
Probabilistic random walk after 16950 steps, saw 12674 distinct states, run finished after 115 ms. (steps per millisecond=147 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16918 steps, run visited all 1 properties in 117 ms. (steps per millisecond=144 )
Probabilistic random walk after 16918 steps, saw 12646 distinct states, run finished after 117 ms. (steps per millisecond=144 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16926 steps, run visited all 1 properties in 118 ms. (steps per millisecond=143 )
Probabilistic random walk after 16926 steps, saw 12653 distinct states, run finished after 118 ms. (steps per millisecond=143 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16934 steps, run visited all 1 properties in 117 ms. (steps per millisecond=144 )
Probabilistic random walk after 16934 steps, saw 12660 distinct states, run finished after 120 ms. (steps per millisecond=141 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6190 steps, run visited all 1 properties in 45 ms. (steps per millisecond=137 )
Probabilistic random walk after 6190 steps, saw 4788 distinct states, run finished after 46 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6198 steps, run visited all 1 properties in 76 ms. (steps per millisecond=81 )
Probabilistic random walk after 6198 steps, saw 4795 distinct states, run finished after 77 ms. (steps per millisecond=80 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6206 steps, run visited all 1 properties in 45 ms. (steps per millisecond=137 )
Probabilistic random walk after 6206 steps, saw 4802 distinct states, run finished after 46 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6174 steps, run visited all 1 properties in 45 ms. (steps per millisecond=137 )
Probabilistic random walk after 6174 steps, saw 4774 distinct states, run finished after 46 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6182 steps, run visited all 1 properties in 45 ms. (steps per millisecond=137 )
Probabilistic random walk after 6182 steps, saw 4781 distinct states, run finished after 46 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1846 steps, run visited all 1 properties in 16 ms. (steps per millisecond=115 )
Probabilistic random walk after 1846 steps, saw 1516 distinct states, run finished after 17 ms. (steps per millisecond=108 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1854 steps, run visited all 1 properties in 16 ms. (steps per millisecond=115 )
Probabilistic random walk after 1854 steps, saw 1523 distinct states, run finished after 17 ms. (steps per millisecond=109 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1862 steps, run visited all 1 properties in 17 ms. (steps per millisecond=109 )
Probabilistic random walk after 1862 steps, saw 1530 distinct states, run finished after 17 ms. (steps per millisecond=109 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1870 steps, run visited all 1 properties in 17 ms. (steps per millisecond=110 )
Probabilistic random walk after 1870 steps, saw 1537 distinct states, run finished after 17 ms. (steps per millisecond=110 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1838 steps, run visited all 1 properties in 17 ms. (steps per millisecond=108 )
Probabilistic random walk after 1838 steps, saw 1509 distinct states, run finished after 17 ms. (steps per millisecond=108 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 518 steps, run visited all 1 properties in 8 ms. (steps per millisecond=64 )
Probabilistic random walk after 518 steps, saw 445 distinct states, run finished after 8 ms. (steps per millisecond=64 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 526 steps, run visited all 1 properties in 8 ms. (steps per millisecond=65 )
Probabilistic random walk after 526 steps, saw 452 distinct states, run finished after 8 ms. (steps per millisecond=65 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 534 steps, run visited all 1 properties in 74 ms. (steps per millisecond=7 )
Probabilistic random walk after 534 steps, saw 459 distinct states, run finished after 78 ms. (steps per millisecond=6 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 542 steps, run visited all 1 properties in 7 ms. (steps per millisecond=77 )
Probabilistic random walk after 542 steps, saw 466 distinct states, run finished after 8 ms. (steps per millisecond=67 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 550 steps, run visited all 1 properties in 7 ms. (steps per millisecond=78 )
Probabilistic random walk after 550 steps, saw 473 distinct states, run finished after 8 ms. (steps per millisecond=68 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 158 steps, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
Probabilistic random walk after 158 steps, saw 141 distinct states, run finished after 5 ms. (steps per millisecond=31 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 166 steps, run visited all 1 properties in 5 ms. (steps per millisecond=33 )
Probabilistic random walk after 166 steps, saw 148 distinct states, run finished after 5 ms. (steps per millisecond=33 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 6 ms. (steps per millisecond=29 )
Probabilistic random walk after 174 steps, saw 155 distinct states, run finished after 6 ms. (steps per millisecond=29 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 204 edges and 342 vertex of which 15 / 342 are part of one of the 7 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 962 transitions
Reduce isomorphic transitions removed 987 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 334 transition count 701
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 321 transition count 695
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 315 transition count 695
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 39 place count 315 transition count 694
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 314 transition count 694
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 312 transition count 692
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 47 place count 311 transition count 711
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 67 place count 311 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 178 transitions
Redundant transition composition rules discarded 178 transitions
Iterating global reduction 4 with 178 rules applied. Total rules applied 245 place count 311 transition count 513
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 257 place count 305 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 291 place count 305 transition count 533
Free-agglomeration rule applied 47 times.
Iterating global reduction 4 with 47 rules applied. Total rules applied 338 place count 305 transition count 486
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 385 place count 258 transition count 486
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 391 place count 258 transition count 486
Applied a total of 391 rules in 44 ms. Remains 258 /342 variables (removed 84) and now considering 486/1701 (removed 1215) transitions.
Running SMT prover for 950 properties.
// Phase 1: matrix 486 rows 258 cols
[2024-05-23 16:56:59] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:57:05] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 16:57:05] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-23 16:57:34] [INFO ] After 34919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:950
[2024-05-23 16:57:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-23 16:57:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-23 16:58:05] [INFO ] After 19743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :950
TRAPS : Iteration 0
[2024-05-23 16:58:07] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-23 16:58:08] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-05-23 16:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 16:58:08] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-23 16:58:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-23 16:58:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-23 16:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-23 16:58:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms

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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r166-smll-171636274400112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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