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 QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926300205
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494755484767


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-10 @ 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: E (F (((2 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212) AND (3 <= p166) AND ((1 <= p214) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)) AND (p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131) AND (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 <= p384) AND ((2 <= p251) OR (p252 + p362 + p351 + p340 + p329 + p318 + p307 + p296 + p285 + p263 + p274 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p264 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p262 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p261 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p260 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p259 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p258 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p257 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p256 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p255 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p254 + p253 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p88 + p77 + p66 + p55 + p44 + p33 + p22 + p11 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p10 + p108 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p107 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p106 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p105 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p104 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p103 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p102 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p101 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : E (F (((2 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527) AND (p249 + 1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178) AND (p252 + p362 + p351 + p340 + p329 + p318 + p307 + p296 + p285 + p263 + p274 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p264 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p262 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p261 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p260 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p259 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p258 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p257 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p256 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p255 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p254 + p253 <= 1)))) : E (F ((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))) : A (G (((p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 <= 2) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= 2) OR (p251 <= 0)))) : A (G (((p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + 1 <= p384) OR (p165 + 1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178) OR (p190 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373)))) : A (G ((p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 <= 1))) : E (F ((((3 <= p216 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217) AND (1 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373) AND (p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 <= p250) AND (1 <= p216 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217)) OR (2 <= p384)))) : A (G (((p166 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 <= 0)))) : E (F (((((2 <= p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538) AND (p190 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p88 + p77 + p66 + p55 + p44 + p33 + p22 + p11 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p10 + p108 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p107 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p106 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p105 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p104 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p103 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p102 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p101 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 <= 1)) AND (p215 + 1 <= p252 + p362 + p351 + p340 + p329 + p318 + p307 + p296 + p285 + p263 + p274 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p264 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p262 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p261 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p260 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p259 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p258 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p257 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p256 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p255 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p254 + p253)))) : A (G ((p250 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212))) : A (G (())) : A (G (((p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= 1) OR (p250 <= 2) OR (p384 + 1 <= p214) OR (p214 <= 2)))) : E (F (((2 <= p249)))) : A (G ((((p252 + p362 + p351 + p340 + p329 + p318 + p307 + p296 + p285 + p263 + p274 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p264 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p262 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p261 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p260 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p259 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p258 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p257 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p256 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p255 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p254 + p253 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131) AND ((p216 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p88 + p77 + p66 + p55 + p44 + p33 + p22 + p11 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p10 + p108 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p107 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p106 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p105 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p104 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p103 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p102 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p101 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p213))) OR (p190 + 1 <= p251)))) : E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p88 + p77 + p66 + p55 + p44 + p33 + p22 + p11 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p10 + p108 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p107 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p106 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p105 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p104 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p103 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p102 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p101 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131) AND ((3 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527) OR ((1 <= p252 + p362 + p351 + p340 + p329 + p318 + p307 + p296 + p285 + p263 + p274 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p264 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p262 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p261 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p260 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p259 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p258 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p257 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p256 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p255 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p254 + p253) AND (3 <= p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)))))) : E (F (((3 <= p251) AND (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p213) AND (2 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527) AND (p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + 1 <= p213))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212) AND (3 <= p166) AND ((1 <= p214) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)) AND (p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 <= p121 + p122 + p123 + p124 + p125 + ... (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 700 bytes per marking, with 0 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 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p4... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara.
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))
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 700 bytes per marking, with 0 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 <= 2) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= 2) OR (p251 <= 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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + 1 <= p384) OR (p165 + 1 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178) OR (p190 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373))))
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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: state equation: calling and running sara
The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 <= 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 700 bytes per marking, with 0 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-5.sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-4.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p216 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217) AND (1 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373) AND (p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 <= p250) AND (1 <= p216 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217)) OR (2 <= p384))))
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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p166 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 <= 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 700 bytes per marking, with 0 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((2 <= p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538) AND (p190 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p88 + p77 + p66 + p55 + p44 + p33 + p22 + p11 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p10 + p108 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p107 + p23 + p24 + p25 + p26 + p27... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p250 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212)))
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 700 bytes per marking, with 0 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= 1) OR (p250 <= 2) OR (p384 + 1 <= p214) OR (p214 <= 2))))
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 700 bytes per marking, with 0 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)
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-9.sara.
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p249))))
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 700 bytes per marking, with 0 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p252 + p362 + p351 + p340 + p329 + p318 + p307 + p296 + p285 + p263 + p274 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p264 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p262 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p261 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p260 + p308 + p309 +... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p88 + p77 + p66 + p55 + p44 + p33 + p22 + p11 + p109 + p110 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p10 + p108 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p107 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p106 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p4... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-13.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p251) AND (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p213) AND (2 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p4... (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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes yes no yes yes no no yes no
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494755485912

--------------------
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="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
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/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 QuasiCertifProtocol-COL-10, 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 r058-smll-149440926300205"
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 ;