About the Execution of ITS-Tools for PhilosophersDyn-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
345.190 | 6523.00 | 12627.00 | 185.90 | FFFTTFFFFTFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085kn-ebro-146369085400464
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-0
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-1
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-15
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-2
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-3
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-4
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-5
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-6
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-7
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-8
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464063790177
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(F(G(F("((HasLeft_2+HasLeft_3)+HasLeft_1)<=((HasRight_2+HasRight_1)+HasRight_3)"))))))
Formula 0 simplified : !FGF"((HasLeft_2+HasLeft_3)+HasLeft_1)<=((HasRight_2+HasRight_1)+HasRight_3)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.250071,27280,1,0,108,13359,157,53,2438,13367,177
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("3<=((Forks_1+Forks_2)+Forks_3)"))
Formula 1 simplified : !"3<=((Forks_1+Forks_2)+Forks_3)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.25617,27484,1,0,109,13515,162,54,2442,13614,186
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("1<=((WaitRight_1+WaitRight_2)+WaitRight_3)"))
Formula 2 simplified : !"1<=((WaitRight_1+WaitRight_2)+WaitRight_3)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.256903,27512,1,0,109,13515,165,54,2446,13614,188
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("3<=((Outside_3+Outside_2)+Outside_1)")U(F("((Forks_1+Forks_2)+Forks_3)<=((Think_3+Think_2)+Think_1)"))))
Formula 3 simplified : !("3<=((Outside_3+Outside_2)+Outside_1)" U F"((Forks_1+Forks_2)+Forks_3)<=((Think_3+Think_2)+Think_1)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.257714,27780,1,0,109,13515,174,54,2454,13614,192
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(F(F(F("1<=((Outside_3+Outside_2)+Outside_1)"))))))
Formula 4 simplified : !GF"1<=((Outside_3+Outside_2)+Outside_1)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.262234,27796,1,0,112,13796,183,56,2461,13934,205
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(X(X("2<=((HasRight_2+HasRight_1)+HasRight_3)"))))))
Formula 5 simplified : !XFXX"2<=((HasRight_2+HasRight_1)+HasRight_3)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.357119,28704,1,0,127,16992,192,71,2468,20742,241
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((G("2<=((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)"))U(F(G("((Forks_1+Forks_2)+Forks_3)<=((Outside_3+Outside_2)+Outside_1)")))))
Formula 6 simplified : !(G"2<=((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)" U FG"((Forks_1+Forks_2)+Forks_3)<=((Outside_3+Outside_2)+Outside_1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.442904,30384,1,0,168,20543,205,111,2519,29358,332
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((F(G("1<=((WaitRight_1+WaitRight_2)+WaitRight_3)")))U(F(X("((WaitRight_1+WaitRight_2)+WaitRight_3)<=((Think_3+Think_2)+Think_1)")))))
Formula 7 simplified : !(FG"1<=((WaitRight_1+WaitRight_2)+WaitRight_3)" U FX"((WaitRight_1+WaitRight_2)+WaitRight_3)<=((Think_3+Think_2)+Think_1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.445593,30836,1,0,168,20543,214,111,2529,29358,336
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("2<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1)"))
Formula 8 simplified : !"2<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.446316,30836,1,0,168,20543,217,111,2533,29358,338
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(("((HasLeft_2+HasLeft_3)+HasLeft_1)<=((WaitRight_1+WaitRight_2)+WaitRight_3)")U(F("1<=((Think_3+Think_2)+Think_1)")))))
Formula 9 simplified : !F("((HasLeft_2+HasLeft_3)+HasLeft_1)<=((WaitRight_1+WaitRight_2)+WaitRight_3)" U F"1<=((Think_3+Think_2)+Think_1)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.447225,31028,1,0,168,20543,226,111,2540,29358,346
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G((F("2<=((HasRight_2+HasRight_1)+HasRight_3)"))U(G("2<=((HasRight_2+HasRight_1)+HasRight_3)")))))
Formula 10 simplified : !G(F"2<=((HasRight_2+HasRight_1)+HasRight_3)" U G"2<=((HasRight_2+HasRight_1)+HasRight_3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.469853,31376,1,0,181,21204,236,136,2545,31835,419
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("((WaitLeft_2+WaitLeft_3)+WaitLeft_1)<=((Outside_3+Outside_2)+Outside_1)"))
Formula 11 simplified : !"((WaitLeft_2+WaitLeft_3)+WaitLeft_1)<=((Outside_3+Outside_2)+Outside_1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.470797,31376,1,0,181,21204,239,136,2552,31835,421
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(F("1<=((Think_3+Think_2)+Think_1)"))))
Formula 12 simplified : !XF"1<=((Think_3+Think_2)+Think_1)"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.471476,31644,1,0,181,21204,239,136,2552,31835,423
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G("((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)<=((Think_3+Think_2)+Think_1)")))
Formula 13 simplified : !G"((((((((Neighbourhood_1_2+Neighbourhood_2_2)+Neighbourhood_3_3)+Neighbourhood_1_1)+Neighbourhood_2_3)+Neighbourhood_2_1)+Neighbourhood_1_3)+Neighbourhood_3_2)+Neighbourhood_3_1)<=((Think_3+Think_2)+Think_1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.512199,32096,1,0,195,22270,245,147,2721,33885,458
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((X(G("((HasLeft_2+HasLeft_3)+HasLeft_1)<=((Think_3+Think_2)+Think_1)")))U(("2<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1)")U("1<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1)"))))
Formula 14 simplified : !(XG"((HasLeft_2+HasLeft_3)+HasLeft_1)<=((Think_3+Think_2)+Think_1)" U ("2<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1)" U "1<=((WaitLeft_2+WaitLeft_3)+WaitLeft_1)"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.587988,34948,1,0,215,24002,259,170,2777,37673,520
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(X("((WaitLeft_2+WaitLeft_3)+WaitLeft_1)<=((HasLeft_2+HasLeft_3)+HasLeft_1)")))))
Formula 15 simplified : !GXX"((WaitLeft_2+WaitLeft_3)+WaitLeft_1)<=((HasLeft_2+HasLeft_3)+HasLeft_1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.603333,35376,1,0,223,24279,265,179,2801,38812,546
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1464063796700
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 24, 2016 4:23:14 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 24, 2016 4:23:15 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 83 ms
May 24, 2016 4:23:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
May 24, 2016 4:23:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
May 24, 2016 4:23:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 323 ms
May 24, 2016 4:23:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.gal : 37 ms
May 24, 2016 4:23:15 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r085kn-ebro-146369085400464"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
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 ;