fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476601034
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldRVt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.750 3600000.00 3662292.00 2861.50 FFFF?????F?????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476601034.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.2K May 14 02:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 82K May 12 20: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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-030A-00
FORMULA_NAME ShieldRVt-PT-030A-01
FORMULA_NAME ShieldRVt-PT-030A-02
FORMULA_NAME ShieldRVt-PT-030A-03
FORMULA_NAME ShieldRVt-PT-030A-04
FORMULA_NAME ShieldRVt-PT-030A-05
FORMULA_NAME ShieldRVt-PT-030A-06
FORMULA_NAME ShieldRVt-PT-030A-07
FORMULA_NAME ShieldRVt-PT-030A-08
FORMULA_NAME ShieldRVt-PT-030A-09
FORMULA_NAME ShieldRVt-PT-030A-10
FORMULA_NAME ShieldRVt-PT-030A-11
FORMULA_NAME ShieldRVt-PT-030A-12
FORMULA_NAME ShieldRVt-PT-030A-13
FORMULA_NAME ShieldRVt-PT-030A-14
FORMULA_NAME ShieldRVt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1590632591094

[2020-05-28 02:23:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-28 02:23:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 02:23:12] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-05-28 02:23:12] [INFO ] Transformed 243 places.
[2020-05-28 02:23:12] [INFO ] Transformed 243 transitions.
[2020-05-28 02:23:12] [INFO ] Found NUPN structural information;
[2020-05-28 02:23:12] [INFO ] Parsed PT model containing 243 places and 243 transitions in 95 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 415 ms. (steps per millisecond=240 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 242 rows 243 cols
[2020-05-28 02:23:13] [INFO ] Computed 121 place invariants in 8 ms
[2020-05-28 02:23:13] [INFO ] [Real]Absence check using 121 positive place invariants in 81 ms returned sat
[2020-05-28 02:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:13] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-28 02:23:13] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 27 ms.
[2020-05-28 02:23:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2020-05-28 02:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:14] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2020-05-28 02:23:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 24 ms.
[2020-05-28 02:23:15] [INFO ] Added : 239 causal constraints over 49 iterations in 1068 ms. Result :sat
[2020-05-28 02:23:15] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2020-05-28 02:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:15] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-05-28 02:23:15] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 21 ms.
[2020-05-28 02:23:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2020-05-28 02:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:16] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-05-28 02:23:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-05-28 02:23:17] [INFO ] Added : 238 causal constraints over 48 iterations in 1183 ms. Result :sat
[2020-05-28 02:23:17] [INFO ] [Real]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-05-28 02:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:17] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-28 02:23:17] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-05-28 02:23:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2020-05-28 02:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:17] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2020-05-28 02:23:17] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-05-28 02:23:18] [INFO ] Added : 239 causal constraints over 49 iterations in 868 ms. Result :sat
[2020-05-28 02:23:18] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-05-28 02:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:19] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-05-28 02:23:19] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 23 ms.
[2020-05-28 02:23:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 47 ms returned sat
[2020-05-28 02:23:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:19] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2020-05-28 02:23:19] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-05-28 02:23:20] [INFO ] Added : 240 causal constraints over 49 iterations in 1233 ms. Result :sat
[2020-05-28 02:23:20] [INFO ] [Real]Absence check using 121 positive place invariants in 60 ms returned sat
[2020-05-28 02:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:20] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-05-28 02:23:20] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-05-28 02:23:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 56 ms returned sat
[2020-05-28 02:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:21] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-05-28 02:23:21] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 38 ms.
[2020-05-28 02:23:22] [INFO ] Added : 235 causal constraints over 47 iterations in 983 ms. Result :sat
[2020-05-28 02:23:22] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2020-05-28 02:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:22] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-05-28 02:23:22] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-05-28 02:23:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-05-28 02:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:23] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2020-05-28 02:23:23] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-05-28 02:23:24] [INFO ] Added : 240 causal constraints over 49 iterations in 1256 ms. Result :sat
[2020-05-28 02:23:24] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-05-28 02:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:24] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-28 02:23:24] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 18 ms.
[2020-05-28 02:23:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-05-28 02:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:25] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2020-05-28 02:23:25] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 26 ms.
[2020-05-28 02:23:26] [INFO ] Added : 239 causal constraints over 49 iterations in 1121 ms. Result :sat
[2020-05-28 02:23:26] [INFO ] [Real]Absence check using 121 positive place invariants in 41 ms returned sat
[2020-05-28 02:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:26] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-05-28 02:23:26] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-05-28 02:23:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-05-28 02:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:26] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-05-28 02:23:26] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 10 ms.
[2020-05-28 02:23:27] [INFO ] Added : 236 causal constraints over 48 iterations in 889 ms. Result :sat
[2020-05-28 02:23:27] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2020-05-28 02:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:28] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-28 02:23:28] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-05-28 02:23:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-05-28 02:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:28] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-05-28 02:23:28] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-05-28 02:23:29] [INFO ] Added : 237 causal constraints over 48 iterations in 980 ms. Result :sat
[2020-05-28 02:23:29] [INFO ] [Real]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-05-28 02:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:29] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-05-28 02:23:29] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-05-28 02:23:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2020-05-28 02:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:29] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-28 02:23:30] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-05-28 02:23:31] [INFO ] Added : 237 causal constraints over 49 iterations in 1012 ms. Result :sat
[2020-05-28 02:23:31] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2020-05-28 02:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:31] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-05-28 02:23:31] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-05-28 02:23:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 47 ms returned sat
[2020-05-28 02:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:31] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-05-28 02:23:31] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-05-28 02:23:32] [INFO ] Added : 238 causal constraints over 48 iterations in 1198 ms. Result :sat
[2020-05-28 02:23:32] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned unsat
[2020-05-28 02:23:32] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-05-28 02:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:33] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-05-28 02:23:33] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-05-28 02:23:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-05-28 02:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:33] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2020-05-28 02:23:33] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-05-28 02:23:34] [INFO ] Added : 239 causal constraints over 49 iterations in 1215 ms. Result :sat
[2020-05-28 02:23:34] [INFO ] [Real]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-05-28 02:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:35] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-05-28 02:23:35] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-05-28 02:23:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:23:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-05-28 02:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:23:35] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-05-28 02:23:35] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-05-28 02:23:36] [INFO ] Added : 236 causal constraints over 48 iterations in 1015 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-28 02:23:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-28 02:23:36] [INFO ] Flatten gal took : 76 ms
FORMULA ShieldRVt-PT-030A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 02:23:36] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 02:23:36] [INFO ] Applying decomposition
[2020-05-28 02:23:36] [INFO ] Flatten gal took : 49 ms
[2020-05-28 02:23:36] [INFO ] Input system was already deterministic with 242 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2423061219645947725.txt, -o, /tmp/graph2423061219645947725.bin, -w, /tmp/graph2423061219645947725.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2423061219645947725.bin, -l, -1, -v, -w, /tmp/graph2423061219645947725.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 02:23:37] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 242 rows 243 cols
[2020-05-28 02:23:37] [INFO ] Computed 121 place invariants in 4 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p173 + p174 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p163 + p164 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p213 + p214 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p241 + p242 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p215 + p216 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p239 + p240 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p169 + p170 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p233 + p234 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p207 + p208 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p167 + p168 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p209 + p210 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p171 + p172 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p165 + p166 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p205 + p206 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p211 + p212 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p217 + p218 = 1
inv : p0 + p185 + p186 = 1
Total of 121 invariants.
[2020-05-28 02:23:37] [INFO ] Computed 121 place invariants in 7 ms
[2020-05-28 02:23:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:23:37] [INFO ] Removed a total of 90 redundant transitions.
[2020-05-28 02:23:37] [INFO ] Flatten gal took : 53 ms
[2020-05-28 02:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-28 02:23:37] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 17 ms
[2020-05-28 02:23:37] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((X((G("((i6.i1.u46.p94==1)&&(i6.i1.u48.p97==1))"))||(((((F(X(X("(((i13.i1.u93.p188==1)&&(i13.i1.u94.p189==1))&&(i13.i1.u95.p192==1))"))))&&(F("(i5.i0.u36.p73==1)")))&&("(i5.i0.u36.p73==1)"))&&("(i6.i1.u46.p94==1)"))&&("(i6.i1.u48.p97==1)")))))
Formula 0 simplified : !X(G"((i6.i1.u46.p94==1)&&(i6.i1.u48.p97==1))" | ("(i5.i0.u36.p73==1)" & "(i6.i1.u46.p94==1)" & "(i6.i1.u48.p97==1)" & FXX"(((i13.i1.u93.p188==1)&&(i13.i1.u94.p189==1))&&(i13.i1.u95.p192==1))" & F"(i5.i0.u36.p73==1)"))
built 18 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 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.093404,20584,1,0,2202,83,1077,3108,66,130,5553
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F(G(!(G((G(F(X(X("(i16.i1.u115.p231==1)")))))||(F(G("((i6.i0.u42.p86==1)&&(i6.i0.u44.p89==1))"))))))))))
Formula 1 simplified : FG!G(GFXX"(i16.i1.u115.p231==1)" | FG"((i6.i0.u42.p86==1)&&(i6.i0.u44.p89==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 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.102688,21228,1,0,2690,83,1141,3996,66,130,6464
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(X((G(F("(i1.i0.u5.p11==1)")))&&(F("(i5.i0.u33.p67==1)")))))))
Formula 2 simplified : !GXX(GF"(i1.i0.u5.p11==1)" & F"(i5.i0.u33.p67==1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1 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.10726,21228,1,0,3174,83,1197,4454,66,130,7166
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(G("(i4.u32.p65==1)")))&&(G(("(((i15.i1.u105.p212==1)&&(i15.i1.u106.p213==1))&&(i15.i1.u107.p216==1))")U(F("(i16.i0.u111.p223==1)"))))))
Formula 3 simplified : !(FG"(i4.u32.p65==1)" & G("(((i15.i1.u105.p212==1)&&(i15.i1.u106.p213==1))&&(i15.i1.u107.p216==1))" U F"(i16.i0.u111.p223==1)"))
[2020-05-28 02:23:37] [INFO ] Proved 243 variables to be positive in 564 ms
[2020-05-28 02:23:37] [INFO ] Computing symmetric may disable matrix : 242 transitions.
[2020-05-28 02:23:37] [INFO ] Computation of disable matrix completed :0/242 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:23:37] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:23:37] [INFO ] Computing symmetric may enable matrix : 242 transitions.
[2020-05-28 02:23:37] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:23:40] [INFO ] Computing symmetric co enabling matrix : 242 transitions.
[2020-05-28 02:23:40] [INFO ] Computation of co-enabling matrix(0/242) took 547 ms. Total solver calls (SAT/UNSAT): 241(0/241)
[2020-05-28 02:23:43] [INFO ] Computation of co-enabling matrix(91/242) took 3559 ms. Total solver calls (SAT/UNSAT): 491(91/400)
[2020-05-28 02:23:46] [INFO ] Computation of co-enabling matrix(221/242) took 6563 ms. Total solver calls (SAT/UNSAT): 859(209/650)
[2020-05-28 02:23:47] [INFO ] Computation of Finished co-enabling matrix. took 7089 ms. Total solver calls (SAT/UNSAT): 869(209/660)
[2020-05-28 02:23:47] [INFO ] Computing Do-Not-Accords matrix : 242 transitions.
[2020-05-28 02:23:47] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:23:47] [INFO ] Built C files in 10658ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 2859 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>([]((LTLAP9==true))) ) && ( [](((LTLAP10==true))U(<>((LTLAP11==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>([]((LTLAP9==true))) ) && ( [](((LTLAP10==true))U(<>((LTLAP11==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>([]((LTLAP9==true))) ) && ( [](((LTLAP10==true))U(<>((LTLAP11==true)))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-28 02:43:45] [INFO ] Applying decomposition
[2020-05-28 02:43:45] [INFO ] Flatten gal took : 19 ms
[2020-05-28 02:43:45] [INFO ] Decomposing Gal with order
[2020-05-28 02:43:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:43:45] [INFO ] Removed a total of 90 redundant transitions.
[2020-05-28 02:43:45] [INFO ] Flatten gal took : 20 ms
[2020-05-28 02:43:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-28 02:43:45] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-28 02:43:45] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !(((F(G("(u33.p65==1)")))&&(G(("(((u106.p212==1)&&(u107.p213==1))&&(u108.p216==1))")U(F("(u112.p223==1)"))))))
Formula 0 simplified : !(FG"(u33.p65==1)" & G("(((u106.p212==1)&&(u107.p213==1))&&(u108.p216==1))" U F"(u112.p223==1)"))
built 122 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-28 03:03:53] [INFO ] Flatten gal took : 14 ms
[2020-05-28 03:03:53] [INFO ] Input system was already deterministic with 242 transitions.
[2020-05-28 03:03:53] [INFO ] Transformed 243 places.
[2020-05-28 03:03:53] [INFO ] Transformed 242 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-28 03:03:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-28 03:03:53] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 11 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G("(p65==1)")))&&(G(("(((p212==1)&&(p213==1))&&(p216==1))")U(F("(p223==1)"))))))
Formula 0 simplified : !(FG"(p65==1)" & G("(((p212==1)&&(p213==1))&&(p216==1))" U F"(p223==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldRVt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-030A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033476601034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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