Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r287-smll-167863553800047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ParamProductionCell-PT-1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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 ParamProductionCell-PT-1-UpperBounds-00
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-01
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-02
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-03
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-04
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-05
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-06
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-07
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-08
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-09
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-10
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-11
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-12
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-13
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-14
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678917962898

Running Version 202205111006
[2023-03-15 22:06:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:06:05] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-15 22:06:05] [INFO ] Transformed 231 places.
[2023-03-15 22:06:05] [INFO ] Transformed 202 transitions.
[2023-03-15 22:06:05] [INFO ] Found NUPN structural information;
[2023-03-15 22:06:05] [INFO ] Parsed PT model containing 231 places and 202 transitions in 345 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA ParamProductionCell-PT-1-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 22:06:05] [INFO ] Computed 59 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 15) seen :12
FORMULA ParamProductionCell-PT-1-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 22:06:06] [INFO ] Computed 59 place invariants in 17 ms
[2023-03-15 22:06:06] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2023-03-15 22:06:06] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-15 22:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:06] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-15 22:06:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:06:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2023-03-15 22:06:06] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-15 22:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:07] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-15 22:06:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:06:07] [INFO ] [Nat]Added 68 Read/Feed constraints in 78 ms returned sat
[2023-03-15 22:06:07] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 12 ms to minimize.
[2023-03-15 22:06:07] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 2 ms to minimize.
[2023-03-15 22:06:07] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 2 ms to minimize.
[2023-03-15 22:06:07] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 4 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 5 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:06:08] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 0 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:06:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2614 ms
[2023-03-15 22:06:09] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2023-03-15 22:06:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-15 22:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:10] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-15 22:06:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:06:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2023-03-15 22:06:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-15 22:06:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:10] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-15 22:06:10] [INFO ] [Nat]Added 68 Read/Feed constraints in 55 ms returned sat
[2023-03-15 22:06:10] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2023-03-15 22:06:10] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-15 22:06:10] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
[2023-03-15 22:06:10] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-15 22:06:11] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-15 22:06:11] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-15 22:06:11] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2023-03-15 22:06:11] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-15 22:06:11] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2023-03-15 22:06:11] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2023-03-15 22:06:12] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-15 22:06:12] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-15 22:06:12] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2023-03-15 22:06:12] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-15 22:06:12] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 10 ms to minimize.
[2023-03-15 22:06:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 2431 ms
[2023-03-15 22:06:12] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2023-03-15 22:06:12] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-15 22:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:12] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-15 22:06:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:06:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2023-03-15 22:06:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-15 22:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:06:13] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-15 22:06:13] [INFO ] [Nat]Added 68 Read/Feed constraints in 32 ms returned sat
[2023-03-15 22:06:13] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-15 22:06:13] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-15 22:06:13] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:06:13] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2023-03-15 22:06:13] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2023-03-15 22:06:13] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:06:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1619 ms
Current structural bounds on expressions (after SMT) : [0, 0, 0] Max seen :[0, 0, 0]
FORMULA ParamProductionCell-PT-1-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9398 ms.

BK_STOP 1678917974933

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is ParamProductionCell-PT-1, 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 r287-smll-167863553800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 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 ;