Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995800004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.9K May 5 16:51 model.pnml

--------------------
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 Philosophers-COL-000010-00
FORMULA_NAME Philosophers-COL-000010-01
FORMULA_NAME Philosophers-COL-000010-02
FORMULA_NAME Philosophers-COL-000010-03
FORMULA_NAME Philosophers-COL-000010-04
FORMULA_NAME Philosophers-COL-000010-05
FORMULA_NAME Philosophers-COL-000010-06
FORMULA_NAME Philosophers-COL-000010-07
FORMULA_NAME Philosophers-COL-000010-08
FORMULA_NAME Philosophers-COL-000010-09
FORMULA_NAME Philosophers-COL-000010-10
FORMULA_NAME Philosophers-COL-000010-11
FORMULA_NAME Philosophers-COL-000010-12
FORMULA_NAME Philosophers-COL-000010-13
FORMULA_NAME Philosophers-COL-000010-14
FORMULA_NAME Philosophers-COL-000010-15

=== Now, execution of the tool begins

BK_START 1622990100738

Running Version 0
[2021-06-06 14:35:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 14:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-06-06 14:35:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:35:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1126 ms
[2021-06-06 14:35:06] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 14:35:06] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 4 ms.
[2021-06-06 14:35:06] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2511815081729630139.dot
[2021-06-06 14:35:06] [INFO ] Initial state test concluded for 3 properties.
FORMULA Philosophers-COL-000010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 26429 steps, including 2194 resets, run visited all 15 properties in 69 ms. (steps per millisecond=383 )
[2021-06-06 14:35:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-06 14:35:07] [INFO ] Flatten gal took : 62 ms
FORMULA Philosophers-COL-000010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 14:35:07] [INFO ] Flatten gal took : 4 ms
[2021-06-06 14:35:07] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 4 ms.
[2021-06-06 14:35:07] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_16633570174331812424.dot
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 25 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:07] [INFO ] Computed 20 place invariants in 9 ms
[2021-06-06 14:35:07] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:07] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:07] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:07] [INFO ] Computed 20 place invariants in 3 ms
[2021-06-06 14:35:07] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
[2021-06-06 14:35:07] [INFO ] Flatten gal took : 14 ms
[2021-06-06 14:35:07] [INFO ] Flatten gal took : 32 ms
[2021-06-06 14:35:07] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 12 properties in 2 ms. (steps per millisecond=21 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(p0)))||X((p0&&X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:08] [INFO ] Computed 20 place invariants in 4 ms
[2021-06-06 14:35:08] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:08] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:08] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:08] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:08] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 727 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)), p1:(GT 3 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-00 finished in 1046 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 17 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:09] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:09] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:09] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:09] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2021-06-06 14:35:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:09] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:09] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39)), p1:(GT (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 963 reset in 536 ms.
Stack based approach found an accepted trace after 1554 steps with 16 reset with depth 35 and stack size 35 in 10 ms.
FORMULA Philosophers-COL-000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-01 finished in 1200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:10] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:10] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:10] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:10] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:10] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-03 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 40 transition count 40
Applied a total of 20 rules in 11 ms. Remains 40 /50 variables (removed 10) and now considering 40/50 (removed 10) transitions.
// Phase 1: matrix 40 rows 40 cols
[2021-06-06 14:35:10] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:10] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2021-06-06 14:35:10] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2021-06-06 14:35:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 40 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/50 places, 40/50 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 299 steps with 2 reset in 2 ms.
FORMULA Philosophers-COL-000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-04 finished in 354 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:11] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-05 finished in 516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2021-06-06 14:35:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:11] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-07 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 8 ms
[2021-06-06 14:35:12] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:12] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:12] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 3 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-08 finished in 435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:12] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 2 ms
[2021-06-06 14:35:12] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:12] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:12] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39)), p1:(LEQ (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 39943 reset in 390 ms.
Product exploration explored 100000 steps with 40014 reset in 526 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 40027 reset in 360 ms.
Product exploration explored 100000 steps with 39981 reset in 462 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 20 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 50 transition count 50
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2021-06-06 14:35:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:15] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:15] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Product exploration explored 100000 steps with 40002 reset in 785 ms.
Product exploration explored 100000 steps with 39981 reset in 651 ms.
[2021-06-06 14:35:16] [INFO ] Flatten gal took : 10 ms
[2021-06-06 14:35:16] [INFO ] Flatten gal took : 18 ms
[2021-06-06 14:35:16] [INFO ] Time to serialize gal into /tmp/LTL7770701450264447922.gal : 2 ms
[2021-06-06 14:35:16] [INFO ] Time to serialize properties into /tmp/LTL6164719284917450391.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7770701450264447922.gal, -t, CGAL, -LTL, /tmp/LTL6164719284917450391.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7770701450264447922.gal -t CGAL -LTL /tmp/LTL6164719284917450391.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((Catch2_0+Catch2_1)+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_8)+Catch2_9)>=2)"))||(X(F("((((((((((Catch2_0+Catch2_1)+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_8)+Catch2_9)<=(((((((((Catch1_0+Catch1_1)+Catch1_2)+Catch1_3)+Catch1_4)+Catch1_5)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9))")))))
Formula 0 simplified : !(F"((((((((((Catch2_0+Catch2_1)+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_8)+Catch2_9)>=2)" | XF"((((((((((Catch2_0+Catch2_1)+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_8)+Catch2_9)<=(((((((((Catch1_0+Catch1_1)+Catch1_2)+Catch1_3)+Catch1_4)+Catch1_5)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.077648,17796,1,0,11,7969,25,6,1335,2814,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Philosophers-COL-000010-11 finished in 4283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:16] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:16] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:16] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)) (GT (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 9808 steps with 2513 reset in 40 ms.
FORMULA Philosophers-COL-000010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-12 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:17] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2021-06-06 14:35:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 1 ms
[2021-06-06 14:35:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0]
Running random walk in product with property : Philosophers-COL-000010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49) (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-14 finished in 283 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(p0 U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:17] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:17] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2021-06-06 14:35:17] [INFO ] Computed 20 place invariants in 0 ms
[2021-06-06 14:35:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49)), p1:(AND (GT (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)) (GT 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-15 finished in 371 ms.
All properties solved without resorting to model-checking.

BK_STOP 1622990119034

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Philosophers-COL-000010"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000010, 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 r140-tall-162298995800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;