Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455800217.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J06T06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455800217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717269905760

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:25:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:25:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:25:08] [INFO ] Load time of PNML (sax parser for PT used): 708 ms
[2024-06-01 19:25:08] [INFO ] Transformed 700 places.
[2024-06-01 19:25:08] [INFO ] Transformed 10740 transitions.
[2024-06-01 19:25:08] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 986 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 700/700 places, 10740/10740 transitions.
Ensure Unique test removed 6 places
Ensure Unique test removed 8070 transitions
Reduce isomorphic transitions removed 8070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 8130 rules applied. Total rules applied 8130 place count 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 8184 place count 640 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 8184 place count 640 transition count 2532
Deduced a syphon composed of 84 places in 11 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 8352 place count 556 transition count 2532
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 14 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 8496 place count 484 transition count 2460
Applied a total of 8496 rules in 358 ms. Remains 484 /700 variables (removed 216) and now considering 2460/10740 (removed 8280) transitions.
Running 2454 sub problems to find dead transitions.
[2024-06-01 19:25:08] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 484 cols
[2024-06-01 19:25:09] [INFO ] Computed 52 invariants in 205 ms
[2024-06-01 19:25:09] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-06-01 19:25:46] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 13 ms to minimize.
[2024-06-01 19:25:47] [INFO ] Deduced a trap composed of 47 places in 413 ms of which 4 ms to minimize.
[2024-06-01 19:25:47] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 3 ms to minimize.
[2024-06-01 19:25:48] [INFO ] Deduced a trap composed of 26 places in 491 ms of which 4 ms to minimize.
[2024-06-01 19:25:48] [INFO ] Deduced a trap composed of 55 places in 589 ms of which 14 ms to minimize.
SMT process timed out in 39776ms, After SMT, problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 39850ms
[2024-06-01 19:25:48] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
[2024-06-01 19:25:48] [INFO ] Invariant cache hit.
[2024-06-01 19:25:49] [INFO ] Implicit Places using invariants in 844 ms returned [45, 126, 323, 367, 465, 469]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 865 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 478/700 places, 2460/10740 transitions.
Applied a total of 0 rules in 16 ms. Remains 478 /478 variables (removed 0) and now considering 2460/2460 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 41197 ms. Remains : 478/700 places, 2460/10740 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (412 resets) in 11592 ms. (3 steps per ms) remains 1099/2454 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 1099/1099 properties
[2024-06-01 19:25:53] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 478 cols
[2024-06-01 19:25:53] [INFO ] Computed 46 invariants in 90 ms
[2024-06-01 19:25:54] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Problem qltransition_33 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 22745ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Fused 1099 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 2460/2460 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 2457
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 2457
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 475 transition count 2454
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 472 transition count 2454
Applied a total of 12 rules in 516 ms. Remains 472 /478 variables (removed 6) and now considering 2454/2460 (removed 6) transitions.
Running 2448 sub problems to find dead transitions.
[2024-06-01 19:26:17] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-06-01 19:26:17] [INFO ] Computed 46 invariants in 35 ms
[2024-06-01 19:26:17] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 19:26:56] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:26:56] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:26:56] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 39 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 19:27:01] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 2 ms to minimize.
[2024-06-01 19:27:01] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 1 ms to minimize.
[2024-06-01 19:27:01] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:27:02] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:27:02] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:27:02] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:27:04] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 2 ms to minimize.
[2024-06-01 19:27:04] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 47 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 19/21 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 61934ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 62008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62534 ms. Remains : 472/478 places, 2454/2460 transitions.
Total runtime 131885 ms.
ITS solved all properties within timeout

BK_STOP 1717270039355

--------------------
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 QuasiLiveness -timeout 180 -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="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBLF-PT-S06J06T06, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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