About the Execution of ITS-Tools for Champagne-PT-H04T2O
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 7048.00 | 0.00 | 0.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339100021.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 itstools
Input is Champagne-PT-H04T2O, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339100021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 13K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 71K Jun 5 20:08 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 Champagne-PT-H04T2O-UpperBounds-00
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-01
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-02
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-03
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-04
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-05
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-06
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-07
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-08
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-09
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-10
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-11
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-12
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-13
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-14
FORMULA_NAME Champagne-PT-H04T2O-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749318072927
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H04T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-07 17:41:14] [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-06-07 17:41:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:41:14] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-07 17:41:14] [INFO ] Transformed 417 places.
[2025-06-07 17:41:14] [INFO ] Transformed 494 transitions.
[2025-06-07 17:41:14] [INFO ] Found NUPN structural information;
[2025-06-07 17:41:14] [INFO ] Parsed PT model containing 417 places and 494 transitions and 1106 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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 494 rows 417 cols
[2025-06-07 17:41:14] [INFO ] Computed 11 invariants in 21 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 (31 resets) in 56 ms. (175 steps per ms)
FORMULA Champagne-PT-H04T2O-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H04T2O-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (10 resets) in 19 ms. (1000 steps per ms)
FORMULA Champagne-PT-H04T2O-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-07 17:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:41:14] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2025-06-07 17:41:14] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:15] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 7 ms to minimize.
[2025-06-07 17:41:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 17:41:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-06-07 17:41:15] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:15] [INFO ] Deduced a trap composed of 103 places in 64 ms of which 3 ms to minimize.
[2025-06-07 17:41:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-07 17:41:15] [INFO ] Computed and/alt/rep : 492/985/492 causal constraints (skipped 1 transitions) in 52 ms.
[2025-06-07 17:41:19] [INFO ] Added : 492 causal constraints over 99 iterations in 3678 ms. Result :sat
Minimization took 200 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:[1] Max Struct:[1]
Support contains 1 out of 417 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p348) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 493/493 transitions.
Graph (trivial) has 437 edges and 417 vertex of which 233 / 417 are part of one of the 11 SCC in 3 ms
Free SCC test removed 222 places
Drop transitions (Empty/Sink Transition effects.) removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 195 transition count 143
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 112 rules applied. Total rules applied 207 place count 101 transition count 125
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 216 place count 92 transition count 125
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 249 place count 59 transition count 92
Iterating global reduction 3 with 33 rules applied. Total rules applied 282 place count 59 transition count 92
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 282 place count 59 transition count 81
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 304 place count 48 transition count 81
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 310 place count 42 transition count 61
Iterating global reduction 3 with 6 rules applied. Total rules applied 316 place count 42 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 322 place count 42 transition count 55
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 340 place count 33 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 344 place count 31 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 348 place count 31 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 354 place count 31 transition count 47
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 368 place count 31 transition count 33
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 401 place count 17 transition count 14
Ensure Unique test removed 6 places
Iterating post reduction 6 with 6 rules applied. Total rules applied 407 place count 11 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 409 place count 11 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 410 place count 10 transition count 11
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 417 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 417 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 419 place count 6 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 424 place count 3 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 426 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 426 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 428 place count 2 transition count 1
Applied a total of 428 rules in 55 ms. Remains 2 /417 variables (removed 415) and now considering 1/493 (removed 492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 2/417 places, 1/493 transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-07 17:41:19] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA Champagne-PT-H04T2O-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 238 ms. (4184 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 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 )
[2025-06-07 17:41:19] [INFO ] Flatten gal took : 106 ms
[2025-06-07 17:41:19] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5922034461322385577.gal : 2 ms
[2025-06-07 17:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4106409890553601610.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/ReachabilityCardinality5922034461322385577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4106409890553601610.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 5834 ms.
BK_STOP 1749318079975
--------------------
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="Champagne-PT-H04T2O"
export BK_EXAMINATION="UpperBounds"
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-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H04T2O, 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 r254-tall-174931339100021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H04T2O.tgz
mv Champagne-PT-H04T2O 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 '
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 ;