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 mcc4mcc-structural
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 r119-csrt-152666479500094
=====================================================================

--------------------
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 1527319051721


BK_STOP 1527319420723

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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 stderr -----
----- Start make result stdout -----
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 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (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 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= 0) AND (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + 1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)))) : A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31)))) : A (F ((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143))) : NOT((E (F (((p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)))) AND A (((3 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) U (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111))))) : A (F ((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31))) : E (F (A (G (((3 <= 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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) AND (1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)))))) : E (((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 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) U E (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223))))) : E (F (E (G (((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND (1 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31)))))) : E (F (E (G ((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= 2))))) : E (G (E (F ((p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + 1 <= 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 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))) : A (((((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241)) AND (p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31 <= 2)) U A (X ((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31))))) : A (G ((E (G ((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111))) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 0) OR ((p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) AND (1 <= p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241)))))) : ((((((3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223)) OR A (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223)))) AND (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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231)) AND ((((p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241 + 1 <= p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239) AND (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= 1)) OR (p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)) OR E (X ((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))))) : E (F (E (F (((1 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) AND (p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17)))))) : A (X (E (F ((p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + 1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143))))) : NOT(A (G (E (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))))
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 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (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 + p18... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (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 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= 0) AND (p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + 1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111))))
lola: processed formula: A (F (((2 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (2 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (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 + p18... (shortened)
lola: processed formula length: 1142
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: 193 markings, 193 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 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 + p88 + p89 + p90... (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
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 996 markings, 2983 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))
lola: processed formula: A (F ((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))
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: 141175 markings, 255433 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)))) AND A (((3 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) U (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)))))
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 (((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + 1 <= p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= 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
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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= 2) R (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + 1 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) U (p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)))
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31)))
lola: processed formula: A (F ((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31)))
lola: processed formula length: 60
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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= 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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95... (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 ((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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 ... (shortened)
lola: processed formula length: 480
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: 714182 markings, 4472370 edges, 3225410488133222400 markings/sec, 0 secs
lola: 1329807 markings, 8450682 edges, 123125 markings/sec, 5 secs
lola: 1931321 markings, 12388779 edges, 120303 markings/sec, 10 secs
lola: 2552795 markings, 16485462 edges, 124295 markings/sec, 15 secs
lola: 3193404 markings, 20777063 edges, 128122 markings/sec, 20 secs
lola: 3759176 markings, 24618751 edges, 113154 markings/sec, 25 secs
lola: 4337368 markings, 28532094 edges, 115638 markings/sec, 30 secs
lola: 4945081 markings, 32630805 edges, 121543 markings/sec, 35 secs
lola: 5489102 markings, 36299040 edges, 108804 markings/sec, 40 secs
lola: 6067209 markings, 40295172 edges, 115621 markings/sec, 45 secs
lola: 6602234 markings, 43948065 edges, 107005 markings/sec, 50 secs
lola: 7135683 markings, 47613225 edges, 106690 markings/sec, 55 secs
lola: 7671890 markings, 51278325 edges, 107241 markings/sec, 60 secs
lola: 8198367 markings, 54939685 edges, 105295 markings/sec, 65 secs
lola: 8779489 markings, 58903198 edges, 116224 markings/sec, 70 secs
lola: 9349567 markings, 62825703 edges, 114016 markings/sec, 75 secs
lola: 9907432 markings, 66686143 edges, 111573 markings/sec, 80 secs
lola: 10432458 markings, 70305207 edges, 105005 markings/sec, 85 secs
lola: 10951028 markings, 73931534 edges, 103714 markings/sec, 90 secs
lola: 11451892 markings, 77420473 edges, 100173 markings/sec, 95 secs
lola: 11962166 markings, 80961829 edges, 102055 markings/sec, 100 secs
lola: 12458828 markings, 84474609 edges, 99332 markings/sec, 105 secs
lola: 12969710 markings, 88006378 edges, 102176 markings/sec, 110 secs
lola: 13480186 markings, 91563010 edges, 102095 markings/sec, 115 secs
lola: 13992900 markings, 95068735 edges, 102543 markings/sec, 120 secs
lola: 14498360 markings, 98671364 edges, 101092 markings/sec, 125 secs
lola: 14998371 markings, 102154989 edges, 100002 markings/sec, 130 secs
lola: 15496636 markings, 105633327 edges, 99653 markings/sec, 135 secs
lola: 16004577 markings, 109256007 edges, 101588 markings/sec, 140 secs
lola: 16527727 markings, 112935874 edges, 104630 markings/sec, 145 secs
lola: 17050459 markings, 116606460 edges, 104546 markings/sec, 150 secs
lola: 17566063 markings, 120277102 edges, 103121 markings/sec, 155 secs
lola: 18068243 markings, 123832753 edges, 100436 markings/sec, 160 secs
lola: 18579982 markings, 127415455 edges, 102348 markings/sec, 165 secs
lola: 19063725 markings, 130863827 edges, 96749 markings/sec, 170 secs
lola: 19556827 markings, 134346390 edges, 98620 markings/sec, 175 secs
lola: 20041603 markings, 137791658 edges, 96955 markings/sec, 180 secs
lola: 20517407 markings, 141179717 edges, 95161 markings/sec, 185 secs
lola: 21004642 markings, 144663829 edges, 97447 markings/sec, 190 secs
lola: 21487970 markings, 148082797 edges, 96666 markings/sec, 195 secs
lola: 21994393 markings, 151614232 edges, 101285 markings/sec, 200 secs
lola: 22494573 markings, 155169121 edges, 100036 markings/sec, 205 secs
lola: 22982096 markings, 158628934 edges, 97505 markings/sec, 210 secs
lola: 23469024 markings, 162097840 edges, 97386 markings/sec, 215 secs
lola: 23956299 markings, 165609787 edges, 97455 markings/sec, 220 secs
lola: 24458293 markings, 169145994 edges, 100399 markings/sec, 225 secs
lola: 24954345 markings, 172665748 edges, 99210 markings/sec, 230 secs
lola: 25443790 markings, 176148262 edges, 97889 markings/sec, 235 secs
lola: 25932542 markings, 179628211 edges, 97750 markings/sec, 240 secs
lola: 26427507 markings, 183142605 edges, 98993 markings/sec, 245 secs
lola: 26917423 markings, 186651552 edges, 97983 markings/sec, 250 secs
lola: 27401301 markings, 190070677 edges, 96776 markings/sec, 255 secs
lola: 27879351 markings, 193490483 edges, 95610 markings/sec, 260 secs
lola: 28362447 markings, 196952985 edges, 96619 markings/sec, 265 secs
lola: 28837515 markings, 200326762 edges, 95014 markings/sec, 270 secs
lola: 29317694 markings, 203720215 edges, 96036 markings/sec, 275 secs
lola: 29797470 markings, 207211143 edges, 95955 markings/sec, 280 secs
lola: 30290506 markings, 210722681 edges, 98607 markings/sec, 285 secs
lola: 30787440 markings, 214253422 edges, 99387 markings/sec, 290 secs
lola: 31266743 markings, 217729113 edges, 95861 markings/sec, 295 secs
lola: 31753838 markings, 221230464 edges, 97419 markings/sec, 300 secs
lola: 32238236 markings, 224695997 edges, 96880 markings/sec, 305 secs
lola: 32716764 markings, 228170081 edges, 95706 markings/sec, 310 secs
lola: 33211534 markings, 231690169 edges, 98954 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 (((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 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((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 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 ... (shortened)
lola: processed formula length: 641
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: 15427 markings, 28070 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99) AND (1 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 + 1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31 <= 0)))))
lola: processed formula length: 196
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: 11487 markings, 19401 edges
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (3 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111))))
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: 69 markings, 70 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + 1 <= 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 + p184 + p185 + p186 + p187 + p188 + p189 + p190... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + 1 <= 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 + p184 + p185 + p186 + p187 + p188... (shortened)
lola: processed formula length: 538
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: 76 markings, 201 edges
lola: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241)) AND (p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31 <= 2)) U A (X ((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 <= p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241)) AND (p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31 <= 2)) U AX((2 <= p27 + p26 + p25 + p24 + p28 + p29 + p30 + p31)))... (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: 69 markings, 69 edges
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111))) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 0) OR ((p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17) AND (1 <= p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= 0)) AND ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND ((p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17 + 1 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) OR (p240 + p242 + p244 + p246 + p248 + p250 + p252 + p254 + p255 + p253 + p251 + p249 + p247 + p245 + p243 + p241 <= 0))))))
lola: processed formula length: 374
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: 1487 markings, 3706 edges
lola: ========================================
lola: subprocess 12 will run for 803 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((((3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223)) OR A (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p216 + p217 + p218 + p219 + p220 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 803 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223))
lola: processed formula length: 292
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 1071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215) AND (p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p23 + p22 + p21 + p20 + p19 + p18 + p16 + p17))))))
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: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + 1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + 1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143)))
lola: processed formula length: 130
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: 87 markings, 91 edges
lola: ========================================
lola: subprocess 15 will run for 3215 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))
lola: processed formula length: 120
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).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 80066 markings, 187283 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="mcc4mcc-structural"
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 mcc4mcc-structural"
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 r119-csrt-152666479500094"
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 ;