Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r175-smll-177961111800068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is LeafsetExtension-PT-S64C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-177961111800068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 15 11:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 11:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14M Mar 3 18:30 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S64C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779753735349

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-26 00:02:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 00:02:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:02:19] [INFO ] Load time of PNML (sax parser for PT used): 1071 ms
[2026-05-26 00:02:19] [INFO ] Transformed 21462 places.
[2026-05-26 00:02:19] [INFO ] Transformed 21129 transitions.
[2026-05-26 00:02:19] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1454 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 21129 rows 21462 cols
[2026-05-26 00:02:23] [INFO ] Computed 333 invariants in 3806 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (299 resets) in 294 ms. (33 steps per ms)
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130013 steps (120 resets) in 379 ms. (342 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1]
[2026-05-26 00:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1]
Support contains 13 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 957 are kept as prefixes of interest. Removing 20505 places using SCC suffix rule.42 ms
Discarding 20505 places :
Also discarding 11924 output transitions
Drop transitions (Output transitions of discarded places.) removed 11924 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4237 transitions
Reduce isomorphic transitions removed 4237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 4552 rules applied. Total rules applied 4553 place count 957 transition count 4653
Reduce places removed 317 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 327 rules applied. Total rules applied 4880 place count 640 transition count 4643
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 4890 place count 630 transition count 4643
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 4890 place count 630 transition count 4628
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 4920 place count 615 transition count 4628
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 4951 place count 584 transition count 4597
Iterating global reduction 3 with 31 rules applied. Total rules applied 4982 place count 584 transition count 4597
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4988 place count 584 transition count 4591
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 4994 place count 578 transition count 4591
Partial Free-agglomeration rule applied 310 times.
Drop transitions (Partial Free agglomeration) removed 310 transitions
Iterating global reduction 4 with 310 rules applied. Total rules applied 5304 place count 578 transition count 4591
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 5314 place count 568 transition count 4591
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 5319 place count 568 transition count 4586
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 5324 place count 563 transition count 4586
Applied a total of 5324 rules in 1414 ms. Remains 563 /21462 variables (removed 20899) and now considering 4586/21129 (removed 16543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1429 ms. Remains : 563/21462 places, 4586/21129 transitions.
[2026-05-26 00:03:23] [INFO ] Flow matrix only has 845 transitions (discarded 3741 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
[2026-05-26 00:03:23] [INFO ] Flow matrix only has 845 transitions (discarded 3741 similar events)
// Phase 1: matrix 845 rows 563 cols
[2026-05-26 00:03:23] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1, 1, 1, +inf, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (103327 resets) in 11244 ms. (88 steps per ms)
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (5161 resets) in 3238 ms. (617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4] Max Struct:[+inf, +inf]
[2026-05-26 00:03:38] [INFO ] Flow matrix only has 845 transitions (discarded 3741 similar events)
[2026-05-26 00:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 00:03:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 12 ms returned sat
[2026-05-26 00:03:38] [INFO ] [Real]Absence check using state equation in 412 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 00:03:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-26 00:03:39] [INFO ] [Real]Absence check using state equation in 373 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4] Max Struct:[1, 4]
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-26 00:03:40] [INFO ] Flatten gal took : 488 ms
[2026-05-26 00:03:40] [INFO ] Flatten gal took : 189 ms
[2026-05-26 00:03:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality329249070378728247.gal : 94 ms
[2026-05-26 00:03:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality867707651183419507.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality329249070378728247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality867707651183419507.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 82553 ms.

BK_STOP 1779753820480

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is LeafsetExtension-PT-S64C4, 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 r175-smll-177961111800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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