Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r014-tall-174853744000447.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is AutonomousCar-PT-08a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853744000447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 448K May 29 14:32 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 1748550289161

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:24:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 20:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:24:50] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-05-29 20:24:50] [INFO ] Transformed 81 places.
[2025-05-29 20:24:50] [INFO ] Transformed 849 transitions.
[2025-05-29 20:24:50] [INFO ] Found NUPN structural information;
[2025-05-29 20:24:50] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 227 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 81/81 places, 849/849 transitions.
Ensure Unique test removed 275 transitions
Reduce isomorphic transitions removed 275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 284 rules applied. Total rules applied 284 place count 81 transition count 565
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 293 place count 72 transition count 565
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 297 place count 70 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 69 transition count 563
Applied a total of 299 rules in 67 ms. Remains 69 /81 variables (removed 12) and now considering 563/849 (removed 286) transitions.
[2025-05-29 20:24:50] [INFO ] Flow matrix only has 562 transitions (discarded 1 similar events)
// Phase 1: matrix 562 rows 69 cols
[2025-05-29 20:24:50] [INFO ] Computed 13 invariants in 15 ms
[2025-05-29 20:24:51] [INFO ] Implicit Places using invariants in 465 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 68/81 places, 563/849 transitions.
Applied a total of 0 rules in 11 ms. Remains 68 /68 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 603 ms. Remains : 68/81 places, 563/849 transitions.
Discarding 44 transitions out of 563. Remains 519
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2703 resets) in 2699 ms. (14 steps per ms) remains 233/518 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
[2025-05-29 20:24:52] [INFO ] Flow matrix only has 562 transitions (discarded 1 similar events)
// Phase 1: matrix 562 rows 68 cols
[2025-05-29 20:24:52] [INFO ] Computed 12 invariants in 13 ms
[2025-05-29 20:24:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 561/629 variables, 68/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/630 variables, and 148 constraints, problems are : Problem set: 0 solved, 233 unsolved in 5016 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 561/629 variables, 68/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/630 variables, and 381 constraints, problems are : Problem set: 0 solved, 233 unsolved in 5352 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 12915ms problems are : Problem set: 0 solved, 233 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 563/563 transitions.
Graph (complete) has 815 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 63 ms. Remains 66 /68 variables (removed 2) and now considering 561/563 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 66/68 places, 561/563 transitions.
RANDOM walk for 4000000 steps (269805 resets) in 43689 ms. (91 steps per ms) remains 18/233 properties
BEST_FIRST walk for 400004 steps (1508 resets) in 381 ms. (1047 steps per ms) remains 15/18 properties
BEST_FIRST walk for 400004 steps (1518 resets) in 368 ms. (1084 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (1495 resets) in 352 ms. (1133 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 347 ms. (1149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (1535 resets) in 345 ms. (1156 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (1812 resets) in 355 ms. (1123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400004 steps (1802 resets) in 344 ms. (1159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400004 steps (1795 resets) in 333 ms. (1197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (1812 resets) in 353 ms. (1129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400004 steps (1827 resets) in 345 ms. (1156 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400003 steps (1525 resets) in 333 ms. (1197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 336 ms. (1186 steps per ms) remains 11/12 properties
BEST_FIRST walk for 400004 steps (1668 resets) in 331 ms. (1204 steps per ms) remains 10/11 properties
// Phase 1: matrix 561 rows 66 cols
[2025-05-29 20:25:17] [INFO ] Computed 10 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 40/54 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 8/62 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 561/623 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 4/627 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/627 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 142 constraints, problems are : Problem set: 0 solved, 10 unsolved in 690 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 40/54 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 8/62 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 561/623 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 4/627 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 10/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/627 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 152 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1730 ms.
Refiners :[Domain max(s): 66/66 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2550ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 3341 ms.
Support contains 14 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 561/561 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 516
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 516
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 514
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 30 place count 59 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 58 transition count 497
Applied a total of 31 rules in 108 ms. Remains 58 /66 variables (removed 8) and now considering 497/561 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 58/66 places, 497/561 transitions.
RANDOM walk for 4000000 steps (242645 resets) in 21259 ms. (188 steps per ms) remains 3/10 properties
BEST_FIRST walk for 4000003 steps (14523 resets) in 2448 ms. (1633 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000004 steps (15611 resets) in 2410 ms. (1659 steps per ms) remains 1/2 properties
// Phase 1: matrix 497 rows 58 cols
[2025-05-29 20:25:30] [INFO ] Computed 10 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 463/474 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/555 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 463/474 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/555 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 497/497 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 470
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 55 transition count 464
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 66 place count 49 transition count 416
Applied a total of 66 rules in 43 ms. Remains 49 /58 variables (removed 9) and now considering 416/497 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 49/58 places, 416/497 transitions.
RANDOM walk for 4000000 steps (30761 resets) in 20418 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (23239 resets) in 2237 ms. (1787 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 67365 steps, run visited all 1 properties in 130 ms. (steps per millisecond=518 )
Probabilistic random walk after 67365 steps, saw 11307 distinct states, run finished after 134 ms. (steps per millisecond=502 ) properties seen :1
Able to resolve query QuasiLiveness after proving 519 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 46392 ms.
ITS solved all properties within timeout

BK_STOP 1748550336725

--------------------
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="AutonomousCar-PT-08a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is AutonomousCar-PT-08a, 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 r014-tall-174853744000447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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