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.r550-tall-171734899000296.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 itstools
Input is FireWire-PT-16, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000296
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1717368664168

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 22:51:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:05] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 22:51:05] [INFO ] Transformed 254 places.
[2024-06-02 22:51:05] [INFO ] Transformed 368 transitions.
[2024-06-02 22:51:05] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:05] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 184 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 254/254 places, 368/368 transitions.
[2024-06-02 22:51:05] [INFO ] Redundant transitions in 26 ms returned []
Running 367 sub problems to find dead transitions.
// Phase 1: matrix 368 rows 254 cols
[2024-06-02 22:51:05] [INFO ] Computed 5 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 4/254 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-02 22:51:10] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 19 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 121 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 105 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 144 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 122 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 160 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:51:13] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:51:13] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 20/279 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:13] [INFO ] Deduced a trap composed of 120 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:51:13] [INFO ] Deduced a trap composed of 120 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:51:13] [INFO ] Deduced a trap composed of 122 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 119 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 124 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 126 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 116 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:51:15] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:51:15] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:51:16] [INFO ] Deduced a trap composed of 119 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:51:16] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 14/293 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:17] [INFO ] Deduced a trap composed of 102 places in 66 ms of which 4 ms to minimize.
[2024-06-02 22:51:17] [INFO ] Deduced a trap composed of 118 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 2/295 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 122 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:51:22] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 3/298 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:24] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/299 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:26] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/300 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:30] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:51:30] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 2/302 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 122 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 1/303 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:35] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:51:35] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/622 variables, and 305 constraints, problems are : Problem set: 11 solved, 356 unsolved in 30017 ms.
Refiners :[Domain max(s): 254/254 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/254 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 11 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 4/254 variables, 5/255 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 4/259 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 46/305 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 131 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:51:38] [INFO ] Deduced a trap composed of 109 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:51:38] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 3/308 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/308 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 368/622 variables, 254/562 constraints. Problems are: Problem set: 11 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 356/918 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:51:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 1/919 constraints. Problems are: Problem set: 11 solved, 356 unsolved
[2024-06-02 22:52:00] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/622 variables, and 920 constraints, problems are : Problem set: 11 solved, 356 unsolved in 30016 ms.
Refiners :[Domain max(s): 254/254 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 356/367 constraints, Known Traps: 51/51 constraints]
After SMT, in 60201ms problems are : Problem set: 11 solved, 356 unsolved
Search for dead transitions found 11 dead transitions in 60223ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 254/254 places, 357/368 transitions.
[2024-06-02 22:52:05] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60371 ms. Remains : 254/254 places, 357/368 transitions.
Final net has 254 places and 357 transitions.
[2024-06-02 22:52:06] [INFO ] Flatten gal took : 56 ms
[2024-06-02 22:52:06] [INFO ] Applying decomposition
[2024-06-02 22:52:06] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3030450963875138469.txt' '-o' '/tmp/graph3030450963875138469.bin' '-w' '/tmp/graph3030450963875138469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3030450963875138469.bin' '-l' '-1' '-v' '-w' '/tmp/graph3030450963875138469.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:52:06] [INFO ] Decomposing Gal with order
[2024-06-02 22:52:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:52:06] [INFO ] Removed a total of 235 redundant transitions.
[2024-06-02 22:52:06] [INFO ] Flatten gal took : 60 ms
[2024-06-02 22:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2024-06-02 22:52:06] [INFO ] Time to serialize gal into /tmp/StateSpace1645426915166258938.gal : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace1645426915166258938.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.13512e+06,0.214865,12156,934,105,14314,1168,703,26967,110,2964,0
Total reachable state count : 5135118

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 5
STATE_SPACE MAX_TOKEN_PER_MARKING 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 5135118
STATE_SPACE STATES 5135118 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 61320 ms.

BK_STOP 1717368726707

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-16"
export BK_EXAMINATION="StateSpace"
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-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-16, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899000296"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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