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 204K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 43K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is LamportFastMutEx-COL-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472200096
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527139047615


BK_STOP 1527139406316

--------------------
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 LamportFastMutEx-COL-7 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, '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': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 2044, 'Memory': 147.65, 'Tool': 'lola'}, {'Time': 91269, 'Memory': 3790.73, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola LamportFastMutEx-COL-7...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
LamportFastMutEx-COL-7: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
LamportFastMutEx-COL-7: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ LamportFastMutEx-COL-7 @ 3540 seconds
----- 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: 800/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 264 places, 536 transitions, 182 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 762 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-7-ReachabilityCardinality.task
lola: A (G (())) : E (F ((p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248))) : E (F ((3 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95))) : A (G ((((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p120 <= 2) AND ((p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223) OR (p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247))) OR (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95)))) : A (G ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248))) : A (G (((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p83 + p82 + p81 + p80 + p84 + p85 + p86 + p87) OR (p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)))) : E (F (((p8 + p9 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND ((p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193 <= 0) OR (p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + 1 <= p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231))))) : E (F (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (2 <= p83 + p82 + p81 + p80 + p84 + p85 + p86 + p87)))) : A (G (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193) OR (3 <= p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239) OR ((1 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)) OR (3 <= p8 + p9 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))) : E (F ((1 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72))) : E (F (((p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND ((3 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248) OR (2 <= p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193)) AND (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248)))) : E (F (((p83 + p82 + p81 + p80 + p84 + p85 + p86 + p87 + 1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND (p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= 1) AND (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2)))) : E (F (((3 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))) : A (G (((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95) AND ((p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)) AND ((3 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p120) OR (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= 1))))) : A (G (((1 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95) OR (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) OR (p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= 0) OR (3 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248)))) : E (F ((((p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) AND (p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193 <= p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)) OR ((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p120) AND (1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND ((2 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) OR (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-ReachabilityCardinality.task
lola: processed formula with 0 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 (F ((p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248)))
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 24 bytes per marking, with 10 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95)))
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 24 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 223092 markings, 1001055 edges, 44618 markings/sec, 0 secs
lola: sara is running 5 secs || 441394 markings, 1994720 edges, 43660 markings/sec, 5 secs
lola: sara is running 10 secs || 653678 markings, 2964501 edges, 42457 markings/sec, 10 secs
lola: sara is running 15 secs || 861387 markings, 3917310 edges, 41542 markings/sec, 15 secs
lola: sara is running 20 secs || 1075241 markings, 4942000 edges, 42771 markings/sec, 20 secs
lola: sara is running 25 secs || 1274595 markings, 5899208 edges, 39871 markings/sec, 25 secs
lola: sara is running 30 secs || 1468638 markings, 6832210 edges, 38809 markings/sec, 30 secs
lola: sara is running 35 secs || 1670307 markings, 7852587 edges, 40334 markings/sec, 35 secs
lola: sara is running 40 secs || 1888308 markings, 8879438 edges, 43600 markings/sec, 40 secs
lola: sara is running 45 secs || 2088332 markings, 9869169 edges, 40005 markings/sec, 45 secs
lola: sara is running 50 secs || 2285320 markings, 10821461 edges, 39398 markings/sec, 50 secs
lola: sara is running 55 secs || 2471942 markings, 11732315 edges, 37324 markings/sec, 55 secs
lola: sara is running 60 secs || 2660163 markings, 12647986 edges, 37644 markings/sec, 60 secs
lola: sara is running 65 secs || 2848781 markings, 13562869 edges, 37724 markings/sec, 65 secs
lola: sara is running 70 secs || 3043034 markings, 14492497 edges, 38851 markings/sec, 70 secs
lola: sara is running 75 secs || 3256813 markings, 15536924 edges, 42756 markings/sec, 75 secs
lola: sara is running 80 secs || 3457739 markings, 16528700 edges, 40185 markings/sec, 80 secs
lola: sara is running 85 secs || 3636504 markings, 17438843 edges, 35753 markings/sec, 85 secs
lola: sara is running 90 secs || 3836585 markings, 18415564 edges, 40016 markings/sec, 90 secs
lola: sara is running 95 secs || 4033752 markings, 19370516 edges, 39433 markings/sec, 95 secs
lola: sara is running 100 secs || 4228848 markings, 20313791 edges, 39019 markings/sec, 100 secs
lola: sara is running 105 secs || 4430870 markings, 21336476 edges, 40404 markings/sec, 105 secs
lola: sara is running 110 secs || 4630201 markings, 22295295 edges, 39866 markings/sec, 110 secs
lola: sara is running 115 secs || 4815970 markings, 23211823 edges, 37154 markings/sec, 115 secs
lola: sara is running 120 secs || 4997347 markings, 24125754 edges, 36275 markings/sec, 120 secs
lola: sara is running 125 secs || 5201612 markings, 25124047 edges, 40853 markings/sec, 125 secs
lola: sara is running 130 secs || 5397800 markings, 26084566 edges, 39238 markings/sec, 130 secs
lola: sara is running 135 secs || 5583631 markings, 27037540 edges, 37166 markings/sec, 135 secs
lola: sara is running 140 secs || 5769434 markings, 27947719 edges, 37161 markings/sec, 140 secs
lola: sara is running 145 secs || 5959500 markings, 28910309 edges, 38013 markings/sec, 145 secs
lola: sara is running 150 secs || 6143681 markings, 29823902 edges, 36836 markings/sec, 150 secs
lola: sara is running 155 secs || 6332879 markings, 30787940 edges, 37840 markings/sec, 155 secs
lola: sara is running 160 secs || 6535483 markings, 31750187 edges, 40521 markings/sec, 160 secs
lola: sara is running 165 secs || 6724706 markings, 32683346 edges, 37845 markings/sec, 165 secs
lola: sara is running 170 secs || 6909404 markings, 33630960 edges, 36940 markings/sec, 170 secs
lola: sara is running 175 secs || 7094192 markings, 34586548 edges, 36958 markings/sec, 175 secs
lola: sara is running 180 secs || 7282708 markings, 35537309 edges, 37703 markings/sec, 180 secs
lola: sara is running 185 secs || 7469995 markings, 36454082 edges, 37457 markings/sec, 185 secs
lola: sara is running 190 secs || 7659638 markings, 37401507 edges, 37929 markings/sec, 190 secs
lola: sara is running 195 secs || 7850276 markings, 38345615 edges, 38128 markings/sec, 195 secs
lola: sara is running 200 secs || 8043278 markings, 39311551 edges, 38600 markings/sec, 200 secs
lola: sara is running 205 secs || 8237615 markings, 40290566 edges, 38867 markings/sec, 205 secs
lola: sara is running 210 secs || 8438256 markings, 41283794 edges, 40128 markings/sec, 210 secs
lola: sara is running 215 secs || 8628336 markings, 42222445 edges, 38016 markings/sec, 215 secs
lola: sara is running 220 secs || 8822386 markings, 43170280 edges, 38810 markings/sec, 220 secs
lola: sara is running 225 secs || 9003956 markings, 44108740 edges, 36314 markings/sec, 225 secs
lola: sara is running 230 secs || 9192366 markings, 45055038 edges, 37682 markings/sec, 230 secs
lola: sara is running 235 secs || 9393572 markings, 46030468 edges, 40241 markings/sec, 235 secs
lola: sara is running 240 secs || 9586540 markings, 46977741 edges, 38594 markings/sec, 240 secs
lola: sara is running 245 secs || 9778141 markings, 47929103 edges, 38320 markings/sec, 245 secs
lola: sara is running 250 secs || 9960337 markings, 48846758 edges, 36439 markings/sec, 250 secs
lola: sara is running 255 secs || 10144622 markings, 49767587 edges, 36857 markings/sec, 255 secs
lola: sara is running 260 secs || 10330952 markings, 50711214 edges, 37266 markings/sec, 260 secs
lola: sara is running 265 secs || 10511996 markings, 51641500 edges, 36209 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 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: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p83 + p82 + p81 + p80 + p84 + p85 + p86 + p87) OR (p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p8 + p9 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p100 + p1... (shortened)
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 24 bytes per marking, with 10 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (2 <= p83 + p82 + p81 + p80 + p84 + p85 + p86 + p87))))
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 24 bytes per marking, with 10 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193) OR (3 <= p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239) OR ((1 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p100 + p101 + p102 + p103 + p96... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72)))
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 24 bytes per marking, with 10 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-9.sara
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND ((3 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248) OR (2 <= p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193)) AND (p112 + p113 + p114 + p... (shortened)
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 24 bytes per marking, with 10 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 233369 markings, 1070523 edges, 46674 markings/sec, 0 secs
lola: sara is running 5 secs || 460431 markings, 2140104 edges, 45412 markings/sec, 5 secs
lola: sara is running 10 secs || 681664 markings, 3225193 edges, 44247 markings/sec, 10 secs
lola: sara is running 15 secs || 902511 markings, 4295671 edges, 44169 markings/sec, 15 secs
lola: sara is running 20 secs || 1119624 markings, 5385652 edges, 43423 markings/sec, 20 secs
lola: sara is running 25 secs || 1337011 markings, 6440352 edges, 43477 markings/sec, 25 secs
lola: sara is running 30 secs || 1553036 markings, 7502165 edges, 43205 markings/sec, 30 secs
lola: sara is running 35 secs || 1773329 markings, 8603743 edges, 44059 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1891498 markings, 9179497 edges
lola: ========================================
lola: subprocess 11 will run for 645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p83 + p82 + p81 + p80 + p84 + p85 + p86 + p87 + 1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND (p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= 1) AND (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2))))
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 24 bytes per marking, with 10 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: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 12 will run for 806 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) AND (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))))
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 24 bytes per marking, with 10 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 13 will run for 1075 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95) AND ((p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193) OR (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)) AND ((3 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 14 will run for 1612 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95) OR (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72) OR (p94 + p93 + p92 + p91 + p90 + p89 + p88 + p95 <= 0) OR (3 <= p249 + p250 + p251 + p252 + p253 + p254 + p255 + p248))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 10 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) AND (p192 + p194 + p196 + p198 + p200 + p202 + p204 + p206 + p207 + p205 + p203 + p201 + p199 + p197 + p195 + p193 <= p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)) OR ((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + ... (shortened)
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 24 bytes per marking, with 10 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 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 234 markings, 243 edges
lola: RESULT
lola:
SUMMARY: yes yes no unknown no no yes yes yes yes yes yes yes no yes yes
lola: ========================================
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-15 TRUE 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="LamportFastMutEx-COL-7"
export BK_EXAMINATION="ReachabilityCardinality"
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/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 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 LamportFastMutEx-COL-7, examination is ReachabilityCardinality"
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-152666472200096"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;