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.r490-tall-167912709701193.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 UtilityControlRoom-PT-Z4T4N04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709701193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Feb 26 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 26 14:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 184K Feb 26 14:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 94K Feb 26 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 357K Feb 26 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 128K 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 UtilityControlRoom-PT-Z4T4N04-CTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679393122839

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=UtilityControlRoom-PT-Z4T4N04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 10:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 10:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 10:05:24] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-21 10:05:24] [INFO ] Transformed 154 places.
[2023-03-21 10:05:24] [INFO ] Transformed 300 transitions.
[2023-03-21 10:05:24] [INFO ] Parsed PT model containing 154 places and 300 transitions and 964 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
Support contains 154 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 8 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2023-03-21 10:05:24] [INFO ] Computed 11 place invariants in 17 ms
[2023-03-21 10:05:24] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-21 10:05:24] [INFO ] Invariant cache hit.
[2023-03-21 10:05:24] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-21 10:05:24] [INFO ] Invariant cache hit.
[2023-03-21 10:05:24] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 154/154 places, 236/236 transitions.
Support contains 154 out of 154 places after structural reductions.
[2023-03-21 10:05:25] [INFO ] Flatten gal took : 38 ms
[2023-03-21 10:05:25] [INFO ] Flatten gal took : 21 ms
[2023-03-21 10:05:25] [INFO ] Input system was already deterministic with 236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 53) seen :19
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 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) 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 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 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 9 ms. (steps per millisecond=111 ) properties (out of 34) 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 34) 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 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 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 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 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 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 15 ms. (steps per millisecond=66 ) 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 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 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 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 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
Running SMT prover for 34 properties.
[2023-03-21 10:05:25] [INFO ] Invariant cache hit.
[2023-03-21 10:05:26] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:33
[2023-03-21 10:05:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-21 10:05:26] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :34 sat :0
Fused 34 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 34 atomic propositions for a total of 16 simplifications.
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 10:05:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 20 ms
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 13 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 66 out of 154 places (down from 154) after GAL structural reductions.
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 9 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 106/154 places, 188/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 9 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 10 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 6 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/154 places, 188/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 10 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 10 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 8 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 106/154 places, 188/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 8 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 9 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Applied a total of 182 rules in 18 ms. Remains 71 /154 variables (removed 83) and now considering 92/236 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 71/154 places, 92/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 4 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 4 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 154 transition count 177
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 132 place count 95 transition count 163
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 132 place count 95 transition count 148
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 162 place count 80 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 77 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 77 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 75 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 75 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 68 transition count 106
Iterating global reduction 2 with 7 rules applied. Total rules applied 186 place count 68 transition count 106
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 193 place count 61 transition count 92
Iterating global reduction 2 with 7 rules applied. Total rules applied 200 place count 61 transition count 92
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 207 place count 54 transition count 78
Iterating global reduction 2 with 7 rules applied. Total rules applied 214 place count 54 transition count 78
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 221 place count 54 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 229 place count 50 transition count 67
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 238 place count 45 transition count 63
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 254 place count 37 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 37 transition count 54
Applied a total of 255 rules in 25 ms. Remains 37 /154 variables (removed 117) and now considering 54/236 (removed 182) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 37/154 places, 54/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 3 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 3 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 5 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 106/154 places, 188/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 8 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 8 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 110 transition count 192
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 110 transition count 192
Applied a total of 88 rules in 3 ms. Remains 110 /154 variables (removed 44) and now considering 192/236 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/154 places, 192/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 8 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 8 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 193 place count 60 transition count 81
Iterating global reduction 2 with 11 rules applied. Total rules applied 204 place count 60 transition count 81
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 215 place count 49 transition count 59
Iterating global reduction 2 with 11 rules applied. Total rules applied 226 place count 49 transition count 59
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 237 place count 38 transition count 48
Iterating global reduction 2 with 11 rules applied. Total rules applied 248 place count 38 transition count 48
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 259 place count 38 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 259 place count 38 transition count 34
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 265 place count 35 transition count 34
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 271 place count 32 transition count 31
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 279 place count 28 transition count 27
Applied a total of 279 rules in 14 ms. Remains 28 /154 variables (removed 126) and now considering 27/236 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 28/154 places, 27/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 1 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 154 transition count 176
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 135 place count 94 transition count 161
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 135 place count 94 transition count 147
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 163 place count 80 transition count 147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 77 transition count 144
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 77 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 171 place count 75 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 75 transition count 112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 180 place count 68 transition count 105
Iterating global reduction 2 with 7 rules applied. Total rules applied 187 place count 68 transition count 105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 193 place count 62 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 199 place count 62 transition count 93
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 56 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 56 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 217 place count 56 transition count 75
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 223 place count 53 transition count 72
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 229 place count 50 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 50 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 231 place count 49 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 49 transition count 58
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 236 place count 45 transition count 54
Iterating global reduction 3 with 4 rules applied. Total rules applied 240 place count 45 transition count 54
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 244 place count 41 transition count 46
Iterating global reduction 3 with 4 rules applied. Total rules applied 248 place count 41 transition count 46
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 38 transition count 43
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 38 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 257 place count 38 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 257 place count 38 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 36 transition count 38
Applied a total of 261 rules in 19 ms. Remains 36 /154 variables (removed 118) and now considering 38/236 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 36/154 places, 38/236 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 1 ms
[2023-03-21 10:05:26] [INFO ] Input system was already deterministic with 38 transitions.
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 9 ms
[2023-03-21 10:05:26] [INFO ] Flatten gal took : 9 ms
[2023-03-21 10:05:26] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-21 10:05:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 236 transitions and 708 arcs took 2 ms.
Total runtime 2575 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: 154 NrTr: 236 NrArc: 708)

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

net check time: 0m 0.000sec

init dd package: 0m 2.716sec


RS generation: 0m 1.214sec


-> reachability set: #nodes 8464 (8.5e+03) #states 65,585,152 (7)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.295sec

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

abstracting: (0<=0)
states: 65,585,152 (7)
.-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EG [AG [A [p66<=p26 U 1<=p153]]]]
normalized: ~ [EG [~ [EG [~ [E [true U ~ [[~ [E [~ [1<=p153] U [~ [1<=p153] & ~ [p66<=p26]]]] & ~ [EG [~ [1<=p153]]]]]]]]]]]

abstracting: (1<=p153)
states: 789,184 (5)
.
EG iterations: 1
abstracting: (p66<=p26)
states: 64,043,328 (7)
abstracting: (1<=p153)
states: 789,184 (5)
abstracting: (1<=p153)
states: 789,184 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.077sec

checking: EF [EG [[~ [p5<=0] & [~ [2<=p150] | ~ [p117<=p26]]]]]
normalized: E [true U EG [[~ [p5<=0] & [~ [2<=p150] | ~ [p117<=p26]]]]]

abstracting: (p117<=p26)
states: 64,043,328 (7)
abstracting: (2<=p150)
states: 0
abstracting: (p5<=0)
states: 63,539,520 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.344sec

checking: EG [A [[[EG [p87<=0] | AX [AG [p76<=p117]]] | ~ [EX [0<=0]]] U AX [[~ [[p129<=0 & p90<=p54]] | ~ [[p112<=0 & 1<=p26]]]]]]
normalized: EG [[~ [EG [EX [~ [[~ [[p112<=0 & 1<=p26]] | ~ [[p129<=0 & p90<=p54]]]]]]] & ~ [E [EX [~ [[~ [[p112<=0 & 1<=p26]] | ~ [[p129<=0 & p90<=p54]]]]] U [~ [[~ [EX [0<=0]] | [~ [EX [E [true U ~ [p76<=p117]]]] | EG [p87<=0]]]] & EX [~ [[~ [[p112<=0 & 1<=p26]] | ~ [[p129<=0 & p90<=p54]]]]]]]]]]

abstracting: (p90<=p54)
states: 64,043,328 (7)
abstracting: (p129<=0)
states: 63,539,520 (7)
abstracting: (1<=p26)
states: 1,578,368 (6)
abstracting: (p112<=0)
states: 64,006,784 (7)
.abstracting: (p87<=0)
states: 64,006,784 (7)
.
EG iterations: 1
abstracting: (p76<=p117)
states: 64,043,328 (7)
.abstracting: (0<=0)
states: 65,585,152 (7)
.abstracting: (p90<=p54)
states: 64,043,328 (7)
abstracting: (p129<=0)
states: 63,539,520 (7)
abstracting: (1<=p26)
states: 1,578,368 (6)
abstracting: (p112<=0)
states: 64,006,784 (7)
.abstracting: (p90<=p54)
states: 64,043,328 (7)
abstracting: (p129<=0)
states: 63,539,520 (7)
abstracting: (1<=p26)
states: 1,578,368 (6)
abstracting: (p112<=0)
states: 64,006,784 (7)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.730sec

checking: EG [[[EX [[sum(p137, p136, p135, p134, p133, p132, p131, p130, p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & p124<=0]] | AX [1<=0]] | EX [0<=0]]]
normalized: EG [[EX [0<=0] | [EX [[sum(p137, p136, p135, p134, p133, p132, p131, p130, p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & p124<=0]] | ~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p124<=0)
states: 9,727,779 (6)
abstracting: (sum(p137, p136, p135, p134, p133, p132, p131, p130, p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
states: 3,659,008 (6)
.abstracting: (0<=0)
states: 65,585,152 (7)
.
EG iterations: 0
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.019sec

checking: E [AG [sum(p129, p128, p127, p126)<=sum(p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8)] U AX [1<=0]]
normalized: E [~ [E [true U ~ [sum(p129, p128, p127, p126)<=sum(p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8)]]] U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (sum(p129, p128, p127, p126)<=sum(p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8))
states: 61,928,659 (7)
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.262sec

checking: EG [AG [EF [[[~ [p125<=80] & ~ [53<=sum(p133, p132, p131, p130)]] | [~ [sum(p123, p122, p121, p120)<=sum(p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138)] & ~ [p124<=sum(p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138)]]]]]]
normalized: EG [~ [E [true U ~ [E [true U [[~ [p124<=sum(p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138)] & ~ [sum(p123, p122, p121, p120)<=sum(p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138)]] | [~ [53<=sum(p133, p132, p131, p130)] & ~ [p125<=80]]]]]]]]

abstracting: (p125<=80)
states: 65,585,152 (7)
abstracting: (53<=sum(p133, p132, p131, p130))
states: 0
abstracting: (sum(p123, p122, p121, p120)<=sum(p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138))
states: 52,659,248 (7)
abstracting: (p124<=sum(p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138))
states: 15,665,315 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N04-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.519sec

totally nodes used: 2434330 (2.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20309946 41281776 61591722
used/not used/entry size/cache size: 31919256 35189608 16 1024MB
basic ops cache: hits/miss/sum: 890342 1923832 2814174
used/not used/entry size/cache size: 2686621 14090595 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 4981747 4981747
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 20256 39807 60063
used/not used/entry size/cache size: 39714 8348894 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 64928364
1 1966931
2 182947
3 26362
4 3378
5 432
6 40
7 89
8 37
9 21
>= 10 263

Total processing time: 0m25.206sec


BK_STOP 1679393152954

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:27607 (116), effective:548 (2)

initing FirstDep: 0m 0.000sec


iterations count:10658 (45), effective:491 (2)

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

iterations count:10819 (45), effective:502 (2)

iterations count:11120 (47), effective:504 (2)

iterations count:14728 (62), effective:589 (2)

iterations count:29948 (126), effective:1365 (5)

iterations count:3330 (14), effective:135 (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="UtilityControlRoom-PT-Z4T4N04"
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 UtilityControlRoom-PT-Z4T4N04, 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 r490-tall-167912709701193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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