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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_NeoElection-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650000230
=====================================================================

--------------------
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-LTLCardinality-0
FORMULA_NAME NeoElection-COL-2-LTLCardinality-1
FORMULA_NAME NeoElection-COL-2-LTLCardinality-10
FORMULA_NAME NeoElection-COL-2-LTLCardinality-11
FORMULA_NAME NeoElection-COL-2-LTLCardinality-12
FORMULA_NAME NeoElection-COL-2-LTLCardinality-13
FORMULA_NAME NeoElection-COL-2-LTLCardinality-14
FORMULA_NAME NeoElection-COL-2-LTLCardinality-15
FORMULA_NAME NeoElection-COL-2-LTLCardinality-2
FORMULA_NAME NeoElection-COL-2-LTLCardinality-3
FORMULA_NAME NeoElection-COL-2-LTLCardinality-4
FORMULA_NAME NeoElection-COL-2-LTLCardinality-5
FORMULA_NAME NeoElection-COL-2-LTLCardinality-6
FORMULA_NAME NeoElection-COL-2-LTLCardinality-7
FORMULA_NAME NeoElection-COL-2-LTLCardinality-8
FORMULA_NAME NeoElection-COL-2-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496364044057


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_NeoElection-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_NeoElection-COL-2: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_NeoElection-COL-2 @ 3540 seconds
----- 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-LTLCardinality.task
lola: A (X ((p248 + p247 + p246 + p243 + p244 + p245 <= p221 + p220 + p219))) : A (G (X (F (F ((1 <= p252 + p253 + p254)))))) : A ((((2 <= p240 + p241 + p242) U (p218 + p217 + p216 <= p189 + p190 + p191)) U (p273 + p274 + p275 <= p207 + p208 + p209))) : A (G ((F ((3 <= p240 + p241 + p242)) U G ((p210 + p211 + p212 <= p218 + p217 + p216))))) : A (F ((3 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437))) : A (G ((X ((p218 + p217 + p216 <= p251 + p250 + p249)) U F ((p273 + p274 + p275 <= p252 + p253 + p254))))) : A ((3 <= p252 + p253 + p254)) : A ((p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2 <= p273 + p274 + p275)) : A (F (F (G (G ((p248 + p247 + p246 + p243 + p244 + p245 <= p218 + p217 + p216)))))) : A ((G (X ((3 <= p213 + p214 + p215))) U G (G ((p218 + p217 + p216 <= p240 + p241 + p242))))) : A ((F (G ((2 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437))) U (p252 + p253 + p254 <= p273 + p274 + p275))) : A (G (F (G (F ((2 <= p221 + p220 + p219)))))) : A ((((1 <= p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2) U (3 <= p240 + p241 + p242)) U F (G ((3 <= p201 + p202 + p203 + p204 + p205 + p206))))) : A ((p251 + p250 + p249 <= p99 + p96 + p93 + p90 + p87 + p102 + p103 + p104 + p105 + p86 + p85 + p108 + p84 + p81 + p111 + p78 + p75 + p114 + p72 + p69 + p117 + p68 + p67 + p120 + p121 + p122 + p123 + p66 + p63 + p126 + p60 + p57 + p129 + p54 + p51 + p132 + p50 + p49 + p135 + p48 + p45 + p138 + p139 + p140 + p141 + p42 + p39 + p144 + p36 + p33 + p147 + p32 + p31 + p150 + p30 + p27 + p153 + p156 + p157 + p158 + p159 + p162 + p165 + p168 + p171 + p174 + p175 + p176 + p177 + p180 + p183 + p186 + p188 + p187 + p185 + p184 + p182 + p181 + p179 + p178 + p173 + p172 + p170 + p169 + p167 + p166 + p164 + p163 + p161 + p160 + p155 + p154 + p152 + p28 + p29 + p151 + p149 + p148 + p146 + p34 + p35 + p145 + p37 + p38 + p143 + p40 + p41 + p142 + p43 + p44 + p137 + p46 + p47 + p136 + p134 + p133 + p131 + p52 + p53 + p130 + p55 + p56 + p128 + p58 + p59 + p127 + p61 + p62 + p125 + p64 + p65 + p124 + p119 + p118 + p116 + p70 + p71 + p115 + p73 + p74 + p113 + p76 + p77 + p112 + p79 + p80 + p110 + p82 + p83 + p109 + p107 + p106 + p101 + p88 + p89 + p100 + p91 + p92 + p94 + p95 + p97 + p98)) : A (G (X (G (X ((2 <= p207 + p208 + p209)))))) : A (G (X (F ((2 <= p218 + p217 + p216)))))
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 (X ((p248 + p247 + p246 + p243 + p244 + p245 <= p221 + p220 + p219)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p248 + p247 + p246 + p243 + p244 + p245 <= p221 + p220 + p219)))
lola: processed formula: A (X ((p248 + p247 + p246 + p243 + p244 + p245 <= p221 + p220 + p219)))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (F ((1 <= p252 + p253 + p254))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (F ((1 <= p252 + p253 + p254)))))
lola: processed formula: A (G (X (F ((1 <= p252 + p253 + p254)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p240 + p241 + p242) U (p218 + p217 + p216 <= p189 + p190 + p191)) U (p273 + p274 + p275 <= p207 + p208 + p209)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p240 + p241 + p242) U (p218 + p217 + p216 <= p189 + p190 + p191)) U (p273 + p274 + p275 <= p207 + p208 + p209)))
lola: processed formula: A ((((2 <= p240 + p241 + p242) U (p218 + p217 + p216 <= p189 + p190 + p191)) U (p273 + p274 + p275 <= p207 + p208 + p209)))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((3 <= p240 + p241 + p242)) U G ((p210 + p211 + p212 <= p218 + p217 + p216)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((3 <= p240 + p241 + p242)) U G ((p210 + p211 + p212 <= p218 + p217 + p216)))))
lola: processed formula: A (G ((F ((3 <= p240 + p241 + p242)) U G ((p210 + p211 + p212 <= p218 + p217 + p216)))))
lola: processed formula length: 88
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 29 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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p31... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437)))
lola: processed formula: A (F ((3 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p31... (shortened)
lola: processed formula length: 1146
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((p218 + p217 + p216 <= p251 + p250 + p249)) U F ((p273 + p274 + p275 <= p252 + p253 + p254)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((p218 + p217 + p216 <= p251 + p250 + p249)) U F ((p273 + p274 + p275 <= p252 + p253 + p254)))))
lola: processed formula: A (G ((X ((p218 + p217 + p216 <= p251 + p250 + p249)) U F ((p273 + p274 + p275 <= p252 + p253 + p254)))))
lola: processed formula length: 105
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p252 + p253 + p254))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p252 + p253 + p254)
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2 <= p273 + p274 + p275))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2 <= p273 + p274 + p275)
lola: processed formula length: 173
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((p248 + p247 + p246 + p243 + p244 + p245 <= p218 + p217 + p216))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((p248 + p247 + p246 + p243 + p244 + p245 <= p218 + p217 + p216)))))
lola: processed formula: A (F (G (G ((p248 + p247 + p246 + p243 + p244 + p245 <= p218 + p217 + p216)))))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((3 <= p213 + p214 + p215))) U G (G ((p218 + p217 + p216 <= p240 + p241 + p242)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((3 <= p213 + p214 + p215))) U G (G ((p218 + p217 + p216 <= p240 + p241 + p242)))))
lola: processed formula: A ((G (X ((3 <= p213 + p214 + p215))) U G (G ((p218 + p217 + p216 <= p240 + p241 + p242)))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((2 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((2 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437))) U (p252 + p253 + p254 <= p273 + p274 + p275)))
lola: processed formula: A ((F (G ((2 <= p425 + p424 + p407 + p406 + p389 + p388 + p371 + p370 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p298 + p281 + p280 + p276 + p277 + p278 + p279 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p318 +... (shortened)
lola: processed formula length: 1197
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (F ((2 <= p221 + p220 + p219))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((2 <= p221 + p220 + p219)))))
lola: processed formula: A (G (G (F ((2 <= p221 + p220 + p219)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2) U (3 <= p240 + p241 + p242)) U F (G ((3 <= p201 + p202 + p203 + p204 + p205 + p206)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2) U (3 <= p240 + p241 + p242)) U F (G ((3 <= p201 + p202 + p203 + p204 + p205 + p206)))))
lola: processed formula: A ((((1 <= p0 + p1 + p3 + p4 + p6 + p7 + p9 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p10 + p11 + p14 + p17 + p20 + p23 + p26 + p8 + p5 + p2) U (3 <= p240 + p241 + p242)) U F (G ((3 <= p201 + p202 + p203 + p204 + p205 + p206)))))
lola: processed formula length: 249
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p251 + p250 + p249 <= p99 + p96 + p93 + p90 + p87 + p102 + p103 + p104 + p105 + p86 + p85 + p108 + p84 + p81 + p111 + p78 + p75 + p114 + p72 + p69 + p117 + p68 + p67 + p120 + p121 + p122 + p123 + p66 + p63 + p126 + p60 + p57 + p129 + p54 + p51 + p132 + p50 + p49 + p135 + p48 + p45 + p138 + p139 + p140 + p141 + p42 + p39 + p144 + p36 + p33 + p147 + p32 + p31 + p150 + p30 + p27 + p153 + p156 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p251 + p250 + p249 <= p99 + p96 + p93 + p90 + p87 + p102 + p103 + p104 + p105 + p86 + p85 + p108 + p84 + p81 + p111 + p78 + p75 + p114 + p72 + p69 + p117 + p68 + p67 + p120 + p121 + p122 + p123 + p66 + p63 + p126 + p60 + p57 + p129 + p54 + p51 + p132 + p50 + p49 + p135 + p48 + p45 + p138 + p139 + p140 + p141 + p42 + p39 + p144 + p36 + p33 + p147 + p32 + p31 + p150 + p30 + p27 + p153 + p156 + p157... (shortened)
lola: processed formula length: 1082
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((2 <= p207 + p208 + p209))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (X ((2 <= p207 + p208 + p209))))))
lola: processed formula: A (G (X (G (X ((2 <= p207 + p208 + p209))))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F ((2 <= p218 + p217 + p216)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (F ((2 <= p218 + p217 + p216)))))
lola: processed formula: A (G (X (F ((2 <= p218 + p217 + p216)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 628 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no no no yes yes yes no no yes no no
FORMULA NeoElection-COL-2-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496364044299

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_NeoElection-COL-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/S_NeoElection-COL-2.tgz
mv S_NeoElection-COL-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_NeoElection-COL-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441650000230"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;