fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r043-smll-171620180400221
Last Updated
July 7, 2024

About the Execution of 2023-gold for AutonomousCar-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
320.920 23904.00 36288.00 517.30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r043-smll-171620180400221.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 gold2023
Input is AutonomousCar-PT-09b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180400221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 865K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-09b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716318305639

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 19:05:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:05:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:05:09] [INFO ] Load time of PNML (sax parser for PT used): 404 ms
[2024-05-21 19:05:09] [INFO ] Transformed 391 places.
[2024-05-21 19:05:09] [INFO ] Transformed 1554 transitions.
[2024-05-21 19:05:09] [INFO ] Found NUPN structural information;
[2024-05-21 19:05:09] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 696 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 1554 rows 391 cols
[2024-05-21 19:05:09] [INFO ] Computed 14 invariants in 70 ms
Incomplete random walk after 10000 steps, including 80 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 16) seen :15
FORMULA AutonomousCar-PT-09b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
[2024-05-21 19:05:09] [INFO ] Invariant cache hit.
[2024-05-21 19:05:10] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-21 19:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 19:05:11] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2024-05-21 19:05:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:05:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2024-05-21 19:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 19:05:12] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2024-05-21 19:05:13] [INFO ] Deduced a trap composed of 15 places in 1076 ms of which 7 ms to minimize.
[2024-05-21 19:05:14] [INFO ] Deduced a trap composed of 17 places in 1004 ms of which 2 ms to minimize.
[2024-05-21 19:05:15] [INFO ] Deduced a trap composed of 16 places in 1070 ms of which 2 ms to minimize.
[2024-05-21 19:05:16] [INFO ] Deduced a trap composed of 30 places in 807 ms of which 3 ms to minimize.
[2024-05-21 19:05:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 391 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1553/1553 transitions.
Graph (trivial) has 375 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1698 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.39 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 381 transition count 1368
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 227 rules applied. Total rules applied 405 place count 208 transition count 1314
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 436 place count 177 transition count 1314
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 436 place count 177 transition count 1309
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 446 place count 172 transition count 1309
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 479 place count 139 transition count 1276
Iterating global reduction 3 with 33 rules applied. Total rules applied 512 place count 139 transition count 1276
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 3 with 324 rules applied. Total rules applied 836 place count 139 transition count 952
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 836 place count 139 transition count 950
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 840 place count 137 transition count 950
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 849 place count 128 transition count 869
Iterating global reduction 4 with 9 rules applied. Total rules applied 858 place count 128 transition count 869
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 876 place count 128 transition count 851
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 885 place count 119 transition count 851
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 971 place count 76 transition count 808
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 980 place count 67 transition count 718
Iterating global reduction 6 with 9 rules applied. Total rules applied 989 place count 67 transition count 718
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 998 place count 67 transition count 709
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1007 place count 58 transition count 709
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1008 place count 58 transition count 709
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1009 place count 57 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1010 place count 56 transition count 708
Applied a total of 1010 rules in 674 ms. Remains 56 /391 variables (removed 335) and now considering 708/1553 (removed 845) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 675 ms. Remains : 56/391 places, 708/1553 transitions.
// Phase 1: matrix 708 rows 56 cols
[2024-05-21 19:05:17] [INFO ] Computed 13 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 3882 resets, run finished after 10979 ms. (steps per millisecond=91 ) properties (out of 1) seen :1
FORMULA AutonomousCar-PT-09b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 19765 ms.

BK_STOP 1716318329543

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutonomousCar-PT-09b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 gold2023"
echo " Input is AutonomousCar-PT-09b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180400221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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