Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654454800079.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S04J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454800079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 Liveness

=== Now, execution of the tool begins

BK_START 1717103431305

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:10:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:10:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:10:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:10:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:10:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 620 ms
[2024-05-30 21:10:33] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 24 ms.
[2024-05-30 21:10:33] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-30 21:10:33] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-30 21:10:33] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 78 ms.
[2024-05-30 21:10:33] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-30 21:10:33] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 46 ms.
[2024-05-30 21:10:33] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:10:33] [INFO ] Reduced 36 identical enabling conditions.
[2024-05-30 21:10:33] [INFO ] Reduced 264 identical enabling conditions.
[2024-05-30 21:10:33] [INFO ] Reduced 1326 identical enabling conditions.
[2024-05-30 21:10:33] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2024-05-30 21:10:33] [INFO ] Skeletonized 65 HLPN properties in 8 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-30 21:10:33] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 39 ms.
[2024-05-30 21:10:33] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-05-30 21:10:33] [INFO ] Reduced 36 identical enabling conditions.
[2024-05-30 21:10:33] [INFO ] Reduced 264 identical enabling conditions.
[2024-05-30 21:10:33] [INFO ] Reduced 1326 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.29840KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 79 ms. Remains 554 /554 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-30 21:10:33] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-05-30 21:10:34] [INFO ] Computed 50 invariants in 92 ms
[2024-05-30 21:10:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-30 21:10:50] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 19 ms to minimize.
[2024-05-30 21:10:50] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-30 21:10:50] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-30 21:10:50] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-05-30 21:10:50] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-30 21:10:51] [INFO ] Deduced a trap composed of 301 places in 283 ms of which 4 ms to minimize.
[2024-05-30 21:10:51] [INFO ] Deduced a trap composed of 157 places in 247 ms of which 4 ms to minimize.
[2024-05-30 21:10:51] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-30 21:10:52] [INFO ] Deduced a trap composed of 302 places in 268 ms of which 3 ms to minimize.
[2024-05-30 21:10:53] [INFO ] Deduced a trap composed of 321 places in 370 ms of which 6 ms to minimize.
[2024-05-30 21:10:53] [INFO ] Deduced a trap composed of 312 places in 337 ms of which 4 ms to minimize.
[2024-05-30 21:10:54] [INFO ] Deduced a trap composed of 313 places in 361 ms of which 4 ms to minimize.
[2024-05-30 21:10:54] [INFO ] Deduced a trap composed of 314 places in 336 ms of which 4 ms to minimize.
[2024-05-30 21:10:55] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 4 ms to minimize.
[2024-05-30 21:10:55] [INFO ] Deduced a trap composed of 354 places in 363 ms of which 4 ms to minimize.
[2024-05-30 21:10:55] [INFO ] Deduced a trap composed of 302 places in 368 ms of which 3 ms to minimize.
[2024-05-30 21:10:56] [INFO ] Deduced a trap composed of 336 places in 319 ms of which 3 ms to minimize.
[2024-05-30 21:10:56] [INFO ] Deduced a trap composed of 309 places in 352 ms of which 3 ms to minimize.
[2024-05-30 21:10:57] [INFO ] Deduced a trap composed of 285 places in 330 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1902 variables, and 61 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-30 21:11:01] [INFO ] Deduced a trap composed of 315 places in 347 ms of which 4 ms to minimize.
[2024-05-30 21:11:03] [INFO ] Deduced a trap composed of 324 places in 380 ms of which 4 ms to minimize.
[2024-05-30 21:11:03] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 4 ms to minimize.
[2024-05-30 21:11:03] [INFO ] Deduced a trap composed of 323 places in 358 ms of which 3 ms to minimize.
[2024-05-30 21:11:04] [INFO ] Deduced a trap composed of 316 places in 356 ms of which 4 ms to minimize.
[2024-05-30 21:11:04] [INFO ] Deduced a trap composed of 280 places in 332 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1902 variables, and 67 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 25/25 constraints]
After SMT, in 45536ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45580ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 45703 ms. Remains : 554/554 places, 1372/1372 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 81 ms. Remains 554 /554 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-05-30 21:11:19] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-30 21:11:19] [INFO ] Invariant cache hit.
[2024-05-30 21:11:19] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-30 21:11:19] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-30 21:11:19] [INFO ] Invariant cache hit.
[2024-05-30 21:11:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 21:11:20] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-30 21:11:20] [INFO ] Redundant transitions in 85 ms returned []
Running 1368 sub problems to find dead transitions.
[2024-05-30 21:11:20] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-30 21:11:20] [INFO ] Invariant cache hit.
[2024-05-30 21:11:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-30 21:11:37] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-30 21:11:38] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-30 21:11:38] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:11:38] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-30 21:11:38] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-05-30 21:11:38] [INFO ] Deduced a trap composed of 171 places in 312 ms of which 3 ms to minimize.
[2024-05-30 21:11:40] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 2 ms to minimize.
[2024-05-30 21:11:45] [INFO ] Deduced a trap composed of 297 places in 309 ms of which 3 ms to minimize.
[2024-05-30 21:11:52] [INFO ] Deduced a trap composed of 297 places in 334 ms of which 5 ms to minimize.
[2024-05-30 21:11:52] [INFO ] Deduced a trap composed of 280 places in 242 ms of which 4 ms to minimize.
[2024-05-30 21:11:53] [INFO ] Deduced a trap composed of 107 places in 401 ms of which 5 ms to minimize.
[2024-05-30 21:11:54] [INFO ] Deduced a trap composed of 286 places in 293 ms of which 4 ms to minimize.
[2024-05-30 21:11:54] [INFO ] Deduced a trap composed of 307 places in 276 ms of which 3 ms to minimize.
[2024-05-30 21:11:54] [INFO ] Deduced a trap composed of 303 places in 292 ms of which 3 ms to minimize.
[2024-05-30 21:11:55] [INFO ] Deduced a trap composed of 276 places in 309 ms of which 5 ms to minimize.
[2024-05-30 21:11:55] [INFO ] Deduced a trap composed of 310 places in 301 ms of which 4 ms to minimize.
[2024-05-30 21:11:55] [INFO ] Deduced a trap composed of 315 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:11:56] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1902 variables, and 60 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-30 21:12:00] [INFO ] Deduced a trap composed of 264 places in 331 ms of which 4 ms to minimize.
[2024-05-30 21:12:00] [INFO ] Deduced a trap composed of 266 places in 311 ms of which 4 ms to minimize.
[2024-05-30 21:12:05] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
[2024-05-30 21:12:05] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-05-30 21:12:15] [INFO ] Deduced a trap composed of 278 places in 334 ms of which 5 ms to minimize.
[2024-05-30 21:12:15] [INFO ] Deduced a trap composed of 369 places in 356 ms of which 5 ms to minimize.
[2024-05-30 21:12:16] [INFO ] Deduced a trap composed of 259 places in 297 ms of which 4 ms to minimize.
[2024-05-30 21:12:17] [INFO ] Deduced a trap composed of 146 places in 352 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1902 variables, and 68 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 26/26 constraints]
After SMT, in 66979ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 67002ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 68250 ms. Remains : 554/554 places, 1372/1372 transitions.
Finished random walk after 37731 steps, including 0 resets, run found a deadlock after 186 ms. (steps per millisecond=202 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 115253 ms.
ITS solved all properties within timeout

BK_STOP 1717103548006

--------------------
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 Liveness -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="PolyORBLF-COL-S04J04T06"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-COL-S04J04T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tajo-171654454800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;