Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079800097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079800097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 460K May 29 14:32 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 EisenbergMcGuire-PT-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748734853172

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:40:54] [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]
[2025-05-31 23:40:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:40:54] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-05-31 23:40:54] [INFO ] Transformed 295 places.
[2025-05-31 23:40:54] [INFO ] Transformed 800 transitions.
[2025-05-31 23:40:54] [INFO ] Found NUPN structural information;
[2025-05-31 23:40:54] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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]
[2025-05-31 23:40:54] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2025-05-31 23:40:54] [INFO ] Computed 16 invariants in 20 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 43 ms. (227 steps per ms)
FORMULA EisenbergMcGuire-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 20 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-31 23:40:54] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2025-05-31 23:40:54] [INFO ] Invariant cache hit.
[2025-05-31 23:40:55] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-05-31 23:40:55] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:55] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-31 23:40:55] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-05-31 23:40:55] [INFO ] [Real]Added 196 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:40:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-31 23:40:55] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2025-05-31 23:40:55] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-05-31 23:40:55] [INFO ] [Nat]Added 196 Read/Feed constraints in 20 ms returned sat
[2025-05-31 23:40:55] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 33 ms to minimize.
[2025-05-31 23:40:55] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 11 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 994 ms
[2025-05-31 23:40:56] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 47 ms.
[2025-05-31 23:40:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:40:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-05-31 23:40:58] [INFO ] Added : 252 causal constraints over 51 iterations in 2236 ms. Result :sat
Minimization took 165 ms.
[2025-05-31 23:40:59] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-05-31 23:40:59] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:59] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-31 23:40:59] [INFO ] [Real]Added 196 Read/Feed constraints in 20 ms returned sat
[2025-05-31 23:40:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-05-31 23:40:59] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:59] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-31 23:40:59] [INFO ] [Nat]Added 196 Read/Feed constraints in 18 ms returned sat
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 905 ms
[2025-05-31 23:41:00] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 34 ms.
[2025-05-31 23:41:02] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2025-05-31 23:41:02] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 474 ms
[2025-05-31 23:41:03] [INFO ] Added : 284 causal constraints over 58 iterations in 2838 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 295 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p25_3_0) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 788/788 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 783
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 783
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 703
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 703
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 190 place count 190 transition count 603
Iterating global reduction 2 with 20 rules applied. Total rules applied 210 place count 190 transition count 603
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 250 place count 170 transition count 583
Applied a total of 250 rules in 113 ms. Remains 170 /295 variables (removed 125) and now considering 583/788 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 170/295 places, 583/788 transitions.
[2025-05-31 23:41:03] [INFO ] Flow matrix only has 259 transitions (discarded 324 similar events)
// Phase 1: matrix 259 rows 170 cols
[2025-05-31 23:41:03] [INFO ] Computed 16 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1229 ms. (813 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after 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 )
[2025-05-31 23:41:05] [INFO ] Flatten gal took : 72 ms
[2025-05-31 23:41:05] [INFO ] Flatten gal took : 35 ms
[2025-05-31 23:41:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1661032450320436102.gal : 18 ms
[2025-05-31 23:41:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16002900410625226332.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1661032450320436102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16002900410625226332.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 11092 ms.

BK_STOP 1748734865657

--------------------
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
+ 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 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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-05, 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 r083-tall-174860079800097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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