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.r345-tall-167889216700116.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 smartxred
Input is RERS17pb115-PT-6, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r345-tall-167889216700116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 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 69M 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679131476892

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=smartxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-6
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 09:24:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 09:24:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:24:40] [INFO ] Load time of PNML (sax parser for PT used): 1912 ms
[2023-03-18 09:24:40] [INFO ] Transformed 1399 places.
[2023-03-18 09:24:40] [INFO ] Transformed 144369 transitions.
[2023-03-18 09:24:40] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2417 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 45 ms.467132KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 19 rules in 3836 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3853 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 270299 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 09:25:16] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 09:25:16] [INFO ] Computed 19 place invariants in 474 ms
[2023-03-18 09:25:39] [INFO ] [Real]Absence check using 19 positive place invariants in 109 ms returned sat
[2023-03-18 09:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:25:59] [INFO ] [Real]Absence check using state equation in 19941 ms returned sat
[2023-03-18 09:26:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:26:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 91 ms returned sat
[2023-03-18 09:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:26:44] [INFO ] [Nat]Absence check using state equation in 19256 ms returned sat
[2023-03-18 09:26:45] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:26:52] [INFO ] [Nat]Added 741 Read/Feed constraints in 6352 ms returned sat
[2023-03-18 09:27:00] [INFO ] Deduced a trap composed of 72 places in 7409 ms of which 14 ms to minimize.
[2023-03-18 09:27:09] [INFO ] Deduced a trap composed of 64 places in 7219 ms of which 1 ms to minimize.
[2023-03-18 09:27:17] [INFO ] Deduced a trap composed of 96 places in 7098 ms of which 1 ms to minimize.
[2023-03-18 09:27:26] [INFO ] Deduced a trap composed of 128 places in 7526 ms of which 2 ms to minimize.
[2023-03-18 09:27:34] [INFO ] Deduced a trap composed of 80 places in 7338 ms of which 1 ms to minimize.
[2023-03-18 09:27:43] [INFO ] Deduced a trap composed of 48 places in 7147 ms of which 1 ms to minimize.
[2023-03-18 09:27:52] [INFO ] Deduced a trap composed of 64 places in 7943 ms of which 1 ms to minimize.
[2023-03-18 09:28:02] [INFO ] Deduced a trap composed of 34 places in 9735 ms of which 2 ms to minimize.
[2023-03-18 09:28:11] [INFO ] Deduced a trap composed of 48 places in 7643 ms of which 1 ms to minimize.
[2023-03-18 09:28:20] [INFO ] Deduced a trap composed of 64 places in 7608 ms of which 0 ms to minimize.
[2023-03-18 09:28:29] [INFO ] Deduced a trap composed of 128 places in 7572 ms of which 1 ms to minimize.
[2023-03-18 09:28:37] [INFO ] Deduced a trap composed of 40 places in 7495 ms of which 1 ms to minimize.
[2023-03-18 09:28:46] [INFO ] Deduced a trap composed of 128 places in 6974 ms of which 1 ms to minimize.
[2023-03-18 09:28:54] [INFO ] Deduced a trap composed of 128 places in 7506 ms of which 0 ms to minimize.
[2023-03-18 09:29:03] [INFO ] Deduced a trap composed of 96 places in 6777 ms of which 1 ms to minimize.
[2023-03-18 09:29:11] [INFO ] Deduced a trap composed of 72 places in 6996 ms of which 1 ms to minimize.
[2023-03-18 09:29:19] [INFO ] Deduced a trap composed of 16 places in 7081 ms of which 1 ms to minimize.
[2023-03-18 09:29:28] [INFO ] Deduced a trap composed of 72 places in 7557 ms of which 16 ms to minimize.
[2023-03-18 09:29:37] [INFO ] Deduced a trap composed of 40 places in 7706 ms of which 2 ms to minimize.
[2023-03-18 09:29:46] [INFO ] Deduced a trap composed of 72 places in 7482 ms of which 0 ms to minimize.
[2023-03-18 09:29:55] [INFO ] Deduced a trap composed of 64 places in 7820 ms of which 1 ms to minimize.
[2023-03-18 09:30:04] [INFO ] Deduced a trap composed of 64 places in 7483 ms of which 1 ms to minimize.
[2023-03-18 09:30:12] [INFO ] Deduced a trap composed of 64 places in 6825 ms of which 1 ms to minimize.
[2023-03-18 09:30:20] [INFO ] Deduced a trap composed of 96 places in 7510 ms of which 1 ms to minimize.
[2023-03-18 09:30:29] [INFO ] Deduced a trap composed of 72 places in 7751 ms of which 1 ms to minimize.
[2023-03-18 09:30:38] [INFO ] Deduced a trap composed of 128 places in 7158 ms of which 1 ms to minimize.
[2023-03-18 09:30:46] [INFO ] Deduced a trap composed of 96 places in 6949 ms of which 1 ms to minimize.
[2023-03-18 09:30:54] [INFO ] Deduced a trap composed of 96 places in 6600 ms of which 0 ms to minimize.
[2023-03-18 09:31:02] [INFO ] Deduced a trap composed of 128 places in 6683 ms of which 1 ms to minimize.
[2023-03-18 09:31:02] [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 Deadlocks.
Interrupted Random directed walk after 183338 steps, including 0 resets, run timeout after 30009 ms. (steps per millisecond=6 )
Interrupted Random walk after 334691 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 184143 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=6 )
Interrupted Random walk after 338336 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1200 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 09:33:03] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:33:03] [INFO ] Invariant cache hit.
[2023-03-18 09:33:11] [INFO ] Implicit Places using invariants in 8309 ms returned []
Implicit Place search using SMT only with invariants took 8310 ms to find 0 implicit places.
[2023-03-18 09:33:11] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:33:12] [INFO ] Invariant cache hit.
[2023-03-18 09:33:42] [INFO ] Performed 89490/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 09:34:01] [INFO ] Dead Transitions using invariants and state equation in 49094 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 58615 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 250003 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
[2023-03-18 09:34:31] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:34:31] [INFO ] Invariant cache hit.
[2023-03-18 09:34:54] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-03-18 09:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:35:13] [INFO ] [Real]Absence check using state equation in 19201 ms returned sat
[2023-03-18 09:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:35:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 89 ms returned sat
[2023-03-18 09:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:35:57] [INFO ] [Nat]Absence check using state equation in 19054 ms returned sat
[2023-03-18 09:35:57] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:36:03] [INFO ] [Nat]Added 741 Read/Feed constraints in 5948 ms returned sat
[2023-03-18 09:36:11] [INFO ] Deduced a trap composed of 96 places in 6963 ms of which 0 ms to minimize.
[2023-03-18 09:36:20] [INFO ] Deduced a trap composed of 80 places in 7887 ms of which 2 ms to minimize.
[2023-03-18 09:36:29] [INFO ] Deduced a trap composed of 16 places in 7315 ms of which 1 ms to minimize.
[2023-03-18 09:36:37] [INFO ] Deduced a trap composed of 128 places in 7366 ms of which 1 ms to minimize.
[2023-03-18 09:36:45] [INFO ] Deduced a trap composed of 40 places in 6293 ms of which 0 ms to minimize.
[2023-03-18 09:36:52] [INFO ] Deduced a trap composed of 64 places in 6063 ms of which 4 ms to minimize.
[2023-03-18 09:37:01] [INFO ] Deduced a trap composed of 48 places in 7687 ms of which 1 ms to minimize.
[2023-03-18 09:37:10] [INFO ] Deduced a trap composed of 64 places in 8455 ms of which 1 ms to minimize.
[2023-03-18 09:37:20] [INFO ] Deduced a trap composed of 72 places in 8117 ms of which 1 ms to minimize.
[2023-03-18 09:37:28] [INFO ] Deduced a trap composed of 128 places in 7308 ms of which 1 ms to minimize.
[2023-03-18 09:37:37] [INFO ] Deduced a trap composed of 48 places in 7987 ms of which 7 ms to minimize.
[2023-03-18 09:37:45] [INFO ] Deduced a trap composed of 128 places in 7203 ms of which 1 ms to minimize.
[2023-03-18 09:37:53] [INFO ] Deduced a trap composed of 64 places in 6734 ms of which 1 ms to minimize.
[2023-03-18 09:38:01] [INFO ] Deduced a trap composed of 72 places in 6516 ms of which 0 ms to minimize.
[2023-03-18 09:38:10] [INFO ] Deduced a trap composed of 40 places in 7505 ms of which 1 ms to minimize.
[2023-03-18 09:38:18] [INFO ] Deduced a trap composed of 72 places in 6996 ms of which 1 ms to minimize.
[2023-03-18 09:38:25] [INFO ] Deduced a trap composed of 72 places in 6084 ms of which 1 ms to minimize.
[2023-03-18 09:38:33] [INFO ] Deduced a trap composed of 128 places in 7208 ms of which 0 ms to minimize.
[2023-03-18 09:38:42] [INFO ] Deduced a trap composed of 64 places in 8100 ms of which 1 ms to minimize.
[2023-03-18 09:38:51] [INFO ] Deduced a trap composed of 128 places in 7705 ms of which 0 ms to minimize.
[2023-03-18 09:39:00] [INFO ] Deduced a trap composed of 72 places in 6798 ms of which 1 ms to minimize.
[2023-03-18 09:39:07] [INFO ] Deduced a trap composed of 96 places in 6576 ms of which 1 ms to minimize.
[2023-03-18 09:39:16] [INFO ] Deduced a trap composed of 64 places in 7258 ms of which 1 ms to minimize.
[2023-03-18 09:39:26] [INFO ] Deduced a trap composed of 128 places in 8310 ms of which 1 ms to minimize.
[2023-03-18 09:39:34] [INFO ] Deduced a trap composed of 96 places in 7566 ms of which 0 ms to minimize.
[2023-03-18 09:39:42] [INFO ] Deduced a trap composed of 128 places in 6483 ms of which 19 ms to minimize.
[2023-03-18 09:39:50] [INFO ] Deduced a trap composed of 128 places in 6448 ms of which 1 ms to minimize.
[2023-03-18 09:39:58] [INFO ] Deduced a trap composed of 128 places in 6913 ms of which 2 ms to minimize.
[2023-03-18 09:40:05] [INFO ] Deduced a trap composed of 40 places in 5823 ms of which 0 ms to minimize.
[2023-03-18 09:40:12] [INFO ] Deduced a trap composed of 34 places in 5088 ms of which 0 ms to minimize.
[2023-03-18 09:40:18] [INFO ] Deduced a trap composed of 64 places in 5171 ms of which 0 ms to minimize.
[2023-03-18 09:40:18] [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 Deadlocks.
Interrupted Random directed walk after 184811 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=6 )
Interrupted Random walk after 330700 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 132704 steps, including 0 resets, run timeout after 30008 ms. (steps per millisecond=4 )
Interrupted Random walk after 232625 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
[2023-03-18 09:42:23] [INFO ] Flatten gal took : 4245 ms
[2023-03-18 09:42:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 09:42:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 306 ms.
Total runtime 1065013 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running RERS17pb115 (PT), instance 6
Examination ReachabilityDeadlock
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/DeadlockParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 1399 places, 144369 transitions, 577414 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15219076 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15931092 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="RERS17pb115-PT-6"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is RERS17pb115-PT-6, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r345-tall-167889216700116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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