Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r364-tall-171683777100097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is ShieldIIPs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777100097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 846K May 18 16:43 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 1716910344140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 15:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 15:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:32:25] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-28 15:32:25] [INFO ] Transformed 3003 places.
[2024-05-28 15:32:25] [INFO ] Transformed 2953 transitions.
[2024-05-28 15:32:25] [INFO ] Found NUPN structural information;
[2024-05-28 15:32:25] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 414 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 3003 transition count 2702
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2752 transition count 2702
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2752 transition count 2451
Deduced a syphon composed of 251 places in 29 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2501 transition count 2451
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 1200
Deduced a syphon composed of 1200 places in 7 ms
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 2 with 2400 rules applied. Total rules applied 3404 place count 1301 transition count 1251
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3404 rules in 433 ms. Remains 1301 /3003 variables (removed 1702) and now considering 1251/2953 (removed 1702) transitions.
// Phase 1: matrix 1251 rows 1301 cols
[2024-05-28 15:32:26] [INFO ] Computed 451 invariants in 28 ms
[2024-05-28 15:32:27] [INFO ] Implicit Places using invariants in 1009 ms returned [1286]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1039 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1300/3003 places, 1251/2953 transitions.
Applied a total of 0 rules in 18 ms. Remains 1300 /1300 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1510 ms. Remains : 1300/3003 places, 1251/2953 transitions.
Discarding 300 transitions out of 1251. Remains 951
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (12 resets) in 3167 ms. (12 steps per ms) remains 5/950 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
// Phase 1: matrix 1251 rows 1300 cols
[2024-05-28 15:32:28] [INFO ] Computed 450 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 36/51 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 36/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1249/1300 variables, 435/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 1249/1750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 7 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 10 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 17/1767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1251/2551 variables, 1300/3067 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 15:32:31] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 4 ms to minimize.
[2024-05-28 15:32:32] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 3 ms to minimize.
[2024-05-28 15:32:32] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 4 ms to minimize.
[2024-05-28 15:32:32] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 4 ms to minimize.
[2024-05-28 15:32:32] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 4 ms to minimize.
[2024-05-28 15:32:33] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 4 ms to minimize.
[2024-05-28 15:32:33] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 4 ms to minimize.
[2024-05-28 15:32:33] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 4 ms to minimize.
[2024-05-28 15:32:33] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2551/2551 variables, and 3076 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 36/51 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 36/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1249/1300 variables, 435/501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 1249/1750 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 26/1776 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:32:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1300 variables, 13/1789 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1300 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1251/2551 variables, 1300/3089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2551 variables, 5/3094 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 15:32:35] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 4 ms to minimize.
[2024-05-28 15:32:35] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:32:36] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 3 ms to minimize.
[2024-05-28 15:32:36] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:32:36] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:32:36] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:32:36] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:32:36] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:32:37] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-05-28 15:32:37] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:32:37] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 3 ms to minimize.
[2024-05-28 15:32:37] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2024-05-28 15:32:37] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:32:37] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-28 15:32:38] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:32:38] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:32:38] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:32:38] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:32:38] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-28 15:32:38] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 10105ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1251/1251 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1250 transition count 1201
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1250 transition count 1201
Partial Free-agglomeration rule applied 338 times.
Drop transitions (Partial Free agglomeration) removed 338 transitions
Iterating global reduction 0 with 338 rules applied. Total rules applied 438 place count 1250 transition count 1201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 439 place count 1249 transition count 1200
Applied a total of 439 rules in 317 ms. Remains 1249 /1300 variables (removed 51) and now considering 1200/1251 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 1249/1300 places, 1200/1251 transitions.
RANDOM walk for 98052 steps (16 resets) in 1435 ms. (68 steps per ms) remains 0/5 properties
Able to resolve query QuasiLiveness after proving 951 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 14436 ms.
ITS solved all properties within timeout

BK_STOP 1716910359695

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-050B, 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 r364-tall-171683777100097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;