fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695200009
Last Updated
May 14, 2023

About the Execution of Marcie+red for BridgeAndVehicles-COL-V10P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7259.128 86213.00 99838.00 96.20 TTFFFFFFFTFTFFFF normal

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-167813695200009.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 BridgeAndVehicles-COL-V10P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695200009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 25 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 38K 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 BridgeAndVehicles-COL-V10P10N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678688538723

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:22:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:22:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 06:22:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 06:22:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 561 ms
[2023-03-13 06:22:21] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:22:21] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2023-03-13 06:22:21] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 80) seen :28
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 48) seen :0
Running SMT prover for 48 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-13 06:22:22] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-13 06:22:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:22] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :27 sat :0 real:21
[2023-03-13 06:22:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:22] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :47 sat :1
[2023-03-13 06:22:22] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :47 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 06:22:22] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :47 sat :1
Fused 48 Parikh solutions to 1 different solutions.
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 47 atomic propositions for a total of 15 simplifications.
[2023-03-13 06:22:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 06:22:23] [INFO ] Flatten gal took : 56 ms
[2023-03-13 06:22:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 06:22:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:22:23] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-13 06:22:23] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 20 ms.
[2023-03-13 06:22:23] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 15 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-13 06:22:23] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2023-03-13 06:22:23] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-13 06:22:23] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
[2023-03-13 06:22:23] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-13 06:22:23] [INFO ] Invariant cache hit.
[2023-03-13 06:22:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-13 06:22:23] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-13 06:22:23] [INFO ] Invariant cache hit.
[2023-03-13 06:22:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 06:22:23] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-13 06:22:23] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-13 06:22:23] [INFO ] Invariant cache hit.
[2023-03-13 06:22:23] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 48/48 places, 288/288 transitions.
Support contains 15 out of 48 places after structural reductions.
[2023-03-13 06:22:23] [INFO ] Flatten gal took : 25 ms
[2023-03-13 06:22:23] [INFO ] Flatten gal took : 31 ms
[2023-03-13 06:22:23] [INFO ] Input system was already deterministic with 288 transitions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 38) seen :16
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 06:22:24] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-13 06:22:24] [INFO ] Invariant cache hit.
[2023-03-13 06:22:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:24] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:5
[2023-03-13 06:22:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 06:22:24] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0
Fused 20 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 20 atomic propositions for a total of 9 simplifications.
[2023-03-13 06:22:24] [INFO ] Flatten gal took : 20 ms
[2023-03-13 06:22:24] [INFO ] Flatten gal took : 21 ms
[2023-03-13 06:22:24] [INFO ] Input system was already deterministic with 288 transitions.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 44 stable transitions
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 28 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-13 06:22:24] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-13 06:22:24] [INFO ] Invariant cache hit.
[2023-03-13 06:22:24] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 149 ms. Remains : 48/48 places, 288/288 transitions.
[2023-03-13 06:22:24] [INFO ] Flatten gal took : 19 ms
[2023-03-13 06:22:24] [INFO ] Flatten gal took : 20 ms
[2023-03-13 06:22:24] [INFO ] Input system was already deterministic with 288 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 8 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-13 06:22:24] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-13 06:22:24] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 06:22:24] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 45/48 places, 287/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 12 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 6 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-13 06:22:25] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-13 06:22:25] [INFO ] Invariant cache hit.
[2023-03-13 06:22:25] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 45/48 places, 287/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 17 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 16 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 286
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 0 with 4 rules applied. Total rules applied 10 place count 41 transition count 284
Applied a total of 10 rules in 37 ms. Remains 41 /48 variables (removed 7) and now considering 284/288 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 41/48 places, 284/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 286
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 0 with 4 rules applied. Total rules applied 10 place count 41 transition count 284
Applied a total of 10 rules in 25 ms. Remains 41 /48 variables (removed 7) and now considering 284/288 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 41/48 places, 284/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-13 06:22:25] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2023-03-13 06:22:25] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-13 06:22:25] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 48/48 places, 288/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 11 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2023-03-13 06:22:25] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2023-03-13 06:22:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 06:22:25] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 47/48 places, 288/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 17 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 2 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2023-03-13 06:22:25] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2023-03-13 06:22:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:25] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 46/48 places, 288/288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:22:25] [INFO ] Input system was already deterministic with 288 transitions.
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:22:25] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 06:22:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 288 transitions and 2090 arcs took 4 ms.
Total runtime 5446 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 48 NrTr: 288 NrArc: 2090)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 3.601sec


RS generation: 0m 2.512sec


-> reachability set: #nodes 44410 (4.4e+04) #states 259,556 (5)



starting MCC model checker
--------------------------

checking: EG [EX [0<=0]]
normalized: EG [EX [0<=0]]

abstracting: (0<=0)
states: 259,556 (5)
...............................................................................................................................................
EG iterations: 142
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.284sec

checking: EG [EX [0<=0]]
normalized: EG [EX [0<=0]]

abstracting: (0<=0)
states: 259,556 (5)
...............................................................................................................................................
EG iterations: 142
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: AG [EF [EG [7<=p28]]]
normalized: ~ [E [true U ~ [E [true U EG [7<=p28]]]]]

abstracting: (7<=p28)
states: 22,022 (4)
.........................................................
EG iterations: 57
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.961sec

checking: EX [~ [p27<=9]]
normalized: EX [~ [p27<=9]]

abstracting: (p27<=9)
states: 259,424 (5)
.-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EF [AG [~ [p29<=sum(p32, p31)]]]
normalized: E [true U ~ [E [true U p29<=sum(p32, p31)]]]

abstracting: (p29<=sum(p32, p31))
states: 80,556 (4)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.641sec

checking: E [EG [EX [EX [p13<=p12]]] U [~ [p15<=p29] & ~ [EX [~ [1<=sum(p47, p46)]]]]]
normalized: E [EG [EX [EX [p13<=p12]]] U [~ [EX [~ [1<=sum(p47, p46)]]] & ~ [p15<=p29]]]

abstracting: (p15<=p29)
states: 218,614 (5)
abstracting: (1<=sum(p47, p46))
states: 30,602 (4)
.abstracting: (p13<=p12)
states: 172,071 (5)
..........................................................................................................
EG iterations: 104
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.741sec

checking: E [[AG [~ [EF [[p30<=p13 & 1<=sum(p47, p46)]]]] & [AG [AX [1<=0]] & [p28<=1 | [82<=sum(p32, p31) | [p13<=62 & 42<=p12]]]]] U [EX [sum(p34, p33)<=p30] & [E [p29<=6 U AX [1<=0]] | [~ [AX [p28<=p30]] | ~ [EF [p30<=1]]]]]]
normalized: E [[[[p28<=1 | [82<=sum(p32, p31) | [p13<=62 & 42<=p12]]] & ~ [E [true U EX [~ [1<=0]]]]] & ~ [E [true U E [true U [p30<=p13 & 1<=sum(p47, p46)]]]]] U [[[~ [E [true U p30<=1]] | EX [~ [p28<=p30]]] | E [p29<=6 U ~ [EX [~ [1<=0]]]]] & EX [sum(p34, p33)<=p30]]]

abstracting: (sum(p34, p33)<=p30)
states: 252,119 (5)
.abstracting: (1<=0)
states: 0
.abstracting: (p29<=6)
states: 239,055 (5)
abstracting: (p28<=p30)
states: 170,181 (5)
.abstracting: (p30<=1)
states: 58,942 (4)
abstracting: (1<=sum(p47, p46))
states: 30,602 (4)
abstracting: (p30<=p13)
states: 108,618 (5)
abstracting: (1<=0)
states: 0
.abstracting: (42<=p12)
states: 0
abstracting: (p13<=62)
states: 259,556 (5)
abstracting: (82<=sum(p32, p31))
states: 0
abstracting: (p28<=1)
states: 104,489 (5)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.503sec

totally nodes used: 23643931 (2.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23203509 127777118 150980627
used/not used/entry size/cache size: 58671271 8437593 16 1024MB
basic ops cache: hits/miss/sum: 6368702 11123836 17492538
used/not used/entry size/cache size: 12636860 4140356 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 38 38
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 78951 205987 284938
used/not used/entry size/cache size: 203484 8185124 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 49022141
1 13777877
2 3369788
3 750038
4 142876
5 26702
6 8061
7 3270
8 1962
9 1563
>= 10 4586

Total processing time: 1m18.647sec


BK_STOP 1678688624936

--------------------
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 CTLCardinality -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 0.000sec

25083
iterations count:163009 (566), effective:2850 (9)

initing FirstDep: 0m 0.001sec


iterations count:288 (1), effective:0 (0)
42918
iterations count:182365 (633), effective:1764 (6)

iterations count:288 (1), effective:0 (0)
22812 35585
iterations count:299777 (1040), effective:3325 (11)

iterations count:288 (1), effective:0 (0)
36362
iterations count:169379 (588), effective:1242 (4)

iterations count:288 (1), effective:0 (0)

iterations count:288 (1), effective:0 (0)

iterations count:288 (1), effective:0 (0)

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="BridgeAndVehicles-COL-V10P10N10"
export BK_EXAMINATION="CTLCardinality"
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 BridgeAndVehicles-COL-V10P10N10, examination is CTLCardinality"
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-167813695200009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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