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 QuasiCertifProtocol-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097kn-smll-146369138500077
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-02-LTLCardinality-0
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-1
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-15
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463948451370


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 : !((G(X(F(G("a1<=((s5_0+s5_1)+s5_2)"))))))
Formula 0 simplified : !GXFG"a1<=((s5_0+s5_1)+s5_2)"
61 unique states visited
0 strongly connected components in search stack
62 transitions explored
32 items max in DFS search stack
65 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.674552,41692,1,0,218,70400,146,197,2478,73927,576
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(("3<=((n3_0+n3_1)+n3_2)")U("a4<=((n6_0+n6_2)+n6_1)")))))
Formula 1 simplified : !FG("3<=((n3_0+n3_1)+n3_2)" U "a4<=((n6_0+n6_2)+n6_1)")
39 unique states visited
0 strongly connected components in search stack
52 transitions explored
21 items max in DFS search stack
11 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.789674,43892,1,0,307,73491,162,337,2519,80875,1033
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G("1<=CstopAbort")))
Formula 2 simplified : !G"1<=CstopAbort"
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.791506,44168,1,0,307,73514,170,337,2521,80919,1043
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(("((Cstart_1+Cstart_0)+Cstart_2)<=((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)")U("SstopAbort<=((CstopOK_0+CstopOK_1)+CstopOK_2)"))))
Formula 3 simplified : !X("((Cstart_1+Cstart_0)+Cstart_2)<=((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)" U "SstopAbort<=((CstopOK_0+CstopOK_1)+CstopOK_2)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.797697,44192,1,0,312,73766,180,345,2557,81346,1073
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G("3<=CstopAbort")))
Formula 4 simplified : !G"3<=CstopAbort"
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.798435,44196,1,0,312,73766,186,345,2559,81346,1078
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(G(("((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)<=a4")U("a4<=Astart")))))
Formula 5 simplified : !G("((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)<=a4" U "a4<=Astart")
33 unique states visited
0 strongly connected components in search stack
44 transitions explored
31 items max in DFS search stack
12 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.914516,47340,1,0,355,83453,204,410,2714,101711,1424
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X("3<=((s5_0+s5_1)+s5_2)")))
Formula 6 simplified : !X"3<=((s5_0+s5_1)+s5_2)"
4 unique states visited
4 strongly connected components in search stack
4 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.91736,47420,1,0,356,83494,207,411,2718,101872,1432
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((("1<=((s5_0+s5_1)+s5_2)")U(("3<=((n3_0+n3_1)+n3_2)")U("3<=AstopAbort"))))
Formula 7 simplified : !("1<=((s5_0+s5_1)+s5_2)" U ("3<=((n3_0+n3_1)+n3_2)" U "3<=AstopAbort"))
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.91881,47720,1,0,356,83494,224,411,2731,101872,1438
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F((X("2<=((CstopOK_0+CstopOK_1)+CstopOK_2)"))U(G("((s5_0+s5_1)+s5_2)<=((n6_0+n6_2)+n6_1)")))))
Formula 8 simplified : !F(X"2<=((CstopOK_0+CstopOK_1)+CstopOK_2)" U G"((s5_0+s5_1)+s5_2)<=((n6_0+n6_2)+n6_1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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,1.01883,49112,1,0,444,88940,237,552,2788,112293,1837
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(X(G(G("((s3_1+s3_0)+s3_2)<=((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)"))))))
Formula 9 simplified : !GXG"((s3_1+s3_0)+s3_2)<=((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)"
4 unique states visited
4 strongly connected components in search stack
4 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,1.03132,49536,1,0,480,89644,243,622,2834,114103,1967
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G("2<=((s4_0+s4_2)+s4_1)"))))
Formula 10 simplified : !G"2<=((s4_0+s4_2)+s4_1)"
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,1.03226,49668,1,0,480,89644,249,622,2840,114103,1972
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((F(G("((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)<=((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_0_2)+n8_2_1)+n8_1_1)+n8_0_1)+n8_1_2)+n8_2_2)")))U(X(G("((SstopOK_1+SstopOK_0)+SstopOK_2)<=((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)")))))
Formula 11 simplified : !(FG"((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)<=((((((((n8_2_0+n8_1_0)+n8_0_0)+n8_0_2)+n8_2_1)+n8_1_1)+n8_0_1)+n8_1_2)+n8_2_2)" U XG"((SstopOK_1+SstopOK_0)+SstopOK_2)<=((((((((n7_1_0+n7_2_0)+n7_0_0)+n7_0_2)+n7_2_1)+n7_1_1)+n7_0_1)+n7_2_2)+n7_1_2)")
71 unique states visited
31 strongly connected components in search stack
94 transitions explored
31 items max in DFS search stack
18 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,1.22015,55044,1,0,683,104233,268,913,3130,150732,2727
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((("a4<=a3")U(X("((n2_0+n2_1)+n2_2)<=((s4_0+s4_2)+s4_1)"))))
Formula 12 simplified : !("a4<=a3" U X"((n2_0+n2_1)+n2_2)<=((s4_0+s4_2)+s4_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,1.22153,55304,1,0,683,104233,280,913,3145,150733,2735
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("2<=a4"))
Formula 13 simplified : !"2<=a4"
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,1.22188,55344,1,0,683,104233,283,913,3147,150733,2737
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((G(G("3<=((s6_0+s6_1)+s6_2)")))U(("((Sstart_1+Sstart_0)+Sstart_2)<=((n4_1+n4_2)+n4_0)")U("2<=((n4_1+n4_2)+n4_0)"))))
Formula 14 simplified : !(G"3<=((s6_0+s6_1)+s6_2)" U ("((Sstart_1+Sstart_0)+Sstart_2)<=((n4_1+n4_2)+n4_0)" U "2<=((n4_1+n4_2)+n4_0)"))
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,1.22564,55868,1,0,683,104233,305,913,3181,150733,2745
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F((X("3<=a5"))U(X("1<=AstopAbort")))))
Formula 15 simplified : !F(X"3<=a5" U X"1<=AstopAbort")
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,1.27029,56204,1,0,761,104885,314,1019,3183,151770,3045
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1463948457071

--------------------
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 22, 2016 8:20:54 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 22, 2016 8:20:54 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 42 ms
May 22, 2016 8:20:54 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
May 22, 2016 8:20:55 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
May 22, 2016 8:20:55 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 86 ms
May 22, 2016 8:20:55 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.gal : 14 ms
May 22, 2016 8:20:55 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/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/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 QuasiCertifProtocol-PT-02, 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 r097kn-smll-146369138500077"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;