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

About the Execution of LoLa+red for ASLink-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
257.247 4369.00 9909.00 59.90 T normal

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.r021-oct2-167813608600011.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ASLink-PT-01b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813608600011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 293K Mar 5 18:22 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 1678929938938

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=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 01:25:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-16 01:25:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:25:42] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-16 01:25:42] [INFO ] Transformed 846 places.
[2023-03-16 01:25:42] [INFO ] Transformed 1148 transitions.
[2023-03-16 01:25:42] [INFO ] Found NUPN structural information;
[2023-03-16 01:25:42] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 200 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 6 ms.17918KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 846 transition count 960
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 386 place count 658 transition count 950
Reduce places removed 3 places and 0 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 389 place count 655 transition count 950
Computed a total of 26 stabilizing places and 26 stable transitions
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 389 place count 655 transition count 759
Deduced a syphon composed of 191 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 395 rules applied. Total rules applied 784 place count 451 transition count 759
Computed a total of 26 stabilizing places and 26 stable transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 795 place count 450 transition count 749
Reduce places removed 10 places and 0 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Iterating post reduction 4 with 10 rules applied. Total rules applied 805 place count 440 transition count 749
Computed a total of 26 stabilizing places and 26 stable transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 805 place count 440 transition count 745
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 817 place count 432 transition count 745
Computed a total of 26 stabilizing places and 26 stable transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 817 place count 432 transition count 741
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 825 place count 428 transition count 741
Computed a total of 26 stabilizing places and 26 stable transitions
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 850 place count 403 transition count 716
Iterating global reduction 5 with 25 rules applied. Total rules applied 875 place count 403 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 876 place count 403 transition count 715
Computed a total of 16 stabilizing places and 16 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 876 place count 403 transition count 705
Deduced a syphon composed of 10 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 897 place count 392 transition count 705
Computed a total of 18 stabilizing places and 16 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 897 place count 392 transition count 704
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 900 place count 390 transition count 704
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 902 place count 388 transition count 689
Iterating global reduction 6 with 2 rules applied. Total rules applied 904 place count 388 transition count 689
Computed a total of 18 stabilizing places and 16 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 904 place count 388 transition count 688
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 906 place count 387 transition count 688
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 907 place count 386 transition count 680
Iterating global reduction 6 with 1 rules applied. Total rules applied 908 place count 386 transition count 680
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 909 place count 385 transition count 672
Iterating global reduction 6 with 1 rules applied. Total rules applied 910 place count 385 transition count 672
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 911 place count 384 transition count 664
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 384 transition count 664
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 913 place count 383 transition count 656
Iterating global reduction 6 with 1 rules applied. Total rules applied 914 place count 383 transition count 656
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 915 place count 382 transition count 648
Iterating global reduction 6 with 1 rules applied. Total rules applied 916 place count 382 transition count 648
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 917 place count 381 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 918 place count 381 transition count 640
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 919 place count 380 transition count 632
Iterating global reduction 6 with 1 rules applied. Total rules applied 920 place count 380 transition count 632
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 921 place count 379 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 922 place count 379 transition count 624
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 923 place count 378 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 924 place count 378 transition count 616
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 925 place count 377 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 926 place count 377 transition count 608
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 927 place count 376 transition count 600
Iterating global reduction 6 with 1 rules applied. Total rules applied 928 place count 376 transition count 600
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 929 place count 375 transition count 592
Iterating global reduction 6 with 1 rules applied. Total rules applied 930 place count 375 transition count 592
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 931 place count 374 transition count 584
Iterating global reduction 6 with 1 rules applied. Total rules applied 932 place count 374 transition count 584
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 933 place count 373 transition count 576
Iterating global reduction 6 with 1 rules applied. Total rules applied 934 place count 373 transition count 576
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 935 place count 372 transition count 568
Iterating global reduction 6 with 1 rules applied. Total rules applied 936 place count 372 transition count 568
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 937 place count 371 transition count 560
Iterating global reduction 6 with 1 rules applied. Total rules applied 938 place count 371 transition count 560
Computed a total of 18 stabilizing places and 16 stable transitions
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 1022 place count 329 transition count 518
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1023 place count 328 transition count 517
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1025 place count 327 transition count 517
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1026 place count 326 transition count 516
Iterating global reduction 6 with 1 rules applied. Total rules applied 1027 place count 326 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1029 place count 326 transition count 514
Reduce places removed 1 places and 0 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 1030 place count 325 transition count 514
Computed a total of 3 stabilizing places and 1 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1032 place count 324 transition count 523
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1033 place count 323 transition count 522
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1036 place count 321 transition count 521
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 1037 place count 320 transition count 521
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 1037 place count 320 transition count 518
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 1044 place count 316 transition count 518
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 1046 place count 314 transition count 518
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1046 place count 314 transition count 517
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1048 place count 313 transition count 517
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1054 place count 310 transition count 514
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1055 place count 309 transition count 513
Iterating global reduction 11 with 1 rules applied. Total rules applied 1056 place count 309 transition count 513
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 1056 rules in 610 ms. Remains 309 /846 variables (removed 537) and now considering 513/1148 (removed 635) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 610 ms. Remains : 309/846 places, 513/1148 transitions.
Finished random walk after 7 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=3 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 987 ms.
ITS solved all properties within timeout

BK_STOP 1678929943307

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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="ASLink-PT-01b"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ASLink-PT-01b, 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 r021-oct2-167813608600011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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