fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r343-tall-167889215100121
Last Updated
May 14, 2023

About the Execution of LTSMin+red for RERS17pb115-PT-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8101.899 1800000.00 1885902.00 4503.00 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r343-tall-167889215100121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RERS17pb115-PT-7, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215100121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M Mar 5 18:23 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679131239388

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:20:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 09:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:20:42] [INFO ] Load time of PNML (sax parser for PT used): 1876 ms
[2023-03-18 09:20:43] [INFO ] Transformed 1399 places.
[2023-03-18 09:20:43] [INFO ] Transformed 144369 transitions.
[2023-03-18 09:20:43] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2382 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 46 ms.505762KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 19 rules in 5303 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 5326 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 310689 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 09:21:19] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 09:21:20] [INFO ] Computed 19 place invariants in 394 ms
[2023-03-18 09:21:44] [INFO ] [Real]Absence check using 19 positive place invariants in 88 ms returned sat
[2023-03-18 09:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:22:04] [INFO ] [Real]Absence check using state equation in 20000 ms returned sat
[2023-03-18 09:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:22:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 80 ms returned sat
[2023-03-18 09:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:22:50] [INFO ] [Nat]Absence check using state equation in 19603 ms returned sat
[2023-03-18 09:22:51] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:22:58] [INFO ] [Nat]Added 741 Read/Feed constraints in 6949 ms returned sat
[2023-03-18 09:23:07] [INFO ] Deduced a trap composed of 16 places in 7410 ms of which 10 ms to minimize.
[2023-03-18 09:23:15] [INFO ] Deduced a trap composed of 64 places in 7312 ms of which 1 ms to minimize.
[2023-03-18 09:23:25] [INFO ] Deduced a trap composed of 40 places in 8176 ms of which 2 ms to minimize.
[2023-03-18 09:23:35] [INFO ] Deduced a trap composed of 72 places in 8826 ms of which 4 ms to minimize.
[2023-03-18 09:23:43] [INFO ] Deduced a trap composed of 64 places in 7180 ms of which 2 ms to minimize.
[2023-03-18 09:23:51] [INFO ] Deduced a trap composed of 72 places in 7428 ms of which 1 ms to minimize.
[2023-03-18 09:24:01] [INFO ] Deduced a trap composed of 48 places in 8650 ms of which 1 ms to minimize.
[2023-03-18 09:24:10] [INFO ] Deduced a trap composed of 128 places in 7536 ms of which 2 ms to minimize.
[2023-03-18 09:24:19] [INFO ] Deduced a trap composed of 96 places in 7346 ms of which 1 ms to minimize.
[2023-03-18 09:24:28] [INFO ] Deduced a trap composed of 72 places in 7974 ms of which 1 ms to minimize.
[2023-03-18 09:24:38] [INFO ] Deduced a trap composed of 72 places in 8766 ms of which 3 ms to minimize.
[2023-03-18 09:24:47] [INFO ] Deduced a trap composed of 64 places in 7571 ms of which 1 ms to minimize.
[2023-03-18 09:24:54] [INFO ] Deduced a trap composed of 48 places in 6170 ms of which 0 ms to minimize.
[2023-03-18 09:25:03] [INFO ] Deduced a trap composed of 40 places in 7590 ms of which 1 ms to minimize.
[2023-03-18 09:25:12] [INFO ] Deduced a trap composed of 96 places in 7899 ms of which 0 ms to minimize.
[2023-03-18 09:25:20] [INFO ] Deduced a trap composed of 72 places in 6975 ms of which 1 ms to minimize.
[2023-03-18 09:25:29] [INFO ] Deduced a trap composed of 34 places in 7279 ms of which 1 ms to minimize.
[2023-03-18 09:25:38] [INFO ] Deduced a trap composed of 128 places in 7528 ms of which 1 ms to minimize.
[2023-03-18 09:25:46] [INFO ] Deduced a trap composed of 128 places in 6927 ms of which 0 ms to minimize.
[2023-03-18 09:25:54] [INFO ] Deduced a trap composed of 72 places in 7159 ms of which 0 ms to minimize.
[2023-03-18 09:26:02] [INFO ] Deduced a trap composed of 128 places in 6904 ms of which 2 ms to minimize.
[2023-03-18 09:26:10] [INFO ] Deduced a trap composed of 64 places in 6395 ms of which 1 ms to minimize.
[2023-03-18 09:26:19] [INFO ] Deduced a trap composed of 128 places in 7458 ms of which 1 ms to minimize.
[2023-03-18 09:26:28] [INFO ] Deduced a trap composed of 40 places in 7751 ms of which 1 ms to minimize.
[2023-03-18 09:26:37] [INFO ] Deduced a trap composed of 96 places in 7765 ms of which 2 ms to minimize.
[2023-03-18 09:26:44] [INFO ] Deduced a trap composed of 96 places in 6527 ms of which 1 ms to minimize.
[2023-03-18 09:26:52] [INFO ] Deduced a trap composed of 64 places in 6697 ms of which 0 ms to minimize.
[2023-03-18 09:26:59] [INFO ] Deduced a trap composed of 128 places in 6007 ms of which 1 ms to minimize.
[2023-03-18 09:27:07] [INFO ] Deduced a trap composed of 128 places in 5835 ms of which 0 ms to minimize.
[2023-03-18 09:27:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 189228 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 331168 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 190638 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 337077 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1800 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 09:29:09] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:29:09] [INFO ] Invariant cache hit.
[2023-03-18 09:29:17] [INFO ] Implicit Places using invariants in 8518 ms returned []
Implicit Place search using SMT only with invariants took 8521 ms to find 0 implicit places.
[2023-03-18 09:29:17] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:29:17] [INFO ] Invariant cache hit.
[2023-03-18 09:29:47] [INFO ] Performed 91148/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 09:30:04] [INFO ] Dead Transitions using invariants and state equation in 47081 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 57404 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 345601 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:30:34] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:30:34] [INFO ] Invariant cache hit.
[2023-03-18 09:30:58] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2023-03-18 09:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:31:17] [INFO ] [Real]Absence check using state equation in 19263 ms returned sat
[2023-03-18 09:31:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:31:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 42 ms returned sat
[2023-03-18 09:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:32:01] [INFO ] [Nat]Absence check using state equation in 19896 ms returned sat
[2023-03-18 09:32:02] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:32:08] [INFO ] [Nat]Added 741 Read/Feed constraints in 5835 ms returned sat
[2023-03-18 09:32:16] [INFO ] Deduced a trap composed of 48 places in 7742 ms of which 2 ms to minimize.
[2023-03-18 09:32:25] [INFO ] Deduced a trap composed of 72 places in 7203 ms of which 1 ms to minimize.
[2023-03-18 09:32:33] [INFO ] Deduced a trap composed of 40 places in 6800 ms of which 1 ms to minimize.
[2023-03-18 09:32:40] [INFO ] Deduced a trap composed of 128 places in 6586 ms of which 1 ms to minimize.
[2023-03-18 09:32:48] [INFO ] Deduced a trap composed of 96 places in 6472 ms of which 1 ms to minimize.
[2023-03-18 09:32:56] [INFO ] Deduced a trap composed of 48 places in 6544 ms of which 2 ms to minimize.
[2023-03-18 09:33:04] [INFO ] Deduced a trap composed of 34 places in 7392 ms of which 2 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 64 places in 7119 ms of which 1 ms to minimize.
[2023-03-18 09:33:20] [INFO ] Deduced a trap composed of 40 places in 7066 ms of which 1 ms to minimize.
[2023-03-18 09:33:29] [INFO ] Deduced a trap composed of 96 places in 6966 ms of which 1 ms to minimize.
[2023-03-18 09:33:37] [INFO ] Deduced a trap composed of 40 places in 7053 ms of which 3 ms to minimize.
[2023-03-18 09:33:44] [INFO ] Deduced a trap composed of 72 places in 6089 ms of which 1 ms to minimize.
[2023-03-18 09:33:51] [INFO ] Deduced a trap composed of 64 places in 6069 ms of which 1 ms to minimize.
[2023-03-18 09:33:58] [INFO ] Deduced a trap composed of 16 places in 5796 ms of which 1 ms to minimize.
[2023-03-18 09:34:05] [INFO ] Deduced a trap composed of 72 places in 5603 ms of which 1 ms to minimize.
[2023-03-18 09:34:12] [INFO ] Deduced a trap composed of 64 places in 6149 ms of which 1 ms to minimize.
[2023-03-18 09:34:19] [INFO ] Deduced a trap composed of 72 places in 5878 ms of which 1 ms to minimize.
[2023-03-18 09:34:27] [INFO ] Deduced a trap composed of 72 places in 6344 ms of which 0 ms to minimize.
[2023-03-18 09:34:35] [INFO ] Deduced a trap composed of 96 places in 6933 ms of which 0 ms to minimize.
[2023-03-18 09:34:45] [INFO ] Deduced a trap composed of 64 places in 9012 ms of which 1 ms to minimize.
[2023-03-18 09:34:53] [INFO ] Deduced a trap composed of 72 places in 7234 ms of which 1 ms to minimize.
[2023-03-18 09:35:01] [INFO ] Deduced a trap composed of 128 places in 6828 ms of which 3 ms to minimize.
[2023-03-18 09:35:10] [INFO ] Deduced a trap composed of 128 places in 7263 ms of which 1 ms to minimize.
[2023-03-18 09:35:17] [INFO ] Deduced a trap composed of 96 places in 6583 ms of which 1 ms to minimize.
[2023-03-18 09:35:26] [INFO ] Deduced a trap composed of 96 places in 7372 ms of which 1 ms to minimize.
[2023-03-18 09:35:34] [INFO ] Deduced a trap composed of 64 places in 6282 ms of which 0 ms to minimize.
[2023-03-18 09:35:41] [INFO ] Deduced a trap composed of 128 places in 6584 ms of which 7 ms to minimize.
[2023-03-18 09:35:48] [INFO ] Deduced a trap composed of 64 places in 5880 ms of which 0 ms to minimize.
[2023-03-18 09:35:56] [INFO ] Deduced a trap composed of 128 places in 6781 ms of which 10 ms to minimize.
[2023-03-18 09:36:03] [INFO ] Deduced a trap composed of 128 places in 5806 ms of which 0 ms to minimize.
[2023-03-18 09:36:09] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 241041 ms
[2023-03-18 09:36:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 81236 transitions) in 14108 ms.
[2023-03-18 09:36:23] [INFO ] Added : 0 causal constraints over 0 iterations in 14118 ms. Result :unknown
Interrupted Random directed walk after 190830 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 332979 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 193877 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=6 )
Interrupted Random walk after 334464 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 09:38:27] [INFO ] Flatten gal took : 3917 ms
[2023-03-18 09:38:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 09:38:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 289 ms.
Total runtime 1067223 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14999756 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15983952 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2023

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="RERS17pb115-PT-7"
export BK_EXAMINATION="ReachabilityDeadlock"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb115-PT-7, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r343-tall-167889215100121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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