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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472200094
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527139044672


BK_STOP 1527139410707

--------------------
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': 'CTLCardinality', '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': 1302737, 'Memory': 15944.7, 'Tool': 'lola'}, {'Time': 1710862, 'Memory': 14762.38, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality 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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ 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-CTLCardinality.task
lola: A (F (((2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (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 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= 0) AND (p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95 + 1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))) : A (G (((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255) OR (p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))) : A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) : NOT((E (F (((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) AND (1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))) AND A (((3 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) U (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))) : A (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))) : E (F (A (G (((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255) AND (1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))))) : E (((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 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) U E (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95))))) : E (F (E (G (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) AND (1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))) : E (F (E (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2))))) : E (G (E (F ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + 1 <= 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 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87))))) : A (((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) OR (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161)) AND (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= 2)) U A (X ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))) : A (G ((E (G ((1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR ((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= 0) OR ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161)))))) : ((((((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95)) OR A (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95)))) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)) AND ((((p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161 + 1 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 1)) OR (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)) OR E (X ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135))))) : E (F (E (F (((1 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)))))) : A (X (E (F ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : NOT(A (G (E (G ((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143))))))
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 (F (((2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (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 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (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 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 <= 0) AND (p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95 + 1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
lola: processed formula: A (F (((2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (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 + p6... (shortened)
lola: processed formula length: 1140
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 +... (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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-7-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9451 markings, 35510 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: processed formula: A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) AND (1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))) AND A (((3 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) U (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 + 1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0))))
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-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= 2) R (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) U (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
lola: processed formula length: 183
lola: 11 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))
lola: processed formula: A (F ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 9 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p24... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 ... (shortened)
lola: processed formula length: 544
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: 662977 markings, 3933836 edges, 2962460907961057280 markings/sec, 0 secs
lola: 1312334 markings, 7925953 edges, 129871 markings/sec, 5 secs
lola: 1917095 markings, 11809607 edges, 120952 markings/sec, 10 secs
lola: 2509912 markings, 15483564 edges, 118563 markings/sec, 15 secs
lola: 3118864 markings, 19384031 edges, 121790 markings/sec, 20 secs
lola: 3702324 markings, 23254695 edges, 116692 markings/sec, 25 secs
lola: 4254628 markings, 26893124 edges, 110461 markings/sec, 30 secs
lola: 4852455 markings, 30679985 edges, 119565 markings/sec, 35 secs
lola: 5463689 markings, 34777617 edges, 122247 markings/sec, 40 secs
lola: 6039073 markings, 38556533 edges, 115077 markings/sec, 45 secs
lola: 6602358 markings, 42177908 edges, 112657 markings/sec, 50 secs
lola: 7143365 markings, 45685823 edges, 108201 markings/sec, 55 secs
lola: 7654500 markings, 49103398 edges, 102227 markings/sec, 60 secs
lola: 8176633 markings, 52517430 edges, 104427 markings/sec, 65 secs
lola: 8701747 markings, 55936518 edges, 105023 markings/sec, 70 secs
lola: 9243156 markings, 59563340 edges, 108282 markings/sec, 75 secs
lola: 9818975 markings, 63329675 edges, 115164 markings/sec, 80 secs
lola: 10347287 markings, 66822356 edges, 105662 markings/sec, 85 secs
lola: 10843332 markings, 70213065 edges, 99209 markings/sec, 90 secs
lola: 11403242 markings, 73941661 edges, 111982 markings/sec, 95 secs
lola: 11911998 markings, 77334471 edges, 101751 markings/sec, 100 secs
lola: 12454004 markings, 80919287 edges, 108401 markings/sec, 105 secs
lola: 12969696 markings, 84405881 edges, 103138 markings/sec, 110 secs
lola: 13507467 markings, 87957843 edges, 107554 markings/sec, 115 secs
lola: 14060894 markings, 91723037 edges, 110685 markings/sec, 120 secs
lola: 14624652 markings, 95489863 edges, 112752 markings/sec, 125 secs
lola: 15129315 markings, 98879961 edges, 100933 markings/sec, 130 secs
lola: 15641833 markings, 102349610 edges, 102504 markings/sec, 135 secs
lola: 16168545 markings, 106064177 edges, 105342 markings/sec, 140 secs
lola: 16685385 markings, 109635153 edges, 103368 markings/sec, 145 secs
lola: 17203580 markings, 113104102 edges, 103639 markings/sec, 150 secs
lola: 17710689 markings, 116553712 edges, 101422 markings/sec, 155 secs
lola: 18246644 markings, 120121686 edges, 107191 markings/sec, 160 secs
lola: 18766167 markings, 123614846 edges, 103905 markings/sec, 165 secs
lola: 19291114 markings, 127120777 edges, 104989 markings/sec, 170 secs
lola: 19754933 markings, 130301532 edges, 92764 markings/sec, 175 secs
lola: 20237590 markings, 133582314 edges, 96531 markings/sec, 180 secs
lola: 20775848 markings, 137161679 edges, 107652 markings/sec, 185 secs
lola: 21254628 markings, 140425099 edges, 95756 markings/sec, 190 secs
lola: 21752171 markings, 143818447 edges, 99509 markings/sec, 195 secs
lola: 22260502 markings, 147298083 edges, 101666 markings/sec, 200 secs
lola: 22789775 markings, 150969535 edges, 105855 markings/sec, 205 secs
lola: 23303674 markings, 154472227 edges, 102780 markings/sec, 210 secs
lola: 23806174 markings, 157987324 edges, 100500 markings/sec, 215 secs
lola: 24322944 markings, 161491316 edges, 103354 markings/sec, 220 secs
lola: 24797390 markings, 164760768 edges, 94889 markings/sec, 225 secs
lola: 25268108 markings, 167955998 edges, 94144 markings/sec, 230 secs
lola: 25760720 markings, 171390840 edges, 98522 markings/sec, 235 secs
lola: 26237143 markings, 174676218 edges, 95285 markings/sec, 240 secs
lola: 26723414 markings, 177986472 edges, 97254 markings/sec, 245 secs
lola: 27189045 markings, 181153854 edges, 93126 markings/sec, 250 secs
lola: 27655605 markings, 184397891 edges, 93312 markings/sec, 255 secs
lola: 28132243 markings, 187693504 edges, 95328 markings/sec, 260 secs
lola: 28595581 markings, 190835685 edges, 92668 markings/sec, 265 secs
lola: 29057592 markings, 194013018 edges, 92402 markings/sec, 270 secs
lola: 29524365 markings, 197227266 edges, 93355 markings/sec, 275 secs
lola: 30003475 markings, 200512846 edges, 95822 markings/sec, 280 secs
lola: 30477000 markings, 203763267 edges, 94705 markings/sec, 285 secs
lola: 30956576 markings, 207063632 edges, 95915 markings/sec, 290 secs
lola: 31420369 markings, 210208507 edges, 92759 markings/sec, 295 secs
lola: 31882763 markings, 213425488 edges, 92479 markings/sec, 300 secs
lola: 32350033 markings, 216663432 edges, 93454 markings/sec, 305 secs
lola: 32821939 markings, 219946190 edges, 94381 markings/sec, 310 secs
lola: 33268092 markings, 223082978 edges, 89231 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((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 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 <= p0 + p1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((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 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 <= p0 + p1 + p2... (shortened)
lola: processed formula length: 543
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) AND (1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= 0)))))
lola: processed formula length: 198
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28241 markings, 55249 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + 1 <= 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 + p72 + p73 + p74 + p75 + p76 + p77 + p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + 1 <= 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 + p72 + p73 + p74 + p75 + ... (shortened)
lola: processed formula length: 474
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 46 markings, 64 edges
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) OR (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161)) AND (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= 2)) U A (X ((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) OR (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161)) AND (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= 2)) U AX((2 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))... (shortened)
lola: processed formula length: 400
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) OR ((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= 0) OR ((p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0)) AND ((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) AND ((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + 1 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) OR (p160 + p162 + p164 + p166 + p168 + p170 + p172 + p174 + p175 + p173 + p171 + p169 + p167 + p165 + p163 + p161 <= 0))))))
lola: processed formula length: 398
lola: 6 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 112640 markings, 319276 edges
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95)) OR A (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95)))) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR (p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) AND (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + 1 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95))
lola: processed formula length: 284
lola: 1 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
lola: processed formula with 3 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
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p91 + p90 + p89 + p88 + p92 + p93 + p94 + p95)))
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-CTLCardinality-13.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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111))))))
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-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: processed formula length: 110
lola: 2 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: 122 markings, 126 edges
lola: ========================================
lola: subprocess 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17)))
lola: processed formula length: 128
lola: 7 rewrites
lola: formula mentions 0 of 264 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-7-CTLCardinality.task
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 84684 markings, 312580 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown yes yes yes yes no no no yes yes yes
FORMULA LamportFastMutEx-COL-7-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-7-CTLCardinality-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="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/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 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-152666472200094"
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 ;