fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339500224
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CopsAndRobbers-PT-HRL020X006

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 291902.00 0.00 0.00 3.9089E+0008 ? 6 33 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339500224.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CopsAndRobbers-PT-HRL020X006, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339500224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 9.5K Jun 6 08:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 08:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Jun 6 11:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 17K Jun 6 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 6 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 08:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 6 08:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 195K Jun 5 20:08 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1749344529767

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL020X006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-06-08 01:02:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 01:02:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 01:02:11] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-08 01:02:11] [INFO ] Transformed 110 places.
[2025-06-08 01:02:11] [INFO ] Transformed 224 transitions.
[2025-06-08 01:02:11] [INFO ] Parsed PT model containing 110 places and 224 transitions and 1149 arcs in 158 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 110/110 places, 224/224 transitions.
Running 184 sub problems to find dead transitions.
// Phase 1: matrix 224 rows 110 cols
[2025-06-08 01:02:11] [INFO ] Computed 24 invariants in 16 ms
[2025-06-08 01:02:11] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 19/19 constraints. Problems are: Problem set: 39 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/19 constraints. Problems are: Problem set: 39 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 22/110 variables, 4/23 constraints. Problems are: Problem set: 39 solved, 145 unsolved
Problem TDEAD118 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/24 constraints. Problems are: Problem set: 40 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:13] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:13] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:13] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/27 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/27 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 224/334 variables, 110/137 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 60/197 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 197 constraints, problems are : Problem set: 40 solved, 144 unsolved in 7741 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 144 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 19/19 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/19 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 22/110 variables, 4/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/24 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/27 constraints. Problems are: Problem set: 40 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:19] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:19] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:19] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:20] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:21] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:21] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 20/47 constraints. Problems are: Problem set: 40 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:02:21] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/48 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 224/334 variables, 110/158 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 60/218 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 144/362 constraints. Problems are: Problem set: 40 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/334 variables, and 362 constraints, problems are : Problem set: 40 solved, 144 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 144/184 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28007ms problems are : Problem set: 40 solved, 144 unsolved
Search for dead transitions found 40 dead transitions in 28024ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 40 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 01:02:39] [INFO ] Redundant transitions in 6 ms returned []
Starting structural reductions in STATESPACE mode, iteration 1 : 110/110 places, 184/224 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 28089 ms. Remains : 110/110 places, 184/224 transitions.
Final net has 110 places and 184 transitions.
[2025-06-08 01:02:39] [INFO ] Flatten gal took : 59 ms
[2025-06-08 01:02:39] [INFO ] Applying decomposition
[2025-06-08 01:02:39] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10155213759700469840.txt' '-o' '/tmp/graph10155213759700469840.bin' '-w' '/tmp/graph10155213759700469840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10155213759700469840.bin' '-l' '-1' '-v' '-w' '/tmp/graph10155213759700469840.weights' '-q' '0' '-e' '0.001'
[2025-06-08 01:02:39] [INFO ] Decomposing Gal with order
[2025-06-08 01:02:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 01:02:39] [INFO ] Removed a total of 236 redundant transitions.
[2025-06-08 01:02:39] [INFO ] Flatten gal took : 105 ms
[2025-06-08 01:02:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 22 ms.
[2025-06-08 01:02:39] [INFO ] Time to serialize gal into /tmp/StateSpace16556465161343888580.gal : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace16556465161343888580.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.90887e+08,261.42,2213820,3754,662,1.63391e+06,616836,359,1.40283e+07,39,3.5893e+06,0
Total reachable state count : 390887090

Max variable value : 6
STATE_SPACE MAX_TOKEN_IN_PLACE 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 33
STATE_SPACE MAX_TOKEN_PER_MARKING 33 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 390887090
STATE_SPACE STATES 390887090 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 290662 ms.

BK_STOP 1749344821669

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CopsAndRobbers-PT-HRL020X006"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-HRL020X006, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339500224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL020X006.tgz
mv CopsAndRobbers-PT-HRL020X006 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;