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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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 1717351670089

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:07:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:07:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:51] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 18:07:51] [INFO ] Transformed 116 places.
[2024-06-02 18:07:51] [INFO ] Transformed 368 transitions.
[2024-06-02 18:07:51] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:51] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 174 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 116/116 places, 368/368 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 116 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 56 place count 116 transition count 311
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 115 transition count 311
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 64 place count 112 transition count 308
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 70 place count 109 transition count 314
Applied a total of 70 rules in 52 ms. Remains 109 /116 variables (removed 7) and now considering 314/368 (removed 54) transitions.
[2024-06-02 18:07:51] [INFO ] Flow matrix only has 271 transitions (discarded 43 similar events)
// Phase 1: matrix 271 rows 109 cols
[2024-06-02 18:07:51] [INFO ] Computed 9 invariants in 17 ms
[2024-06-02 18:07:51] [INFO ] Implicit Places using invariants in 266 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 300 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 108/116 places, 314/368 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 108 transition count 313
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 107 transition count 313
Applied a total of 2 rules in 8 ms. Remains 107 /108 variables (removed 1) and now considering 313/314 (removed 1) transitions.
[2024-06-02 18:07:51] [INFO ] Flow matrix only has 270 transitions (discarded 43 similar events)
// Phase 1: matrix 270 rows 107 cols
[2024-06-02 18:07:51] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:07:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:07:51] [INFO ] Flow matrix only has 270 transitions (discarded 43 similar events)
[2024-06-02 18:07:51] [INFO ] Invariant cache hit.
[2024-06-02 18:07:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:07:52] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [35, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 311 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 105/116 places, 313/368 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 691 ms. Remains : 105/116 places, 313/368 transitions.
Discarding 107 transitions out of 313. Remains 206
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2300 resets) in 1796 ms. (22 steps per ms) remains 114/205 properties
BEST_FIRST walk for 402 steps (14 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (17 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (10 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (12 resets) in 17 ms. (22 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (9 resets) in 11 ms. (33 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (11 resets) in 24 ms. (16 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (9 resets) in 13 ms. (28 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (17 resets) in 14 ms. (26 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (10 resets) in 10 ms. (36 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (11 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (10 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (9 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (11 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (10 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (10 resets) in 6 ms. (57 steps per ms) remains 114/114 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (10 resets) in 6 ms. (57 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (10 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (9 resets) in 6 ms. (57 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (9 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (14 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (9 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (11 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (11 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (13 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (10 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (18 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 402 steps (14 resets) in 4 ms. (80 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (10 resets) in 8 ms. (44 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (14 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (10 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (11 resets) in 15 ms. (25 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (11 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (9 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (9 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 404 steps (14 resets) in 7 ms. (50 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (12 resets) in 5 ms. (67 steps per ms) remains 114/114 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 114/114 properties
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 270 transitions (discarded 43 similar events)
// Phase 1: matrix 270 rows 105 cols
[2024-06-02 18:07:52] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 18:07:52] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 30/103 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 30/109 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:07:53] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 14 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 17 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 269/372 variables, 103/216 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 2/374 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/375 variables, and 260 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5015 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 30/103 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 30/109 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 269/372 variables, 103/216 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 103/359 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 114 unsolved
SMT process timed out in 10191ms, After SMT, problems are : Problem set: 0 solved, 114 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 313/313 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 105 transition count 304
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 105 transition count 293
Applied a total of 20 rules in 25 ms. Remains 105 /105 variables (removed 0) and now considering 293/313 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 105/105 places, 293/313 transitions.
RANDOM walk for 4000000 steps (229948 resets) in 24152 ms. (165 steps per ms) remains 35/114 properties
BEST_FIRST walk for 400002 steps (6038 resets) in 574 ms. (695 steps per ms) remains 33/35 properties
BEST_FIRST walk for 400004 steps (12253 resets) in 647 ms. (617 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (536 resets) in 646 ms. (618 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400003 steps (6006 resets) in 519 ms. (769 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (12251 resets) in 621 ms. (643 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (6093 resets) in 538 ms. (742 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (221 resets) in 713 ms. (560 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (12381 resets) in 671 ms. (595 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (258 resets) in 569 ms. (701 steps per ms) remains 25/32 properties
BEST_FIRST walk for 400003 steps (6092 resets) in 491 ms. (813 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5854 resets) in 509 ms. (784 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (6164 resets) in 473 ms. (843 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5819 resets) in 475 ms. (840 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (12330 resets) in 540 ms. (739 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6039 resets) in 459 ms. (869 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (349 resets) in 449 ms. (888 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400002 steps (6031 resets) in 465 ms. (858 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5782 resets) in 473 ms. (843 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6062 resets) in 492 ms. (811 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5924 resets) in 469 ms. (851 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5798 resets) in 511 ms. (781 steps per ms) remains 22/24 properties
BEST_FIRST walk for 400004 steps (5892 resets) in 521 ms. (766 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (5902 resets) in 546 ms. (731 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (5020 resets) in 504 ms. (792 steps per ms) remains 22/22 properties
[2024-06-02 18:08:13] [INFO ] Flow matrix only has 266 transitions (discarded 27 similar events)
// Phase 1: matrix 266 rows 105 cols
[2024-06-02 18:08:13] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 18:08:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 77/103 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 77/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 266/369 variables, 103/217 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 40/257 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 2/371 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/371 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 261 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1552 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 77/103 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 77/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 266/369 variables, 103/217 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 40/257 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 21/278 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 2/371 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:08:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:08:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/371 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 285 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2073 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints]
After SMT, in 3650ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 3387 ms.
Support contains 26 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 293/293 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 293
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 8 place count 102 transition count 291
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 10 place count 102 transition count 289
Applied a total of 10 rules in 32 ms. Remains 102 /105 variables (removed 3) and now considering 289/293 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 102/105 places, 289/293 transitions.
RANDOM walk for 4000000 steps (229376 resets) in 25657 ms. (155 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400003 steps (643 resets) in 580 ms. (688 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400004 steps (5911 resets) in 1074 ms. (372 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (12315 resets) in 1328 ms. (300 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (664 resets) in 880 ms. (454 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (5764 resets) in 633 ms. (630 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (5952 resets) in 673 ms. (593 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (5775 resets) in 710 ms. (562 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (5782 resets) in 537 ms. (743 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (6007 resets) in 516 ms. (773 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (12312 resets) in 594 ms. (672 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (6118 resets) in 500 ms. (798 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (647 resets) in 416 ms. (959 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400004 steps (5940 resets) in 486 ms. (821 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5889 resets) in 489 ms. (816 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (6086 resets) in 491 ms. (813 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5807 resets) in 499 ms. (800 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5806 resets) in 508 ms. (785 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5862 resets) in 504 ms. (792 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5958 resets) in 602 ms. (663 steps per ms) remains 18/18 properties
[2024-06-02 18:08:32] [INFO ] Flow matrix only has 261 transitions (discarded 28 similar events)
// Phase 1: matrix 261 rows 102 cols
[2024-06-02 18:08:32] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:08:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 79/100 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-02 18:08:32] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2024-06-02 18:08:33] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 261/361 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 40/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 2/363 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/363 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 253 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1239 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 79/100 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 261/361 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 40/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 18/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/363 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 18:08:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 18:08:35] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/363 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 273 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2000 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 5/5 constraints]
After SMT, in 3269ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 805 ms.
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 289/289 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 288
Applied a total of 1 rules in 18 ms. Remains 101 /102 variables (removed 1) and now considering 288/289 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 101/102 places, 288/289 transitions.
RANDOM walk for 4000000 steps (243850 resets) in 15970 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (6085 resets) in 455 ms. (877 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (12821 resets) in 524 ms. (761 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (663 resets) in 374 ms. (1066 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5875 resets) in 445 ms. (896 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (6199 resets) in 456 ms. (875 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5730 resets) in 452 ms. (883 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (6033 resets) in 451 ms. (884 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5916 resets) in 449 ms. (888 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (12764 resets) in 491 ms. (813 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (6002 resets) in 435 ms. (917 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (636 resets) in 372 ms. (1072 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (6008 resets) in 470 ms. (849 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (6012 resets) in 458 ms. (871 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (6287 resets) in 464 ms. (860 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (5919 resets) in 461 ms. (865 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5799 resets) in 459 ms. (869 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (5948 resets) in 451 ms. (884 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (6171 resets) in 461 ms. (865 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 2353927 steps, run visited all 18 properties in 6053 ms. (steps per millisecond=388 )
Probabilistic random walk after 2353927 steps, saw 482925 distinct states, run finished after 6057 ms. (steps per millisecond=388 ) properties seen :18
Able to resolve query QuasiLiveness after proving 206 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 59352 ms.
ITS solved all properties within timeout

BK_STOP 1717351730614

--------------------
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-06"
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-06, 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-171734905800132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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