Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814480700069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CloudReconfiguration-PT-309, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678257868052

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-309
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 06:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 06:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:44:29] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-08 06:44:29] [INFO ] Transformed 2585 places.
[2023-03-08 06:44:29] [INFO ] Transformed 3095 transitions.
[2023-03-08 06:44:29] [INFO ] Found NUPN structural information;
[2023-03-08 06:44:29] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
FORMULA CloudReconfiguration-PT-309-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-08 06:44:30] [INFO ] Computed 4 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 69 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-309-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-309-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
[2023-03-08 06:44:30] [INFO ] Invariant cache hit.
[2023-03-08 06:44:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:32] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2023-03-08 06:44:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:44:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 06:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:34] [INFO ] [Nat]Absence check using state equation in 1305 ms returned sat
[2023-03-08 06:44:34] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-08 06:44:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 06:44:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:39] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-08 06:44:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:44:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 06:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:40] [INFO ] [Nat]Absence check using state equation in 1290 ms returned sat
[2023-03-08 06:44:41] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-08 06:44:44] [INFO ] Added : 125 causal constraints over 25 iterations in 3218 ms. Result :unknown
[2023-03-08 06:44:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:45] [INFO ] [Real]Absence check using state equation in 1251 ms returned sat
[2023-03-08 06:44:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:44:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:48] [INFO ] [Nat]Absence check using state equation in 1793 ms returned sat
[2023-03-08 06:44:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-08 06:44:51] [INFO ] Added : 100 causal constraints over 20 iterations in 2770 ms. Result :unknown
[2023-03-08 06:44:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:52] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2023-03-08 06:44:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:44:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2023-03-08 06:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:54] [INFO ] [Nat]Absence check using state equation in 1208 ms returned sat
[2023-03-08 06:44:54] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-08 06:44:57] [INFO ] Added : 120 causal constraints over 24 iterations in 3219 ms. Result :unknown
[2023-03-08 06:44:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:44:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:44:59] [INFO ] [Real]Absence check using state equation in 1244 ms returned sat
[2023-03-08 06:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:01] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2023-03-08 06:45:01] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-08 06:45:04] [INFO ] Added : 125 causal constraints over 25 iterations in 3330 ms. Result :unknown
[2023-03-08 06:45:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:06] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2023-03-08 06:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:08] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-08 06:45:08] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-08 06:45:11] [INFO ] Added : 125 causal constraints over 25 iterations in 3379 ms. Result :unknown
[2023-03-08 06:45:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:13] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2023-03-08 06:45:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:14] [INFO ] [Nat]Absence check using state equation in 1219 ms returned sat
[2023-03-08 06:45:15] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 158 ms.
[2023-03-08 06:45:18] [INFO ] Added : 120 causal constraints over 24 iterations in 3329 ms. Result :unknown
[2023-03-08 06:45:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:19] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2023-03-08 06:45:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:21] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2023-03-08 06:45:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 154 ms.
[2023-03-08 06:45:25] [INFO ] Added : 115 causal constraints over 23 iterations in 3201 ms. Result :unknown
[2023-03-08 06:45:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:26] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2023-03-08 06:45:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:28] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2023-03-08 06:45:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 145 ms.
[2023-03-08 06:45:31] [INFO ] Added : 120 causal constraints over 24 iterations in 3235 ms. Result :unknown
[2023-03-08 06:45:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:33] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2023-03-08 06:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:35] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2023-03-08 06:45:35] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-08 06:45:38] [INFO ] Added : 117 causal constraints over 24 iterations in 3386 ms. Result :unknown
[2023-03-08 06:45:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:40] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-08 06:45:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:41] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2023-03-08 06:45:41] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 151 ms.
[2023-03-08 06:45:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 06:45:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:46] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2023-03-08 06:45:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:48] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2023-03-08 06:45:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-08 06:45:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 06:45:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:53] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2023-03-08 06:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:45:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:45:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:45:55] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2023-03-08 06:45:55] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-08 06:45:58] [INFO ] Added : 125 causal constraints over 25 iterations in 3390 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-309-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2933 edges and 2585 vertex of which 852 / 2585 are part of one of the 63 SCC in 15 ms
Free SCC test removed 789 places
Drop transitions removed 962 transitions
Reduce isomorphic transitions removed 962 transitions.
Graph (complete) has 2413 edges and 1796 vertex of which 1782 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1204 rules applied. Total rules applied 1206 place count 1782 transition count 920
Reduce places removed 1195 places and 0 transitions.
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 1326 rules applied. Total rules applied 2532 place count 587 transition count 789
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 67 rules applied. Total rules applied 2599 place count 529 transition count 780
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 2605 place count 526 transition count 777
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 4 rules applied. Total rules applied 2609 place count 524 transition count 775
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 8 rules applied. Total rules applied 2617 place count 523 transition count 768
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2626 place count 516 transition count 766
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2626 place count 516 transition count 743
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2672 place count 493 transition count 743
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2750 place count 415 transition count 665
Iterating global reduction 7 with 78 rules applied. Total rules applied 2828 place count 415 transition count 665
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2828 place count 415 transition count 656
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2846 place count 406 transition count 656
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 2907 place count 345 transition count 595
Iterating global reduction 7 with 61 rules applied. Total rules applied 2968 place count 345 transition count 595
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 35 rules applied. Total rules applied 3003 place count 345 transition count 560
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3030 place count 328 transition count 550
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 3036 place count 323 transition count 549
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3038 place count 322 transition count 548
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3059 place count 301 transition count 515
Iterating global reduction 11 with 21 rules applied. Total rules applied 3080 place count 301 transition count 515
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3089 place count 301 transition count 506
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3098 place count 292 transition count 488
Iterating global reduction 12 with 9 rules applied. Total rules applied 3107 place count 292 transition count 488
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3110 place count 289 transition count 482
Iterating global reduction 12 with 3 rules applied. Total rules applied 3113 place count 289 transition count 482
Performed 149 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 12 with 298 rules applied. Total rules applied 3411 place count 140 transition count 255
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3414 place count 140 transition count 252
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3420 place count 137 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3426 place count 137 transition count 243
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3432 place count 134 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3438 place count 134 transition count 234
Performed 38 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 15 with 76 rules applied. Total rules applied 3514 place count 96 transition count 274
Drop transitions removed 10 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 15 with 38 rules applied. Total rules applied 3552 place count 96 transition count 236
Discarding 21 places :
Symmetric choice reduction at 16 with 21 rule applications. Total rules 3573 place count 75 transition count 201
Iterating global reduction 16 with 21 rules applied. Total rules applied 3594 place count 75 transition count 201
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 3606 place count 75 transition count 189
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 3610 place count 71 transition count 181
Iterating global reduction 17 with 4 rules applied. Total rules applied 3614 place count 71 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 3617 place count 71 transition count 178
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 18 with 23 rules applied. Total rules applied 3640 place count 71 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 3642 place count 70 transition count 154
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3646 place count 70 transition count 150
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3651 place count 66 transition count 149
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3653 place count 66 transition count 149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3654 place count 66 transition count 148
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3655 place count 65 transition count 147
Iterating global reduction 19 with 1 rules applied. Total rules applied 3656 place count 65 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3657 place count 64 transition count 146
Applied a total of 3657 rules in 291 ms. Remains 64 /2585 variables (removed 2521) and now considering 146/3095 (removed 2949) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 64/2585 places, 146/3095 transitions.
Normalized transition count is 138 out of 146 initially.
// Phase 1: matrix 138 rows 64 cols
[2023-03-08 06:45:59] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 12191 resets, run finished after 1029 ms. (steps per millisecond=971 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-309-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-309-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 90520 ms.
ITS solved all properties within timeout

BK_STOP 1678257961467

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

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="CloudReconfiguration-PT-309"
export BK_EXAMINATION="UpperBounds"
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 CloudReconfiguration-PT-309, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814480700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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