Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r201-smll-171649586500095.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HirschbergSinclair-PT-25, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586500095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716595528662

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 00:05:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 00:05:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 00:05:31] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-25 00:05:31] [INFO ] Transformed 600 places.
[2024-05-25 00:05:31] [INFO ] Transformed 545 transitions.
[2024-05-25 00:05:31] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 2905 ms. (13 steps per ms) remains 7/16 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 742 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 829 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1337 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 478 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
// Phase 1: matrix 545 rows 600 cols
[2024-05-25 00:05:34] [INFO ] Computed 55 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem HirschbergSinclair-PT-25-ReachabilityFireability-2024-01 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityFireability-2024-04 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityFireability-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityFireability-2024-13 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 387/545 variables, 47/47 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/554 variables, 3/50 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 0/50 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/581 variables, 5/55 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/55 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 545/1126 variables, 581/636 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1126 variables, 0/636 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 19/1145 variables, 19/655 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 0/655 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1145 variables, 0/655 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 655 constraints, problems are : Problem set: 4 solved, 3 unsolved in 3107 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 431/484 variables, 32/32 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 00:05:38] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 64 ms to minimize.
[2024-05-25 00:05:38] [INFO ] Deduced a trap composed of 206 places in 297 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 2/34 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 57/541 variables, 17/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 00:05:39] [INFO ] Deduced a trap composed of 108 places in 264 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 1/52 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/544 variables, 1/53 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/53 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 33/577 variables, 5/58 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 0/58 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 545/1122 variables, 577/635 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 00:05:40] [INFO ] Deduced a trap composed of 50 places in 277 ms of which 10 ms to minimize.
[2024-05-25 00:05:40] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 7 ms to minimize.
[2024-05-25 00:05:41] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1122 variables, 3/638 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 0/638 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 23/1145 variables, 23/661 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1145 variables, 3/664 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-25 00:05:42] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 6 ms to minimize.
SMT process timed out in 8616ms, After SMT, problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 545/545 transitions.
Graph (complete) has 1148 edges and 600 vertex of which 575 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.7 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 575 transition count 441
Reduce places removed 104 places and 0 transitions.
Graph (complete) has 847 edges and 471 vertex of which 447 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 447 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 234 place count 447 transition count 417
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 250 place count 431 transition count 401
Iterating global reduction 3 with 16 rules applied. Total rules applied 266 place count 431 transition count 401
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 278 place count 419 transition count 389
Iterating global reduction 3 with 12 rules applied. Total rules applied 290 place count 419 transition count 389
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 306 place count 419 transition count 373
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 322 place count 403 transition count 373
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 333 place count 392 transition count 362
Applied a total of 333 rules in 354 ms. Remains 392 /600 variables (removed 208) and now considering 362/545 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 392/600 places, 362/545 transitions.
RANDOM walk for 40000 steps (100 resets) in 1220 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 93 ms. (425 steps per ms) remains 2/3 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (14 resets) in 99 ms. (400 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 27449 steps (9 resets) in 106 ms. (256 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 12669 ms.
ITS solved all properties within timeout

BK_STOP 1716595543772

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

+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="HirschbergSinclair-PT-25"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HirschbergSinclair-PT-25, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649586500095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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