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.r235-tall-167856421900525.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 smartxred
Input is LeafsetExtension-PT-S64C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C2-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S64C2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678666790974

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 00:19:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 00:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:19:52] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2023-03-13 00:19:53] [INFO ] Transformed 21462 places.
[2023-03-13 00:19:53] [INFO ] Transformed 21129 transitions.
[2023-03-13 00:19:53] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 702 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 00:19:55] [INFO ] Computed 333 place invariants in 2441 ms
Incomplete random walk after 10000 steps, including 552 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 16) seen :2
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :1
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :1
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
[2023-03-13 00:19:56] [INFO ] Invariant cache hit.
[2023-03-13 00:19:59] [INFO ] [Real]Absence check using 67 positive place invariants in 756 ms returned sat
[2023-03-13 00:20:00] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 620 ms returned sat
[2023-03-13 00:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:01] [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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 00:20:04] [INFO ] [Real]Absence check using 67 positive place invariants in 724 ms returned sat
[2023-03-13 00:20:04] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 601 ms returned sat
[2023-03-13 00:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:06] [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 1
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 00:20:09] [INFO ] [Real]Absence check using 67 positive place invariants in 717 ms returned sat
[2023-03-13 00:20:09] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 540 ms returned sat
[2023-03-13 00:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:11] [INFO ] [Real]Absence check using state equation in 1553 ms returned unknown
[2023-03-13 00:20:14] [INFO ] [Real]Absence check using 67 positive place invariants in 712 ms returned sat
[2023-03-13 00:20:15] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 648 ms returned sat
[2023-03-13 00:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:16] [INFO ] [Real]Absence check using state equation in 1459 ms returned unknown
[2023-03-13 00:20:19] [INFO ] [Real]Absence check using 67 positive place invariants in 738 ms returned sat
[2023-03-13 00:20:20] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 681 ms returned sat
[2023-03-13 00:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 00:20:24] [INFO ] [Real]Absence check using 67 positive place invariants in 716 ms returned sat
[2023-03-13 00:20:25] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 700 ms returned sat
[2023-03-13 00:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:26] [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 5
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 00:20:29] [INFO ] [Real]Absence check using 67 positive place invariants in 716 ms returned sat
[2023-03-13 00:20:30] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 698 ms returned sat
[2023-03-13 00:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 00:20:34] [INFO ] [Real]Absence check using 67 positive place invariants in 700 ms returned sat
[2023-03-13 00:20:35] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 692 ms returned sat
[2023-03-13 00:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 00:20:39] [INFO ] [Real]Absence check using 67 positive place invariants in 716 ms returned sat
[2023-03-13 00:20:40] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 581 ms returned sat
[2023-03-13 00:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:41] [INFO ] [Real]Absence check using state equation in 1517 ms returned unknown
[2023-03-13 00:20:44] [INFO ] [Real]Absence check using 67 positive place invariants in 714 ms returned sat
[2023-03-13 00:20:45] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 582 ms returned sat
[2023-03-13 00:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 00:20:46] [INFO ] [Real]Absence check using state equation in 1521 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 555 are kept as prefixes of interest. Removing 20907 places using SCC suffix rule.31 ms
Discarding 20907 places :
Also discarding 12278 output transitions
Drop transitions removed 12278 transitions
Drop transitions removed 4278 transitions
Reduce isomorphic transitions removed 4278 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 4438 rules applied. Total rules applied 4439 place count 554 transition count 4414
Reduce places removed 161 places and 0 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 1 with 166 rules applied. Total rules applied 4605 place count 393 transition count 4409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 4610 place count 388 transition count 4409
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4610 place count 388 transition count 4401
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 4626 place count 380 transition count 4401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4628 place count 379 transition count 4400
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4629 place count 379 transition count 4399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4630 place count 378 transition count 4399
Partial Free-agglomeration rule applied 153 times.
Drop transitions removed 153 transitions
Iterating global reduction 4 with 153 rules applied. Total rules applied 4783 place count 378 transition count 4399
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 4 with 4 rules applied. Total rules applied 4787 place count 374 transition count 4399
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4791 place count 374 transition count 4395
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 4795 place count 370 transition count 4395
Applied a total of 4795 rules in 633 ms. Remains 370 /21462 variables (removed 21092) and now considering 4395/21129 (removed 16734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 370/21462 places, 4395/21129 transitions.
Successfully produced net in file /tmp/petri1000_8559341171999502353.dot
Successfully produced net in file /tmp/petri1001_17948209087949468877.dot
Successfully produced net in file /tmp/petri1002_18026623159005287197.dot
Successfully produced net in file /tmp/petri1003_2169298112079210169.dot
Successfully produced net in file /tmp/petri1004_11747915131464392064.dot
Successfully produced net in file /tmp/petri1005_17221044732645215794.dot
Successfully produced net in file /tmp/petri1006_8597168931623656056.dot
Successfully produced net in file /tmp/petri1007_8472721823197097447.dot
Successfully produced net in file /tmp/petri1008_18142397662614680719.dot
Successfully produced net in file /tmp/petri1009_13226689337013277686.dot
Successfully produced net in file /tmp/petri1010_12169951076365290454.dot
Successfully produced net in file /tmp/petri1011_3345423312842771231.dot
Successfully produced net in file /tmp/petri1012_17596711126984123873.dot
Successfully produced net in file /tmp/petri1013_5244694726018045356.dot
Successfully produced net in file /tmp/petri1014_11995960875044226275.dot
Successfully produced net in file /tmp/petri1015_14135321770932038783.dot
Successfully produced net in file /tmp/petri1016_10806956840414472902.dot
Successfully produced net in file /tmp/petri1017_13394108898924529333.dot
Successfully produced net in file /tmp/petri1018_428789934124970888.dot
Successfully produced net in file /tmp/petri1019_8810185161318352661.dot
Successfully produced net in file /tmp/petri1020_2237557447937844765.dot
Successfully produced net in file /tmp/petri1021_511533168026853556.dot
Successfully produced net in file /tmp/petri1022_9270997864435685077.dot
Successfully produced net in file /tmp/petri1023_8370763682406172261.dot
Successfully produced net in file /tmp/petri1024_1120112441611325589.dot
Successfully produced net in file /tmp/petri1025_3213149673946250947.dot
Successfully produced net in file /tmp/petri1026_5649492460818055424.dot
Successfully produced net in file /tmp/petri1027_2614767071338627557.dot
Successfully produced net in file /tmp/petri1028_643176117456178401.dot
Successfully produced net in file /tmp/petri1029_2219561773645941430.dot
Successfully produced net in file /tmp/petri1030_4250043228751636225.dot
Successfully produced net in file /tmp/petri1031_4824335357695108985.dot
Successfully produced net in file /tmp/petri1032_17658649834375136391.dot
Successfully produced net in file /tmp/petri1033_12536867580362724214.dot
Successfully produced net in file /tmp/petri1034_14657306611002451002.dot
Successfully produced net in file /tmp/petri1035_14172058707721194405.dot
Successfully produced net in file /tmp/petri1036_567930057683642090.dot
Successfully produced net in file /tmp/petri1037_17868464665624994724.dot
Successfully produced net in file /tmp/petri1038_15054868400066040537.dot
Successfully produced net in file /tmp/petri1039_9710293436611252755.dot
Successfully produced net in file /tmp/petri1040_7344590550438023689.dot
Successfully produced net in file /tmp/petri1041_12450689407982180211.dot
Successfully produced net in file /tmp/petri1042_4293112075473305966.dot
Successfully produced net in file /tmp/petri1043_15653709072568092018.dot
Successfully produced net in file /tmp/petri1044_1472904260319479434.dot
Successfully produced net in file /tmp/petri1045_1571053597893385344.dot
Successfully produced net in file /tmp/petri1046_7242730329845981452.dot
Successfully produced net in file /tmp/petri1047_10037046477663154747.dot
Successfully produced net in file /tmp/petri1048_17741824192323594138.dot
Successfully produced net in file /tmp/petri1049_5534320614716639389.dot
Successfully produced net in file /tmp/petri1050_62120024936128230.dot
Successfully produced net in file /tmp/petri1051_11797309434168264388.dot
Successfully produced net in file /tmp/petri1052_11230243139793571759.dot
Successfully produced net in file /tmp/petri1053_12376870404610663164.dot
Successfully produced net in file /tmp/petri1054_14848864053529166286.dot
Successfully produced net in file /tmp/petri1055_287279197409159495.dot
Successfully produced net in file /tmp/petri1056_11440120892887214096.dot
Successfully produced net in file /tmp/petri1057_9304127488476753749.dot
Successfully produced net in file /tmp/petri1058_5999728167864429790.dot
Successfully produced net in file /tmp/petri1059_3237453196412647647.dot
Successfully produced net in file /tmp/petri1060_8519394515969739995.dot
Successfully produced net in file /tmp/petri1061_8465980873070022318.dot
Successfully produced net in file /tmp/petri1062_3369455040306877254.dot
Successfully produced net in file /tmp/petri1063_1864776445896863472.dot
Successfully produced net in file /tmp/petri1064_2697736974578543671.dot
Successfully produced net in file /tmp/petri1065_10516270479567432633.dot
Successfully produced net in file /tmp/petri1066_13589628925220084376.dot
Successfully produced net in file /tmp/petri1067_14653480428517760389.dot
Successfully produced net in file /tmp/petri1068_17689940621968782867.dot
Successfully produced net in file /tmp/petri1069_13693057828023319829.dot
Successfully produced net in file /tmp/petri1070_12156752121398714286.dot
Successfully produced net in file /tmp/petri1071_8316409350497710020.dot
Successfully produced net in file /tmp/petri1072_7481222948981933774.dot
Successfully produced net in file /tmp/petri1073_11466191553892592503.dot
Successfully produced net in file /tmp/petri1074_2994102482793629762.dot
Successfully produced net in file /tmp/petri1075_9301432047878565324.dot
Successfully produced net in file /tmp/petri1076_14634451218438986903.dot
Successfully produced net in file /tmp/petri1077_17007189131347940001.dot
Successfully produced net in file /tmp/petri1078_13068152853055245562.dot
Successfully produced net in file /tmp/petri1079_5614120956516206842.dot
Successfully produced net in file /tmp/petri1080_8531122736914858017.dot
Successfully produced net in file /tmp/petri1081_4655259029093977846.dot
Successfully produced net in file /tmp/petri1082_8721283265162520135.dot
Successfully produced net in file /tmp/petri1083_17699300673107416242.dot
Successfully produced net in file /tmp/petri1084_3328597694065272160.dot
Successfully produced net in file /tmp/petri1085_11570063344755394591.dot
Successfully produced net in file /tmp/petri1086_5081606943380606041.dot
Successfully produced net in file /tmp/petri1087_10037250607910236930.dot
Successfully produced net in file /tmp/petri1088_669851575749792128.dot
Successfully produced net in file /tmp/petri1089_15353665222689828610.dot
Successfully produced net in file /tmp/petri1090_12195180838323181646.dot
Successfully produced net in file /tmp/petri1091_6258425801751225332.dot
Successfully produced net in file /tmp/petri1092_6461037170202803565.dot
Successfully produced net in file /tmp/petri1093_281204612829632260.dot
Successfully produced net in file /tmp/petri1094_6179316044669754250.dot
Successfully produced net in file /tmp/petri1095_16828575616562428362.dot
Successfully produced net in file /tmp/petri1096_4470724655824763327.dot
Successfully produced net in file /tmp/petri1097_12177082629162923469.dot
Successfully produced net in file /tmp/petri1098_14873111320739903789.dot
Successfully produced net in file /tmp/petri1099_3118956543950675501.dot
Successfully produced net in file /tmp/petri1100_8739846949411444683.dot
Successfully produced net in file /tmp/petri1101_15179996660779776595.dot
Successfully produced net in file /tmp/petri1102_2628472923052144696.dot
Successfully produced net in file /tmp/petri1103_6832296199831880846.dot
Successfully produced net in file /tmp/petri1104_9967446313439626331.dot
Successfully produced net in file /tmp/petri1105_9932502661011037733.dot
Successfully produced net in file /tmp/petri1106_1169545185895993706.dot
Successfully produced net in file /tmp/petri1107_16830478840104415074.dot
Successfully produced net in file /tmp/petri1108_5432206614298897440.dot
Successfully produced net in file /tmp/petri1109_3425050115989529787.dot
Successfully produced net in file /tmp/petri1110_4846613114754500142.dot
Successfully produced net in file /tmp/petri1111_7777886945753844889.dot
Successfully produced net in file /tmp/petri1112_18410177930460746772.dot
Successfully produced net in file /tmp/petri1113_14614650100788238610.dot
Successfully produced net in file /tmp/petri1114_9705181357938210948.dot
Successfully produced net in file /tmp/petri1115_8606662872721271628.dot
Successfully produced net in file /tmp/petri1116_8070025282920128124.dot
Successfully produced net in file /tmp/petri1117_10301945320163221565.dot
Successfully produced net in file /tmp/petri1118_12450341878708274091.dot
Successfully produced net in file /tmp/petri1119_16014482418155718173.dot
Successfully produced net in file /tmp/petri1120_16025529547723262764.dot
Successfully produced net in file /tmp/petri1121_5390282375188014101.dot
Successfully produced net in file /tmp/petri1122_13634778447332142109.dot
Successfully produced net in file /tmp/petri1123_944378077006603986.dot
Drop transitions removed 124 transitions
Dominated transitions for bounds rules discarded 124 transitions
Normalized transition count is 340 out of 4271 initially.
// Phase 1: matrix 340 rows 370 cols
[2023-03-13 00:20:47] [INFO ] Computed 33 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 196652 resets, run finished after 6713 ms. (steps per millisecond=148 ) properties (out of 10) seen :10
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 62126 ms.
ITS solved all properties within timeout

BK_STOP 1678666855347

--------------------
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="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is LeafsetExtension-PT-S64C2, 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 r235-tall-167856421900525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C2.tgz
mv LeafsetExtension-PT-S64C2 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 ;