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.r056-tall-174854042200427.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 CryptoMiner-PT-D20N100, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tall-174854042200427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 268K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 27K 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 1748649180194

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CryptoMiner-PT-D20N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:53:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 23:53:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:53:01] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2025-05-30 23:53:01] [INFO ] Transformed 63 places.
[2025-05-30 23:53:01] [INFO ] Transformed 63 transitions.
[2025-05-30 23:53:01] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 138 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 63/63 places, 63/63 transitions.
Graph (trivial) has 41 edges and 63 vertex of which 21 / 63 are part of one of the 1 SCC in 2 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 43
Applied a total of 2 rules in 26 ms. Remains 42 /63 variables (removed 21) and now considering 43/63 (removed 20) transitions.
// Phase 1: matrix 43 rows 42 cols
[2025-05-30 23:53:01] [INFO ] Computed 0 invariants in 5 ms
[2025-05-30 23:53:01] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 23:53:01] [INFO ] Invariant cache hit.
[2025-05-30 23:53:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 23:53:01] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-05-30 23:53:01] [INFO ] Invariant cache hit.
[2025-05-30 23:53:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 848 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 42/83 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 40 unsolved in 835 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1736ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1751ms
Starting structural reductions in LIVENESS mode, iteration 1 : 42/63 places, 43/63 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 2109 ms. Remains : 42/63 places, 43/63 transitions.
Discarding 22 transitions out of 43. Remains 21
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40147 steps (539 resets) in 1172 ms. (34 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4000 steps (129 resets) in 91 ms. (43 steps per ms) remains 13/18 properties
BEST_FIRST walk for 4001 steps (130 resets) in 65 ms. (60 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4001 steps (131 resets) in 73 ms. (54 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4001 steps (132 resets) in 68 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000 steps (137 resets) in 77 ms. (51 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000 steps (129 resets) in 58 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4001 steps (133 resets) in 67 ms. (58 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4001 steps (129 resets) in 89 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4001 steps (134 resets) in 67 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (134 resets) in 65 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4001 steps (128 resets) in 58 ms. (67 steps per ms) remains 10/10 properties
[2025-05-30 23:53:04] [INFO ] Invariant cache hit.
[2025-05-30 23:53:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 32/53 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/65 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/67 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/69 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/71 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2/73 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/75 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/75 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 2/77 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/77 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 2/79 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/79 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 2/81 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/81 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/81 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 2/83 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/83 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 62 constraints, problems are : Problem set: 0 solved, 10 unsolved in 692 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 32/53 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/65 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/67 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/69 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/71 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2/73 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/75 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/75 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 2/77 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/77 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 2/79 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/79 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 2/81 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/81 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/81 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 2/83 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/83 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/84 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/84 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 0/84 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 72 constraints, problems are : Problem set: 0 solved, 10 unsolved in 755 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 1458ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 8592 steps, including 164 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1432 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 1039 ms.
Able to resolve query QuasiLiveness after proving 21 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 5486 ms.
ITS solved all properties within timeout

BK_STOP 1748649186948

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="CryptoMiner-PT-D20N100"
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 CryptoMiner-PT-D20N100, 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 r056-tall-174854042200427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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