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.r246-smll-162106594200080.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 gold2020
Input is ShieldRVs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594200080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 18:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 18:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 625K May 5 16:52 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 ShieldRVs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621307409486

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 03:10:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 03:10:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 03:10:13] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2021-05-18 03:10:13] [INFO ] Transformed 2003 places.
[2021-05-18 03:10:13] [INFO ] Transformed 2253 transitions.
[2021-05-18 03:10:13] [INFO ] Found NUPN structural information;
[2021-05-18 03:10:13] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 494 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 113 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 207 ms. (steps per millisecond=48 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1]
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 2253 rows 2003 cols
[2021-05-18 03:10:13] [INFO ] Computed 201 place invariants in 79 ms
[2021-05-18 03:10:15] [INFO ] [Real]Absence check using 201 positive place invariants in 395 ms returned sat
[2021-05-18 03:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:10:18] [INFO ] [Real]Absence check using state equation in 3792 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 03:10:19] [INFO ] [Real]Absence check using 201 positive place invariants in 366 ms returned sat
[2021-05-18 03:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:10:24] [INFO ] [Real]Absence check using state equation in 4122 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 03:10:24] [INFO ] [Real]Absence check using 201 positive place invariants in 354 ms returned sat
[2021-05-18 03:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:10:29] [INFO ] [Real]Absence check using state equation in 4302 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 03:10:29] [INFO ] [Real]Absence check using 201 positive place invariants in 357 ms returned sat
[2021-05-18 03:10:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:10:34] [INFO ] [Real]Absence check using state equation in 4320 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 03:10:34] [INFO ] [Real]Absence check using 201 positive place invariants in 380 ms returned sat
[2021-05-18 03:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:10:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 03:10:39] [INFO ] [Real]Absence check using state equation in 4264 ms returned (error "Failed to check-sat")
Support contains 64 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 2003 transition count 2059
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 388 place count 1809 transition count 2059
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 243 Pre rules applied. Total rules applied 388 place count 1809 transition count 1816
Deduced a syphon composed of 243 places in 4 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 2 with 486 rules applied. Total rules applied 874 place count 1566 transition count 1816
Symmetric choice reduction at 2 with 337 rule applications. Total rules 1211 place count 1566 transition count 1816
Deduced a syphon composed of 337 places in 14 ms
Reduce places removed 337 places and 337 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1885 place count 1229 transition count 1479
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 127 Pre rules applied. Total rules applied 1885 place count 1229 transition count 1352
Deduced a syphon composed of 127 places in 9 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 2139 place count 1102 transition count 1352
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 4 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 2821 place count 761 transition count 1011
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 2 with 95 rules applied. Total rules applied 2916 place count 761 transition count 1011
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2917 place count 760 transition count 1010
Applied a total of 2917 rules in 844 ms. Remains 760 /2003 variables (removed 1243) and now considering 1010/2253 (removed 1243) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/2003 places, 1010/2253 transitions.
Incomplete random walk after 1000000 steps, including 1481 resets, run finished after 6284 ms. (steps per millisecond=159 ) properties seen :[0, 1, 1, 0, 1]
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 162 resets, run finished after 4240 ms. (steps per millisecond=235 ) properties seen :[1, 0]
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 151 resets, run finished after 4249 ms. (steps per millisecond=235 ) properties seen :[0]
// Phase 1: matrix 1010 rows 760 cols
[2021-05-18 03:10:54] [INFO ] Computed 201 place invariants in 8 ms
[2021-05-18 03:10:55] [INFO ] [Real]Absence check using 201 positive place invariants in 150 ms returned sat
[2021-05-18 03:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:10:56] [INFO ] [Real]Absence check using state equation in 1890 ms returned sat
[2021-05-18 03:10:57] [INFO ] Deduced a trap composed of 8 places in 407 ms
[2021-05-18 03:10:57] [INFO ] Deduced a trap composed of 10 places in 277 ms
[2021-05-18 03:10:58] [INFO ] Deduced a trap composed of 13 places in 321 ms
[2021-05-18 03:10:58] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2021-05-18 03:10:58] [INFO ] Deduced a trap composed of 7 places in 241 ms
[2021-05-18 03:10:58] [INFO ] Deduced a trap composed of 12 places in 231 ms
[2021-05-18 03:10:59] [INFO ] Deduced a trap composed of 13 places in 239 ms
[2021-05-18 03:10:59] [INFO ] Deduced a trap composed of 11 places in 202 ms
[2021-05-18 03:10:59] [INFO ] Deduced a trap composed of 19 places in 192 ms
[2021-05-18 03:11:00] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2021-05-18 03:11:00] [INFO ] Deduced a trap composed of 10 places in 194 ms
[2021-05-18 03:11:00] [INFO ] Deduced a trap composed of 7 places in 199 ms
[2021-05-18 03:11:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3592 ms
[2021-05-18 03:11:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:11:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 160 ms returned sat
[2021-05-18 03:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:11:02] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2021-05-18 03:11:03] [INFO ] Deduced a trap composed of 14 places in 382 ms
[2021-05-18 03:11:03] [INFO ] Deduced a trap composed of 17 places in 374 ms
[2021-05-18 03:11:04] [INFO ] Deduced a trap composed of 8 places in 395 ms
[2021-05-18 03:11:04] [INFO ] Deduced a trap composed of 6 places in 377 ms
[2021-05-18 03:11:04] [INFO ] Deduced a trap composed of 6 places in 361 ms
[2021-05-18 03:11:05] [INFO ] Deduced a trap composed of 6 places in 360 ms
[2021-05-18 03:11:05] [INFO ] Deduced a trap composed of 16 places in 336 ms
[2021-05-18 03:11:06] [INFO ] Deduced a trap composed of 9 places in 333 ms
[2021-05-18 03:11:06] [INFO ] Deduced a trap composed of 12 places in 337 ms
[2021-05-18 03:11:06] [INFO ] Deduced a trap composed of 10 places in 343 ms
[2021-05-18 03:11:07] [INFO ] Deduced a trap composed of 15 places in 346 ms
[2021-05-18 03:11:07] [INFO ] Deduced a trap composed of 8 places in 336 ms
[2021-05-18 03:11:07] [INFO ] Deduced a trap composed of 12 places in 337 ms
[2021-05-18 03:11:08] [INFO ] Deduced a trap composed of 14 places in 309 ms
[2021-05-18 03:11:08] [INFO ] Deduced a trap composed of 23 places in 296 ms
[2021-05-18 03:11:08] [INFO ] Deduced a trap composed of 15 places in 234 ms
[2021-05-18 03:11:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6177 ms
[2021-05-18 03:11:09] [INFO ] Computed and/alt/rep : 993/5761/993 causal constraints in 84 ms.
[2021-05-18 03:11:29] [INFO ] Added : 645 causal constraints over 129 iterations in 20520 ms.(timeout) Result :sat
[2021-05-18 03:11:29] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2021-05-18 03:11:29] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2021-05-18 03:11:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 658 ms
Attempting to minimize the solution found.
Minimization took 127 ms.
Incomplete Parikh walk after 108300 steps, including 997 resets, run finished after 853 ms. (steps per millisecond=126 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 760 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 760/760 places, 1010/1010 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 760 transition count 1005
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 755 transition count 1005
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 755 transition count 991
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 741 transition count 991
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 721 transition count 971
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 721 transition count 971
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 720 transition count 970
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 719 transition count 969
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 718 transition count 968
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 717 transition count 967
Applied a total of 89 rules in 361 ms. Remains 717 /760 variables (removed 43) and now considering 967/1010 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 717/760 places, 967/1010 transitions.
Incomplete random walk after 1000000 steps, including 1649 resets, run finished after 5970 ms. (steps per millisecond=167 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 178 resets, run finished after 4344 ms. (steps per millisecond=230 ) properties seen :[0]
Interrupted probabilistic random walk after 2069124 steps, run timeout after 30001 ms. (steps per millisecond=68 ) properties seen :[0]
Probabilistic random walk after 2069124 steps, saw 339442 distinct states, run finished after 30001 ms. (steps per millisecond=68 ) properties seen :[0]
// Phase 1: matrix 967 rows 717 cols
[2021-05-18 03:12:11] [INFO ] Computed 201 place invariants in 9 ms
[2021-05-18 03:12:12] [INFO ] [Real]Absence check using 201 positive place invariants in 164 ms returned sat
[2021-05-18 03:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:12:13] [INFO ] [Real]Absence check using state equation in 1687 ms returned sat
[2021-05-18 03:12:14] [INFO ] Deduced a trap composed of 7 places in 370 ms
[2021-05-18 03:12:14] [INFO ] Deduced a trap composed of 18 places in 269 ms
[2021-05-18 03:12:14] [INFO ] Deduced a trap composed of 17 places in 212 ms
[2021-05-18 03:12:15] [INFO ] Deduced a trap composed of 21 places in 218 ms
[2021-05-18 03:12:15] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2021-05-18 03:12:15] [INFO ] Deduced a trap composed of 11 places in 177 ms
[2021-05-18 03:12:15] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2021-05-18 03:12:15] [INFO ] Deduced a trap composed of 24 places in 136 ms
[2021-05-18 03:12:16] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2021-05-18 03:12:16] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2021-05-18 03:12:16] [INFO ] Deduced a trap composed of 11 places in 60 ms
[2021-05-18 03:12:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2407 ms
[2021-05-18 03:12:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:12:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 139 ms returned sat
[2021-05-18 03:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:12:18] [INFO ] [Nat]Absence check using state equation in 1663 ms returned sat
[2021-05-18 03:12:18] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2021-05-18 03:12:18] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2021-05-18 03:12:19] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2021-05-18 03:12:19] [INFO ] Deduced a trap composed of 21 places in 184 ms
[2021-05-18 03:12:19] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2021-05-18 03:12:19] [INFO ] Deduced a trap composed of 10 places in 142 ms
[2021-05-18 03:12:19] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2021-05-18 03:12:19] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2021-05-18 03:12:20] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2021-05-18 03:12:20] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2021-05-18 03:12:20] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-18 03:12:20] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2021-05-18 03:12:20] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2021-05-18 03:12:20] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2021-05-18 03:12:20] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2402 ms
[2021-05-18 03:12:20] [INFO ] Computed and/alt/rep : 959/5039/959 causal constraints in 77 ms.
[2021-05-18 03:12:42] [INFO ] Added : 760 causal constraints over 152 iterations in 21948 ms.(timeout) Result :sat
[2021-05-18 03:12:42] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2021-05-18 03:12:43] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2021-05-18 03:12:43] [INFO ] Deduced a trap composed of 35 places in 69 ms
[2021-05-18 03:12:43] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2021-05-18 03:12:43] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2021-05-18 03:12:44] [INFO ] Deduced a trap composed of 33 places in 70 ms
[2021-05-18 03:12:44] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2021-05-18 03:12:44] [INFO ] Deduced a trap composed of 22 places in 91 ms
[2021-05-18 03:12:44] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2021-05-18 03:12:45] [INFO ] Deduced a trap composed of 40 places in 77 ms
[2021-05-18 03:12:45] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2021-05-18 03:12:45] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2021-05-18 03:12:45] [INFO ] Deduced a trap composed of 40 places in 63 ms
[2021-05-18 03:12:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3099 ms
Attempting to minimize the solution found.
Minimization took 109 ms.
Incomplete Parikh walk after 104300 steps, including 1042 resets, run finished after 732 ms. (steps per millisecond=142 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 717 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 717/717 places, 967/967 transitions.
Applied a total of 0 rules in 29 ms. Remains 717 /717 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 717/717 places, 967/967 transitions.
Starting structural reductions, iteration 0 : 717/717 places, 967/967 transitions.
Applied a total of 0 rules in 26 ms. Remains 717 /717 variables (removed 0) and now considering 967/967 (removed 0) transitions.
// Phase 1: matrix 967 rows 717 cols
[2021-05-18 03:12:46] [INFO ] Computed 201 place invariants in 10 ms
[2021-05-18 03:12:48] [INFO ] Implicit Places using invariants in 1537 ms returned []
// Phase 1: matrix 967 rows 717 cols
[2021-05-18 03:12:48] [INFO ] Computed 201 place invariants in 7 ms
[2021-05-18 03:12:54] [INFO ] Implicit Places using invariants and state equation in 6269 ms returned []
Implicit Place search using SMT with State Equation took 7817 ms to find 0 implicit places.
[2021-05-18 03:12:55] [INFO ] Redundant transitions in 676 ms returned []
// Phase 1: matrix 967 rows 717 cols
[2021-05-18 03:12:55] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-18 03:12:57] [INFO ] Dead Transitions using invariants and state equation in 2211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 717/717 places, 967/967 transitions.
Incomplete random walk after 100000 steps, including 165 resets, run finished after 580 ms. (steps per millisecond=172 ) properties seen :[0]
// Phase 1: matrix 967 rows 717 cols
[2021-05-18 03:12:58] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-18 03:12:58] [INFO ] [Real]Absence check using 201 positive place invariants in 141 ms returned sat
[2021-05-18 03:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:12:59] [INFO ] [Real]Absence check using state equation in 1624 ms returned sat
[2021-05-18 03:13:00] [INFO ] Deduced a trap composed of 7 places in 218 ms
[2021-05-18 03:13:00] [INFO ] Deduced a trap composed of 18 places in 220 ms
[2021-05-18 03:13:00] [INFO ] Deduced a trap composed of 17 places in 223 ms
[2021-05-18 03:13:01] [INFO ] Deduced a trap composed of 21 places in 221 ms
[2021-05-18 03:13:01] [INFO ] Deduced a trap composed of 11 places in 206 ms
[2021-05-18 03:13:01] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2021-05-18 03:13:01] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2021-05-18 03:13:01] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2021-05-18 03:13:01] [INFO ] Deduced a trap composed of 11 places in 78 ms
[2021-05-18 03:13:02] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-18 03:13:02] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-18 03:13:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2137 ms
[2021-05-18 03:13:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:13:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 142 ms returned sat
[2021-05-18 03:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:13:04] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2021-05-18 03:13:04] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2021-05-18 03:13:04] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2021-05-18 03:13:04] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 21 places in 184 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 11 places in 163 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 10 places in 144 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 8 places in 97 ms
[2021-05-18 03:13:05] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2021-05-18 03:13:06] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2021-05-18 03:13:06] [INFO ] Deduced a trap composed of 14 places in 87 ms
[2021-05-18 03:13:06] [INFO ] Deduced a trap composed of 10 places in 96 ms
[2021-05-18 03:13:06] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2021-05-18 03:13:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2496 ms
[2021-05-18 03:13:06] [INFO ] Computed and/alt/rep : 959/5039/959 causal constraints in 109 ms.
[2021-05-18 03:13:22] [INFO ] Added : 680 causal constraints over 136 iterations in 15576 ms. Result :(error "Solver has unexpectedly terminated")
Applied a total of 0 rules in 27 ms. Remains 717 /717 variables (removed 0) and now considering 967/967 (removed 0) transitions.
// Phase 1: matrix 967 rows 717 cols
[2021-05-18 03:13:22] [INFO ] Computed 201 place invariants in 5 ms
[2021-05-18 03:13:22] [INFO ] [Real]Absence check using 201 positive place invariants in 146 ms returned sat
[2021-05-18 03:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:13:24] [INFO ] [Real]Absence check using state equation in 1670 ms returned sat
[2021-05-18 03:13:24] [INFO ] Deduced a trap composed of 7 places in 216 ms
[2021-05-18 03:13:24] [INFO ] Deduced a trap composed of 18 places in 217 ms
[2021-05-18 03:13:25] [INFO ] Deduced a trap composed of 17 places in 220 ms
[2021-05-18 03:13:25] [INFO ] Deduced a trap composed of 21 places in 214 ms
[2021-05-18 03:13:25] [INFO ] Deduced a trap composed of 11 places in 203 ms
[2021-05-18 03:13:25] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2021-05-18 03:13:25] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2021-05-18 03:13:26] [INFO ] Deduced a trap composed of 24 places in 109 ms
[2021-05-18 03:13:26] [INFO ] Deduced a trap composed of 11 places in 77 ms
[2021-05-18 03:13:26] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-18 03:13:26] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2021-05-18 03:13:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2105 ms
[2021-05-18 03:13:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:13:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 142 ms returned sat
[2021-05-18 03:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:13:28] [INFO ] [Nat]Absence check using state equation in 1684 ms returned sat
[2021-05-18 03:13:28] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2021-05-18 03:13:28] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2021-05-18 03:13:29] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2021-05-18 03:13:29] [INFO ] Deduced a trap composed of 21 places in 187 ms
[2021-05-18 03:13:29] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2021-05-18 03:13:29] [INFO ] Deduced a trap composed of 10 places in 143 ms
[2021-05-18 03:13:29] [INFO ] Deduced a trap composed of 8 places in 109 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2021-05-18 03:13:30] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2021-05-18 03:13:30] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2412 ms
[2021-05-18 03:13:30] [INFO ] Computed and/alt/rep : 959/5039/959 causal constraints in 70 ms.
[2021-05-18 03:13:52] [INFO ] Added : 760 causal constraints over 152 iterations in 22007 ms.(timeout) Result :sat
[2021-05-18 03:13:52] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2021-05-18 03:13:53] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2021-05-18 03:13:53] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2021-05-18 03:13:53] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2021-05-18 03:13:53] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2021-05-18 03:13:54] [INFO ] Deduced a trap composed of 33 places in 66 ms
[2021-05-18 03:13:54] [INFO ] Deduced a trap composed of 22 places in 65 ms
[2021-05-18 03:13:54] [INFO ] Deduced a trap composed of 22 places in 66 ms
[2021-05-18 03:13:54] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2021-05-18 03:13:55] [INFO ] Deduced a trap composed of 40 places in 65 ms
[2021-05-18 03:13:55] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2021-05-18 03:13:55] [INFO ] Deduced a trap composed of 41 places in 80 ms
[2021-05-18 03:13:55] [INFO ] Deduced a trap composed of 40 places in 66 ms
[2021-05-18 03:13:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3135 ms
Attempting to minimize the solution found.
Minimization took 116 ms.
[2021-05-18 03:13:56] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-18 03:13:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
[2021-05-18 03:13:56] [INFO ] Flatten gal took : 275 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-050B @ 3570 seconds
vrfy: finished
info: timeLeft: 3551
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-050B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 03:13:57 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 30136,
"runtime": 19.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p591) AND (1 <= p372) AND (1 <= p585) AND (1 <= p300) AND ((p115 <= 0) OR (p623 <= 0)) AND ((p517 <= 0) OR (p533 <= 0) OR (p545 <= 0) OR (2 <= p257) OR (p257 <= 0) OR (p275 <= 0) OR (p286 <= 0)) AND (((1 <= p656)) OR ((1 <= p350) AND (1 <= p356))))))",
"processed_size": 271,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 4626,
"conflict_clusters": 68,
"places": 717,
"places_significant": 516,
"singleton_clusters": 0,
"transitions": 967
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 210,
"problems": 28
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1684/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 717
lola: finding significant places
lola: 717 places, 967 transitions, 516 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p591 <= 1)
lola: LP says that atomic proposition is always true: (p372 <= 1)
lola: LP says that atomic proposition is always true: (p585 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p623 <= 1)
lola: LP says that atomic proposition is always true: (p517 <= 1)
lola: LP says that atomic proposition is always true: (p533 <= 1)
lola: LP says that atomic proposition is always true: (p545 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p656 <= 1)
lola: LP says that atomic proposition is always true: (p350 <= 1)
lola: LP says that atomic proposition is always true: (p356 <= 1)
lola: E (F (((1 <= p591) AND (1 <= p372) AND (1 <= p585) AND (1 <= p300) AND ((p115 <= 0) OR (p623 <= 0)) AND ((p517 <= 0) OR (p533 <= 0) OR (p545 <= 0) OR (2 <= p257) OR (p257 <= 0) OR (p275 <= 0) OR (p286 <= 0)) AND (((1 <= p656)) OR ((1 <= p350) AND (1 <= p356))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p591) AND (1 <= p372) AND (1 <= p585) AND (1 <= p300) AND ((p115 <= 0) OR (p623 <= 0)) AND ((p517 <= 0) OR (p533 <= 0) OR (p545 <= 0) OR (2 <= p257) OR (p257 <= 0) OR (p275 <= 0) OR (p286 <= 0)) AND (((1 <= p656)) OR ((1 <= p350) AND (1 <= p356))))))
lola: processed formula length: 271
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p591) AND (1 <= p372) AND (1 <= p585) AND (1 <= p300) AND ((p115 <= 0) OR (p623 <= 0)) AND ((p517 <= 0) OR (p533 <= 0) OR (p545 <= 0) OR (2 <= p257) OR (p257 <= 0) OR (p275 <= 0) OR (p286 <= 0)) AND (((1 <= p656)) OR ((1 <= p350) AND (1 <= p356))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 210 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: memory consumption: 30136 KB
lola: time consumption: 19 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
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="ShieldRVs-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is ShieldRVs-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-smll-162106594200080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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