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.r034-smll-171620174900112.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 AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-smll-171620174900112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 538K 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 1716245038374

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-20 22:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:44:01] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-05-20 22:44:01] [INFO ] Transformed 2230 places.
[2024-05-20 22:44:01] [INFO ] Transformed 2228 transitions.
[2024-05-20 22:44:01] [INFO ] Found NUPN structural information;
[2024-05-20 22:44:01] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 751 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 29 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 1 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 3 with 868 rules applied. Total rules applied 3458 place count 561 transition count 439
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3458 rules in 450 ms. Remains 561 /2230 variables (removed 1669) and now considering 439/2228 (removed 1789) transitions.
// Phase 1: matrix 439 rows 561 cols
[2024-05-20 22:44:01] [INFO ] Computed 148 invariants in 41 ms
[2024-05-20 22:44:03] [INFO ] Implicit Places using invariants in 1584 ms returned [171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 213, 216, 219, 222, 225, 228, 231, 234, 237, 240, 560]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1642 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 536/2230 places, 439/2228 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 536 transition count 415
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 512 transition count 415
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 100 place count 486 transition count 389
Applied a total of 100 rules in 49 ms. Remains 486 /536 variables (removed 50) and now considering 389/439 (removed 50) transitions.
// Phase 1: matrix 389 rows 486 cols
[2024-05-20 22:44:03] [INFO ] Computed 123 invariants in 5 ms
[2024-05-20 22:44:04] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-20 22:44:04] [INFO ] Invariant cache hit.
[2024-05-20 22:44:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-20 22:44:07] [INFO ] Implicit Places using invariants and state equation in 3393 ms returned []
Implicit Place search using SMT with State Equation took 4044 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 486/2230 places, 389/2228 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6214 ms. Remains : 486/2230 places, 389/2228 transitions.
Discarding 96 transitions out of 389. Remains 293
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (494 resets) in 4322 ms. (9 steps per ms) remains 115/292 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 115/115 properties
[2024-05-20 22:44:08] [INFO ] Invariant cache hit.
[2024-05-20 22:44:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 194/394 variables, 77/277 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 194/471 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-20 22:44:11] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 22 ms to minimize.
[2024-05-20 22:44:11] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 3 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 3 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 3 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:44:12] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/875 variables, and 481 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5023 ms.
Refiners :[Domain max(s): 394/486 constraints, Positive P Invariants (semi-flows): 77/123 constraints, State Equation: 0/486 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 194/394 variables, 77/277 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 194/471 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 10/481 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 3 ms to minimize.
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 3 ms to minimize.
[2024-05-20 22:44:15] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 7/488 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s5 0)
(s6 1)
(s7 0)
(s12 0)
(s13 0)
(s14 1)
(s19 0)
(s20 0)
(s21 1)
(s26 0)
(s27 0)
(s28 1)
(s33 0)
(s34 0)
(s35 1)
(s40 0)
(s41 0)
(s42 1)
(s47 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/875 variables, and 488 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5024 ms.
Refiners :[Domain max(s): 394/486 constraints, Positive P Invariants (semi-flows): 77/123 constraints, State Equation: 0/486 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/115 constraints, Known Traps: 17/17 constraints]
After SMT, in 10179ms problems are : Problem set: 0 solved, 115 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 389/389 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 467 transition count 370
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 467 transition count 370
Free-agglomeration rule applied 46 times.
Iterating global reduction 0 with 46 rules applied. Total rules applied 84 place count 467 transition count 324
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 130 place count 421 transition count 324
Applied a total of 130 rules in 100 ms. Remains 421 /486 variables (removed 65) and now considering 324/389 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 421/486 places, 324/389 transitions.
RANDOM walk for 4000000 steps (60696 resets) in 62530 ms. (63 steps per ms) remains 68/115 properties
BEST_FIRST walk for 400004 steps (252 resets) in 1682 ms. (237 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (254 resets) in 1518 ms. (263 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (365 resets) in 1465 ms. (272 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (368 resets) in 1280 ms. (312 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (370 resets) in 1323 ms. (302 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1229 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (367 resets) in 1280 ms. (312 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1229 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (369 resets) in 1277 ms. (312 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (342 resets) in 1228 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (370 resets) in 1271 ms. (314 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (346 resets) in 1212 ms. (329 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (362 resets) in 1246 ms. (320 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (342 resets) in 1192 ms. (335 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (368 resets) in 1236 ms. (323 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1201 ms. (332 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (373 resets) in 1232 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (339 resets) in 1199 ms. (333 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (375 resets) in 1237 ms. (323 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1223 ms. (326 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (372 resets) in 1250 ms. (319 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1232 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (365 resets) in 1242 ms. (321 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1201 ms. (332 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (370 resets) in 1239 ms. (322 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1190 ms. (335 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (369 resets) in 1232 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (335 resets) in 1197 ms. (333 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (369 resets) in 1229 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (339 resets) in 1194 ms. (334 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (365 resets) in 1235 ms. (323 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (349 resets) in 1191 ms. (335 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (371 resets) in 1231 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (342 resets) in 1217 ms. (328 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (338 resets) in 1227 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (368 resets) in 1263 ms. (316 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (340 resets) in 1222 ms. (327 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (344 resets) in 1225 ms. (326 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (346 resets) in 1228 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (337 resets) in 1226 ms. (326 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1221 ms. (327 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (352 resets) in 1227 ms. (325 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1220 ms. (327 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1221 ms. (327 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1224 ms. (326 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (344 resets) in 1224 ms. (326 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (343 resets) in 1226 ms. (326 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (346 resets) in 1193 ms. (335 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (344 resets) in 1233 ms. (324 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (334 resets) in 1211 ms. (330 steps per ms) remains 68/68 properties
// Phase 1: matrix 324 rows 421 cols
[2024-05-20 22:44:51] [INFO ] Computed 123 invariants in 4 ms
[2024-05-20 22:44:51] [INFO ] State equation strengthened by 166 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 183/294 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 127/421 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-20 22:44:53] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 4 ms to minimize.
[2024-05-20 22:44:53] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
[2024-05-20 22:44:54] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 3 ms to minimize.
[2024-05-20 22:44:54] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 324/745 variables, 421/548 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 166/714 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/745 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 714 constraints, problems are : Problem set: 0 solved, 68 unsolved in 15215 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 421/421 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 183/294 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 127/421 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-20 22:45:08] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 324/745 variables, 421/549 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 166/715 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/745 variables, 68/783 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-20 22:45:19] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/745 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 0/745 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 745/745 variables, and 784 constraints, problems are : Problem set: 0 solved, 68 unsolved in 36357 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 421/421 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 6/6 constraints]
After SMT, in 51623ms problems are : Problem set: 0 solved, 68 unsolved
Parikh walk visited 10 properties in 12041 ms.
Support contains 91 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 324/324 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 416 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 416 transition count 319
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 416 transition count 317
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 414 transition count 317
Applied a total of 14 rules in 60 ms. Remains 414 /421 variables (removed 7) and now considering 317/324 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 414/421 places, 317/324 transitions.
RANDOM walk for 4000000 steps (39391 resets) in 50491 ms. (79 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (240 resets) in 1242 ms. (321 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (239 resets) in 1228 ms. (325 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (334 resets) in 1298 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (295 resets) in 1205 ms. (331 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (333 resets) in 1284 ms. (311 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (292 resets) in 1203 ms. (332 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (281 resets) in 1207 ms. (331 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (332 resets) in 1279 ms. (312 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (295 resets) in 1198 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (298 resets) in 1214 ms. (329 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (331 resets) in 1296 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (280 resets) in 1641 ms. (243 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1449 ms. (275 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (337 resets) in 1302 ms. (306 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1221 ms. (327 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (278 resets) in 1219 ms. (327 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (341 resets) in 1294 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (300 resets) in 1215 ms. (328 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1225 ms. (326 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (333 resets) in 1298 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1628 ms. (245 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1336 ms. (299 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (329 resets) in 1283 ms. (311 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (296 resets) in 1214 ms. (329 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (288 resets) in 1207 ms. (331 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (274 resets) in 1208 ms. (330 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1209 ms. (330 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (283 resets) in 1234 ms. (323 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (286 resets) in 1242 ms. (321 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (285 resets) in 1648 ms. (242 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (299 resets) in 1326 ms. (301 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (285 resets) in 1203 ms. (332 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (278 resets) in 1211 ms. (330 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (285 resets) in 1205 ms. (331 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (278 resets) in 1215 ms. (328 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (289 resets) in 1214 ms. (329 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1209 ms. (330 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (294 resets) in 1202 ms. (332 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (289 resets) in 1209 ms. (330 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (300 resets) in 1203 ms. (332 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (285 resets) in 1216 ms. (328 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (281 resets) in 1219 ms. (327 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (291 resets) in 1205 ms. (331 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1376 ms. (290 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (289 resets) in 1568 ms. (254 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (284 resets) in 1425 ms. (280 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (293 resets) in 1211 ms. (330 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (289 resets) in 1425 ms. (280 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (289 resets) in 1825 ms. (219 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (294 resets) in 1236 ms. (323 steps per ms) remains 58/58 properties
Interrupted probabilistic random walk after 5615218 steps, run timeout after 87001 ms. (steps per millisecond=64 ) properties seen :25 out of 58
Probabilistic random walk after 5615218 steps, saw 1746515 distinct states, run finished after 87010 ms. (steps per millisecond=64 ) properties seen :25
// Phase 1: matrix 317 rows 414 cols
[2024-05-20 22:47:51] [INFO ] Computed 123 invariants in 3 ms
[2024-05-20 22:47:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 226/292 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 122/414 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 317/731 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 33 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 168/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/731 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 705 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4163 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 226/292 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 122/414 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 317/731 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 168/705 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 33/738 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/731 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 738 constraints, problems are : Problem set: 0 solved, 33 unsolved in 10524 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 14717ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 24 properties in 22401 ms.
Support contains 18 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 317/317 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 316
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 34 place count 413 transition count 284
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 66 place count 381 transition count 284
Applied a total of 66 rules in 92 ms. Remains 381 /414 variables (removed 33) and now considering 284/317 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 381/414 places, 284/317 transitions.
RANDOM walk for 4000000 steps (39584 resets) in 28779 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (5615 resets) in 12356 ms. (323 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4924 resets) in 11069 ms. (361 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (4865 resets) in 11045 ms. (362 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4923 resets) in 11045 ms. (362 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (4891 resets) in 11035 ms. (362 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4927 resets) in 11053 ms. (361 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4858 resets) in 11060 ms. (361 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (4947 resets) in 11023 ms. (362 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000004 steps (4959 resets) in 10943 ms. (365 steps per ms) remains 8/8 properties
// Phase 1: matrix 284 rows 381 cols
[2024-05-20 22:49:05] [INFO ] Computed 123 invariants in 5 ms
[2024-05-20 22:49:05] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 225/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 140/381 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 284/665 variables, 381/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 200/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 704 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 381/381 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 225/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 140/381 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 284/665 variables, 381/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 200/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 8/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/665 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 712 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 381/381 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3282ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 4238 ms.
Support contains 16 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 284/284 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 379 transition count 282
Applied a total of 4 rules in 47 ms. Remains 379 /381 variables (removed 2) and now considering 282/284 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 379/381 places, 282/284 transitions.
RANDOM walk for 4000000 steps (39599 resets) in 25954 ms. (154 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (5888 resets) in 11988 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (4987 resets) in 10620 ms. (376 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (5079 resets) in 10678 ms. (374 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (5073 resets) in 10652 ms. (375 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (4934 resets) in 10636 ms. (376 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (5054 resets) in 10655 ms. (375 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (5051 resets) in 10470 ms. (382 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (5014 resets) in 10483 ms. (381 steps per ms) remains 7/7 properties
// Phase 1: matrix 282 rows 379 cols
[2024-05-20 22:49:42] [INFO ] Computed 123 invariants in 2 ms
[2024-05-20 22:49:42] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 224/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 141/379 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 282/661 variables, 379/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 202/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/661 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 704 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 379/379 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 224/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 141/379 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 282/661 variables, 379/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 202/704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 7/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/661 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 711 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2108 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 379/379 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 3165ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 3673 ms.
Support contains 14 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 282/282 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 377 transition count 280
Applied a total of 4 rules in 25 ms. Remains 377 /379 variables (removed 2) and now considering 280/282 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 377/379 places, 280/282 transitions.
RANDOM walk for 4000000 steps (39483 resets) in 24284 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (6237 resets) in 11974 ms. (334 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (5194 resets) in 10547 ms. (379 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (5232 resets) in 10645 ms. (375 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (5147 resets) in 10510 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (5077 resets) in 10520 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (5148 resets) in 10462 ms. (382 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (5146 resets) in 10414 ms. (384 steps per ms) remains 6/6 properties
// Phase 1: matrix 280 rows 377 cols
[2024-05-20 22:50:14] [INFO ] Computed 123 invariants in 2 ms
[2024-05-20 22:50:14] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 223/235 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 142/377 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 280/657 variables, 377/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 204/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/657 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 704 constraints, problems are : Problem set: 0 solved, 6 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 377/377 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 223/235 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 142/377 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 280/657 variables, 377/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 204/704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 6/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/657 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 657/657 variables, and 710 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 377/377 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2650ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4690 ms.
Support contains 12 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 280/280 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 375 transition count 278
Applied a total of 4 rules in 34 ms. Remains 375 /377 variables (removed 2) and now considering 278/280 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 375/377 places, 278/280 transitions.
RANDOM walk for 4000000 steps (39656 resets) in 24844 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (6722 resets) in 12201 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5119 resets) in 10640 ms. (375 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5238 resets) in 10619 ms. (376 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5275 resets) in 10659 ms. (375 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5152 resets) in 10562 ms. (378 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (5291 resets) in 10561 ms. (378 steps per ms) remains 5/5 properties
// Phase 1: matrix 278 rows 375 cols
[2024-05-20 22:50:46] [INFO ] Computed 123 invariants in 4 ms
[2024-05-20 22:50:46] [INFO ] State equation strengthened by 206 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 222/232 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 143/375 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 278/653 variables, 375/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 206/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/653 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 704 constraints, problems are : Problem set: 0 solved, 5 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 375/375 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 222/232 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 143/375 variables, 117/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 278/653 variables, 375/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 206/704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 5/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/653 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 709 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 375/375 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2090ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2413 ms.
Support contains 10 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 278/278 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 375 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 373 transition count 276
Applied a total of 4 rules in 26 ms. Remains 373 /375 variables (removed 2) and now considering 276/278 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 373/375 places, 276/278 transitions.
RANDOM walk for 4000000 steps (39274 resets) in 23903 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (6919 resets) in 12327 ms. (324 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (5340 resets) in 10748 ms. (372 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (5270 resets) in 10714 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (5320 resets) in 10814 ms. (369 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (5373 resets) in 10606 ms. (377 steps per ms) remains 4/4 properties
// Phase 1: matrix 276 rows 373 cols
[2024-05-20 22:51:11] [INFO ] Computed 123 invariants in 1 ms
[2024-05-20 22:51:11] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 221/229 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/373 variables, 118/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 276/649 variables, 373/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 208/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/649 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 704 constraints, problems are : Problem set: 0 solved, 4 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 373/373 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 221/229 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/373 variables, 118/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 276/649 variables, 373/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 208/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 4/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/649 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 708 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 373/373 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1976ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1304 ms.
Support contains 8 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 276/276 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 371 transition count 274
Applied a total of 4 rules in 22 ms. Remains 371 /373 variables (removed 2) and now considering 274/276 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 371/373 places, 274/276 transitions.
RANDOM walk for 4000000 steps (38767 resets) in 22476 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (7425 resets) in 12429 ms. (321 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (5322 resets) in 10592 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (5360 resets) in 10481 ms. (381 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (5328 resets) in 10262 ms. (389 steps per ms) remains 3/3 properties
// Phase 1: matrix 274 rows 371 cols
[2024-05-20 22:51:32] [INFO ] Computed 123 invariants in 2 ms
[2024-05-20 22:51:32] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 220/226 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 145/371 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 274/645 variables, 371/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 210/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 371/371 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 220/226 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 145/371 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 274/645 variables, 371/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 210/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 3/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/645 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 707 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 371/371 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1328 ms.
Support contains 6 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 274/274 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 371 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 369 transition count 272
Applied a total of 4 rules in 29 ms. Remains 369 /371 variables (removed 2) and now considering 272/274 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 369/371 places, 272/274 transitions.
RANDOM walk for 4000000 steps (37729 resets) in 22046 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (7897 resets) in 12068 ms. (331 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (5374 resets) in 10545 ms. (379 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000004 steps (5335 resets) in 10103 ms. (395 steps per ms) remains 2/2 properties
// Phase 1: matrix 272 rows 369 cols
[2024-05-20 22:51:49] [INFO ] Computed 123 invariants in 1 ms
[2024-05-20 22:51:49] [INFO ] State equation strengthened by 212 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 219/223 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 146/369 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 272/641 variables, 369/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 212/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/641 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 369/369 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 219/223 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 146/369 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 272/641 variables, 369/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 212/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 706 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 369/369 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2074ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 375 ms.
Support contains 4 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 272/272 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 369 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 367 transition count 270
Applied a total of 4 rules in 17 ms. Remains 367 /369 variables (removed 2) and now considering 270/272 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 367/369 places, 270/272 transitions.
RANDOM walk for 4000000 steps (35836 resets) in 20965 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (8368 resets) in 12182 ms. (328 steps per ms) remains 2/2 properties
BEST_FIRST walk for 33387 steps (26 resets) in 131 ms. (252 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 293 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 480924 ms.
ITS solved all properties within timeout

BK_STOP 1716245521358

--------------------
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="AutoFlight-PT-24b"
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 AutoFlight-PT-24b, 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 r034-smll-171620174900112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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