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 240K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 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 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is NeoElection-COL-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473800243
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527152002207


BK_STOP 1527152045973

--------------------
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 NeoElection-COL-2 as instance name.
Using NeoElection as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, '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': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 186, 'Memory': 109.54, 'Tool': 'lola'}, {'Time': 207, 'Memory': 112.59, 'Tool': 'lola'}, {'Time': 3233, 'Memory': 2230.29, 'Tool': 'marcie'}, {'Time': 3441, 'Memory': 2230.53, 'Tool': 'marcie'}, {'Time': 4424, 'Memory': 346.74, 'Tool': 'itstools'}, {'Time': 4558, 'Memory': 348.62, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 23.78494623655914x far from the best tool lola.
ReachabilityCardinality lola NeoElection-COL-2...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
NeoElection-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
NeoElection-COL-2: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ NeoElection-COL-2 @ 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: 813/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 375 transitions, 156 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 249 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-2-ReachabilityCardinality.task
lola: A (G ((((p395 + p394 + p393 + 1 <= p425 + p424 + p423 + p422 + p421 + p420) AND (p335 + p334 + p333 + 1 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p235 + p234 + p233 + p232 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p174 + p173 + p172 + p171)) OR (p390 + p391 + p392 <= p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416)))) : A (G (((3 <= p5 + p4 + p3) AND (p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 <= p335 + p334 + p333) AND (p5 + p4 + p3 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344) AND ((p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416 + 1 <= p431 + p430 + p429) OR (p335 + p334 + p333 <= 2))))) : E (F (((3 <= p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389) AND (1 <= p428 + p427 + p426) AND (p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344 <= p5 + p4 + p3) AND (p431 + p430 + p429 <= p428 + p427 + p426)))) : A (G ((((1 <= p6 + p7 + p8) AND (p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p235 + p234 + p233 + p232 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p174 + p173 + p172 + p171 <= p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362) AND (p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150 + p21 + p18 + p153 + p15 + p14 + p156 + p157 + p158 + p159 + p13 + p12 + p162 + p165 + p168 + p170 + p169 + p167 + p166 + p164 + p163 + p10 + p11 + p161 + p160 + p155 + p154 + p16 + p17 + p152 + p19 + p20 + p151 + p22 + p23 + p149 + p25 + p26 + p148 + p28 + p29 + p146 + p145 + p143 + p142 + p34 + p35 + p137 + p37 + p38 + p136 + p40 + p41 + p134 + p43 + p44 + p133 + p46 + p47 + p131 + p130 + p128 + p127 + p52 + p53 + p125 + p55 + p56 + p124 + p58 + p59 + p119 + p61 + p62 + p118 + p64 + p65 + p116 + p115 + p113 + p112 + p70 + p71 + p110 + p73 + p74 + p109 + p76 + p77 + p107 + p79 + p80 + p106 + p82 + p83 + p101 + p100 + p88 + p89 + p91 + p92 + p94 + p95 + p97 + p98 <= p417 + p418 + p419) AND (p2 + p1 + p0 <= p425 + p424 + p423 + p422 + p421 + p420)) OR ((p425 + p424 + p423 + p422 + p421 + p420 + 1 <= p6 + p7 + p8) AND (p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p235 + p234 + p233 + p232 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p174 + p173 + p172 + p171))))) : E (F (((p436 + p434 + p432 + p433 + p435 + p437 <= 0) OR (1 <= p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150 + p21 + p18 + p153 + p15 + p14 + p156 + p157 + p158 + p159 + p13 + p12 + p162 + p165 + p168 + p170 + p169 + p167 + p166 + p164 + p163 + p10 + p11 + p161 + p160 + p155 + p154 + p16 + p17 + p152 + p19 + p20 + p151 + p22 + p23 + p149 + p25 + p26 + p148 + p28 + p29 + p146 + p145 + p143 + p142 + p34 + p35 + p137 + p37 + p38 + p136 + p40 + p41 + p134 + p43 + p44 + p133 + p46 + p47 + p131 + p130 + p128 + p127 + p52 + p53 + p125 + p55 + p56 + p124 + p58 + p59 + p119 + p61 + p62 + p118 + p64 + p65 + p116 + p115 + p113 + p112 + p70 + p71 + p110 + p73 + p74 + p109 + p76 + p77 + p107 + p79 + p80 + p106 + p82 + p83 + p101 + p100 + p88 + p89 + p91 + p92 + p94 + p95 + p97 + p98)))) : E (F ((((p436 + p434 + p432 + p433 + p435 + p437 <= p431 + p430 + p429) AND (2 <= p425 + p424 + p423 + p422 + p421 + p420)) OR ((1 <= p335 + p334 + p333) AND (p428 + p427 + p426 <= p398 + p397 + p396)) OR (p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150 + p21 + p18 + p153 + p15 + p14 + p156 + p157 + p158 + p159 + p13 + p12 + p162 + p165 + p168 + p170 + p169 + p167 + p166 + p164 + p163 + p10 + p11 + p161 + p160 + p155 + p154 + p16 + p17 + p152 + p19 + p20 + p151 + p22 + p23 + p149 + p25 + p26 + p148 + p28 + p29 + p146 + p145 + p143 + p142 + p34 + p35 + p137 + p37 + p38 + p136 + p40 + p41 + p134 + p43 + p44 + p133 + p46 + p47 + p131 + p130 + p128 + p127 + p52 + p53 + p125 + p55 + p56 + p124 + p58 + p59 + p119 + p61 + p62 + p118 + p64 + p65 + p116 + p115 + p113 + p112 + p70 + p71 + p110 + p73 + p74 + p109 + p76 + p77 + p107 + p79 + p80 + p106 + p82 + p83 + p101 + p100 + p88 + p89 + p91 + p92 + p94 + p95 + p97 + p98 <= p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416)))) : E (F ((p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389 <= p428 + p427 + p426))) : A (G (((2 <= p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389) OR (3 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p235 + p234 + p233 + p232 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p174 + p173 + p172 + p171) OR (p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416 <= 2) OR (p2 + p1 + p0 <= p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362) OR (p335 + p334 + p333 <= p417 + p418 + p419) OR ((2 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344) AND (2 <= p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362))))) : A (G ((p390 + p391 + p392 <= 1))) : E (F (((p431 + p430 + p429 <= p428 + p427 + p426) AND (p6 + p7 + p8 <= p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150 + p21 + p18 + p153 + p15 + p14 + p156 + p157 + p158 + p159 + p13 + p12 + p162 + p165 + p168 + p170 + p169 + p167 + p166 + p164 + p163 + p10 + p11 + p161 + p160 + p155 + p154 + p16 + p17 + p152 + p19 + p20 + p151 + p22 + p23 + p149 + p25 + p26 + p148 + p28 + p29 + p146 + p145 + p143 + p142 + p34 + p35 + p137 + p37 + p38 + p136 + p40 + p41 + p134 + p43 + p44 + p133 + p46 + p47 + p131 + p130 + p128 + p127 + p52 + p53 + p125 + p55 + p56 + p124 + p58 + p59 + p119 + p61 + p62 + p118 + p64 + p65 + p116 + p115 + p113 + p112 + p70 + p71 + p110 + p73 + p74 + p109 + p76 + p77 + p107 + p79 + p80 + p106 + p82 + p83 + p101 + p100 + p88 + p89 + p91 + p92 + p94 + p95 + p97 + p98)))) : E (F ((((p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344 <= p6 + p7 + p8) OR (3 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344) OR (1 <= p431 + p430 + p429)) AND ((p390 + p391 + p392 <= p398 + p397 + p396) OR ((1 <= p431 + p430 + p429) AND (3 <= p428 + p427 + p426)))))) : A (G ((3 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344))) : E (F ((p395 + p394 + p393 + 1 <= p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150 + p21 + p18 + p153 + p15 + p14 + p156 + p157 + p158 + p159 + p13 + p12 + p162 + p165 + p168 + p170 + p169 + p167 + p166 + p164 + p163 + p10 + p11 + p161 + p160 + p155 + p154 + p16 + p17 + p152 + p19 + p20 + p151 + p22 + p23 + p149 + p25 + p26 + p148 + p28 + p29 + p146 + p145 + p143 + p142 + p34 + p35 + p137 + p37 + p38 + p136 + p40 + p41 + p134 + p43 + p44 + p133 + p46 + p47 + p131 + p130 + p128 + p127 + p52 + p53 + p125 + p55 + p56 + p124 + p58 + p59 + p119 + p61 + p62 + p118 + p64 + p65 + p116 + p115 + p113 + p112 + p70 + p71 + p110 + p73 + p74 + p109 + p76 + p77 + p107 + p79 + p80 + p106 + p82 + p83 + p101 + p100 + p88 + p89 + p91 + p92 + p94 + p95 + p97 + p98))) : E (F (((p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416 <= 1) AND (p417 + p418 + p419 + 1 <= p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389) AND (p436 + p434 + p432 + p433 + p435 + p437 <= p425 + p424 + p423 + p422 + p421 + p420)))) : E (F ((p5 + p4 + p3 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p235 + p234 + p233 + p232 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p174 + p173 + p172 + p171))) : A (G (((p425 + p424 + p423 + p422 + p421 + p420 <= 0) OR (p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150 + p21 + p18 + p153 + p15 + p14 + p156 + p157 + p158 + p159 + p13 + p12 + p162 + p165 + p168 + p170 + p169 + p167 + p166 + p164 + p163 + p10 + p11 + p161 + p160 + p155 + p154 + p16 + p17 + p152 + p19 + p20 + p151 + p22 + p23 + p149 + p25 + p26 + p148 + p28 + p29 + p146 + p145 + p143 + p142 + p34 + p35 + p137 + p37 + p38 + p136 + p40 + p41 + p134 + p43 + p44 + p133 + p46 + p47 + p131 + p130 + p128 + p127 + p52 + p53 + p125 + p55 + p56 + p124 + p58 + p59 + p119 + p61 + p62 + p118 + p64 + p65 + p116 + p115 + p113 + p112 + p70 + p71 + p110 + p73 + p74 + p109 + p76 + p77 + p107 + p79 + p80 + p106 + p82 + p83 + p101 + p100 + p88 + p89 + p91 + p92 + p94 + p95 + p97 + p98 + 1 <= p417 + p418 + p419) OR (p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + 1 <= p417 + p418 + p419))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p395 + p394 + p393 + 1 <= p425 + p424 + p423 + p422 + p421 + p420) AND (p335 + p334 + p333 + 1 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 +... (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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p5 + p4 + p3) AND (p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 <= p335 + p334 + p333) AND (p5 + p4 + p3 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344) AND ((p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416 + 1 <= p... (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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 5 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389) AND (1 <= p428 + p427 + p426) AND (p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344 <= p5 + p4 + p3) AND (p431 + p430 + p429 <= p428 + p427 + p426))))
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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-2.sara
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p6 + p7 + p8) AND (p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p28... (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 20 bytes per marking, with 4 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 16 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-3.sara
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-2.sara.
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p436 + p434 + p432 + p433 + p435 + p437 <= 0) OR (1 <= p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p436 + p434 + p432 + p433 + p435 + p437 <= p431 + p430 + p429) AND (2 <= p425 + p424 + p423 + p422 + p421 + p420)) OR ((1 <= p335 + p334 + p333) AND (p428 + p427 + p426 <= p398 + p397 + p396)) OR (p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-5.sara
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-3.sara.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-5.sara.

lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389 <= p428 + p427 + p426)))
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 20 bytes per marking, with 4 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 NeoElection-COL-2-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 241 markings, 448 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389) OR (3 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + ... (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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p390 + p391 + p392 <= 1)))
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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p431 + p430 + p429 <= p428 + p427 + p426) AND (p6 + p7 + p8 <= p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344 <= p6 + p7 + p8) OR (3 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344) OR (1 <= p431 + p430 + p429)) AND ((p390 + p391 + p392 <= p398 + p397 + p396) OR ((1 <= p431 + p430 + p429) AND (3 <= p428 + p427 + p426))))))
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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p343 + p342 + p340 + p339 + p337 + p336 + p338 + p341 + p344)))
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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p395 + p394 + p393 + 1 <= p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30 + p147 + p27 + p24 + p150... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 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 NeoElection-COL-2-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p415 + p414 + p413 + p412 + p411 + p409 + p408 + p407 + p406 + p405 + p403 + p402 + p401 + p400 + p399 + p404 + p410 + p416 <= 1) AND (p417 + p418 + p419 + 1 <= p388 + p387 + p385 + p384 + p382 + p381 + p379 + p378 + p376 + p375 + p373 + p372 + p370 + p369 + p367 + p366 + p364 + p363 + p365 + p368 + p371 + p374 + p377 + p380 + p383 + p386 + p389) AND (p436 + p434 + p432 + p433 + p435 + p43... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-13.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p5 + p4 + p3 <= p175 + p176 + p193 + p194 + p211 + p212 + p229 + p230 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p425 + p424 + p423 + p422 + p421 + p420 <= 0) OR (p99 + p96 + p93 + p90 + p87 + p86 + p9 + p85 + p84 + p102 + p103 + p104 + p105 + p81 + p78 + p108 + p75 + p72 + p111 + p69 + p68 + p114 + p67 + p66 + p117 + p63 + p60 + p120 + p121 + p122 + p123 + p57 + p54 + p126 + p51 + p50 + p129 + p49 + p48 + p132 + p45 + p42 + p135 + p39 + p36 + p138 + p139 + p140 + p141 + p33 + p32 + p144 + p31 + p30... (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 20 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-13.sara.

lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-COL-2-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no yes yes yes yes no yes no yes no
lola: ========================================
sara: try reading problem file NeoElection-COL-2-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic



FORMULA NeoElection-COL-2-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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/NeoElection-COL-2.tgz
mv NeoElection-COL-2 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-structural"
echo " Input is NeoElection-COL-2, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666473800243"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;