Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r498-tall-171640616900018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640616900018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717192569121

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:56:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 21:56:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:56:10] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-31 21:56:10] [INFO ] Transformed 542 places.
[2024-05-31 21:56:10] [INFO ] Transformed 621 transitions.
[2024-05-31 21:56:10] [INFO ] Found NUPN structural information;
[2024-05-31 21:56:10] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 195 ms.
Graph (trivial) has 522 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 5 ms
Free SCC test removed 32 places
Structural test allowed to assert that 164 places are NOT stable. Took 35 ms.
Ensure Unique test removed 33 transitions
Reduce redundant transitions removed 33 transitions.
RANDOM walk for 40000 steps (995 resets) in 2798 ms. (14 steps per ms) remains 210/378 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 210/210 properties
BEST_FIRST walk for 401 steps (8 resets) in 19 ms. (20 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 210/210 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 210/210 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 210/210 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 210/210 properties
[2024-05-31 21:56:11] [INFO ] Flow matrix only has 583 transitions (discarded 5 similar events)
// Phase 1: matrix 583 rows 510 cols
[2024-05-31 21:56:11] [INFO ] Computed 8 invariants in 21 ms
[2024-05-31 21:56:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 300/510 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 300/518 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1093 variables, and 518 constraints, problems are : Problem set: 0 solved, 210 unsolved in 5158 ms.
Refiners :[Domain max(s): 510/510 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/510 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 300/510 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 300/518 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 18 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 189 places in 150 ms of which 4 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 185 places in 126 ms of which 3 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 2 ms to minimize.
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 3 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 3 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 186 places in 139 ms of which 3 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 189 places in 130 ms of which 3 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 174 places in 125 ms of which 3 ms to minimize.
[2024-05-31 21:56:19] [INFO ] Deduced a trap composed of 177 places in 112 ms of which 2 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 2 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 3 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 182 places in 150 ms of which 3 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/538 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 124 places in 61 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 104 places in 65 ms of which 1 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 159 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 155 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 156 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 123 places in 79 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 123 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 121 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 156 places in 79 ms of which 2 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 122 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 10290ms, After SMT, problems are : Problem set: 0 solved, 210 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 210 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 588/588 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 510 transition count 494
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 182 place count 422 transition count 494
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 182 place count 422 transition count 493
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 421 transition count 493
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 238 place count 367 transition count 439
Iterating global reduction 2 with 54 rules applied. Total rules applied 292 place count 367 transition count 439
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 304 place count 355 transition count 427
Iterating global reduction 2 with 12 rules applied. Total rules applied 316 place count 355 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 317 place count 355 transition count 426
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 381 place count 323 transition count 394
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 389 place count 323 transition count 386
Free-agglomeration rule applied 86 times.
Iterating global reduction 4 with 86 rules applied. Total rules applied 475 place count 323 transition count 300
Reduce places removed 86 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 99 rules applied. Total rules applied 574 place count 237 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 575 place count 236 transition count 286
Applied a total of 575 rules in 133 ms. Remains 236 /510 variables (removed 274) and now considering 286/588 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 236/510 places, 286/588 transitions.
RANDOM walk for 39462 steps (0 resets) in 548 ms. (71 steps per ms) remains 0/210 properties
Able to resolve query StableMarking after proving 380 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 12095 ms.
ITS solved all properties within timeout

BK_STOP 1717192582463

--------------------
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 StableMarking -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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="StableMarking"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-06b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r498-tall-171640616900018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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