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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 201K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 781K 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 1748550337085

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-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:25:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 20:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:25:38] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-29 20:25:38] [INFO ] Transformed 89 places.
[2025-05-29 20:25:38] [INFO ] Transformed 1249 transitions.
[2025-05-29 20:25:38] [INFO ] Found NUPN structural information;
[2025-05-29 20:25:38] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 271 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 89/89 places, 1249/1249 transitions.
Ensure Unique test removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 89 transition count 894
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 365 place count 79 transition count 894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 369 place count 77 transition count 892
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 76 transition count 892
Applied a total of 371 rules in 95 ms. Remains 76 /89 variables (removed 13) and now considering 892/1249 (removed 357) transitions.
[2025-05-29 20:25:38] [INFO ] Flow matrix only has 891 transitions (discarded 1 similar events)
// Phase 1: matrix 891 rows 76 cols
[2025-05-29 20:25:38] [INFO ] Computed 14 invariants in 30 ms
[2025-05-29 20:25:39] [INFO ] Implicit Places using invariants in 691 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 722 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 75/89 places, 892/1249 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 842 ms. Remains : 75/89 places, 892/1249 transitions.
Discarding 49 transitions out of 892. Remains 843
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2573 resets) in 4490 ms. (8 steps per ms) remains 572/842 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 572/572 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 572/572 properties
[2025-05-29 20:25:40] [INFO ] Flow matrix only has 891 transitions (discarded 1 similar events)
// Phase 1: matrix 891 rows 75 cols
[2025-05-29 20:25:40] [INFO ] Computed 13 invariants in 9 ms
[2025-05-29 20:25:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (OVERLAPS) 16/73 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 73/966 variables, and 85 constraints, problems are : Problem set: 0 solved, 572 unsolved in 5133 ms.
Refiners :[Domain max(s): 73/75 constraints, Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 0/75 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (OVERLAPS) 16/73 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 2/75 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 75/966 variables, and 88 constraints, problems are : Problem set: 0 solved, 572 unsolved in 5022 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/75 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/572 constraints, Known Traps: 0/0 constraints]
After SMT, in 20607ms problems are : Problem set: 0 solved, 572 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 892/892 transitions.
Graph (complete) has 1003 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 890
Applied a total of 2 rules in 130 ms. Remains 74 /75 variables (removed 1) and now considering 890/892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 74/75 places, 890/892 transitions.
RANDOM walk for 4000000 steps (254260 resets) in 99108 ms. (40 steps per ms) remains 58/572 properties
BEST_FIRST walk for 400004 steps (1311 resets) in 989 ms. (404 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1281 resets) in 530 ms. (753 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1311 resets) in 523 ms. (763 steps per ms) remains 57/58 properties
BEST_FIRST walk for 400004 steps (1501 resets) in 511 ms. (781 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (1487 resets) in 514 ms. (776 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400004 steps (1490 resets) in 507 ms. (787 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400004 steps (1487 resets) in 507 ms. (787 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (1285 resets) in 508 ms. (785 steps per ms) remains 52/54 properties
BEST_FIRST walk for 400003 steps (1261 resets) in 502 ms. (795 steps per ms) remains 50/52 properties
BEST_FIRST walk for 400003 steps (1385 resets) in 486 ms. (821 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1368 resets) in 494 ms. (808 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1482 resets) in 492 ms. (811 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1486 resets) in 493 ms. (809 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (1480 resets) in 502 ms. (795 steps per ms) remains 47/49 properties
BEST_FIRST walk for 400003 steps (1311 resets) in 502 ms. (795 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (1282 resets) in 503 ms. (793 steps per ms) remains 43/47 properties
BEST_FIRST walk for 400004 steps (1285 resets) in 505 ms. (790 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400003 steps (1352 resets) in 508 ms. (785 steps per ms) remains 38/42 properties
BEST_FIRST walk for 400003 steps (1374 resets) in 497 ms. (803 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (1493 resets) in 662 ms. (603 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (1507 resets) in 511 ms. (781 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400004 steps (1497 resets) in 509 ms. (784 steps per ms) remains 35/37 properties
BEST_FIRST walk for 400003 steps (1282 resets) in 510 ms. (782 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (1288 resets) in 514 ms. (776 steps per ms) remains 33/35 properties
BEST_FIRST walk for 400004 steps (1497 resets) in 501 ms. (796 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1495 resets) in 495 ms. (806 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1321 resets) in 486 ms. (821 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1292 resets) in 485 ms. (823 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1492 resets) in 491 ms. (813 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1306 resets) in 484 ms. (824 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1292 resets) in 491 ms. (813 steps per ms) remains 31/33 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 494 ms. (808 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 488 ms. (818 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1292 resets) in 489 ms. (816 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (1483 resets) in 540 ms. (739 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1299 resets) in 495 ms. (806 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1504 resets) in 464 ms. (860 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1477 resets) in 466 ms. (856 steps per ms) remains 27/29 properties
BEST_FIRST walk for 400004 steps (1274 resets) in 464 ms. (860 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1371 resets) in 480 ms. (831 steps per ms) remains 27/27 properties
// Phase 1: matrix 890 rows 74 cols
[2025-05-29 20:26:34] [INFO ] Computed 12 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 46/70 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 46/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/72 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 890/962 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 2/964 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/964 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/964 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/964 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 964/964 variables, and 160 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2445 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 46/70 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 46/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 2/72 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 890/962 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 2/964 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/964 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/964 variables, 27/187 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/964 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/964 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 964/964 variables, and 187 constraints, problems are : Problem set: 0 solved, 27 unsolved in 9595 ms.
Refiners :[Domain max(s): 74/74 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 12469ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 2473 ms.
Support contains 24 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 890/890 transitions.
Graph (complete) has 999 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 73 transition count 888
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 23 place count 71 transition count 870
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 70 transition count 869
Applied a total of 24 rules in 176 ms. Remains 70 /74 variables (removed 4) and now considering 869/890 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 70/74 places, 869/890 transitions.
RANDOM walk for 4000000 steps (241652 resets) in 39993 ms. (100 steps per ms) remains 15/27 properties
BEST_FIRST walk for 400004 steps (1227 resets) in 363 ms. (1098 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (1202 resets) in 360 ms. (1108 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400004 steps (1466 resets) in 340 ms. (1173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (1219 resets) in 351 ms. (1136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (1448 resets) in 338 ms. (1179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (1237 resets) in 344 ms. (1159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (1470 resets) in 344 ms. (1159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (1218 resets) in 363 ms. (1098 steps per ms) remains 11/12 properties
BEST_FIRST walk for 400004 steps (1212 resets) in 554 ms. (720 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400003 steps (1227 resets) in 353 ms. (1129 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400003 steps (1243 resets) in 350 ms. (1139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (1335 resets) in 389 ms. (1025 steps per ms) remains 10/10 properties
// Phase 1: matrix 869 rows 70 cols
[2025-05-29 20:27:01] [INFO ] Computed 11 invariants in 6 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) 34/48 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 855/903 variables, 48/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 36/939 variables, 22/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 22/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/939 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 939/939 variables, and 151 constraints, problems are : Problem set: 0 solved, 10 unsolved in 900 ms.
Refiners :[Domain max(s): 70/70 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 70/70 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) 34/48 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 855/903 variables, 48/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 36/939 variables, 22/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 22/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/939 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 939/939 variables, and 161 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2393 ms.
Refiners :[Domain max(s): 70/70 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 3451ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 14 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 869/869 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 839
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 839
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 67 transition count 834
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 61 place count 62 transition count 789
Applied a total of 61 rules in 90 ms. Remains 62 /70 variables (removed 8) and now considering 789/869 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 62/70 places, 789/869 transitions.
RANDOM walk for 4000000 steps (69812 resets) in 41669 ms. (95 steps per ms) remains 1/10 properties
BEST_FIRST walk for 4000004 steps (12162 resets) in 3249 ms. (1230 steps per ms) remains 1/1 properties
// Phase 1: matrix 789 rows 62 cols
[2025-05-29 20:27:17] [INFO ] Computed 11 invariants in 9 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) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 753/765 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/851 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/851 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 62/62 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) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 753/765 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/851 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/851 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/851 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 789/789 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 729
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 729
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 56 transition count 727
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 34 place count 54 transition count 709
Applied a total of 34 rules in 71 ms. Remains 54 /62 variables (removed 8) and now considering 709/789 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 54/62 places, 709/789 transitions.
RANDOM walk for 4000000 steps (24994 resets) in 35568 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (18753 resets) in 3290 ms. (1215 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 141537 steps, run visited all 1 properties in 366 ms. (steps per millisecond=386 )
Probabilistic random walk after 141537 steps, saw 20512 distinct states, run finished after 370 ms. (steps per millisecond=382 ) properties seen :1
Able to resolve query QuasiLiveness after proving 843 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 110095 ms.
ITS solved all properties within timeout

BK_STOP 1748550448419

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-09a"
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-09a, 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-174853744000457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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