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.r224-tall-174902009900232.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 SieveSingleMsgMbox-PT-d0m18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009900232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K 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 3.6K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749107146205

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:05:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:05:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:05:47] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2025-06-05 07:05:47] [INFO ] Transformed 262 places.
[2025-06-05 07:05:47] [INFO ] Transformed 73 transitions.
[2025-06-05 07:05:47] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 162 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 19 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2025-06-05 07:05:47] [INFO ] Computed 5 invariants in 8 ms
[2025-06-05 07:05:47] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-05 07:05:47] [INFO ] Invariant cache hit.
[2025-06-05 07:05:48] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 07:05:48] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-05 07:05:48] [INFO ] Invariant cache hit.
[2025-06-05 07:05:48] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:05:48] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 12 ms to minimize.
[2025-06-05 07:05:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2025-06-05 07:05:49] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 109 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 181 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
After SMT, in 5002ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 5014ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 5499 ms. Remains : 70/262 places, 73/73 transitions.
Discarding 10 transitions out of 73. Remains 63
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8945 resets) in 1859 ms. (21 steps per ms) remains 37/62 properties
BEST_FIRST walk for 4001 steps (195 resets) in 64 ms. (61 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (197 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (201 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (179 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (204 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (191 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (203 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (185 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (189 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (193 resets) in 20 ms. (190 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4003 steps (220 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (195 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (200 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (182 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (182 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (192 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (193 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (186 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (201 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (184 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (195 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (800 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (421 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (389 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (391 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (433 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (427 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (392 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (437 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (404 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (437 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (419 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (431 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (410 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (397 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (406 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
[2025-06-05 07:05:54] [INFO ] Invariant cache hit.
[2025-06-05 07:05:54] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 2/143 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 106 constraints, problems are : Problem set: 0 solved, 35 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 141 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 2257ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 30 different solutions.
Parikh walk visited 12 properties in 3061 ms.
Support contains 30 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 66 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 66 transition count 69
Applied a total of 8 rules in 14 ms. Remains 66 /70 variables (removed 4) and now considering 69/73 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 66/70 places, 69/73 transitions.
RANDOM walk for 4000000 steps (894473 resets) in 30401 ms. (131 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (19061 resets) in 1199 ms. (333 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400002 steps (19231 resets) in 1239 ms. (322 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (19264 resets) in 1195 ms. (334 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (19428 resets) in 1094 ms. (365 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (19269 resets) in 1113 ms. (359 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (19184 resets) in 1118 ms. (357 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (19270 resets) in 1244 ms. (321 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (19386 resets) in 1076 ms. (371 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (19147 resets) in 1110 ms. (360 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (19036 resets) in 1063 ms. (375 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (19280 resets) in 1122 ms. (356 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1757 ms. (227 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (41476 resets) in 1437 ms. (278 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (41504 resets) in 1539 ms. (259 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (41881 resets) in 1368 ms. (292 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (41171 resets) in 1422 ms. (281 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (41305 resets) in 1538 ms. (259 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (41230 resets) in 1396 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (41213 resets) in 1531 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (41153 resets) in 1533 ms. (260 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (40915 resets) in 1436 ms. (278 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (41242 resets) in 1432 ms. (279 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 78824 steps, run visited all 22 properties in 412 ms. (steps per millisecond=191 )
Probabilistic random walk after 78824 steps, saw 41997 distinct states, run finished after 422 ms. (steps per millisecond=186 ) properties seen :22
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 28972 ms.
ITS solved all properties within timeout

BK_STOP 1749107176542

--------------------
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="SieveSingleMsgMbox-PT-d0m18"
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 SieveSingleMsgMbox-PT-d0m18, 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 r224-tall-174902009900232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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