Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900582.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 161K Mar 5 18:22 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 BusinessProcesses-PT-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678647852513

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:04:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:04:14] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-12 19:04:14] [INFO ] Transformed 650 places.
[2023-03-12 19:04:14] [INFO ] Transformed 580 transitions.
[2023-03-12 19:04:14] [INFO ] Found NUPN structural information;
[2023-03-12 19:04:14] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-12 19:04:15] [INFO ] Computed 108 place invariants in 70 ms
[2023-03-12 19:04:16] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 19:04:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-12 19:04:16] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-12 19:04:17] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-12 19:04:17] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 6 ms to minimize.
[2023-03-12 19:04:17] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:04:17] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:04:17] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2023-03-12 19:04:18] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 1 ms to minimize.
[2023-03-12 19:04:18] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-12 19:04:18] [INFO ] Deduced a trap composed of 132 places in 197 ms of which 2 ms to minimize.
[2023-03-12 19:04:18] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 2 ms to minimize.
[2023-03-12 19:04:19] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 1 ms to minimize.
[2023-03-12 19:04:19] [INFO ] Deduced a trap composed of 132 places in 192 ms of which 1 ms to minimize.
[2023-03-12 19:04:19] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 1 ms to minimize.
[2023-03-12 19:04:19] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 0 ms to minimize.
[2023-03-12 19:04:19] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 1 ms to minimize.
[2023-03-12 19:04:20] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 1 ms to minimize.
[2023-03-12 19:04:20] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:04:20] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 1 ms to minimize.
[2023-03-12 19:04:20] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-12 19:04:20] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 1 ms to minimize.
[2023-03-12 19:04:21] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 1 ms to minimize.
[2023-03-12 19:04:21] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 0 ms to minimize.
[2023-03-12 19:04:21] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:04:21] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 1 ms to minimize.
[2023-03-12 19:04:21] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 1 ms to minimize.
[2023-03-12 19:04:22] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:04:22] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:04:22] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 1 ms to minimize.
[2023-03-12 19:04:22] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 0 ms to minimize.
[2023-03-12 19:04:22] [INFO ] Deduced a trap composed of 130 places in 177 ms of which 0 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 1 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 1 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 0 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 147 places in 159 ms of which 1 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 0 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 1 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 0 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 2 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 0 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 141 places in 190 ms of which 0 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 1 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 0 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 0 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 0 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 0 ms to minimize.
[2023-03-12 19:04:28] [INFO ] Deduced a trap composed of 136 places in 173 ms of which 1 ms to minimize.
[2023-03-12 19:04:28] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 8 ms to minimize.
[2023-03-12 19:04:28] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 0 ms to minimize.
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 148 places in 185 ms of which 0 ms to minimize.
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 146 places in 151 ms of which 1 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 0 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 155 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 5 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 2 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 150 places in 188 ms of which 1 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 0 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 0 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 0 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 152 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 152 places in 128 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 144 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 154 places in 142 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 1 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 157 places in 159 ms of which 1 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 153 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 0 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 1 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 139 places in 193 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 142 places in 126 ms of which 0 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 144 places in 121 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 147 places in 121 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 144 places in 117 ms of which 0 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 0 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 28 places in 968 ms of which 0 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 143 places in 127 ms of which 1 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 0 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:04:41] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 19:04:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:04:41] [INFO ] After 25101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 55 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 313 edges and 646 vertex of which 4 / 646 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1308 edges and 643 vertex of which 639 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 639 transition count 459
Reduce places removed 112 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 125 rules applied. Total rules applied 239 place count 527 transition count 446
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 252 place count 514 transition count 446
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 252 place count 514 transition count 357
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 443 place count 412 transition count 357
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 511 place count 344 transition count 289
Iterating global reduction 3 with 68 rules applied. Total rules applied 579 place count 344 transition count 289
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 579 place count 344 transition count 285
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 588 place count 339 transition count 285
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 779 place count 242 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 781 place count 241 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 783 place count 241 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 785 place count 239 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 786 place count 238 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 787 place count 237 transition count 192
Applied a total of 787 rules in 268 ms. Remains 237 /646 variables (removed 409) and now considering 192/576 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 237/646 places, 192/576 transitions.
Incomplete random walk after 10000 steps, including 499 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 192 rows 237 cols
[2023-03-12 19:04:41] [INFO ] Computed 87 place invariants in 20 ms
[2023-03-12 19:04:42] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:04:42] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-12 19:04:42] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-12 19:04:42] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:04:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:04:42] [INFO ] After 101ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 13 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 819 ms
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 0 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 452 ms
[2023-03-12 19:04:43] [INFO ] After 1500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-12 19:04:43] [INFO ] After 1947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 48 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 192/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 191
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 236 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 235 transition count 190
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12 place count 231 transition count 186
Applied a total of 12 rules in 22 ms. Remains 231 /237 variables (removed 6) and now considering 186/192 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 231/237 places, 186/192 transitions.
Incomplete random walk after 10000 steps, including 502 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 893892 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 893892 steps, saw 144790 distinct states, run finished after 3002 ms. (steps per millisecond=297 ) properties seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 231 cols
[2023-03-12 19:04:47] [INFO ] Computed 87 place invariants in 18 ms
[2023-03-12 19:04:47] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:04:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-12 19:04:47] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-12 19:04:47] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:04:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:04:47] [INFO ] After 85ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:04:47] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:04:48] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 0 ms to minimize.
[2023-03-12 19:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-03-12 19:04:48] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 19:04:48] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 186/186 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 185
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 230 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 229 transition count 184
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 place count 229 transition count 176
Deduced a syphon composed of 8 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 22 place count 219 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 216 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 216 transition count 173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 209 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 207 transition count 164
Applied a total of 44 rules in 84 ms. Remains 207 /231 variables (removed 24) and now considering 164/186 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 207/231 places, 164/186 transitions.
Incomplete random walk after 10000 steps, including 699 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 155 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 452026 steps, run visited all 1 properties in 1070 ms. (steps per millisecond=422 )
Probabilistic random walk after 452026 steps, saw 84394 distinct states, run finished after 1070 ms. (steps per millisecond=422 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 35330 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/878/inv_0_ --invariant=/tmp/878/inv_1_ --invariant=/tmp/878/inv_2_ --invariant=/tmp/878/inv_3_ --invariant=/tmp/878/inv_4_ --invariant=/tmp/878/inv_5_ --invariant=/tmp/878/inv_6_ --invariant=/tmp/878/inv_7_ --invariant=/tmp/878/inv_8_ --invariant=/tmp/878/inv_9_ --invariant=/tmp/878/inv_10_ --invariant=/tmp/878/inv_11_ --invariant=/tmp/878/inv_12_ --invariant=/tmp/878/inv_13_ --invariant=/tmp/878/inv_14_ --invariant=/tmp/878/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 5472380 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16103548 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="BusinessProcesses-PT-17"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-17, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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