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.r047-tajo-171620397700181.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 greatspnxred
Input is BridgeAndVehicles-PT-V20P10N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 14K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 84K Apr 13 01:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 347K Apr 13 01:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 207K Apr 13 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 842K Apr 13 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 434K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716284646645

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:44:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 09:44:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:44:08] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-21 09:44:08] [INFO ] Transformed 68 places.
[2024-05-21 09:44:08] [INFO ] Transformed 548 transitions.
[2024-05-21 09:44:08] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 13
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 20, 0, 10, 0, 1, 20, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 20, 0, 10, 0, 1, 20, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 09:44:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 09:44:08] [INFO ] Computed 7 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 20, 0, 10, 0, 1, 20, 0] Max Struct:[10, 2, 20, 20, 20, 1, 10, 10, 1, 20, 20]
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (56 resets) in 78 ms. (126 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (42 resets) in 51 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[2, 10]
[2024-05-21 09:44:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2024-05-21 09:44:08] [INFO ] Invariant cache hit.
[2024-05-21 09:44:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-05-21 09:44:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 09:44:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 09:44:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:44:08] [INFO ] [Real]Added 22 Read/Feed constraints in 10 ms returned sat
[2024-05-21 09:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:44:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 09:44:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 09:44:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2024-05-21 09:44:08] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 7 ms to minimize.
[2024-05-21 09:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-21 09:44:09] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 32 ms.
[2024-05-21 09:44:09] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-21 09:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-21 09:44:09] [INFO ] Added : 11 causal constraints over 9 iterations in 224 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[1, 10]
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[10]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 68 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2024-05-21 09:44:09] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2024-05-21 09:44:09] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 09:44:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-21 09:44:11] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-21 09:44:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
[2024-05-21 09:44:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 504 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 95 constraints, problems are : Problem set: 42 solved, 502 unsolved in 13051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 597 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 3/3 constraints]
After SMT, in 34231ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 34256ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 44 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34392 ms. Remains : 65/68 places, 505/548 transitions.
[2024-05-21 09:44:43] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-21 09:44:43] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[10]
RANDOM walk for 1000000 steps (6488 resets) in 2555 ms. (391 steps per ms)
BEST_FIRST walk for 1000001 steps (2450 resets) in 899 ms. (1111 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P10N10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 39305 ms.
ITS solved all properties within timeout

BK_STOP 1716284687355

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="BridgeAndVehicles-PT-V20P10N10"
export BK_EXAMINATION="UpperBounds"
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 BridgeAndVehicles-PT-V20P10N10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397700181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;