fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r560-tall-171734905800142
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FireWire-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1268.352 213674.00 473310.00 304.90 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r560-tall-171734905800142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717351726133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:08:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:47] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 18:08:47] [INFO ] Transformed 127 places.
[2024-06-02 18:08:47] [INFO ] Transformed 397 transitions.
[2024-06-02 18:08:47] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:47] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 183 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 127/127 places, 397/397 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 127 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 126 transition count 343
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 123 transition count 349
Applied a total of 61 rules in 51 ms. Remains 123 /127 variables (removed 4) and now considering 349/397 (removed 48) transitions.
[2024-06-02 18:08:47] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
// Phase 1: matrix 307 rows 123 cols
[2024-06-02 18:08:47] [INFO ] Computed 8 invariants in 12 ms
[2024-06-02 18:08:47] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-02 18:08:47] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2024-06-02 18:08:47] [INFO ] Invariant cache hit.
[2024-06-02 18:08:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:08:48] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-02 18:08:48] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2024-06-02 18:08:48] [INFO ] Invariant cache hit.
[2024-06-02 18:08:48] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 15 ms to minimize.
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:08:51] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:08:52] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 306/429 variables, 123/261 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 46/307 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 1/430 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 308 constraints, problems are : Problem set: 0 solved, 348 unsolved in 14500 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 306/429 variables, 123/261 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 46/307 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 348/655 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 10 (OVERLAPS) 1/430 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 656 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30027 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 7/7 constraints]
After SMT, in 44889ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 44907ms
Starting structural reductions in LIVENESS mode, iteration 1 : 123/127 places, 349/397 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 45504 ms. Remains : 123/127 places, 349/397 transitions.
Discarding 113 transitions out of 349. Remains 236
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2269 resets) in 2214 ms. (18 steps per ms) remains 140/235 properties
BEST_FIRST walk for 403 steps (12 resets) in 12 ms. (31 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (10 resets) in 14 ms. (26 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (11 resets) in 10 ms. (36 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (8 resets) in 28 ms. (13 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (9 resets) in 17 ms. (22 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (10 resets) in 19 ms. (20 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (11 resets) in 16 ms. (23 steps per ms) remains 140/140 properties
BEST_FIRST walk for 401 steps (8 resets) in 19 ms. (20 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (9 resets) in 24 ms. (16 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (13 resets) in 20 ms. (19 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 39 ms. (10 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (11 resets) in 11 ms. (33 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (9 resets) in 8 ms. (44 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (9 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (12 resets) in 5 ms. (67 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (11 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 8 ms. (44 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (12 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 5 ms. (67 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (10 resets) in 8 ms. (44 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (12 resets) in 5 ms. (67 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (11 resets) in 9 ms. (40 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (9 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (12 resets) in 9 ms. (40 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (11 resets) in 9 ms. (40 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (13 resets) in 9 ms. (40 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 4 ms. (80 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (11 resets) in 5 ms. (67 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (11 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 402 steps (9 resets) in 8 ms. (44 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 140/140 properties
BEST_FIRST walk for 404 steps (10 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (14 resets) in 8 ms. (44 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (9 resets) in 5 ms. (67 steps per ms) remains 140/140 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
BEST_FIRST walk for 401 steps (11 resets) in 6 ms. (57 steps per ms) remains 140/140 properties
[2024-06-02 18:09:33] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2024-06-02 18:09:33] [INFO ] Invariant cache hit.
[2024-06-02 18:09:33] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 33/122 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 33/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:09:34] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:09:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:09:35] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:09:35] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:09:35] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 306/428 variables, 122/259 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 46/305 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/429 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 140 unsolved
SMT process timed out in 5129ms, After SMT, problems are : Problem set: 0 solved, 140 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 349/349 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 123 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 123 transition count 331
Applied a total of 18 rules in 30 ms. Remains 123 /123 variables (removed 0) and now considering 331/349 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 123/123 places, 331/349 transitions.
RANDOM walk for 4000000 steps (219253 resets) in 29764 ms. (134 steps per ms) remains 72/140 properties
BEST_FIRST walk for 400003 steps (15215 resets) in 984 ms. (406 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (5540 resets) in 674 ms. (592 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (5765 resets) in 673 ms. (593 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (66 resets) in 1285 ms. (311 steps per ms) remains 71/72 properties
BEST_FIRST walk for 400003 steps (5486 resets) in 697 ms. (573 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (10808 resets) in 759 ms. (526 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (5713 resets) in 668 ms. (597 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400002 steps (285 resets) in 1194 ms. (334 steps per ms) remains 70/71 properties
BEST_FIRST walk for 400003 steps (5391 resets) in 680 ms. (587 steps per ms) remains 68/70 properties
BEST_FIRST walk for 400003 steps (10857 resets) in 758 ms. (527 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (5745 resets) in 661 ms. (604 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400001 steps (85 resets) in 1246 ms. (320 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (5514 resets) in 698 ms. (572 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (10713 resets) in 755 ms. (529 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (5759 resets) in 669 ms. (597 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (145 resets) in 1171 ms. (341 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (5539 resets) in 715 ms. (558 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (10786 resets) in 783 ms. (510 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (5553 resets) in 667 ms. (598 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400002 steps (223 resets) in 1095 ms. (364 steps per ms) remains 64/68 properties
BEST_FIRST walk for 400003 steps (5415 resets) in 666 ms. (599 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400003 steps (10710 resets) in 760 ms. (525 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (5610 resets) in 674 ms. (592 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (275 resets) in 1270 ms. (314 steps per ms) remains 60/63 properties
BEST_FIRST walk for 400004 steps (5408 resets) in 719 ms. (555 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (10799 resets) in 780 ms. (512 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5569 resets) in 646 ms. (618 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (150 resets) in 1179 ms. (338 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5430 resets) in 653 ms. (611 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (10672 resets) in 722 ms. (553 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5672 resets) in 645 ms. (619 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (275 resets) in 1177 ms. (339 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5448 resets) in 686 ms. (582 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (10783 resets) in 800 ms. (499 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (5677 resets) in 676 ms. (590 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (167 resets) in 1136 ms. (351 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5401 resets) in 681 ms. (586 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (10729 resets) in 753 ms. (530 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5636 resets) in 653 ms. (611 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (234 resets) in 1030 ms. (387 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5626 resets) in 685 ms. (583 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (10806 resets) in 728 ms. (548 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5756 resets) in 658 ms. (606 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (253 resets) in 1158 ms. (345 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5455 resets) in 672 ms. (594 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (10678 resets) in 759 ms. (526 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (15231 resets) in 908 ms. (440 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (5506 resets) in 630 ms. (633 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (290 resets) in 987 ms. (404 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400001 steps (5474 resets) in 629 ms. (634 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (5724 resets) in 645 ms. (619 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400001 steps (5345 resets) in 645 ms. (619 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5754 resets) in 631 ms. (632 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400001 steps (357 resets) in 902 ms. (442 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5564 resets) in 644 ms. (620 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5704 resets) in 644 ms. (620 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5414 resets) in 642 ms. (622 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5635 resets) in 637 ms. (626 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (166 resets) in 1225 ms. (326 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (5532 resets) in 659 ms. (606 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5641 resets) in 802 ms. (498 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (5524 resets) in 797 ms. (501 steps per ms) remains 59/59 properties
[2024-06-02 18:10:02] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
// Phase 1: matrix 303 rows 123 cols
[2024-06-02 18:10:02] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:10:02] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 72/116 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 72/122 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-02 18:10:03] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 303/423 variables, 120/253 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 46/299 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 3/426 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 59 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3093 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 72/116 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 72/122 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 303/423 variables, 120/253 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 46/299 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 59/358 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 3/426 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-02 18:10:08] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-06-02 18:10:10] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/426 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 20 (OVERLAPS) 0/426 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 366 constraints, problems are : Problem set: 0 solved, 59 unsolved in 8758 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 7/7 constraints]
After SMT, in 11915ms problems are : Problem set: 0 solved, 59 unsolved
Parikh walk visited 10 properties in 3681 ms.
Support contains 40 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 331/331 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 121 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 120 transition count 324
Applied a total of 7 rules in 31 ms. Remains 120 /123 variables (removed 3) and now considering 324/331 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 120/123 places, 324/331 transitions.
RANDOM walk for 4000000 steps (232003 resets) in 20585 ms. (194 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5603 resets) in 682 ms. (585 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5723 resets) in 786 ms. (508 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (394 resets) in 916 ms. (436 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5479 resets) in 612 ms. (652 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (11049 resets) in 884 ms. (451 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5771 resets) in 632 ms. (631 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (350 resets) in 887 ms. (450 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5626 resets) in 664 ms. (601 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (11002 resets) in 681 ms. (586 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (5716 resets) in 609 ms. (655 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400001 steps (376 resets) in 1022 ms. (391 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5426 resets) in 827 ms. (483 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (11064 resets) in 839 ms. (476 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5723 resets) in 726 ms. (550 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400000 steps (174 resets) in 1198 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5522 resets) in 775 ms. (515 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (11160 resets) in 652 ms. (612 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5768 resets) in 576 ms. (693 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (95 resets) in 1066 ms. (374 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5539 resets) in 581 ms. (687 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (11103 resets) in 630 ms. (633 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5666 resets) in 562 ms. (710 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400001 steps (324 resets) in 970 ms. (411 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5619 resets) in 586 ms. (681 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400001 steps (11057 resets) in 646 ms. (618 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5821 resets) in 578 ms. (690 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (335 resets) in 923 ms. (432 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5544 resets) in 569 ms. (701 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (10898 resets) in 622 ms. (642 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5538 resets) in 563 ms. (709 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5632 resets) in 585 ms. (682 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5658 resets) in 567 ms. (704 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5639 resets) in 694 ms. (575 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (569 resets) in 738 ms. (541 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (11050 resets) in 642 ms. (622 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5601 resets) in 584 ms. (683 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400001 steps (367 resets) in 1051 ms. (380 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5414 resets) in 566 ms. (705 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5817 resets) in 574 ms. (695 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5610 resets) in 576 ms. (693 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5636 resets) in 560 ms. (713 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (272 resets) in 874 ms. (457 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (5589 resets) in 605 ms. (660 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5753 resets) in 584 ms. (683 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (5607 resets) in 578 ms. (690 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5869 resets) in 584 ms. (683 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (496 resets) in 647 ms. (617 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5551 resets) in 611 ms. (653 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (5667 resets) in 569 ms. (701 steps per ms) remains 49/49 properties
Interrupted probabilistic random walk after 9903002 steps, run timeout after 51001 ms. (steps per millisecond=194 ) properties seen :37 out of 49
Probabilistic random walk after 9903002 steps, saw 1838750 distinct states, run finished after 51007 ms. (steps per millisecond=194 ) properties seen :37
[2024-06-02 18:11:26] [INFO ] Flow matrix only has 296 transitions (discarded 28 similar events)
// Phase 1: matrix 296 rows 120 cols
[2024-06-02 18:11:26] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:11:26] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 52/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 241/307 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 99/406 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 22/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/407 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 9/416 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/416 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 173 constraints, problems are : Problem set: 0 solved, 12 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 52/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 241/307 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 99/406 variables, 46/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 22/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/407 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 9/416 variables, 7/183 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/416 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 185 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 2063 ms.
Support contains 14 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 324/324 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 116 transition count 314
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 116 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 114 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 114 transition count 309
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 114 transition count 311
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 113 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 113 transition count 307
Applied a total of 19 rules in 33 ms. Remains 113 /120 variables (removed 7) and now considering 307/324 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 113/120 places, 307/324 transitions.
RANDOM walk for 4000000 steps (231388 resets) in 15289 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (57430 resets) in 3874 ms. (1032 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (55625 resets) in 4723 ms. (846 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (57399 resets) in 5149 ms. (776 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (55947 resets) in 4728 ms. (845 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (56988 resets) in 4563 ms. (876 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (55507 resets) in 4368 ms. (915 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (57325 resets) in 3925 ms. (1018 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (55659 resets) in 3619 ms. (1104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (57607 resets) in 4523 ms. (884 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (56035 resets) in 5719 ms. (699 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (56860 resets) in 3911 ms. (1022 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (56001 resets) in 4950 ms. (807 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 6880302 steps, run visited all 12 properties in 25395 ms. (steps per millisecond=270 )
Probabilistic random walk after 6880302 steps, saw 1243647 distinct states, run finished after 25401 ms. (steps per millisecond=270 ) properties seen :12
Able to resolve query QuasiLiveness after proving 236 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 212491 ms.
ITS solved all properties within timeout

BK_STOP 1717351939807

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-08"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-08, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905800142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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