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-174853743800342.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 AutoFlight-PT-12b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743800342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K 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 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 266K 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 1748549499059

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:11:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 20:11:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:11:40] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-29 20:11:40] [INFO ] Transformed 1126 places.
[2025-05-29 20:11:40] [INFO ] Transformed 1124 transitions.
[2025-05-29 20:11:40] [INFO ] Found NUPN structural information;
[2025-05-29 20:11:40] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 220 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1126 transition count 676
Reduce places removed 448 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 532 rules applied. Total rules applied 980 place count 678 transition count 592
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1004 place count 654 transition count 592
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 1004 place count 654 transition count 441
Deduced a syphon composed of 151 places in 9 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 1306 place count 503 transition count 441
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 218
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 1742 place count 285 transition count 223
Applied a total of 1742 rules in 113 ms. Remains 285 /1126 variables (removed 841) and now considering 223/1124 (removed 901) transitions.
// Phase 1: matrix 223 rows 285 cols
[2025-05-29 20:11:40] [INFO ] Computed 76 invariants in 11 ms
[2025-05-29 20:11:41] [INFO ] Implicit Places using invariants in 499 ms returned [87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 284]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 528 ms to find 13 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 272/1126 places, 223/1124 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 272 transition count 211
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 260 transition count 211
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 52 place count 246 transition count 197
Applied a total of 52 rules in 9 ms. Remains 246 /272 variables (removed 26) and now considering 197/223 (removed 26) transitions.
// Phase 1: matrix 197 rows 246 cols
[2025-05-29 20:11:41] [INFO ] Computed 63 invariants in 2 ms
[2025-05-29 20:11:41] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-29 20:11:41] [INFO ] Invariant cache hit.
[2025-05-29 20:11:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-29 20:11:41] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 246/1126 places, 197/1124 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1416 ms. Remains : 246/1126 places, 197/1124 transitions.
Discarding 48 transitions out of 197. Remains 149
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (905 resets) in 2397 ms. (16 steps per ms) remains 50/148 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
[2025-05-29 20:11:42] [INFO ] Invariant cache hit.
[2025-05-29 20:11:42] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 101/186 variables, 33/118 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 101/219 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2025-05-29 20:11:43] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 8 ms to minimize.
[2025-05-29 20:11:43] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 60/246 variables, 30/251 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 60/311 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2025-05-29 20:11:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:11:44] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 197/443 variables, 246/559 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 60/619 constraints. Problems are: Problem set: 0 solved, 50 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (OVERLAPS) 0/443 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 619 constraints, problems are : Problem set: 0 solved, 50 unsolved in 4370 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 246/246 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 101/186 variables, 33/118 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 101/219 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 60/246 variables, 30/254 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 60/314 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 197/443 variables, 246/563 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 60/623 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 50/673 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2025-05-29 20:11:49] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 674 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5009 ms.
Refiners :[Domain max(s): 246/246 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 246/246 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 9/9 constraints]
After SMT, in 9439ms problems are : Problem set: 0 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 197/197 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 236 transition count 187
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 236 transition count 187
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 44 place count 236 transition count 163
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 68 place count 212 transition count 163
Applied a total of 68 rules in 42 ms. Remains 212 /246 variables (removed 34) and now considering 163/197 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 212/246 places, 163/197 transitions.
RANDOM walk for 4000000 steps (75435 resets) in 23447 ms. (170 steps per ms) remains 26/50 properties
BEST_FIRST walk for 400003 steps (817 resets) in 661 ms. (604 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (839 resets) in 644 ms. (620 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (845 resets) in 624 ms. (640 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (826 resets) in 613 ms. (651 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (834 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (828 resets) in 606 ms. (658 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (819 resets) in 613 ms. (651 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (821 resets) in 620 ms. (644 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (811 resets) in 624 ms. (640 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (835 resets) in 622 ms. (642 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (832 resets) in 614 ms. (650 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (826 resets) in 616 ms. (648 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (831 resets) in 617 ms. (647 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (822 resets) in 614 ms. (650 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (853 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (824 resets) in 620 ms. (644 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (830 resets) in 617 ms. (647 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (812 resets) in 610 ms. (654 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (817 resets) in 611 ms. (653 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (830 resets) in 620 ms. (644 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (847 resets) in 609 ms. (655 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (848 resets) in 617 ms. (647 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (832 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (850 resets) in 611 ms. (653 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (836 resets) in 616 ms. (648 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (826 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
// Phase 1: matrix 163 rows 212 cols
[2025-05-29 20:12:02] [INFO ] Computed 63 invariants in 2 ms
[2025-05-29 20:12:02] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 62/212 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2025-05-29 20:12:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 4 ms to minimize.
[2025-05-29 20:12:03] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 163/375 variables, 212/277 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 84/361 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 361 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 212/212 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 111/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 62/212 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 163/375 variables, 212/277 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 84/361 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 26/387 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/375 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 387 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 212/212 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 3266ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 1451 ms.
Support contains 39 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 163/163 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 210 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 210 transition count 161
Applied a total of 4 rules in 19 ms. Remains 210 /212 variables (removed 2) and now considering 161/163 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 210/212 places, 161/163 transitions.
RANDOM walk for 4000000 steps (75421 resets) in 23727 ms. (168 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (840 resets) in 643 ms. (621 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (827 resets) in 637 ms. (626 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (827 resets) in 610 ms. (654 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (848 resets) in 608 ms. (656 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (831 resets) in 611 ms. (653 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (835 resets) in 611 ms. (653 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (841 resets) in 615 ms. (649 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (851 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (825 resets) in 611 ms. (653 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (837 resets) in 610 ms. (654 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (833 resets) in 615 ms. (649 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (835 resets) in 615 ms. (649 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (829 resets) in 607 ms. (657 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (795 resets) in 615 ms. (649 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (842 resets) in 610 ms. (654 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (836 resets) in 607 ms. (657 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (833 resets) in 618 ms. (646 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (835 resets) in 616 ms. (648 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (845 resets) in 610 ms. (654 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (848 resets) in 618 ms. (646 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (840 resets) in 619 ms. (645 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (850 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (830 resets) in 617 ms. (647 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (839 resets) in 622 ms. (642 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (836 resets) in 612 ms. (652 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (838 resets) in 609 ms. (655 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 5519245 steps, run timeout after 33001 ms. (steps per millisecond=167 ) properties seen :13 out of 26
Probabilistic random walk after 5519245 steps, saw 1374728 distinct states, run finished after 33006 ms. (steps per millisecond=167 ) properties seen :13
// Phase 1: matrix 161 rows 210 cols
[2025-05-29 20:12:52] [INFO ] Computed 63 invariants in 3 ms
[2025-05-29 20:12:52] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 62/210 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 357 constraints, problems are : Problem set: 0 solved, 13 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 62/210 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 161/371 variables, 210/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 84/357 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 13/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 370 constraints, problems are : Problem set: 0 solved, 13 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 210/210 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1509ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 6927 ms.
Support contains 26 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 161/161 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 160
Applied a total of 2 rules in 11 ms. Remains 209 /210 variables (removed 1) and now considering 160/161 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 209/210 places, 160/161 transitions.
RANDOM walk for 4000000 steps (75527 resets) in 21088 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (8334 resets) in 7295 ms. (548 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (8389 resets) in 8247 ms. (484 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8291 resets) in 6328 ms. (632 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8410 resets) in 6120 ms. (653 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8382 resets) in 6353 ms. (629 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (8365 resets) in 5791 ms. (690 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8315 resets) in 5784 ms. (691 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8303 resets) in 5614 ms. (712 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8328 resets) in 7469 ms. (535 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8430 resets) in 7209 ms. (554 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8408 resets) in 7022 ms. (569 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8422 resets) in 5981 ms. (668 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8392 resets) in 5906 ms. (677 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 17829666 steps, run timeout after 93001 ms. (steps per millisecond=191 ) properties seen :0 out of 13
Probabilistic random walk after 17829666 steps, saw 3553643 distinct states, run finished after 93001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 160 rows 209 cols
[2025-05-29 20:15:05] [INFO ] Computed 63 invariants in 1 ms
[2025-05-29 20:15:05] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 61/209 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 160/369 variables, 209/272 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 84/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 356 constraints, problems are : Problem set: 0 solved, 13 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 209/209 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 122/148 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 61/209 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 160/369 variables, 209/272 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 84/356 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 13/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 369 constraints, problems are : Problem set: 0 solved, 13 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 209/209 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 62 steps, including 0 resets, run visited all 13 properties in 4 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 12 ms.
Able to resolve query QuasiLiveness after proving 149 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 206860 ms.
ITS solved all properties within timeout

BK_STOP 1748549707085

--------------------
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="AutoFlight-PT-12b"
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 AutoFlight-PT-12b, 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-174853743800342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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