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.r500-smll-171649587500110.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 ltsminxred
Input is HirschbergSinclair-PT-35, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 03:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 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 544K 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-35-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717248658252

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:30:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:31:00] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-01 13:31:00] [INFO ] Transformed 998 places.
[2024-06-01 13:31:00] [INFO ] Transformed 922 transitions.
[2024-06-01 13:31:00] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 120 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 2289 ms. (17 steps per ms) remains 6/16 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
// Phase 1: matrix 922 rows 998 cols
[2024-06-01 13:31:01] [INFO ] Computed 76 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-04 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-05 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 737/852 variables, 53/53 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/852 variables, 0/53 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/908 variables, 17/70 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/70 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 61/969 variables, 6/76 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 922/1891 variables, 969/1045 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1891 variables, 0/1045 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/1920 variables, 29/1074 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1920/1920 variables, and 1074 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 671/707 variables, 26/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 66 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/707 variables, 1/27 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/707 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 173/880 variables, 38/65 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/880 variables, 0/65 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/898 variables, 6/71 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/71 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/964 variables, 6/77 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/964 variables, 0/77 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 922/1886 variables, 964/1041 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 15 places in 439 ms of which 9 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 25 places in 550 ms of which 18 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 15 places in 446 ms of which 8 ms to minimize.
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 15 places in 382 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1886 variables, 4/1045 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1886 variables, 0/1045 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/1920 variables, 34/1079 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1920 variables, 1/1080 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1920 variables, 1/1081 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1920 variables, 0/1081 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1920 variables, 0/1081 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1920/1920 variables, and 1081 constraints, problems are : Problem set: 5 solved, 1 unsolved in 4732 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 6507ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 36 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 949 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.8 ms
Discarding 49 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 377 rules applied. Total rules applied 378 place count 949 transition count 545
Reduce places removed 360 places and 0 transitions.
Graph (complete) has 1013 edges and 589 vertex of which 509 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.2 ms
Discarding 80 places :
Also discarding 0 output transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 374 rules applied. Total rules applied 752 place count 509 transition count 532
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 845 place count 496 transition count 452
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 848 place count 493 transition count 449
Iterating global reduction 3 with 3 rules applied. Total rules applied 851 place count 493 transition count 449
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 853 place count 491 transition count 447
Iterating global reduction 3 with 2 rules applied. Total rules applied 855 place count 491 transition count 447
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 884 place count 491 transition count 418
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 913 place count 462 transition count 418
Reduce places removed 31 places and 31 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 944 place count 431 transition count 387
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 43 rules applied. Total rules applied 987 place count 422 transition count 353
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 36 rules applied. Total rules applied 1023 place count 388 transition count 351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1025 place count 386 transition count 351
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 45 Pre rules applied. Total rules applied 1025 place count 386 transition count 306
Deduced a syphon composed of 45 places in 6 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 1115 place count 341 transition count 306
Applied a total of 1115 rules in 383 ms. Remains 341 /998 variables (removed 657) and now considering 306/922 (removed 616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 341/998 places, 306/922 transitions.
RANDOM walk for 40000 steps (128 resets) in 704 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9284 steps (7 resets) in 110 ms. (83 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 9254 ms.
ITS solved all properties within timeout

BK_STOP 1717248669320

--------------------
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 ReachabilityCardinality -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-35"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HirschbergSinclair-PT-35, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587500110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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