fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r478-tall-171620516400376
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CloudDeployment-PT-6a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1004.659 60396.00 77186.00 250.40 [undef] Cannot compute

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.r478-tall-171620516400376.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 ltsminxred
Input is CloudDeployment-PT-6a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r478-tall-171620516400376
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 317K May 18 16:42 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717179675175

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:21:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-31 18:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:21:16] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-31 18:21:16] [INFO ] Transformed 221 places.
[2024-05-31 18:21:16] [INFO ] Transformed 908 transitions.
[2024-05-31 18:21:16] [INFO ] Found NUPN structural information;
[2024-05-31 18:21:16] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 240 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.16207KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 221/221 places, 794/794 transitions.
Graph (trivial) has 241 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Computed a total of 125 stabilizing places and 479 stable transitions
Graph (complete) has 2101 edges and 179 vertex of which 166 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.11 ms
Discarding 13 places :
Also discarding 0 output transitions
Computed a total of 112 stabilizing places and 478 stable transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 12 place count 156 transition count 616
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 156 transition count 616
Computed a total of 102 stabilizing places and 432 stable transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 153 transition count 613
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 153 transition count 613
Computed a total of 99 stabilizing places and 429 stable transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 151 transition count 611
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 151 transition count 611
Computed a total of 97 stabilizing places and 427 stable transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 150 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 150 transition count 610
Computed a total of 96 stabilizing places and 426 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 70 place count 132 transition count 676
Computed a total of 78 stabilizing places and 492 stable transitions
Computed a total of 78 stabilizing places and 492 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 177 transitions
Redundant transition composition rules discarded 177 transitions
Iterating global reduction 0 with 177 rules applied. Total rules applied 247 place count 132 transition count 499
Computed a total of 78 stabilizing places and 390 stable transitions
Computed a total of 78 stabilizing places and 390 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 248 place count 131 transition count 498
Computed a total of 77 stabilizing places and 390 stable transitions
Computed a total of 77 stabilizing places and 390 stable transitions
Applied a total of 248 rules in 227 ms. Remains 131 /221 variables (removed 90) and now considering 498/794 (removed 296) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 240 ms. Remains : 131/221 places, 498/794 transitions.
Random walk for 1250000 steps, including 20663 resets, run took 2798 ms (no deadlock found). (steps per millisecond=446 )
Random directed walk for 1250000 steps, including 5373 resets, run took 2558 ms (no deadlock found). (steps per millisecond=488 )
[2024-05-31 18:21:22] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2024-05-31 18:21:22] [INFO ] Computed 23 invariants in 12 ms
[2024-05-31 18:21:22] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 6 ms returned sat
[2024-05-31 18:21:22] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-31 18:21:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:21:22] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 6 ms returned sat
[2024-05-31 18:21:22] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 18:21:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 18:21:22] [INFO ] [Nat]Added 7 Read/Feed constraints in 24 ms returned sat
[2024-05-31 18:21:22] [INFO ] Computed and/alt/rep : 146/270/146 causal constraints (skipped 15 transitions) in 28 ms.
[2024-05-31 18:21:23] [INFO ] Added : 82 causal constraints over 17 iterations in 308 ms. Result :sat
Parikh directed walk for 9200 steps, including 139 resets, run took 34 ms. (steps per millisecond=270 )
Random directed walk for 500000 steps, including 2157 resets, run took 1056 ms (no deadlock found). (steps per millisecond=473 )
Random walk for 500000 steps, including 8279 resets, run took 1030 ms (no deadlock found). (steps per millisecond=485 )
Random directed walk for 500005 steps, including 2145 resets, run took 1061 ms (no deadlock found). (steps per millisecond=471 )
Random walk for 500000 steps, including 8254 resets, run took 1015 ms (no deadlock found). (steps per millisecond=492 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 131/131 places, 498/498 transitions.
Computed a total of 77 stabilizing places and 390 stable transitions
Computed a total of 77 stabilizing places and 390 stable transitions
Computed a total of 77 stabilizing places and 390 stable transitions
Applied a total of 0 rules in 18 ms. Remains 131 /131 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-05-31 18:21:27] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-31 18:21:27] [INFO ] Invariant cache hit.
[2024-05-31 18:21:27] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-31 18:21:27] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-31 18:21:27] [INFO ] Invariant cache hit.
[2024-05-31 18:21:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 18:21:27] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-31 18:21:27] [INFO ] Redundant transitions in 303 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-31 18:21:28] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-31 18:21:28] [INFO ] Invariant cache hit.
[2024-05-31 18:21:28] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/329 variables, 131/154 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/330 variables, and 161 constraints, problems are : Problem set: 0 solved, 455 unsolved in 12866 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 131/131 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/329 variables, 131/154 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 455/616 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/330 variables, and 616 constraints, problems are : Problem set: 0 solved, 455 unsolved in 23705 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 131/131 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints]
After SMT, in 37197ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 37225ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 37853 ms. Remains : 131/131 places, 498/498 transitions.
Random walk for 1250000 steps, including 20719 resets, run took 2518 ms (no deadlock found). (steps per millisecond=496 )
Random directed walk for 1250003 steps, including 5383 resets, run took 2586 ms (no deadlock found). (steps per millisecond=483 )
[2024-05-31 18:22:10] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2024-05-31 18:22:10] [INFO ] Invariant cache hit.
[2024-05-31 18:22:10] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 4 ms returned sat
[2024-05-31 18:22:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 18:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:22:10] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 5 ms returned sat
[2024-05-31 18:22:10] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 18:22:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 18:22:10] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-31 18:22:10] [INFO ] Computed and/alt/rep : 146/270/146 causal constraints (skipped 15 transitions) in 16 ms.
[2024-05-31 18:22:10] [INFO ] Added : 100 causal constraints over 22 iterations in 305 ms. Result :sat
Parikh directed walk for 10000 steps, including 119 resets, run took 31 ms. (steps per millisecond=322 )
Random directed walk for 500005 steps, including 2149 resets, run took 1049 ms (no deadlock found). (steps per millisecond=476 )
Random walk for 500000 steps, including 8240 resets, run took 1015 ms (no deadlock found). (steps per millisecond=492 )
Random directed walk for 500003 steps, including 2164 resets, run took 1053 ms (no deadlock found). (steps per millisecond=474 )
Random walk for 500000 steps, including 8223 resets, run took 1008 ms (no deadlock found). (steps per millisecond=496 )
[2024-05-31 18:22:15] [INFO ] Flatten gal took : 97 ms
[2024-05-31 18:22:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2024-05-31 18:22:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 221 places, 794 transitions and 5109 arcs took 10 ms.
Total runtime 58888 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ReachabilityDeadlock

BK_STOP 1717179735571

--------------------
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 ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2024
property name is ReachabilityDeadlock
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CloudDeployment-PT-6a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudDeployment-PT-6a, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r478-tall-171620516400376"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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