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.r564-tall-171734907600117.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 ltsminxred
Input is FireWire-PT-03, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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 1717361572197

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:52:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:53] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 20:52:53] [INFO ] Transformed 112 places.
[2024-06-02 20:52:53] [INFO ] Transformed 356 transitions.
[2024-06-02 20:52:53] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:53] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 193 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 112/112 places, 356/356 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 112 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 53 place count 112 transition count 302
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 111 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 108 transition count 299
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 67 place count 105 transition count 305
Applied a total of 67 rules in 50 ms. Remains 105 /112 variables (removed 7) and now considering 305/356 (removed 51) transitions.
[2024-06-02 20:52:53] [INFO ] Flow matrix only has 262 transitions (discarded 43 similar events)
// Phase 1: matrix 262 rows 105 cols
[2024-06-02 20:52:53] [INFO ] Computed 9 invariants in 15 ms
[2024-06-02 20:52:53] [INFO ] Implicit Places using invariants in 246 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 274 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 104/112 places, 305/356 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 104 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 304
Applied a total of 2 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 304/305 (removed 1) transitions.
[2024-06-02 20:52:53] [INFO ] Flow matrix only has 261 transitions (discarded 43 similar events)
// Phase 1: matrix 261 rows 103 cols
[2024-06-02 20:52:53] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:53] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 20:52:53] [INFO ] Flow matrix only has 261 transitions (discarded 43 similar events)
[2024-06-02 20:52:54] [INFO ] Invariant cache hit.
[2024-06-02 20:52:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:52:54] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 103/112 places, 304/356 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 630 ms. Remains : 103/112 places, 304/356 transitions.
Discarding 104 transitions out of 304. Remains 200
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2378 resets) in 1926 ms. (20 steps per ms) remains 102/199 properties
BEST_FIRST walk for 403 steps (11 resets) in 14 ms. (26 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (18 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (15 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (9 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (16 resets) in 19 ms. (20 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (9 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (11 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (11 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (10 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 400 steps (8 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 400 steps (8 resets) in 19 ms. (20 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (8 resets) in 15 ms. (25 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (11 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (11 resets) in 17 ms. (22 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (10 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (11 resets) in 17 ms. (22 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (13 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 400 steps (8 resets) in 20 ms. (19 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (9 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (10 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (10 resets) in 23 ms. (16 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (11 resets) in 15 ms. (25 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (11 resets) in 15 ms. (25 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (17 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (12 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (11 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (11 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (10 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (11 resets) in 4 ms. (80 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (10 resets) in 4 ms. (80 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (11 resets) in 4 ms. (80 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (12 resets) in 4 ms. (80 steps per ms) remains 102/102 properties
[2024-06-02 20:52:55] [INFO ] Flow matrix only has 261 transitions (discarded 43 similar events)
[2024-06-02 20:52:55] [INFO ] Invariant cache hit.
[2024-06-02 20:52:55] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 33/103 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 33/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 11 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:52:56] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 260/363 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 40/262 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/364 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 263 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5013 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 33/103 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 33/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-02 20:53:00] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 260/363 variables, 103/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 40/263 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 102/365 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/364 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 366 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5011 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 9/9 constraints]
After SMT, in 10189ms problems are : Problem set: 0 solved, 102 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 304/304 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 103 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 20 place count 103 transition count 284
Applied a total of 20 rules in 24 ms. Remains 103 /103 variables (removed 0) and now considering 284/304 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 103/103 places, 284/304 transitions.
RANDOM walk for 4000000 steps (229540 resets) in 24398 ms. (163 steps per ms) remains 57/102 properties
BEST_FIRST walk for 400004 steps (5831 resets) in 628 ms. (635 steps per ms) remains 54/57 properties
BEST_FIRST walk for 400003 steps (12250 resets) in 726 ms. (550 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (248 resets) in 1131 ms. (353 steps per ms) remains 49/54 properties
BEST_FIRST walk for 400000 steps (8 resets) in 983 ms. (406 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (52 resets) in 525 ms. (760 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (19 resets) in 508 ms. (785 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400000 steps (17892 resets) in 898 ms. (444 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5986 resets) in 615 ms. (649 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (5750 resets) in 655 ms. (609 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (12317 resets) in 698 ms. (572 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (6017 resets) in 619 ms. (645 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (339 resets) in 826 ms. (483 steps per ms) remains 41/49 properties
BEST_FIRST walk for 400003 steps (445 resets) in 729 ms. (547 steps per ms) remains 37/41 properties
BEST_FIRST walk for 400004 steps (5823 resets) in 565 ms. (706 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (12366 resets) in 650 ms. (614 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (6098 resets) in 551 ms. (724 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (264 resets) in 765 ms. (522 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400004 steps (5812 resets) in 604 ms. (661 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400002 steps (12134 resets) in 714 ms. (559 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (6077 resets) in 600 ms. (665 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (278 resets) in 794 ms. (503 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400003 steps (5762 resets) in 636 ms. (627 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400001 steps (12371 resets) in 658 ms. (606 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (5935 resets) in 582 ms. (686 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (379 resets) in 835 ms. (478 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6018 resets) in 538 ms. (742 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (353 resets) in 704 ms. (567 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (5888 resets) in 595 ms. (671 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (12272 resets) in 678 ms. (589 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6031 resets) in 548 ms. (728 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (282 resets) in 898 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (5813 resets) in 565 ms. (706 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (12207 resets) in 666 ms. (599 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (331 resets) in 750 ms. (532 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6017 resets) in 598 ms. (667 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (5843 resets) in 583 ms. (684 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6053 resets) in 572 ms. (698 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (5990 resets) in 562 ms. (710 steps per ms) remains 30/33 properties
BEST_FIRST walk for 400002 steps (305 resets) in 856 ms. (466 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6004 resets) in 711 ms. (561 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (6032 resets) in 515 ms. (775 steps per ms) remains 30/30 properties
[2024-06-02 20:53:22] [INFO ] Flow matrix only has 257 transitions (discarded 27 similar events)
// Phase 1: matrix 257 rows 103 cols
[2024-06-02 20:53:22] [INFO ] Computed 8 invariants in 10 ms
[2024-06-02 20:53:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 72/99 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 72/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 20:53:22] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:53:22] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:53:22] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:53:22] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 4/103 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 20:53:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:53:23] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 257/360 variables, 103/220 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/360 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 260 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1689 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 72/99 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 72/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 4/103 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 257/360 variables, 103/220 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 30/290 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 0/360 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 290 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1324 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 6/6 constraints]
After SMT, in 3068ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 1055 ms.
Support contains 27 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 284/284 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 286
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 0 with 3 rules applied. Total rules applied 4 place count 102 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 102 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 101 transition count 281
Applied a total of 7 rules in 37 ms. Remains 101 /103 variables (removed 2) and now considering 281/284 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 101/103 places, 281/284 transitions.
RANDOM walk for 4000000 steps (244000 resets) in 21914 ms. (182 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (6078 resets) in 575 ms. (694 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5996 resets) in 657 ms. (607 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (12656 resets) in 1100 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (6079 resets) in 582 ms. (686 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (300 resets) in 937 ms. (426 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5964 resets) in 772 ms. (517 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (12568 resets) in 732 ms. (545 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (6075 resets) in 618 ms. (646 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (348 resets) in 815 ms. (490 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (5958 resets) in 936 ms. (426 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (12605 resets) in 639 ms. (625 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5955 resets) in 570 ms. (700 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (251 resets) in 905 ms. (441 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (6020 resets) in 924 ms. (432 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (12573 resets) in 683 ms. (584 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (6295 resets) in 596 ms. (670 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (291 resets) in 970 ms. (411 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (6065 resets) in 703 ms. (568 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (112 resets) in 1409 ms. (283 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5961 resets) in 608 ms. (656 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (6193 resets) in 840 ms. (475 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (6079 resets) in 947 ms. (421 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (6164 resets) in 593 ms. (673 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5924 resets) in 591 ms. (675 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (6332 resets) in 638 ms. (625 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (5817 resets) in 587 ms. (680 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (338 resets) in 874 ms. (457 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (5960 resets) in 617 ms. (647 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (6102 resets) in 677 ms. (589 steps per ms) remains 29/29 properties
Finished probabilistic random walk after 230700 steps, run visited all 29 properties in 982 ms. (steps per millisecond=234 )
Probabilistic random walk after 230700 steps, saw 50548 distinct states, run finished after 986 ms. (steps per millisecond=233 ) properties seen :29
Able to resolve query QuasiLiveness after proving 200 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 49045 ms.
ITS solved all properties within timeout

BK_STOP 1717361622452

--------------------
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-03"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-03, 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 r564-tall-171734907600117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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