Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is PolyORBNT-PT-S05J80, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089200950
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-0
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-1
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-15
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-2
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-3
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-4
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-5
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-6
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-7
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-8
FORMULA_NAME PolyORBNT-COL-S05J80-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463744417314

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBNT-PT-S05J80
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-LTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3539/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 1189 places, 2350 transitions, 1007 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J80-LTLCardinality.task
lola: read: A((2 <= mi2 U mi3 <= QueueJobB_1_8 + QueueJobB_1_45 + QueueJobB_1_18 + QueueJobB_1_27 + QueueJobB_1_36 + QueueJobB_1_63 + QueueJobB_1_16 + QueueJobB_1_51 + QueueJobB_1_71 + QueueJobB_1_2 + QueueJobB_1_23 + QueueJobB_1_64 + QueueJobB_1_79 + QueueJobB_1_44 + QueueJobB_1_9 + QueueJobB_1_37 + QueueJobB_1_30 + QueueJobB_1_58 + QueueJobB_1_15 + QueueJobB_1_65 + QueueJobB_1_29 + QueueJobB_1_1 + QueueJobB... (shortened)
lola: formula length: 8374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-mi2 <= -2 U mi3 + -QueueJobB_1_80 + -QueueJobB_1_79 + -QueueJobB_1_78 + -QueueJobB_1_77 + -QueueJobB_1_76 + -QueueJobB_1_75 + -QueueJobB_1_74 + -QueueJobB_1_73 + -QueueJobB_1_72 + -QueueJobB_1_71 + -QueueJobB_1_70 + -QueueJobB_1_69 + -QueueJobB_1_68 + -QueueJobB_1_67 + -QueueJobB_1_66 + -QueueJobB_1_65 + -QueueJobB_1_64 + -QueueJobB_1_63 + -QueueJobB_1_62 + -QueueJobB_1_61 + -QueueJobB_1_60 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((-cJobCnt + mo2 <= 0 U -Schedule_Task_B_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (-place_522_1 + place_521_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-Perform_Work_B_1_80 + -Perform_Work_B_1_79 + -Perform_Work_B_1_78 + -Perform_Work_B_1_77 + -Perform_Work_B_1_76 + -Perform_Work_B_1_75 + -Perform_Work_B_1_74 + -Perform_Work_B_1_73 + -Perform_Work_B_1_72 + -Perform_Work_B_1_71 + -Perform_Work_B_1_70 + -Perform_Work_B_1_69 + -Perform_Work_B_1_68 + -Perform_Work_B_1_67 + -Perform_Work_B_1_66 + -Perform_Work_B_1_65 + -Perform_Work_B_1_64 + -Per... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (G (-Check_Sources_E_1 + Perform_Work_E_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((X (-mo1 + place_520_1 <= 0) U G (-JobCnt + QueueJobB_1_80 + QueueJobB_1_79 + QueueJobB_1_78 + QueueJobB_1_77 + QueueJobB_1_76 + QueueJobB_1_75 + QueueJobB_1_74 + QueueJobB_1_73 + QueueJobB_1_72 + QueueJobB_1_71 + QueueJobB_1_70 + QueueJobB_1_69 + QueueJobB_1_68 + QueueJobB_1_67 + QueueJobB_1_66 + QueueJobB_1_65 + QueueJobB_1_64 + QueueJobB_1_63 + QueueJobB_1_62 + QueueJobB_1_61 + QueueJobB_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (X (-mi2 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-place_458 <= -2) U (-Perform_Work_E_1 + place_520_1 <= 0 U cJobCnt + -f2_80 + -f2_79 + -f2_78 + -f2_77 + -f2_76 + -f2_75 + -f2_74 + -f2_73 + -f2_72 + -f2_71 + -f2_70 + -f2_69 + -f2_68 + -f2_67 + -f2_66 + -f2_65 + -f2_64 + -f2_63 + -f2_62 + -f2_61 + -f2_60 + -f2_59 + -f2_58 + -f2_57 + -f2_56 + -f2_55 + -f2_54 + -f2_53 + -f2_52 + -f2_51 + -f2_50 + -f2_49 + -f2_48 + -f2_47 + -f2_46 + -f2_45 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (place_500_1 + -place_521_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (G (NotifyEventEndOfCheckSourcesB_1 + -block <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (X (F (-Check_Sources_E_1 + NotifyEventEndOfCheckSourcesB_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ModifiedSrc_5 + -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 + place_520_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (X (G (mo3 + -Try_Check_Sources_E_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 600 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((G (-NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_1_80 + -NotifyEventJobQueuedB_1_10 + -NotifyEventJobQueuedB_1_11 + -NotifyEvent... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -place_460 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J80-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 1802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: cJobCnt + -mo2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J80-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: RESULT
lola: summary: yes no yes yes unknown unknown no no yes unknown yes unknown unknown no no no

BK_STOP 1463746156203

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

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="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is PolyORBNT-PT-S05J80, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086kn-ebro-146369089200950"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;