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 212K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PermAdmissibility-COL-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700465
=====================================================================

--------------------
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 PermAdmissibility-COL-50-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-50-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527141679997


BK_STOP 1527142461691

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-50 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1722293, 'Memory': 15950.7, 'Tool': 'lola'}, {'Time': 2107935, 'Memory': 15950.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-50...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-50: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-COL-50 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-50-CTLCardinality.task
lola: (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60) AND E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p33)))) OR E (F (((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60) AND (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) AND (3 <= p114))))) : (E (((p34 <= 1) U (p69 + 1 <= p181))) AND E (F (E (F ((p36 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163)))))) : E (((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= 1) U (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123))) : (NOT(A (F (((p207 <= p35) AND (p104 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87))))) OR E (F (A (X ((1 <= p79)))))) : A (F ((A (F ((1 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87))) AND ((p172 <= 1) AND (p33 <= 2))))) : (E (((p33 <= p34) U ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND (3 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))) AND A ((((3 <= p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (1 <= p69)) U ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))) : (NOT((E (G ((p172 <= p69))) AND (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))) OR NOT(((p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR A (G ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))) : A (F (A (G ((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + 1 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155))))) : NOT(A (F ((p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + 1 <= p69)))) : NOT(A (F ((((2 <= p114) OR (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171)) AND ((p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= p36) OR (2 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78)))))) : A (F (A (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p70) U (2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113))))) : A (X (A (F (((3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p32 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78)))))) : A ((((2 <= p79) OR ((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131) AND (p35 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))) U E (F ((2 <= p32))))) : E (G (A (F (((1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR (p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))))) : E ((((p114 <= p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (3 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p70)) U A (G ((1 <= p36))))) : E (G (E (G ((p33 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60) AND E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p33)))) OR E (F (((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60) AND (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) AND (3 <= p114)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)
lola: processed formula length: 94
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p33 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60) AND (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) AND (3 <= p114))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p34 <= 1) U (p69 + 1 <= p181))) AND E (F (E (F ((p36 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p34 <= 1) U (p69 + 1 <= p181)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p34 <= 1) U (p69 + 1 <= p181))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p36 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-50-CTLCardinality-2.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= 1) U (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= 1) U (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123))
lola: processed formula length: 182
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1530820 markings, 1659930 edges, 2976872481744224256 markings/sec, 0 secs
lola: 3062188 markings, 3341183 edges, 306274 markings/sec, 5 secs
lola: 4330316 markings, 4859063 edges, 253626 markings/sec, 10 secs
lola: 5653899 markings, 6403914 edges, 264717 markings/sec, 15 secs
lola: 6976990 markings, 7942344 edges, 264618 markings/sec, 20 secs
lola: 8220095 markings, 9431742 edges, 248621 markings/sec, 25 secs
lola: 9494958 markings, 10935383 edges, 254973 markings/sec, 30 secs
lola: 10816358 markings, 12488670 edges, 264280 markings/sec, 35 secs
lola: 12051350 markings, 13937997 edges, 246998 markings/sec, 40 secs
lola: 13281999 markings, 15281022 edges, 246130 markings/sec, 45 secs
lola: 14474612 markings, 16685702 edges, 238523 markings/sec, 50 secs
lola: 15701438 markings, 18144833 edges, 245365 markings/sec, 55 secs
lola: 16881265 markings, 19555236 edges, 235965 markings/sec, 60 secs
lola: 18103648 markings, 21016349 edges, 244477 markings/sec, 65 secs
lola: 19338523 markings, 22494352 edges, 246975 markings/sec, 70 secs
lola: 20473378 markings, 23861521 edges, 226971 markings/sec, 75 secs
lola: 21645747 markings, 25277469 edges, 234474 markings/sec, 80 secs
lola: 22774974 markings, 26630099 edges, 225845 markings/sec, 85 secs
lola: 23938632 markings, 28033358 edges, 232732 markings/sec, 90 secs
lola: 25134257 markings, 29435080 edges, 239125 markings/sec, 95 secs
lola: 26404450 markings, 30823583 edges, 254039 markings/sec, 100 secs
lola: 27559104 markings, 32220253 edges, 230931 markings/sec, 105 secs
lola: 28701849 markings, 33594763 edges, 228549 markings/sec, 110 secs
lola: 29797532 markings, 34924185 edges, 219137 markings/sec, 115 secs
lola: 30896219 markings, 36290402 edges, 219737 markings/sec, 120 secs
lola: 31932305 markings, 37620208 edges, 207217 markings/sec, 125 secs
lola: 32983937 markings, 38926086 edges, 210326 markings/sec, 130 secs
lola: 34090949 markings, 40281541 edges, 221402 markings/sec, 135 secs
lola: 35157000 markings, 41585125 edges, 213210 markings/sec, 140 secs
lola: 36211442 markings, 42907570 edges, 210888 markings/sec, 145 secs
lola: 37263808 markings, 44212685 edges, 210473 markings/sec, 150 secs
lola: 38265518 markings, 45487460 edges, 200342 markings/sec, 155 secs
lola: 39285495 markings, 46792413 edges, 203995 markings/sec, 160 secs
lola: 40310702 markings, 48038687 edges, 205041 markings/sec, 165 secs
lola: 41309063 markings, 49306575 edges, 199672 markings/sec, 170 secs
lola: 42392164 markings, 50693228 edges, 216620 markings/sec, 175 secs
lola: 42594601 markings, 50944265 edges, 40487 markings/sec, 180 secs
lola: 42597059 markings, 50947137 edges, 492 markings/sec, 185 secs
lola: 42602497 markings, 50953780 edges, 1088 markings/sec, 190 secs
lola: 42604118 markings, 50955965 edges, 324 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((p207 <= p35) AND (p104 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87))))) OR E (F (A (X ((1 <= p79))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p35 + 1 <= p207) OR (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 + 1 <= p104))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p207 <= p35) AND (p104 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87))))
lola: processed formula length: 90
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p79)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= p79)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 788 markings, 787 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87))) AND ((p172 <= 1) AND (p33 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (1 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87)) AND ((p172 <= 1) AND (p33 <= 2))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1518918 markings, 1728646 edges, 3689329903141912576 markings/sec, 0 secs
lola: 3039321 markings, 3483723 edges, 304081 markings/sec, 5 secs
lola: 4577572 markings, 5296147 edges, 307650 markings/sec, 10 secs
lola: 6161484 markings, 7103090 edges, 316782 markings/sec, 15 secs
lola: 7759510 markings, 8905177 edges, 319605 markings/sec, 20 secs
lola: 9329837 markings, 10717421 edges, 314065 markings/sec, 25 secs
lola: 10879009 markings, 12468013 edges, 309834 markings/sec, 30 secs
lola: 12313267 markings, 14098876 edges, 286852 markings/sec, 35 secs
lola: 13764590 markings, 15730682 edges, 290265 markings/sec, 40 secs
lola: 15263249 markings, 17472889 edges, 299732 markings/sec, 45 secs
lola: 16893815 markings, 19335319 edges, 326113 markings/sec, 50 secs
lola: 18568815 markings, 21251404 edges, 335000 markings/sec, 55 secs
lola: 20187893 markings, 23112564 edges, 323816 markings/sec, 60 secs
lola: 21763218 markings, 24938369 edges, 315065 markings/sec, 65 secs
lola: 23356049 markings, 26773141 edges, 318566 markings/sec, 70 secs
lola: 24990873 markings, 28651636 edges, 326965 markings/sec, 75 secs
lola: 26557886 markings, 30462673 edges, 313403 markings/sec, 80 secs
lola: 28019527 markings, 32107961 edges, 292328 markings/sec, 85 secs
lola: 29459512 markings, 33717878 edges, 287997 markings/sec, 90 secs
lola: 30955200 markings, 35444193 edges, 299138 markings/sec, 95 secs
lola: 32520545 markings, 37258211 edges, 313069 markings/sec, 100 secs
lola: 34100807 markings, 39092758 edges, 316052 markings/sec, 105 secs
lola: 35660888 markings, 40928620 edges, 312016 markings/sec, 110 secs
lola: 37225907 markings, 42798770 edges, 313004 markings/sec, 115 secs
lola: 38687449 markings, 44582201 edges, 292308 markings/sec, 120 secs
lola: 40124367 markings, 46253079 edges, 287384 markings/sec, 125 secs
lola: 41556347 markings, 47910183 edges, 286396 markings/sec, 130 secs
lola: 42975817 markings, 49669855 edges, 283894 markings/sec, 135 secs
lola: 44425816 markings, 51447656 edges, 290000 markings/sec, 140 secs
lola: 45865665 markings, 53150059 edges, 287970 markings/sec, 145 secs
lola: 47256251 markings, 54920720 edges, 278117 markings/sec, 150 secs
lola: 48753260 markings, 56743811 edges, 299402 markings/sec, 155 secs
lola: 50197650 markings, 58510359 edges, 288878 markings/sec, 160 secs
lola: 51625340 markings, 60260446 edges, 285538 markings/sec, 165 secs
lola: 53083983 markings, 62039855 edges, 291729 markings/sec, 170 secs
lola: 54539245 markings, 63885085 edges, 291052 markings/sec, 175 secs
lola: 55998002 markings, 65756908 edges, 291751 markings/sec, 180 secs
lola: 57608530 markings, 67564671 edges, 322106 markings/sec, 185 secs
lola: 59226142 markings, 69339752 edges, 323522 markings/sec, 190 secs
lola: 60684020 markings, 71005609 edges, 291576 markings/sec, 195 secs
lola: 62182716 markings, 72736171 edges, 299739 markings/sec, 200 secs
lola: 63660696 markings, 74423930 edges, 295596 markings/sec, 205 secs
lola: 65162073 markings, 76149937 edges, 300275 markings/sec, 210 secs
lola: 66694121 markings, 77919637 edges, 306410 markings/sec, 215 secs
lola: 68216032 markings, 79665519 edges, 304382 markings/sec, 220 secs
lola: 69653926 markings, 81336595 edges, 287579 markings/sec, 225 secs
lola: 71185685 markings, 83132053 edges, 306352 markings/sec, 230 secs
lola: 72653056 markings, 84889402 edges, 293474 markings/sec, 235 secs
lola: 74042897 markings, 86593397 edges, 277968 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p33 <= p34) U ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND (3 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))) AND A ((((3 <= p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (1 <= p69)) U ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p33 <= p34) U ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND (3 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p33 <= p34) U ((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND (3 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))
lola: processed formula length: 189
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 64539 markings, 78703 edges
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (1 <= p69)) U ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((3 <= p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (1 <= p69)) U ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))
lola: processed formula: A ((((3 <= p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (1 <= p69)) U ((3 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))
lola: processed formula length: 197
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (G ((p172 <= p69))) AND (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))) OR NOT(((p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR A (G ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p69 + 1 <= p172)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p69 + 1 <= p172)))
lola: processed formula: A (F ((p69 + 1 <= p172)))
lola: processed formula length: 25
lola: 11 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 18882 markings, 48006 edges, 3776 markings/sec, 0 secs
lola: 40375 markings, 108667 edges, 4299 markings/sec, 5 secs
lola: 62101 markings, 169674 edges, 4345 markings/sec, 10 secs
lola: 83550 markings, 231097 edges, 4290 markings/sec, 15 secs
lola: 100351 markings, 287865 edges, 3360 markings/sec, 20 secs
lola: 120753 markings, 359006 edges, 4080 markings/sec, 25 secs
lola: 138536 markings, 423190 edges, 3557 markings/sec, 30 secs
lola: 158056 markings, 486577 edges, 3904 markings/sec, 35 secs
lola: 176271 markings, 554017 edges, 3643 markings/sec, 40 secs
lola: 199321 markings, 668684 edges, 4610 markings/sec, 45 secs
lola: 217323 markings, 807264 edges, 3600 markings/sec, 50 secs
lola: 234113 markings, 865552 edges, 3358 markings/sec, 55 secs
lola: 246714 markings, 912935 edges, 2520 markings/sec, 60 secs
lola: 268671 markings, 1001096 edges, 4391 markings/sec, 65 secs
lola: 289944 markings, 1061106 edges, 4255 markings/sec, 70 secs
lola: 310638 markings, 1120734 edges, 4139 markings/sec, 75 secs
lola: 330263 markings, 1180143 edges, 3925 markings/sec, 80 secs
lola: 346143 markings, 1225919 edges, 3176 markings/sec, 85 secs
lola: 366614 markings, 1305129 edges, 4094 markings/sec, 90 secs
lola: 382461 markings, 1350946 edges, 3169 markings/sec, 95 secs
lola: 403236 markings, 1429980 edges, 4155 markings/sec, 100 secs
lola: 419599 markings, 1477933 edges, 3273 markings/sec, 105 secs
lola: 440641 markings, 1565721 edges, 4208 markings/sec, 110 secs
lola: 460485 markings, 1674039 edges, 3969 markings/sec, 115 secs
lola: 478655 markings, 1802788 edges, 3634 markings/sec, 120 secs
lola: 494226 markings, 1854299 edges, 3114 markings/sec, 125 secs
lola: 510488 markings, 1928291 edges, 3252 markings/sec, 130 secs
lola: 535955 markings, 2081100 edges, 5093 markings/sec, 135 secs
lola: 553977 markings, 2152061 edges, 3604 markings/sec, 140 secs
lola: 572735 markings, 2229375 edges, 3752 markings/sec, 145 secs
lola: 597834 markings, 2329371 edges, 5020 markings/sec, 150 secs
lola: 619650 markings, 2390737 edges, 4363 markings/sec, 155 secs
lola: 641569 markings, 2454007 edges, 4384 markings/sec, 160 secs
lola: 656092 markings, 2501649 edges, 2905 markings/sec, 165 secs
lola: 679659 markings, 2584020 edges, 4713 markings/sec, 170 secs
lola: 694067 markings, 2631271 edges, 2882 markings/sec, 175 secs
lola: 720542 markings, 2759007 edges, 5295 markings/sec, 180 secs
lola: 740362 markings, 2901415 edges, 3964 markings/sec, 185 secs
lola: 758359 markings, 2970165 edges, 3599 markings/sec, 190 secs
lola: 773738 markings, 3031161 edges, 3076 markings/sec, 195 secs
lola: 793865 markings, 3108474 edges, 4025 markings/sec, 200 secs
lola: 815154 markings, 3168064 edges, 4258 markings/sec, 205 secs
lola: 836075 markings, 3227977 edges, 4184 markings/sec, 210 secs
lola: 849661 markings, 3272420 edges, 2717 markings/sec, 215 secs
lola: 872296 markings, 3351660 edges, 4527 markings/sec, 220 secs
lola: 885880 markings, 3396103 edges, 2717 markings/sec, 225 secs
lola: 910094 markings, 3504023 edges, 4843 markings/sec, 230 secs
lola: 929571 markings, 3624160 edges, 3895 markings/sec, 235 secs
lola: 948148 markings, 3726202 edges, 3715 markings/sec, 240 secs
lola: 961904 markings, 3778086 edges, 2751 markings/sec, 245 secs
lola: 987236 markings, 3918127 edges, 5066 markings/sec, 250 secs
lola: 1007922 markings, 4021948 edges, 4137 markings/sec, 255 secs
lola: 1026926 markings, 4087796 edges, 3801 markings/sec, 260 secs
lola: 1050374 markings, 4202459 edges, 4690 markings/sec, 265 secs
lola: 1069686 markings, 4261961 edges, 3862 markings/sec, 270 secs
lola: 1087739 markings, 4309125 edges, 3611 markings/sec, 275 secs
lola: 1105824 markings, 4380445 edges, 3617 markings/sec, 280 secs
lola: 1128290 markings, 4490373 edges, 4493 markings/sec, 285 secs
lola: 1146057 markings, 4623631 edges, 3553 markings/sec, 290 secs
lola: 1163176 markings, 4689244 edges, 3424 markings/sec, 295 secs
lola: 1175842 markings, 4736860 edges, 2533 markings/sec, 300 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: 'P'
Aborted (core dumped)
FORMULA PermAdmissibility-COL-50-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="PermAdmissibility-COL-50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-50 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 irma4mcc-full"
echo " Input is PermAdmissibility-COL-50, 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 r114-csrt-152666472700465"
echo "====================================================================="
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
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 ;