About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S32C05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1984.296 | 72704.00 | 107682.00 | 231.70 | TTFTTTTTTTTFTFTT | 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.r245-tall-171654349300174.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S32C05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349300174
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 22M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716625632106
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 08:27:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 08:27:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:27:14] [INFO ] Load time of PNML (sax parser for PT used): 807 ms
[2024-05-25 08:27:14] [INFO ] Transformed 20498 places.
[2024-05-25 08:27:14] [INFO ] Transformed 31713 transitions.
[2024-05-25 08:27:14] [INFO ] Parsed PT model containing 20498 places and 31713 transitions and 126502 arcs in 1039 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (774 resets) in 3997 ms. (10 steps per ms) remains 14/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (112 resets) in 644 ms. (62 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (112 resets) in 378 ms. (105 steps per ms) remains 13/14 properties
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (112 resets) in 1045 ms. (38 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 391 ms. (102 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 342 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 472 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 375 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 290 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 301 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (112 resets) in 325 ms. (122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (112 resets) in 436 ms. (91 steps per ms) remains 13/13 properties
[2024-05-25 08:27:17] [INFO ] Flow matrix only has 30657 transitions (discarded 1056 similar events)
// Phase 1: matrix 30657 rows 20498 cols
[2024-05-25 08:27:20] [INFO ] Computed 1543 invariants in 2950 ms
[2024-05-25 08:27:20] [INFO ] State equation strengthened by 10210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5458/5736 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5736 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5736 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 69/5805 variables, 67/75 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5805 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 10136/15941 variables, 677/752 constraints. Problems are: Problem set: 11 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15941/51155 variables, and 752 constraints, problems are : Problem set: 11 solved, 2 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 74/80 constraints, Generalized P Invariants (flows): 678/1463 constraints, State Equation: 0/20498 constraints, ReadFeed: 0/10210 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5495/5525 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5525 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9078/14603 variables, 553/554 constraints. Problems are: Problem set: 11 solved, 2 unsolved
[2024-05-25 08:28:06] [INFO ] Deduced a trap composed of 98 places in 36714 ms of which 662 ms to minimize.
SMT process timed out in 48353ms, After SMT, problems are : Problem set: 11 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 20498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20498/20498 places, 31713/31713 transitions.
Graph (complete) has 72683 edges and 20498 vertex of which 20452 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.54 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5249 transitions
Trivial Post-agglo rules discarded 5249 transitions
Performed 5249 trivial Post agglomeration. Transition count delta: 5249
Iterating post reduction 0 with 5249 rules applied. Total rules applied 5250 place count 20452 transition count 26464
Reduce places removed 5249 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 5268 rules applied. Total rules applied 10518 place count 15203 transition count 26445
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 10537 place count 15184 transition count 26445
Performed 329 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 329 Pre rules applied. Total rules applied 10537 place count 15184 transition count 26116
Deduced a syphon composed of 329 places in 27 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 3 with 658 rules applied. Total rules applied 11195 place count 14855 transition count 26116
Discarding 4935 places :
Symmetric choice reduction at 3 with 4935 rule applications. Total rules 16130 place count 9920 transition count 21181
Iterating global reduction 3 with 4935 rules applied. Total rules applied 21065 place count 9920 transition count 21181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21065 place count 9920 transition count 21179
Deduced a syphon composed of 2 places in 23 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21069 place count 9918 transition count 21179
Discarding 975 places :
Symmetric choice reduction at 3 with 975 rule applications. Total rules 22044 place count 8943 transition count 16304
Iterating global reduction 3 with 975 rules applied. Total rules applied 23019 place count 8943 transition count 16304
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 15 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23085 place count 8910 transition count 16271
Free-agglomeration rule (complex) applied 586 times.
Iterating global reduction 3 with 586 rules applied. Total rules applied 23671 place count 8910 transition count 19405
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 3 with 586 rules applied. Total rules applied 24257 place count 8324 transition count 19405
Partial Free-agglomeration rule applied 263 times.
Drop transitions (Partial Free agglomeration) removed 263 transitions
Iterating global reduction 4 with 263 rules applied. Total rules applied 24520 place count 8324 transition count 19405
Applied a total of 24520 rules in 17113 ms. Remains 8324 /20498 variables (removed 12174) and now considering 19405/31713 (removed 12308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17127 ms. Remains : 8324/20498 places, 19405/31713 transitions.
RANDOM walk for 40000 steps (1269 resets) in 3173 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (116 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (116 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1464 steps, run visited all 2 properties in 339 ms. (steps per millisecond=4 )
Probabilistic random walk after 1464 steps, saw 816 distinct states, run finished after 343 ms. (steps per millisecond=4 ) properties seen :2
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C05-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 71465 ms.
ITS solved all properties within timeout
BK_STOP 1716625704810
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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="MultiCrashLeafsetExtension-PT-S32C05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C05, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349300174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C05.tgz
mv MultiCrashLeafsetExtension-PT-S32C05 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;