Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 39M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678749974649

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:26:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 23:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:26:17] [INFO ] Load time of PNML (sax parser for PT used): 786 ms
[2023-03-13 23:26:17] [INFO ] Transformed 13764 places.
[2023-03-13 23:26:17] [INFO ] Transformed 38880 transitions.
[2023-03-13 23:26:17] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1002 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 757 ms. (steps per millisecond=13 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 38880 rows 13764 cols
[2023-03-13 23:26:28] [INFO ] Computed 83 place invariants in 9722 ms
[2023-03-13 23:26:33] [INFO ] After 4882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 23:26:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 198 ms returned sat
[2023-03-13 23:26:38] [INFO ] [Nat]Absence check using 81 positive and 2 generalized place invariants in 335 ms returned sat
[2023-03-13 23:26:58] [INFO ] After 16719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 23:26:58] [INFO ] State equation strengthened by 12720 read => feed constraints.
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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:26:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:26:58] [INFO ] After 25204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 249 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.44 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 13763 transition count 38367
Reduce places removed 513 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 528 rules applied. Total rules applied 1042 place count 13250 transition count 38352
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1057 place count 13235 transition count 38352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1057 place count 13235 transition count 38344
Deduced a syphon composed of 8 places in 16 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1073 place count 13227 transition count 38344
Performed 6108 Post agglomeration using F-continuation condition.Transition count delta: 6108
Deduced a syphon composed of 6108 places in 38 ms
Reduce places removed 6108 places and 0 transitions.
Iterating global reduction 3 with 12216 rules applied. Total rules applied 13289 place count 7119 transition count 32236
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 13298 place count 7119 transition count 32227
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 13307 place count 7110 transition count 32227
Partial Free-agglomeration rule applied 6621 times.
Drop transitions removed 6621 transitions
Iterating global reduction 4 with 6621 rules applied. Total rules applied 19928 place count 7110 transition count 32227
Partial Free-agglomeration rule applied 717 times.
Drop transitions removed 717 transitions
Iterating global reduction 4 with 717 rules applied. Total rules applied 20645 place count 7110 transition count 32227
Applied a total of 20645 rules in 17624 ms. Remains 7110 /13764 variables (removed 6654) and now considering 32227/38880 (removed 6653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17630 ms. Remains : 7110/13764 places, 32227/38880 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 14) seen :3
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-13 23:27:17] [INFO ] Flow matrix only has 32134 transitions (discarded 93 similar events)
// Phase 1: matrix 32134 rows 7110 cols
[2023-03-13 23:27:19] [INFO ] Computed 82 place invariants in 2448 ms
[2023-03-13 23:27:22] [INFO ] After 2295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 23:27:24] [INFO ] [Nat]Absence check using 80 positive place invariants in 134 ms returned sat
[2023-03-13 23:27:24] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 160 ms returned sat
[2023-03-13 23:27:47] [INFO ] After 21051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 23:27:47] [INFO ] State equation strengthened by 30587 read => feed constraints.
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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:27:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:27:47] [INFO ] After 25366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 215 out of 7110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7110/7110 places, 32227/32227 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7110 transition count 32226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7109 transition count 32226
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 14 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 44 place count 7088 transition count 32205
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 7088 transition count 32205
Applied a total of 56 rules in 7856 ms. Remains 7088 /7110 variables (removed 22) and now considering 32205/32227 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7857 ms. Remains : 7088/7110 places, 32205/32227 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 11) seen :5
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 23:27:56] [INFO ] Flow matrix only has 32123 transitions (discarded 82 similar events)
// Phase 1: matrix 32123 rows 7088 cols
[2023-03-13 23:27:58] [INFO ] Computed 82 place invariants in 2169 ms
[2023-03-13 23:28:00] [INFO ] [Real]Absence check using 80 positive place invariants in 110 ms returned sat
[2023-03-13 23:28:00] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 135 ms returned sat
[2023-03-13 23:28:00] [INFO ] After 1978ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 23:28:01] [INFO ] [Nat]Absence check using 80 positive place invariants in 76 ms returned sat
[2023-03-13 23:28:02] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 129 ms returned sat
[2023-03-13 23:28:19] [INFO ] After 16844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 23:28:20] [INFO ] State equation strengthened by 30805 read => feed constraints.
[2023-03-13 23:28:25] [INFO ] After 5210ms SMT Verify possible using 30805 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 23:28:25] [INFO ] After 5212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-13 23:28:25] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 139 out of 7088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7088/7088 places, 32205/32205 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 0 with 2 rules applied. Total rules applied 2 place count 7088 transition count 32203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7086 transition count 32203
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 10 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 90 place count 7043 transition count 32160
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 2 with 33 rules applied. Total rules applied 123 place count 7043 transition count 32160
Applied a total of 123 rules in 7838 ms. Remains 7043 /7088 variables (removed 45) and now considering 32160/32205 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7838 ms. Remains : 7043/7088 places, 32160/32205 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 6) seen :2
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 23:28:33] [INFO ] Flow matrix only has 32108 transitions (discarded 52 similar events)
// Phase 1: matrix 32108 rows 7043 cols
[2023-03-13 23:28:36] [INFO ] Computed 82 place invariants in 2290 ms
[2023-03-13 23:28:37] [INFO ] After 1307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 23:28:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 108 ms returned sat
[2023-03-13 23:28:39] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 130 ms returned sat
[2023-03-13 23:28:57] [INFO ] After 17639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 23:28:57] [INFO ] State equation strengthened by 31266 read => feed constraints.
[2023-03-13 23:29:02] [INFO ] After 5098ms SMT Verify possible using 31266 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 23:29:02] [INFO ] After 5104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-13 23:29:02] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 124 out of 7043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7043/7043 places, 32160/32160 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7043 transition count 32159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7042 transition count 32159
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 7032 transition count 32149
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 7032 transition count 32149
Applied a total of 27 rules in 7231 ms. Remains 7032 /7043 variables (removed 11) and now considering 32149/32160 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7231 ms. Remains : 7032/7043 places, 32149/32160 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 23:29:10] [INFO ] Flow matrix only has 32102 transitions (discarded 47 similar events)
// Phase 1: matrix 32102 rows 7032 cols
[2023-03-13 23:29:12] [INFO ] Computed 82 place invariants in 2335 ms
[2023-03-13 23:29:13] [INFO ] After 1139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 23:29:15] [INFO ] [Nat]Absence check using 80 positive place invariants in 106 ms returned sat
[2023-03-13 23:29:15] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 128 ms returned sat
[2023-03-13 23:29:31] [INFO ] After 16362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 23:29:32] [INFO ] State equation strengthened by 31374 read => feed constraints.
[2023-03-13 23:29:39] [INFO ] After 6719ms SMT Verify possible using 31374 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 23:29:39] [INFO ] After 6721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 23:29:39] [INFO ] After 25175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 123 out of 7032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7032/7032 places, 32149/32149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7031 transition count 32148
Applied a total of 2 rules in 4849 ms. Remains 7031 /7032 variables (removed 1) and now considering 32148/32149 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4850 ms. Remains : 7031/7032 places, 32148/32149 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81263 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81263 steps, saw 74798 distinct states, run finished after 3004 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 23:29:47] [INFO ] Flow matrix only has 32101 transitions (discarded 47 similar events)
// Phase 1: matrix 32101 rows 7031 cols
[2023-03-13 23:29:49] [INFO ] Computed 82 place invariants in 2132 ms
[2023-03-13 23:29:50] [INFO ] After 1221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 23:29:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 103 ms returned sat
[2023-03-13 23:29:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 129 ms returned sat
[2023-03-13 23:30:09] [INFO ] After 16505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 23:30:09] [INFO ] State equation strengthened by 31376 read => feed constraints.
[2023-03-13 23:30:15] [INFO ] After 6390ms SMT Verify possible using 31376 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 23:30:15] [INFO ] After 6392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-13 23:30:15] [INFO ] After 25100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 123 out of 7031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7031/7031 places, 32148/32148 transitions.
Applied a total of 0 rules in 2579 ms. Remains 7031 /7031 variables (removed 0) and now considering 32148/32148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2580 ms. Remains : 7031/7031 places, 32148/32148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7031/7031 places, 32148/32148 transitions.
Applied a total of 0 rules in 2427 ms. Remains 7031 /7031 variables (removed 0) and now considering 32148/32148 (removed 0) transitions.
[2023-03-13 23:30:20] [INFO ] Flow matrix only has 32101 transitions (discarded 47 similar events)
[2023-03-13 23:30:21] [INFO ] Invariant cache hit.
[2023-03-13 23:30:26] [INFO ] Implicit Places using invariants in 5327 ms returned []
Implicit Place search using SMT only with invariants took 5332 ms to find 0 implicit places.
[2023-03-13 23:30:26] [INFO ] Flow matrix only has 32101 transitions (discarded 47 similar events)
[2023-03-13 23:30:26] [INFO ] Invariant cache hit.
[2023-03-13 23:30:27] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8451 ms. Remains : 7031/7031 places, 32148/32148 transitions.
Graph (trivial) has 30775 edges and 7031 vertex of which 6340 / 7031 are part of one of the 2 SCC in 13 ms
Free SCC test removed 6338 places
Drop transitions removed 23796 transitions
Ensure Unique test removed 6477 transitions
Reduce isomorphic transitions removed 30273 transitions.
Graph (complete) has 2362 edges and 693 vertex of which 462 are kept as prefixes of interest. Removing 231 places using SCC suffix rule.1 ms
Discarding 231 places :
Also discarding 75 output transitions
Drop transitions removed 75 transitions
Drop transitions removed 385 transitions
Reduce isomorphic transitions removed 385 transitions.
Iterating post reduction 0 with 385 rules applied. Total rules applied 387 place count 462 transition count 1415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 387 place count 462 transition count 1413
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 391 place count 460 transition count 1413
Discarding 291 places :
Symmetric choice reduction at 1 with 291 rule applications. Total rules 682 place count 169 transition count 678
Iterating global reduction 1 with 291 rules applied. Total rules applied 973 place count 169 transition count 678
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Iterating post reduction 1 with 222 rules applied. Total rules applied 1195 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1199 place count 167 transition count 454
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 2 with 2 rules applied. Total rules applied 1201 place count 166 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1202 place count 166 transition count 452
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 1218 place count 166 transition count 436
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1224 place count 163 transition count 433
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1226 place count 163 transition count 431
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1228 place count 163 transition count 429
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 1231 place count 163 transition count 426
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1236 place count 160 transition count 424
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1245 place count 160 transition count 424
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1250 place count 160 transition count 419
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1251 place count 159 transition count 417
Iterating global reduction 6 with 1 rules applied. Total rules applied 1252 place count 159 transition count 417
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1254 place count 157 transition count 415
Applied a total of 1254 rules in 441 ms. Remains 157 /7031 variables (removed 6874) and now considering 415/32148 (removed 31733) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 415 rows 157 cols
[2023-03-13 23:30:27] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 23:30:27] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 23:30:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 23:30:27] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 23:30:27] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-13 23:30:28] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 23:30:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-13 23:30:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7031 places, 32148 transitions and 128023 arcs took 147 ms.
[2023-03-13 23:30:29] [INFO ] Flatten gal took : 1053 ms
Total runtime 253238 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 7031 NrTr: 32148 NrArc: 128023)

parse formulas
formulas created successfully
place and transition orderings generation:0m52.583sec

net check time: 0m 0.029sec

init dd package: 0m 3.351sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 8418296 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16034372 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 2.995sec

108039 422889

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="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CANInsertWithFailure-PT-080, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696200766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;