Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098204600139.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-PT-000050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204600139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 43M
-rw-r--r-- 1 mcc users 2.2M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.1M May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 311K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 830K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 796K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 263K Mar 27 11:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 686K Mar 27 11:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 546K Mar 25 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Mar 25 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 104K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 205K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 4.0M May 5 16:52 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 SharedMemory-PT-000050-UpperBounds-00
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-01
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-02
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-03
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-04
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-05
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-06
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-07
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-08
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-09
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-10
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-11
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-12
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-13
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-14
FORMULA_NAME SharedMemory-PT-000050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621045440344

Running Version 0
[2021-05-15 02:24:02] [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]
[2021-05-15 02:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 02:24:02] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2021-05-15 02:24:02] [INFO ] Transformed 2651 places.
[2021-05-15 02:24:02] [INFO ] Transformed 5050 transitions.
[2021-05-15 02:24:02] [INFO ] Found NUPN structural information;
[2021-05-15 02:24:02] [INFO ] Parsed PT model containing 2651 places and 5050 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 80 ms.
FORMULA SharedMemory-PT-000050-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 5050 rows 2651 cols
[2021-05-15 02:24:03] [INFO ] Computed 101 place invariants in 384 ms
FORMULA SharedMemory-PT-000050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4175 ms. (steps per millisecond=2 ) properties (out of 13) seen :120
FORMULA SharedMemory-PT-000050-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 9) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 9) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :40
FORMULA SharedMemory-PT-000050-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 5050 rows 2651 cols
[2021-05-15 02:24:08] [INFO ] Computed 101 place invariants in 248 ms
[2021-05-15 02:24:09] [INFO ] [Real]Absence check using 101 positive place invariants in 61 ms returned unsat
[2021-05-15 02:24:09] [INFO ] [Real]Absence check using 101 positive place invariants in 102 ms returned sat
[2021-05-15 02:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:11] [INFO ] [Real]Absence check using state equation in 1456 ms returned sat
[2021-05-15 02:24:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:24:11] [INFO ] [Nat]Absence check using 101 positive place invariants in 89 ms returned sat
[2021-05-15 02:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:13] [INFO ] [Nat]Absence check using state equation in 1404 ms returned sat
[2021-05-15 02:24:13] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 330 ms.
[2021-05-15 02:24:14] [INFO ] Added : 0 causal constraints over 0 iterations in 705 ms. Result :sat
[2021-05-15 02:24:14] [INFO ] [Real]Absence check using 101 positive place invariants in 91 ms returned sat
[2021-05-15 02:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:16] [INFO ] [Real]Absence check using state equation in 1418 ms returned sat
[2021-05-15 02:24:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:24:16] [INFO ] [Nat]Absence check using 101 positive place invariants in 94 ms returned sat
[2021-05-15 02:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:18] [INFO ] [Nat]Absence check using state equation in 1398 ms returned sat
[2021-05-15 02:24:18] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 265 ms.
[2021-05-15 02:24:18] [INFO ] Added : 0 causal constraints over 0 iterations in 553 ms. Result :sat
[2021-05-15 02:24:19] [INFO ] [Real]Absence check using 101 positive place invariants in 52 ms returned unsat
[2021-05-15 02:24:20] [INFO ] [Real]Absence check using 101 positive place invariants in 88 ms returned sat
[2021-05-15 02:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:21] [INFO ] [Real]Absence check using state equation in 1364 ms returned sat
[2021-05-15 02:24:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:24:21] [INFO ] [Nat]Absence check using 101 positive place invariants in 87 ms returned sat
[2021-05-15 02:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:23] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2021-05-15 02:24:23] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 261 ms.
[2021-05-15 02:24:24] [INFO ] Added : 1 causal constraints over 1 iterations in 715 ms. Result :sat
[2021-05-15 02:24:24] [INFO ] [Real]Absence check using 101 positive place invariants in 91 ms returned sat
[2021-05-15 02:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:26] [INFO ] [Real]Absence check using state equation in 1343 ms returned sat
[2021-05-15 02:24:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:24:26] [INFO ] [Nat]Absence check using 101 positive place invariants in 87 ms returned sat
[2021-05-15 02:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:28] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2021-05-15 02:24:28] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 271 ms.
[2021-05-15 02:24:28] [INFO ] Added : 1 causal constraints over 1 iterations in 697 ms. Result :sat
[2021-05-15 02:24:29] [INFO ] [Real]Absence check using 101 positive place invariants in 84 ms returned sat
[2021-05-15 02:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:30] [INFO ] [Real]Absence check using state equation in 1453 ms returned sat
[2021-05-15 02:24:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:24:31] [INFO ] [Nat]Absence check using 101 positive place invariants in 90 ms returned sat
[2021-05-15 02:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:32] [INFO ] [Nat]Absence check using state equation in 1387 ms returned sat
[2021-05-15 02:24:33] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 261 ms.
[2021-05-15 02:24:33] [INFO ] Added : 1 causal constraints over 1 iterations in 722 ms. Result :sat
[2021-05-15 02:24:34] [INFO ] [Real]Absence check using 101 positive place invariants in 84 ms returned sat
[2021-05-15 02:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:35] [INFO ] [Real]Absence check using state equation in 1346 ms returned sat
[2021-05-15 02:24:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 02:24:36] [INFO ] [Nat]Absence check using 101 positive place invariants in 84 ms returned sat
[2021-05-15 02:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 02:24:37] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2021-05-15 02:24:38] [INFO ] Computed and/alt/rep : 4950/4950/4950 causal constraints (skipped 0 transitions) in 215 ms.
[2021-05-15 02:24:38] [INFO ] Added : 1 causal constraints over 1 iterations in 666 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 50, 50, 1, 50, 1, 1, 1] Max seen :[1, 49, 49, 1, 42, 0, 0, 0]
FORMULA SharedMemory-PT-000050-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 1900 steps, including 94 resets, run finished after 30 ms. (steps per millisecond=63 ) properties (out of 6) seen :32 could not realise parikh vector
FORMULA SharedMemory-PT-000050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1900 steps, including 94 resets, run finished after 81 ms. (steps per millisecond=23 ) properties (out of 3) seen :32 could not realise parikh vector
Incomplete Parikh walk after 1900 steps, including 94 resets, run finished after 37 ms. (steps per millisecond=51 ) properties (out of 3) seen :30 could not realise parikh vector
Incomplete Parikh walk after 4700 steps, including 96 resets, run finished after 59 ms. (steps per millisecond=79 ) properties (out of 3) seen :49 could not realise parikh vector
Incomplete Parikh walk after 5000 steps, including 96 resets, run finished after 123 ms. (steps per millisecond=40 ) properties (out of 3) seen :100 could not realise parikh vector
FORMULA SharedMemory-PT-000050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SharedMemory-PT-000050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5000 steps, including 96 resets, run finished after 64 ms. (steps per millisecond=78 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Drop transitions removed 2450 transitions
Trivial Post-agglo rules discarded 2450 transitions
Performed 2450 trivial Post agglomeration. Transition count delta: 2450
Iterating post reduction 0 with 2450 rules applied. Total rules applied 2450 place count 2651 transition count 2600
Reduce places removed 2501 places and 0 transitions.
Ensure Unique test removed 2400 transitions
Reduce isomorphic transitions removed 2400 transitions.
Graph (trivial) has 100 edges and 150 vertex of which 100 / 150 are part of one of the 50 SCC in 23 ms
Free SCC test removed 50 places
Iterating post reduction 1 with 4902 rules applied. Total rules applied 7352 place count 100 transition count 200
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 7452 place count 100 transition count 100
Applied a total of 7452 rules in 144 ms. Remains 100 /2651 variables (removed 2551) and now considering 100/5050 (removed 4950) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/2651 places, 100/5050 transitions.
// Phase 1: matrix 100 rows 100 cols
[2021-05-15 02:24:39] [INFO ] Computed 50 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6242 ms. (steps per millisecond=160 ) properties (out of 1) seen :42
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 1) seen :50
FORMULA SharedMemory-PT-000050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621045490405

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SharedMemory-PT-000050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SharedMemory-PT-000050, 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 r216-tall-162098204600139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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