Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 114K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DatabaseWithMutex-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-blw3-152732474100013
=====================================================================

--------------------
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 DatabaseWithMutex-PT-04-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527852150090

info: Time: 3600 - MCC
===========================================================================================
prep: translating DatabaseWithMutex-PT-04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DatabaseWithMutex-PT-04 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ DatabaseWithMutex-PT-04 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 268/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4480
lola: finding significant places
lola: 140 places, 128 transitions, 112 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 176 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-PT-04-LTLCardinality.task
lola: A ((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4)) : A (G (G (F (F ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)))))) : A ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)) : A ((X (X ((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4))) U ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4) U (3 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)))) : A (F (F (X ((1 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4))))) : A ((F ((2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4)) U (1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4))) : A ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)) : A (X (X (F (F ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4)))))) : A (X (X (F (G ((RecBuff_2_3 <= Message_3_2)))))) : A (X ((X ((Mutex_1 <= Message_2_4)) U X ((Modify_3_2 <= updating_3_4))))) : A ((F (G ((Active_1_2 <= Modify_1_3))) U X (G ((Acknowledge_1_2 <= all_active_3))))) : A (X (F (X (G ((Active_1_3 <= RecBuff_4_4)))))) : A (F (G (G (F ((Mutex_2 <= Acknowledge_3_1)))))) : A ((Message_1_4 <= Message_1_1)) : A ((G ((RecBuff_4_2 <= Active_4_1)) U F (F ((RecBuff_3_1 <= RecBuff_2_3))))) : A ((F (X ((updating_2_4 <= RecBuff_2_3))) U F (G ((Modify_1_3 <= Message_2_3)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4)
lola: processed formula length: 212
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)
lola: processed formula length: 300
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_... (shortened)
lola: processed formula length: 528
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Message_1_4 <= Message_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Message_1_4 <= Message_1_1)
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4))) U ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Ackn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: A ((X (X ((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4))) U ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Ackn... (shortened)
lola: processed formula length: 630
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 ... (shortened)
lola: processed formula length: 512
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1774560 markings, 3490124 edges, 354912 markings/sec, 0 secs
lola: 3281217 markings, 6881549 edges, 301331 markings/sec, 5 secs
lola: 4910532 markings, 10340358 edges, 325863 markings/sec, 10 secs
lola: 6402966 markings, 13692665 edges, 298487 markings/sec, 15 secs
lola: 7929388 markings, 17156276 edges, 305284 markings/sec, 20 secs
lola: 9612280 markings, 20568778 edges, 336578 markings/sec, 25 secs
lola: 11121110 markings, 23984059 edges, 301766 markings/sec, 30 secs
lola: 12767470 markings, 27432312 edges, 329272 markings/sec, 35 secs
lola: 14320094 markings, 30900360 edges, 310525 markings/sec, 40 secs
lola: 15882767 markings, 34309275 edges, 312535 markings/sec, 45 secs
lola: 17483824 markings, 37735247 edges, 320211 markings/sec, 50 secs
lola: 18974259 markings, 41154226 edges, 298087 markings/sec, 55 secs
lola: 20627048 markings, 44532160 edges, 330558 markings/sec, 60 secs
lola: 22123713 markings, 47913174 edges, 299333 markings/sec, 65 secs
lola: 23630570 markings, 51429835 edges, 301371 markings/sec, 70 secs
lola: 25256187 markings, 54794813 edges, 325123 markings/sec, 75 secs
lola: 26741577 markings, 58156364 edges, 297078 markings/sec, 80 secs
lola: 28348296 markings, 61507100 edges, 321344 markings/sec, 85 secs
lola: 29826903 markings, 64829702 edges, 295721 markings/sec, 90 secs
lola: 31403660 markings, 68270711 edges, 315351 markings/sec, 95 secs
lola: 33002168 markings, 71634001 edges, 319702 markings/sec, 100 secs
lola: 34513291 markings, 75059163 edges, 302225 markings/sec, 105 secs
lola: 36183991 markings, 78510519 edges, 334140 markings/sec, 110 secs
lola: 37648725 markings, 81813495 edges, 292947 markings/sec, 115 secs
lola: 39187627 markings, 85137783 edges, 307780 markings/sec, 120 secs
lola: 40744848 markings, 88486033 edges, 311444 markings/sec, 125 secs
lola: 42201224 markings, 91850265 edges, 291275 markings/sec, 130 secs
lola: 43852324 markings, 95205636 edges, 330220 markings/sec, 135 secs
lola: 45323496 markings, 98520282 edges, 294234 markings/sec, 140 secs
lola: 46761829 markings, 101951806 edges, 287667 markings/sec, 145 secs
lola: 48403422 markings, 105311578 edges, 328319 markings/sec, 150 secs
lola: 49889967 markings, 108659491 edges, 297309 markings/sec, 155 secs
lola: 51473973 markings, 111984580 edges, 316801 markings/sec, 160 secs
lola: 52950804 markings, 115292185 edges, 295366 markings/sec, 165 secs
lola: 54492517 markings, 118680044 edges, 308343 markings/sec, 170 secs
lola: 56068293 markings, 122015129 edges, 315155 markings/sec, 175 secs
lola: 57549050 markings, 125363951 edges, 296151 markings/sec, 180 secs
lola: 59167167 markings, 128699453 edges, 323623 markings/sec, 185 secs
lola: 60638201 markings, 132005135 edges, 294207 markings/sec, 190 secs
lola: 62139811 markings, 135320423 edges, 300322 markings/sec, 195 secs
lola: 63737597 markings, 138630239 edges, 319557 markings/sec, 200 secs
lola: 65208728 markings, 141947498 edges, 294226 markings/sec, 205 secs
lola: 66771041 markings, 145225906 edges, 312463 markings/sec, 210 secs
lola: 68244228 markings, 148530459 edges, 294637 markings/sec, 215 secs
lola: 69684412 markings, 151819011 edges, 288037 markings/sec, 220 secs
lola: 71253111 markings, 155139326 edges, 313740 markings/sec, 225 secs
lola: 72716475 markings, 158425970 edges, 292673 markings/sec, 230 secs
lola: 74277169 markings, 161738478 edges, 312139 markings/sec, 235 secs
lola: 75760155 markings, 165025113 edges, 296597 markings/sec, 240 secs
lola: 77198292 markings, 168339522 edges, 287627 markings/sec, 245 secs
lola: 78856474 markings, 171686437 edges, 331636 markings/sec, 250 secs
lola: 80311112 markings, 174966441 edges, 290928 markings/sec, 255 secs
lola: 81879592 markings, 178279864 edges, 313696 markings/sec, 260 secs
lola: 83359923 markings, 181572316 edges, 296066 markings/sec, 265 secs
lola: 84799175 markings, 184865241 edges, 287850 markings/sec, 270 secs
lola: 86427555 markings, 188163201 edges, 325676 markings/sec, 275 secs
lola: 87888006 markings, 191454049 edges, 292090 markings/sec, 280 secs
lola: 89447187 markings, 194749041 edges, 311836 markings/sec, 285 secs
lola: 90909514 markings, 198017153 edges, 292465 markings/sec, 290 secs
lola: 92376566 markings, 201317836 edges, 293410 markings/sec, 295 secs
lola: 93875026 markings, 204625850 edges, 299692 markings/sec, 300 secs
lola: 95345999 markings, 207830567 edges, 294195 markings/sec, 305 secs
lola: 96743120 markings, 211065808 edges, 279424 markings/sec, 310 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 98136033 markings, 214228624 edges

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Mutex_1 <= Message_2_4) U (Modify_3_2 <= updating_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Mutex_1 <= Message_2_4) U (Modify_3_2 <= updating_3_4)))))
lola: processed formula length: 69
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 169 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((Acknowledge_1_2 <= all_active_3))) OR (F (G ((Acknowledge_1_2 <= all_active_3))) AND F (G ((Active_1_2 <= Modify_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((Acknowledge_1_2 <= all_active_3))) OR (F (G ((Acknowledge_1_2 <= all_active_3))) AND F (G ((Active_1_2 <= Modify_1_3))))))
lola: processed formula length: 133
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1578 markings, 1748 edges
lola:
FORMULA DatabaseWithMutex-PT-04-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4))))
lola: processed formula length: 224
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12065 markings, 24336 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Active_1_3 <= RecBuff_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Active_1_3 <= RecBuff_4_4))))
lola: processed formula length: 39
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 68
lola: add low 104
lola: add low 20
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2804 markings, 2929 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Mutex_2 <= Acknowledge_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Mutex_2 <= Acknowledge_3_1))))
lola: processed formula length: 40
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 163 markings, 174 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((RecBuff_2_3 <= Message_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((RecBuff_2_3 <= Message_3_2))))
lola: processed formula length: 40
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1880 markings, 1986 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Modify_1_3 <= Message_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Modify_1_3 <= Message_2_3))))
lola: processed formula length: 39
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 74
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21931 markings, 23892 edges
lola:
FORMULA DatabaseWithMutex-PT-04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1083 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((RecBuff_3_1 <= RecBuff_2_3)) OR (G ((RecBuff_4_2 <= Active_4_1)) AND F ((RecBuff_3_1 <= RecBuff_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((RecBuff_3_1 <= RecBuff_2_3)) OR (G ((RecBuff_4_2 <= Active_4_1)) AND F ((RecBuff_3_1 <= RecBuff_2_3)))))
lola: processed formula length: 112
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4))))
lola: processed formula length: 292
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 20 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4)) U (1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4)) U (1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2... (shortened)
lola: processed formula length: 565
lola: 26 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1721616 markings, 3021209 edges, 344323 markings/sec, 0 secs
lola: 3437518 markings, 6030088 edges, 343180 markings/sec, 5 secs
lola: 5099533 markings, 8931071 edges, 332403 markings/sec, 10 secs
lola: 6755870 markings, 11828171 edges, 331267 markings/sec, 15 secs
lola: 8377027 markings, 14644088 edges, 324231 markings/sec, 20 secs
lola: 10010682 markings, 17513805 edges, 326731 markings/sec, 25 secs
lola: 11624180 markings, 20359811 edges, 322700 markings/sec, 30 secs
lola: 13238742 markings, 23157486 edges, 322912 markings/sec, 35 secs
lola: 14852008 markings, 25976326 edges, 322653 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16401622 markings, 28678041 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes yes yes no no no no no yes yes no
lola:
preliminary result: no no yes yes yes yes yes yes no no no no no yes yes no
lola: memory consumption: 19868 KB
lola: time consumption: 370 seconds

BK_STOP 1527852520378

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

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="DatabaseWithMutex-PT-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DatabaseWithMutex-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r232-blw3-152732474100013"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;