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.r330-tall-167889203700753.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 marciexred
Input is ResAllocation-PT-R020C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:23 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 ResAllocation-PT-R020C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679181759906

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=ResAllocation-PT-R020C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:22:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:22:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:22:41] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-18 23:22:41] [INFO ] Transformed 80 places.
[2023-03-18 23:22:41] [INFO ] Transformed 42 transitions.
[2023-03-18 23:22:41] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 74 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 80 cols
[2023-03-18 23:22:41] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-18 23:22:41] [INFO ] Implicit Places using invariants in 175 ms returned [59, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/80 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 78/80 places, 42/42 transitions.
Support contains 74 out of 78 places after structural reductions.
[2023-03-18 23:22:42] [INFO ] Flatten gal took : 23 ms
[2023-03-18 23:22:42] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:22:42] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 109) seen :67
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) 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 42) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 42 rows 78 cols
[2023-03-18 23:22:42] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-18 23:22:43] [INFO ] [Real]Absence check using 38 positive place invariants in 5 ms returned sat
[2023-03-18 23:22:43] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:30
[2023-03-18 23:22:43] [INFO ] [Nat]Absence check using 38 positive place invariants in 6 ms returned sat
[2023-03-18 23:22:43] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :31 sat :3
[2023-03-18 23:22:43] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :31 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:22:43] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :31 sat :3
Fused 34 Parikh solutions to 2 different solutions.
Finished Parikh walk after 55 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 2 ms.
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R020C002-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:22:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:22:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R020C002-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 49 out of 78 places (down from 60) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 42/42 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 41
Applied a total of 2 rules in 10 ms. Remains 77 /78 variables (removed 1) and now considering 41/42 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 77/78 places, 41/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 42/42 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 75 transition count 40
Applied a total of 5 rules in 6 ms. Remains 75 /78 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 75/78 places, 40/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 75 transition count 40
Applied a total of 5 rules in 5 ms. Remains 75 /78 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 75/78 places, 40/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 42/42 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 75 transition count 40
Applied a total of 5 rules in 5 ms. Remains 75 /78 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 75/78 places, 40/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 42/42 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 75 transition count 40
Applied a total of 5 rules in 4 ms. Remains 75 /78 variables (removed 3) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 75/78 places, 40/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 78/78 places, 42/42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:22:43] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:22:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 42 transitions and 196 arcs took 0 ms.
Total runtime 2256 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: 78 NrTr: 42 NrArc: 196)

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

net check time: 0m 0.000sec

init dd package: 0m 2.694sec


RS generation: 0m 0.012sec


-> reachability set: #nodes 219 (2.2e+02) #states 11,534,336 (7)



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

checking: EG [1<=p47]
normalized: EG [1<=p47]

abstracting: (1<=p47)
states: 10,223,616 (7)
............................................................................................................................................
EG iterations: 140
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: AF [1<=p46]
normalized: ~ [EG [~ [1<=p46]]]

abstracting: (1<=p46)
states: 1,310,720 (6)
............................................................................................................................................
EG iterations: 140
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [AG [A [p40<=0 U 1<=p0]]]
normalized: ~ [E [true U E [true U ~ [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [p40<=0] & ~ [1<=p0]]]]]]]]]

abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (p40<=0)
states: 11,010,048 (7)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (1<=p0)
states: 5,505,024 (6)
............................................................................................................................................................................
EG iterations: 172
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.774sec

checking: EF [EG [AG [p32<=p71]]]
normalized: E [true U EG [~ [E [true U ~ [p32<=p71]]]]]

abstracting: (p32<=p71)
states: 10,223,616 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [[EG [[EF [1<=p70] | AF [~ [1<=p32]]]] & EG [AG [~ [1<=p48]]]]]
normalized: ~ [E [true U ~ [[EG [~ [E [true U 1<=p48]]] & EG [[~ [EG [1<=p32]] | E [true U 1<=p70]]]]]]]

abstracting: (1<=p70)
states: 7,077,888 (6)
abstracting: (1<=p32)
states: 1,310,720 (6)
..........................................................................................................................................
EG iterations: 138

EG iterations: 0
abstracting: (1<=p48)
states: 1,572,864 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: AX [[~ [A [AG [1<=p0] U EG [p56<=0]]] | ~ [p59<=p3]]]
normalized: ~ [EX [~ [[~ [p59<=p3] | ~ [[~ [EG [~ [EG [p56<=0]]]] & ~ [E [~ [EG [p56<=0]] U [E [true U ~ [1<=p0]] & ~ [EG [p56<=0]]]]]]]]]]]

abstracting: (p56<=0)
states: 8,912,896 (6)
...............................................................................................
EG iterations: 95
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (p56<=0)
states: 8,912,896 (6)
...............................................................................................
EG iterations: 95
abstracting: (p56<=0)
states: 8,912,896 (6)
...............................................................................................
EG iterations: 95
.
EG iterations: 1
abstracting: (p59<=p3)
states: 9,830,400 (6)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.282sec

checking: AX [EG [[1<=p68 & [EF [1<=p25] & [AX [1<=p44] | 1<=p21]]]]]
normalized: ~ [EX [~ [EG [[1<=p68 & [[1<=p21 | ~ [EX [~ [1<=p44]]]] & E [true U 1<=p25]]]]]]]

abstracting: (1<=p25)
states: 5,505,024 (6)
abstracting: (1<=p44)
states: 1,048,576 (6)
.abstracting: (1<=p21)
states: 5,505,024 (6)
abstracting: (1<=p68)
states: 7,340,032 (6)
.............................................................................................................................................................................
EG iterations: 173
.-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.680sec

checking: ~ [A [~ [[EG [~ [p7<=0]] | [~ [p62<=0] & ~ [AF [p77<=p22]]]]] U [~ [EG [~ [AG [p33<=0]]]] | AX [~ [EF [p49<=0]]]]]]
normalized: ~ [[~ [E [~ [[~ [EX [E [true U p49<=0]]] | ~ [EG [E [true U ~ [p33<=0]]]]]] U [~ [[~ [EX [E [true U p49<=0]]] | ~ [EG [E [true U ~ [p33<=0]]]]]] & [EG [~ [p7<=0]] | [EG [~ [p77<=p22]] & ~ [p62<=0]]]]]] & ~ [EG [~ [[~ [EX [E [true U p49<=0]]] | ~ [EG [E [true U ~ [p33<=0]]]]]]]]]]

abstracting: (p33<=0)
states: 6,029,312 (6)
...........................................................................................................................................................................................
EG iterations: 187
abstracting: (p49<=0)
states: 1,572,864 (6)
..
EG iterations: 1
abstracting: (p62<=0)
states: 3,407,872 (6)
abstracting: (p77<=p22)
states: 6,946,816 (6)
..................................................................................................................................................................................................................................................................
EG iterations: 258
abstracting: (p7<=0)
states: 6,029,312 (6)
........................................................................................................................................................................................................................................................................................
EG iterations: 280
abstracting: (p33<=0)
states: 6,029,312 (6)
...........................................................................................................................................................................................
EG iterations: 187
abstracting: (p49<=0)
states: 1,572,864 (6)
.abstracting: (p33<=0)
states: 6,029,312 (6)
...........................................................................................................................................................................................
EG iterations: 187
abstracting: (p49<=0)
states: 1,572,864 (6)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.476sec

checking: AG [A [[~ [AX [p21<=p16]] & 1<=p47] U [AF [1<=p27] & [[p70<=1 | p26<=p29] & [p58<=0 | [~ [p37<=1] | ~ [p7<=p11]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[p58<=0 | [~ [p7<=p11] | ~ [p37<=1]]] & [p70<=1 | p26<=p29]] & ~ [EG [~ [1<=p27]]]]]]] & ~ [E [~ [[[[p58<=0 | [~ [p7<=p11] | ~ [p37<=1]]] & [p70<=1 | p26<=p29]] & ~ [EG [~ [1<=p27]]]]] U [~ [[1<=p47 & EX [~ [p21<=p16]]]] & ~ [[[[p58<=0 | [~ [p7<=p11] | ~ [p37<=1]]] & [p70<=1 | p26<=p29]] & ~ [EG [~ [1<=p27]]]]]]]]]]]]

abstracting: (1<=p27)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (p26<=p29)
states: 10,354,688 (7)
abstracting: (p70<=1)
states: 11,534,336 (7)
abstracting: (p37<=1)
states: 11,534,336 (7)
abstracting: (p7<=p11)
states: 8,650,752 (6)
abstracting: (p58<=0)
states: 8,650,752 (6)
abstracting: (p21<=p16)
states: 7,602,176 (6)
.abstracting: (1<=p47)
states: 10,223,616 (7)
abstracting: (1<=p27)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (p26<=p29)
states: 10,354,688 (7)
abstracting: (p70<=1)
states: 11,534,336 (7)
abstracting: (p37<=1)
states: 11,534,336 (7)
abstracting: (p7<=p11)
states: 8,650,752 (6)
abstracting: (p58<=0)
states: 8,650,752 (6)
abstracting: (1<=p27)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (p26<=p29)
states: 10,354,688 (7)
abstracting: (p70<=1)
states: 11,534,336 (7)
abstracting: (p37<=1)
states: 11,534,336 (7)
abstracting: (p7<=p11)
states: 8,650,752 (6)
abstracting: (p58<=0)
states: 8,650,752 (6)
...............................................................................
EG iterations: 79
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.855sec

checking: EF [[[EG [~ [p37<=p26]] & [A [1<=p57 U p44<=0] & AG [AX [[p52<=p7 & p34<=1]]]]] & [~ [p43<=0] & [~ [1<=p0] & [EF [~ [p29<=p67]] | [~ [p48<=1] | ~ [1<=p74]]]]]]]
normalized: E [true U [[[~ [E [true U EX [~ [[p52<=p7 & p34<=1]]]]] & [~ [EG [~ [p44<=0]]] & ~ [E [~ [p44<=0] U [~ [1<=p57] & ~ [p44<=0]]]]]] & EG [~ [p37<=p26]]] & [~ [p43<=0] & [[E [true U ~ [p29<=p67]] | [~ [p48<=1] | ~ [1<=p74]]] & ~ [1<=p0]]]]]

abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (1<=p74)
states: 6,553,600 (6)
abstracting: (p48<=1)
states: 11,534,336 (7)
abstracting: (p29<=p67)
states: 6,029,312 (6)
abstracting: (p43<=0)
states: 786,432 (5)
abstracting: (p37<=p26)
states: 6,946,816 (6)
.........................................................................................................................................................................................................................................................................
EG iterations: 265
abstracting: (p44<=0)
states: 10,485,760 (7)
abstracting: (1<=p57)
states: 8,912,896 (6)
abstracting: (p44<=0)
states: 10,485,760 (7)
abstracting: (p44<=0)
states: 10,485,760 (7)
.
EG iterations: 1
abstracting: (p34<=1)
states: 11,534,336 (7)
abstracting: (p52<=p7)
states: 10,354,688 (7)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.654sec

checking: [EF [1<=p75] & [E [[p27<=p17 & EX [[1<=p66 | ~ [1<=p70]]]] U ~ [[p37<=p42 | ~ [EX [0<=0]]]]] & [AF [[p25<=0 | ~ [1<=p42]]] | E [p15<=p38 U p57<=p53]]]]
normalized: [[[E [p15<=p38 U p57<=p53] | ~ [EG [~ [[p25<=0 | ~ [1<=p42]]]]]] & E [[p27<=p17 & EX [[1<=p66 | ~ [1<=p70]]]] U ~ [[p37<=p42 | ~ [EX [0<=0]]]]]] & E [true U 1<=p75]]

abstracting: (1<=p75)
states: 5,242,880 (6)
abstracting: (0<=0)
states: 11,534,336 (7)
.abstracting: (p37<=p42)
states: 6,422,528 (6)
abstracting: (1<=p70)
states: 7,077,888 (6)
abstracting: (1<=p66)
states: 7,602,176 (6)
.abstracting: (p27<=p17)
states: 8,650,752 (6)
abstracting: (1<=p42)
states: 786,432 (5)
abstracting: (p25<=0)
states: 6,029,312 (6)
.........................................................
EG iterations: 57
abstracting: (p57<=p53)
states: 10,485,760 (7)
abstracting: (p15<=p38)
states: 6,291,456 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.145sec

checking: [AG [[EF [~ [1<=p4]] | [EX [0<=0] | ~ [p11<=0]]]] | [AX [[[AX [1<=p10] & [AF [p12<=0] | EX [1<=p14]]] & [p74<=p29 & [p17<=0 & 1<=p19]]]] | [[AG [~ [E [p56<=p11 U p25<=0]]] | [A [EF [p9<=0] U AG [1<=p7]] & [EF [p7<=0] & AG [1<=p75]]]] & [EG [EX [1<=p68]] | [EX [~ [1<=p49]] | EF [[p25<=p18 & p28<=0]]]]]]]
normalized: [[[[[E [true U [p25<=p18 & p28<=0]] | EX [~ [1<=p49]]] | EG [EX [1<=p68]]] & [[[~ [E [true U ~ [1<=p75]]] & E [true U p7<=0]] & [~ [EG [E [true U ~ [1<=p7]]]] & ~ [E [E [true U ~ [1<=p7]] U [~ [E [true U p9<=0]] & E [true U ~ [1<=p7]]]]]]] | ~ [E [true U E [p56<=p11 U p25<=0]]]]] | ~ [EX [~ [[[p74<=p29 & [p17<=0 & 1<=p19]] & [[EX [1<=p14] | ~ [EG [~ [p12<=0]]]] & ~ [EX [~ [1<=p10]]]]]]]]] | ~ [E [true U ~ [[[~ [p11<=0] | EX [0<=0]] | E [true U ~ [1<=p4]]]]]]]

abstracting: (1<=p4)
states: 4,980,736 (6)
abstracting: (0<=0)
states: 11,534,336 (7)
.abstracting: (p11<=0)
states: 6,029,312 (6)
abstracting: (1<=p10)
states: 4,194,304 (6)
.abstracting: (p12<=0)
states: 7,602,176 (6)
........................................................................................
EG iterations: 88
abstracting: (1<=p14)
states: 3,670,016 (6)
.abstracting: (1<=p19)
states: 5,505,024 (6)
abstracting: (p17<=0)
states: 6,029,312 (6)
abstracting: (p74<=p29)
states: 8,126,464 (6)
.abstracting: (p25<=0)
states: 6,029,312 (6)
abstracting: (p56<=p11)
states: 10,092,544 (7)
abstracting: (1<=p7)
states: 5,505,024 (6)
abstracting: (p9<=0)
states: 6,029,312 (6)
abstracting: (1<=p7)
states: 5,505,024 (6)
abstracting: (1<=p7)
states: 5,505,024 (6)

EG iterations: 0
abstracting: (p7<=0)
states: 6,029,312 (6)
abstracting: (1<=p75)
states: 5,242,880 (6)
abstracting: (1<=p68)
states: 7,340,032 (6)
...............................................................................................................................................................................................
EG iterations: 190
abstracting: (1<=p49)
states: 9,961,472 (6)
.abstracting: (p28<=0)
states: 9,699,328 (6)
abstracting: (p25<=p18)
states: 7,471,104 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.764sec

totally nodes used: 7940588 (7.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3488728 12236944 15725672
used/not used/entry size/cache size: 16556184 50552680 16 1024MB
basic ops cache: hits/miss/sum: 669915 2352600 3022515
used/not used/entry size/cache size: 4276724 12500492 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1319 4199 5518
used/not used/entry size/cache size: 4197 8384411 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 60045044
1 6289293
2 682809
3 82078
4 8815
5 771
6 50
7 4
8 0
9 0
>= 10 0

Total processing time: 0m10.859sec


BK_STOP 1679181775474

--------------------
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


iterations count:1583 (37), effective:420 (10)

initing FirstDep: 0m 0.000sec


iterations count:765 (18), effective:210 (5)

iterations count:117 (2), effective:20 (0)

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

iterations count:560 (13), effective:170 (4)

iterations count:85 (2), effective:16 (0)

iterations count:90 (2), effective:16 (0)

iterations count:555 (13), effective:152 (3)

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

iterations count:117 (2), effective:20 (0)

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

iterations count:108 (2), effective:21 (0)

iterations count:104 (2), effective:21 (0)

iterations count:555 (13), effective:152 (3)

iterations count:104 (2), effective:21 (0)

iterations count:555 (13), effective:152 (3)

iterations count:104 (2), effective:21 (0)

iterations count:555 (13), effective:152 (3)

iterations count:447 (10), effective:130 (3)

iterations count:703 (16), effective:187 (4)

iterations count:106 (2), effective:21 (0)

iterations count:82 (1), effective:12 (0)

iterations count:1315 (31), effective:381 (9)

iterations count:53 (1), effective:5 (0)

iterations count:146 (3), effective:35 (0)

iterations count:82 (1), effective:12 (0)

iterations count:108 (2), effective:18 (0)

iterations count:3863 (91), effective:1147 (27)

iterations count:200 (4), effective:49 (1)

iterations count:69 (1), effective:8 (0)

iterations count:575 (13), effective:157 (3)

iterations count:518 (12), effective:141 (3)

iterations count:575 (13), effective:157 (3)

iterations count:575 (13), effective:157 (3)

iterations count:575 (13), effective:157 (3)

iterations count:101 (2), effective:19 (0)

iterations count:215 (5), effective:54 (1)

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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r330-tall-167889203700753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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