fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r223-tall-171649611300357
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for LeafsetExtension-PT-S16C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
505.252 13618.00 22104.00 103.30 1 1 1 1 1 1 1 1 4 1 1 1 4 1 1 1 normal

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.r223-tall-171649611300357.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 greatspnxred
Input is LeafsetExtension-PT-S16C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611300357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 12 13:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 905K 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 LeafsetExtension-PT-S16C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S16C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716542794142

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 09:26:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 09:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:26:35] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-24 09:26:35] [INFO ] Transformed 1542 places.
[2024-05-24 09:26:35] [INFO ] Transformed 1449 transitions.
[2024-05-24 09:26:35] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1449 rows 1542 cols
[2024-05-24 09:26:35] [INFO ] Computed 93 invariants in 121 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, 1, +inf, +inf, 1, 1, +inf, +inf, 1, +inf, 1]
RANDOM walk for 10000 steps (298 resets) in 83 ms. (119 steps per ms)
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (230 resets) in 114 ms. (695 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 3, 1, 2, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 09:26:36] [INFO ] Invariant cache hit.
[2024-05-24 09:26:36] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2024-05-24 09:26:36] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 25 ms returned unsat
[2024-05-24 09:26:36] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2024-05-24 09:26:36] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 37 ms returned unsat
[2024-05-24 09:26:36] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-24 09:26:36] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 25 ms returned unsat
[2024-05-24 09:26:37] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 09:26:37] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned unsat
[2024-05-24 09:26:37] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 09:26:37] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 39 ms returned sat
[2024-05-24 09:26:37] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-05-24 09:26:38] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 94 ms.
[2024-05-24 09:26:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:26:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 24 ms returned sat
[2024-05-24 09:26:38] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 36 ms returned sat
[2024-05-24 09:26:39] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2024-05-24 09:26:39] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 83 ms.
[2024-05-24 09:26:39] [INFO ] Added : 24 causal constraints over 5 iterations in 607 ms. Result :sat
Minimization took 799 ms.
[2024-05-24 09:26:40] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-24 09:26:40] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 37 ms returned unsat
[2024-05-24 09:26:41] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 09:26:41] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 40 ms returned sat
[2024-05-24 09:26:41] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2024-05-24 09:26:41] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 88 ms.
[2024-05-24 09:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:26:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-24 09:26:42] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 36 ms returned sat
[2024-05-24 09:26:42] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2024-05-24 09:26:43] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 91 ms.
[2024-05-24 09:26:43] [INFO ] Added : 18 causal constraints over 4 iterations in 544 ms. Result :sat
Minimization took 765 ms.
[2024-05-24 09:26:44] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-24 09:26:44] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 45 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 3, 1, 2, 1] Max Struct:[1, 1, 1, 1, +inf, 1, +inf, 1]
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 98 are kept as prefixes of interest. Removing 1444 places using SCC suffix rule.4 ms
Discarding 1444 places :
Also discarding 842 output transitions
Drop transitions (Output transitions of discarded places.) removed 842 transitions
Drop transitions (Empty/Sink Transition effects.) removed 291 transitions
Reduce isomorphic transitions removed 291 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 323 rules applied. Total rules applied 324 place count 82 transition count 300
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 35 rules applied. Total rules applied 359 place count 63 transition count 284
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 367 place count 55 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 367 place count 55 transition count 282
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 371 place count 53 transition count 282
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 385 place count 39 transition count 268
Iterating global reduction 3 with 14 rules applied. Total rules applied 399 place count 39 transition count 268
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 415 place count 39 transition count 252
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 431 place count 23 transition count 252
Applied a total of 431 rules in 72 ms. Remains 23 /1542 variables (removed 1519) and now considering 252/1449 (removed 1197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 23/1542 places, 252/1449 transitions.
[2024-05-24 09:26:44] [INFO ] Flow matrix only has 36 transitions (discarded 216 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-24 09:26:44] [INFO ] Flow matrix only has 36 transitions (discarded 216 similar events)
// Phase 1: matrix 36 rows 23 cols
[2024-05-24 09:26:44] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 2] Max Struct:[+inf, +inf]
RANDOM walk for 1000001 steps (101989 resets) in 2012 ms. (496 steps per ms)
BEST_FIRST walk for 2000002 steps (13316 resets) in 965 ms. (2070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-24 09:26:47] [INFO ] Flow matrix only has 36 transitions (discarded 216 similar events)
[2024-05-24 09:26:47] [INFO ] Invariant cache hit.
[2024-05-24 09:26:47] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:26:47] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2024-05-24 09:26:47] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:26:47] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[4, 4]
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 12402 ms.
ITS solved all properties within timeout

BK_STOP 1716542807760

--------------------
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="LeafsetExtension-PT-S16C4"
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 LeafsetExtension-PT-S16C4, 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 r223-tall-171649611300357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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