Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002800122.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Parking-PT-432, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.6K Apr 30 06:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 06:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 06:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 192K May 10 09:34 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 Parking-PT-432-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655077627622

Running Version 0
[2022-06-12 23:47:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 23:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:47:10] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-06-12 23:47:10] [INFO ] Transformed 529 places.
[2022-06-12 23:47:10] [INFO ] Transformed 785 transitions.
[2022-06-12 23:47:10] [INFO ] Found NUPN structural information;
[2022-06-12 23:47:10] [INFO ] Parsed PT model containing 529 places and 785 transitions in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 91 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 12) seen :4
FORMULA Parking-PT-432-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 457 rows 529 cols
[2022-06-12 23:47:11] [INFO ] Computed 124 place invariants in 37 ms
[2022-06-12 23:47:11] [INFO ] [Real]Absence check using 120 positive place invariants in 45 ms returned sat
[2022-06-12 23:47:11] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-12 23:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:11] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-06-12 23:47:11] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-12 23:47:11] [INFO ] [Real]Added 108 Read/Feed constraints in 36 ms returned sat
[2022-06-12 23:47:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:12] [INFO ] [Nat]Absence check using 120 positive place invariants in 40 ms returned sat
[2022-06-12 23:47:12] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 23:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:12] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2022-06-12 23:47:12] [INFO ] [Nat]Added 108 Read/Feed constraints in 18 ms returned sat
[2022-06-12 23:47:12] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 60 ms.
[2022-06-12 23:47:16] [INFO ] Added : 292 causal constraints over 59 iterations in 3812 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-12 23:47:16] [INFO ] [Real]Absence check using 120 positive place invariants in 106 ms returned sat
[2022-06-12 23:47:16] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 23:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:17] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2022-06-12 23:47:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:18] [INFO ] [Nat]Absence check using 120 positive place invariants in 125 ms returned sat
[2022-06-12 23:47:18] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 23:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:18] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-06-12 23:47:18] [INFO ] [Nat]Added 108 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:47:18] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 58 ms.
[2022-06-12 23:47:21] [INFO ] Added : 245 causal constraints over 49 iterations in 3056 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-12 23:47:22] [INFO ] [Real]Absence check using 120 positive place invariants in 57 ms returned sat
[2022-06-12 23:47:22] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 23:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:22] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-06-12 23:47:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:22] [INFO ] [Nat]Absence check using 120 positive place invariants in 66 ms returned sat
[2022-06-12 23:47:22] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 23:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:22] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2022-06-12 23:47:22] [INFO ] [Nat]Added 108 Read/Feed constraints in 26 ms returned sat
[2022-06-12 23:47:23] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2022-06-12 23:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-12 23:47:23] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 55 ms.
[2022-06-12 23:47:27] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2022-06-12 23:47:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-12 23:47:27] [INFO ] Added : 285 causal constraints over 57 iterations in 4207 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 23:47:27] [INFO ] [Real]Absence check using 120 positive place invariants in 65 ms returned sat
[2022-06-12 23:47:27] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-12 23:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:28] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2022-06-12 23:47:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:28] [INFO ] [Nat]Absence check using 120 positive place invariants in 66 ms returned sat
[2022-06-12 23:47:28] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 23:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:28] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-06-12 23:47:28] [INFO ] [Nat]Added 108 Read/Feed constraints in 27 ms returned sat
[2022-06-12 23:47:28] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2022-06-12 23:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-06-12 23:47:28] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 61 ms.
[2022-06-12 23:47:32] [INFO ] Added : 256 causal constraints over 52 iterations in 3549 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 23:47:32] [INFO ] [Real]Absence check using 120 positive place invariants in 48 ms returned sat
[2022-06-12 23:47:32] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 23:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:32] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-06-12 23:47:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:33] [INFO ] [Real]Absence check using 120 positive place invariants in 64 ms returned sat
[2022-06-12 23:47:33] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 23:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:33] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-06-12 23:47:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:34] [INFO ] [Real]Absence check using 120 positive place invariants in 61 ms returned sat
[2022-06-12 23:47:34] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 5 ms returned unsat
[2022-06-12 23:47:34] [INFO ] [Real]Absence check using 120 positive place invariants in 61 ms returned sat
[2022-06-12 23:47:34] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 23:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:34] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-12 23:47:34] [INFO ] Solution in real domain found non-integer solution.
FORMULA Parking-PT-432-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-432-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-432-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-432-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 32300 steps, including 265 resets, run finished after 452 ms. (steps per millisecond=71 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA Parking-PT-432-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 20603 steps, including 190 resets, run visited all 2 properties in 258 ms. (steps per millisecond=79 )
FORMULA Parking-PT-432-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655077656742

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Parking-PT-432"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is Parking-PT-432, 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 r161-smll-165277002800122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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