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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926300203
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494755390745


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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-LTLCardinality.task
lola: A (G (((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549) U (2 <= 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 (X (G (X ((3 <= p251)))))) : A (G (G (((3 <= p249) U (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 <= p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538))))) : A (X (G (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p249) U (2 <= p215))))) : A (X (X (G (G ((1 <= p251)))))) : A (X ((p166 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237))) : A ((((p167 <= p190) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)) U F (X ((3 <= 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 (X (X (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133))))) : A (G ((F ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p166)) U 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 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237))))) : A ((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)) : A (F (X (F (F ((2 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)))))) : A ((((1 <= p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385) U (p214 <= 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)) U X (X ((p166 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212))))) : A (X ((F ((p251 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373)) U (3 <= p179 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180)))) : A (X (((p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212) U G ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p165))))) : A (X ((X ((3 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)) U F ((p405 + p404 + p403 + p402 + p401 + p400 + p399 + p398 + p397 + p396 + p406 <= 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))))) : A (X (X (X (X ((p190 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))))
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 (((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549) U (2 <= 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 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549) U (2 <= 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))))
lola: processed formula: A (G (((2 <= p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540 + p539 + p549) U (2 <= 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 + p2... (shortened)
lola: processed formula length: 945
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((3 <= p251))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (X ((3 <= p251))))))
lola: processed formula: A (G (X (G (X ((3 <= p251))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((3 <= p249) U (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (((3 <= p249) U (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 <= p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)))))
lola: processed formula: A (G (G (((3 <= p249) U (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... (shortened)
lola: processed formula length: 952
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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: 526105 markings, 2260511 edges, 105221 markings/sec, 0 secs
lola: 957115 markings, 4590617 edges, 86202 markings/sec, 5 secs
lola: 1519222 markings, 7375584 edges, 112421 markings/sec, 10 secs
lola: 2035319 markings, 10143321 edges, 103219 markings/sec, 15 secs
lola: 2466798 markings, 12832538 edges, 86296 markings/sec, 20 secs
lola: 2830866 markings, 15460267 edges, 72814 markings/sec, 25 secs
lola: 3255787 markings, 17706399 edges, 84984 markings/sec, 30 secs
lola: 3726394 markings, 20255203 edges, 94121 markings/sec, 35 secs
lola: 4187583 markings, 22929087 edges, 92238 markings/sec, 40 secs
lola: 4529556 markings, 25277055 edges, 68395 markings/sec, 45 secs
lola: 4910990 markings, 27650859 edges, 76287 markings/sec, 50 secs
lola: 5317035 markings, 30147036 edges, 81209 markings/sec, 55 secs
lola: 5651516 markings, 32539325 edges, 66896 markings/sec, 60 secs
lola: 6050640 markings, 35044696 edges, 79825 markings/sec, 65 secs
lola: 6384847 markings, 37458370 edges, 66841 markings/sec, 70 secs
lola: 6751053 markings, 39832336 edges, 73241 markings/sec, 75 secs
lola: 7074152 markings, 42162848 edges, 64620 markings/sec, 80 secs
lola: 7379931 markings, 44395896 edges, 61156 markings/sec, 85 secs
lola: 7687019 markings, 46575575 edges, 61418 markings/sec, 90 secs
lola: 7973564 markings, 48600302 edges, 57309 markings/sec, 95 secs
lola: 8246283 markings, 50766783 edges, 54544 markings/sec, 100 secs
lola: 8556841 markings, 53348096 edges, 62112 markings/sec, 105 secs
lola: 9036442 markings, 55678673 edges, 95920 markings/sec, 110 secs
lola: 9527815 markings, 57997853 edges, 98275 markings/sec, 115 secs
lola: 9984022 markings, 60252589 edges, 91241 markings/sec, 120 secs
lola: 10419534 markings, 62522281 edges, 87102 markings/sec, 125 secs
lola: 10828340 markings, 64766405 edges, 81761 markings/sec, 130 secs
lola: 11220336 markings, 66984417 edges, 78399 markings/sec, 135 secs
lola: 11597853 markings, 69187858 edges, 75503 markings/sec, 140 secs
lola: 11973264 markings, 71399936 edges, 75082 markings/sec, 145 secs
lola: 12354280 markings, 73637848 edges, 76203 markings/sec, 150 secs
lola: 12635946 markings, 75745529 edges, 56333 markings/sec, 155 secs
lola: 12895520 markings, 77880884 edges, 51915 markings/sec, 160 secs
lola: 13154354 markings, 80024372 edges, 51767 markings/sec, 165 secs
lola: 13421346 markings, 82216875 edges, 53398 markings/sec, 170 secs
lola: 13861671 markings, 84482506 edges, 88065 markings/sec, 175 secs
lola: 14301505 markings, 86744733 edges, 87967 markings/sec, 180 secs
lola: 14731495 markings, 88996014 edges, 85998 markings/sec, 185 secs
lola: 15155506 markings, 91233597 edges, 84802 markings/sec, 190 secs
lola: 15552314 markings, 93394685 edges, 79362 markings/sec, 195 secs
lola: 15921434 markings, 95568468 edges, 73824 markings/sec, 200 secs
lola: 16275833 markings, 97729438 edges, 70880 markings/sec, 205 secs
lola: 16653832 markings, 99943704 edges, 75600 markings/sec, 210 secs
lola: 16985612 markings, 102085452 edges, 66356 markings/sec, 215 secs
lola: 17244570 markings, 104178050 edges, 51792 markings/sec, 220 secs
lola: 17500226 markings, 106298097 edges, 51131 markings/sec, 225 secs
lola: 17767418 markings, 108429602 edges, 53438 markings/sec, 230 secs
lola: 18063992 markings, 110623368 edges, 59315 markings/sec, 235 secs
lola: 18490807 markings, 112861889 edges, 85363 markings/sec, 240 secs
lola: 18914153 markings, 115082206 edges, 84669 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p249) U (2 <= p215)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p249) U (2 <= p215)))))
lola: processed formula: A (X (G (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p249) U (2 <= p215)))))
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (G ((1 <= p251))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (G ((1 <= p251))))))
lola: processed formula: A (X (X (G (G ((1 <= p251))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p166 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p166 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237)))
lola: processed formula: A (X ((p166 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p167 <= p190) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)) U F (X ((3 <= 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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p167 <= p190) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)) U F (X ((3 <= 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)))))
lola: processed formula: A ((((p167 <= p190) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)) U F (X ((3 <= 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 ... (shortened)
lola: processed formula length: 1041
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)))))
lola: processed formula: A (X (X (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)))))
lola: processed formula length: 170
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p166)) U 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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p166)) U 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 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237)))))
lola: processed formula: A (G ((F ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p166)) U 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 +... (shortened)
lola: processed formula length: 919
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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: 520628 markings, 2892926 edges, 104126 markings/sec, 0 secs
lola: 906153 markings, 5283005 edges, 77105 markings/sec, 5 secs
lola: 1295217 markings, 8087568 edges, 77813 markings/sec, 10 secs
lola: 1780245 markings, 11197904 edges, 97006 markings/sec, 15 secs
lola: 2285239 markings, 13867375 edges, 100999 markings/sec, 20 secs
lola: 2757930 markings, 15995789 edges, 94538 markings/sec, 25 secs
lola: 3163838 markings, 18504881 edges, 81182 markings/sec, 30 secs
lola: 3637084 markings, 20642677 edges, 94649 markings/sec, 35 secs
lola: 4046432 markings, 22833193 edges, 81870 markings/sec, 40 secs
lola: 4451025 markings, 24793542 edges, 80919 markings/sec, 45 secs
lola: 4823131 markings, 26788160 edges, 74421 markings/sec, 50 secs
lola: 5176101 markings, 28769608 edges, 70594 markings/sec, 55 secs
lola: 5501434 markings, 30738386 edges, 65067 markings/sec, 60 secs
lola: 5816696 markings, 32734359 edges, 63052 markings/sec, 65 secs
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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-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 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((2 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)))))
lola: processed formula: A (F (X (F ((2 <= p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)))))
lola: processed formula length: 97
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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: 1262949 markings, 3353719 edges, 252590 markings/sec, 0 secs
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 641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385) U (p214 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385) U (p214 <= 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)) U X (X ((p166 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212)))))
lola: processed formula: A ((((1 <= p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385) U (p214 <= 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... (shortened)
lola: processed formula length: 931
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 12 will run for 801 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p251 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373)) U (3 <= p179 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p251 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373)) U (3 <= p179 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180))))
lola: processed formula: A (X ((F ((p251 <= p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373)) U (3 <= p179 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180))))
lola: processed formula length: 182
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 13 will run for 1069 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212) U G ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p165)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212) U G ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p165)))))
lola: processed formula: A (X (((p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 <= p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212) U G ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p165)))))
lola: processed formula length: 255
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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: 376361 markings, 2443423 edges, 75272 markings/sec, 0 secs
lola: 718335 markings, 4699865 edges, 68395 markings/sec, 5 secs
lola: 1015304 markings, 6854528 edges, 59394 markings/sec, 10 secs
lola: 1295215 markings, 8905814 edges, 55982 markings/sec, 15 secs
lola: 1544244 markings, 10938006 edges, 49806 markings/sec, 20 secs
lola: 1794788 markings, 13189963 edges, 50109 markings/sec, 25 secs
lola: 2089995 markings, 15428895 edges, 59041 markings/sec, 30 secs
lola: 2372215 markings, 17601777 edges, 56444 markings/sec, 35 secs
lola: 2738070 markings, 20378131 edges, 73171 markings/sec, 40 secs
lola: 3176788 markings, 23469469 edges, 87744 markings/sec, 45 secs
lola: 3563336 markings, 26472253 edges, 77310 markings/sec, 50 secs
lola: 3932564 markings, 29713614 edges, 73846 markings/sec, 55 secs
lola: 4352121 markings, 32768064 edges, 83911 markings/sec, 60 secs
lola: 4673626 markings, 35290246 edges, 64301 markings/sec, 65 secs
lola: 4852382 markings, 36852719 edges, 35751 markings/sec, 70 secs
lola: 5041018 markings, 38471903 edges, 37727 markings/sec, 75 secs
lola: 5388906 markings, 41124732 edges, 69578 markings/sec, 80 secs
lola: 5719774 markings, 44065660 edges, 66174 markings/sec, 85 secs
lola: 6059559 markings, 46811527 edges, 67957 markings/sec, 90 secs
lola: 6384114 markings, 49648988 edges, 64911 markings/sec, 95 secs
lola: 6697854 markings, 52471020 edges, 62748 markings/sec, 100 secs
lola: 7004540 markings, 55266390 edges, 61337 markings/sec, 105 secs
lola: 7304362 markings, 58106773 edges, 59964 markings/sec, 110 secs
lola: 7590564 markings, 60981840 edges, 57240 markings/sec, 115 secs
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 14 will run for 1542 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)) U F ((p405 + p404 + p403 + p402 + p401 + p400 + p399 + p398 + p397 + p396 + p406 <= 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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)) U F ((p405 + p404 + p403 + p402 + p401 + p400 + p399 + p398 + p397 + p396 + p406 <= 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)))))
lola: processed formula: A (X ((X ((3 <= p132 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133)) U F ((p405 + p404 + p403 + p402 + p401 + p400 + p399 + p398 + p397 + p396 + p406 <= 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 +... (shortened)
lola: processed formula length: 1026
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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 15 will run for 3084 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((p190 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((p190 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))))
lola: processed formula: A (X (X (X (X ((p190 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))))))
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: no no unknown no no yes no yes no no yes yes yes no yes yes
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494755846080

--------------------
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="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/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 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 r058-smll-149440926300203"
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 ;