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.r482-tall-171624201900417.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 DES-PT-10a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201900417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 43K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717179846117

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:24:07] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-31 18:24:07] [INFO ] Transformed 155 places.
[2024-05-31 18:24:07] [INFO ] Transformed 112 transitions.
[2024-05-31 18:24:07] [INFO ] Found NUPN structural information;
[2024-05-31 18:24:07] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 170 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 155/155 places, 112/112 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 155 transition count 98
Applied a total of 14 rules in 26 ms. Remains 155 /155 variables (removed 0) and now considering 98/112 (removed 14) transitions.
// Phase 1: matrix 98 rows 155 cols
[2024-05-31 18:24:07] [INFO ] Computed 59 invariants in 17 ms
[2024-05-31 18:24:07] [INFO ] Implicit Places using invariants in 316 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 154/155 places, 98/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 398 ms. Remains : 154/155 places, 98/112 transitions.
Discarding 9 transitions out of 98. Remains 89
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (896 resets) in 1670 ms. (23 steps per ms) remains 25/88 properties
BEST_FIRST walk for 4003 steps (16 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (20 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (21 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (19 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
// Phase 1: matrix 98 rows 154 cols
[2024-05-31 18:24:08] [INFO ] Computed 58 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 10/39 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 37/140 variables, 23/159 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 37/196 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 6/146 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 97/243 variables, 146/350 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 18:24:09] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 10 ms to minimize.
[2024-05-31 18:24:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:24:09] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 9/252 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/252 variables, 8/369 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/252 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 0/252 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 369 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1822 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 10/39 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 37/140 variables, 23/160 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 37/197 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 6/146 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 97/243 variables, 146/353 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 9/362 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 9/252 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/252 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/252 variables, 15/393 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/252 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 0/252 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 393 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4502 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 6378ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 22 different solutions.
Finished Parikh walk after 620 steps, including 1 resets, run visited all 24 properties in 25 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 24 properties in 33 ms.
Able to resolve query QuasiLiveness after proving 89 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 7813 ms.
ITS solved all properties within timeout

BK_STOP 1717179855194

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -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="DES-PT-10a"
export BK_EXAMINATION="QuasiLiveness"
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 DES-PT-10a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r482-tall-171624201900417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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