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.r351-smll-178021502100010.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 ErlangenMainframeV1-PT-bP04C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 200K May 26 18:17 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 ErlangenMainframeV1-PT-bP04C04-UpperBounds-00
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-01
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-02
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-03
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-04
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-05
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-06
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-07
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-08
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-09
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-10
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-11
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-12
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-13
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-14
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780319880736

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:18:03] [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-06-01 13:18:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:18:03] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2026-06-01 13:18:03] [INFO ] Transformed 233 places.
[2026-06-01 13:18:03] [INFO ] Transformed 507 transitions.
[2026-06-01 13:18:03] [INFO ] Found NUPN structural information;
[2026-06-01 13:18:03] [INFO ] Parsed PT model containing 233 places and 507 transitions and 3455 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 507 rows 233 cols
[2026-06-01 13:18:04] [INFO ] Computed 14 invariants in 43 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 191 ms. (52 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (6 resets) in 364 ms. (82 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-06-01 13:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:18:05] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2026-06-01 13:18:05] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 8 ms returned sat
[2026-06-01 13:18:05] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:18:06] [INFO ] Deduced a trap composed of 37 places in 742 ms of which 75 ms to minimize.
[2026-06-01 13:18:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:18:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2026-06-01 13:18:06] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 5 ms returned sat
[2026-06-01 13:18:07] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:18:07] [INFO ] Deduced a trap composed of 37 places in 403 ms of which 33 ms to minimize.
[2026-06-01 13:18:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2026-06-01 13:18:07] [INFO ] Computed and/alt/rep : 239/583/239 causal constraints (skipped 267 transitions) in 158 ms.
[2026-06-01 13:18:10] [INFO ] Added : 214 causal constraints over 43 iterations in 2964 ms. Result :sat
Minimization took 395 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 233 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p39) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 506/506 transitions.
Graph (trivial) has 215 edges and 233 vertex of which 12 / 233 are part of one of the 5 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 225 transition count 394
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 110 rules applied. Total rules applied 210 place count 127 transition count 382
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 213 place count 124 transition count 382
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 213 place count 124 transition count 378
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 221 place count 120 transition count 378
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 246 place count 95 transition count 353
Iterating global reduction 3 with 25 rules applied. Total rules applied 271 place count 95 transition count 353
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 271 place count 95 transition count 348
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 90 transition count 348
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 294 place count 77 transition count 243
Ensure Unique test removed 3 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 310 place count 74 transition count 243
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 317 place count 67 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 324 place count 67 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 327 place count 64 transition count 79
Iterating global reduction 3 with 3 rules applied. Total rules applied 330 place count 64 transition count 79
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 372 place count 43 transition count 58
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 394 place count 32 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 406 place count 32 transition count 66
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 409 place count 29 transition count 57
Iterating global reduction 4 with 3 rules applied. Total rules applied 412 place count 29 transition count 57
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 417 place count 29 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 421 place count 27 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 422 place count 27 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 6 with 25 rules applied. Total rules applied 447 place count 27 transition count 40
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 454 place count 27 transition count 33
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 470 place count 20 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 471 place count 20 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 472 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 473 place count 18 transition count 22
Applied a total of 473 rules in 176 ms. Remains 18 /233 variables (removed 215) and now considering 22/506 (removed 484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 18/233 places, 22/506 transitions.
[2026-06-01 13:18:11] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 18 cols
[2026-06-01 13:18:11] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (61549 resets) in 1468 ms. (680 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP04C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (13744 resets) in 508 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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-06-01 13:18:13] [INFO ] Flatten gal took : 47 ms
[2026-06-01 13:18:13] [INFO ] Flatten gal took : 13 ms
[2026-06-01 13:18:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3999712612360905396.gal : 11 ms
[2026-06-01 13:18:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13290050796120995110.prop : 1 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/ReachabilityCardinality3999712612360905396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13290050796120995110.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 10353 ms.

BK_STOP 1780319893757

--------------------
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="ErlangenMainframeV1-PT-bP04C04"
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 ErlangenMainframeV1-PT-bP04C04, 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 r351-smll-178021502100010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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