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 SafeBus-COL-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963200205
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494804619469


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ SafeBus-COL-15 @ 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: 5437/65536 symbol table entries, 1233 collisions
lola: preprocessing...
lola: finding significant places
lola: 636 places, 4801 transitions, 556 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2193 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-15-ReachabilityCardinality.task
lola: A (G ((p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 <= p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588))) : E (F (((3 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284) AND ((p604 <= p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620) OR (p635 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558)) AND (1 <= p527)))) : E (F (())) : E (F (((1 <= p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620) AND (p285 <= p635) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p59 + p74 + p89 + p99 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284) OR (1 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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)) AND (1 <= p286)))) : E (F (((p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559 <= 2) OR (p543 + 1 <= p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589)))) : E (F ((((3 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18) AND (p604 + 1 <= p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559)) OR (p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620 + 1 <= p543)))) : A (G (((p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 <= p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619) OR (1 <= p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559)))) : A (G (((p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559 <= 2) OR (p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 <= 2) OR (p527 + 1 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18)))) : E (F ((3 <= p285))) : A (G ((((p604 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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) OR (1 <= p285)) AND (p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p14 + p13 + p12 + p11 + p10)))) : A (G (((2 <= p635) OR (2 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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) OR (1 <= p285) OR (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) OR (p543 <= 2) OR (p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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 <= 1)))) : E (F ((p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559 <= 2))) : A (G ((2 <= p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559))) : A (G (((p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 <= p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619) AND (p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589 <= 1)))) : E (F (((3 <= p543) AND (3 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + 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)))) : E (F (((3 <= p635) AND (p635 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18) AND (p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589 <= p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620))))
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 ((p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 <= p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588)))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18) AND (1 <= p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284) AND ((p604 <= p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620) OR (p635 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551... (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 2224 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1211 markings, 1211 edges, 242 markings/sec, 0 secs
lola: sara is running 5 secs || 2532 markings, 2548 edges, 264 markings/sec, 5 secs

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 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 636 places; total mentions: 0
lola: closed formula file SafeBus-COL-15-ReachabilityCardinality.task
lola: processed formula with 0 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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620) AND (p285 <= p635) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 +... (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 2224 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559 <= 2) OR (p543 + 1 <= p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589))))
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 2224 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18) AND (p604 + 1 <= p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559)) OR (p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620 + 1 <= p543))))
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 2224 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3607 markings, 4268 edges, 721 markings/sec, 0 secs
lola: sara is running 5 secs || 7206 markings, 8627 edges, 720 markings/sec, 5 secs
lola: sara is running 10 secs || 10739 markings, 13255 edges, 707 markings/sec, 10 secs
lola: sara is running 15 secs || 13904 markings, 17389 edges, 633 markings/sec, 15 secs
lola: sara is running 20 secs || 17419 markings, 21999 edges, 703 markings/sec, 20 secs
lola: sara is running 25 secs || 20832 markings, 26366 edges, 683 markings/sec, 25 secs
lola: sara is running 30 secs || 24147 markings, 30816 edges, 663 markings/sec, 30 secs
lola: sara is running 35 secs || 27404 markings, 35065 edges, 651 markings/sec, 35 secs
lola: sara is running 40 secs || 30600 markings, 39387 edges, 639 markings/sec, 40 secs
lola: sara is running 45 secs || 34001 markings, 43950 edges, 680 markings/sec, 45 secs
lola: sara is running 50 secs || 37382 markings, 48833 edges, 676 markings/sec, 50 secs
lola: sara is running 55 secs || 40650 markings, 53229 edges, 654 markings/sec, 55 secs
lola: sara is running 60 secs || 43969 markings, 58067 edges, 664 markings/sec, 60 secs
lola: sara is running 65 secs || 47119 markings, 62344 edges, 630 markings/sec, 65 secs
lola: sara is running 70 secs || 50175 markings, 66586 edges, 611 markings/sec, 70 secs
lola: sara is running 75 secs || 53561 markings, 71289 edges, 677 markings/sec, 75 secs
lola: sara is running 80 secs || 57180 markings, 76513 edges, 724 markings/sec, 80 secs
lola: sara is running 85 secs || 60035 markings, 80382 edges, 571 markings/sec, 85 secs
lola: sara is running 90 secs || 63489 markings, 85294 edges, 691 markings/sec, 90 secs
lola: sara is running 95 secs || 66448 markings, 89436 edges, 592 markings/sec, 95 secs
lola: sara is running 100 secs || 69698 markings, 93973 edges, 650 markings/sec, 100 secs
lola: sara is running 105 secs || 73147 markings, 98624 edges, 690 markings/sec, 105 secs
lola: sara is running 110 secs || 76403 markings, 103144 edges, 651 markings/sec, 110 secs
lola: sara is running 115 secs || 79691 markings, 107863 edges, 658 markings/sec, 115 secs
lola: sara is running 120 secs || 82915 markings, 112664 edges, 645 markings/sec, 120 secs
lola: sara is running 125 secs || 86161 markings, 117560 edges, 649 markings/sec, 125 secs
lola: sara is running 130 secs || 89316 markings, 122363 edges, 631 markings/sec, 130 secs
lola: sara is running 135 secs || 92569 markings, 127034 edges, 651 markings/sec, 135 secs
lola: sara is running 140 secs || 95797 markings, 131549 edges, 646 markings/sec, 140 secs
lola: sara is running 145 secs || 99017 markings, 136256 edges, 644 markings/sec, 145 secs
lola: sara is running 150 secs || 102404 markings, 141007 edges, 677 markings/sec, 150 secs
lola: sara is running 155 secs || 105637 markings, 145622 edges, 647 markings/sec, 155 secs
lola: sara is running 160 secs || 108612 markings, 149978 edges, 595 markings/sec, 160 secs
lola: sara is running 165 secs || 111684 markings, 154453 edges, 614 markings/sec, 165 secs
lola: sara is running 170 secs || 114944 markings, 159354 edges, 652 markings/sec, 170 secs
lola: sara is running 175 secs || 118321 markings, 164159 edges, 675 markings/sec, 175 secs
lola: sara is running 180 secs || 121501 markings, 168831 edges, 636 markings/sec, 180 secs
lola: sara is running 185 secs || 124612 markings, 173452 edges, 622 markings/sec, 185 secs
lola: sara is running 190 secs || 127927 markings, 178562 edges, 663 markings/sec, 190 secs
lola: sara is running 195 secs || 131240 markings, 183201 edges, 663 markings/sec, 195 secs
lola: sara is running 200 secs || 134401 markings, 187827 edges, 632 markings/sec, 200 secs
lola: sara is running 205 secs || 137428 markings, 192360 edges, 605 markings/sec, 205 secs
lola: sara is running 210 secs || 140699 markings, 197645 edges, 654 markings/sec, 210 secs
lola: sara is running 215 secs || 144186 markings, 202877 edges, 697 markings/sec, 215 secs
lola: sara is running 220 secs || 147557 markings, 207685 edges, 674 markings/sec, 220 secs
lola: sara is running 225 secs || 150838 markings, 212858 edges, 656 markings/sec, 225 secs
lola: sara is running 230 secs || 154038 markings, 217769 edges, 640 markings/sec, 230 secs
lola: sara is running 235 secs || 157231 markings, 222588 edges, 639 markings/sec, 235 secs
lola: sara is running 240 secs || 160448 markings, 227872 edges, 643 markings/sec, 240 secs
lola: sara is running 245 secs || 163945 markings, 233375 edges, 699 markings/sec, 245 secs
lola: sara is running 250 secs || 167333 markings, 238544 edges, 678 markings/sec, 250 secs
lola: sara is running 255 secs || 170644 markings, 243659 edges, 662 markings/sec, 255 secs
lola: sara is running 260 secs || 174068 markings, 249003 edges, 685 markings/sec, 260 secs
lola: sara is running 265 secs || 177435 markings, 254341 edges, 673 markings/sec, 265 secs
lola: sara is running 270 secs || 180671 markings, 259668 edges, 647 markings/sec, 270 secs
lola: sara is running 275 secs || 184144 markings, 265345 edges, 695 markings/sec, 275 secs
lola: sara is running 280 secs || 187417 markings, 270526 edges, 655 markings/sec, 280 secs
lola: sara is running 285 secs || 190562 markings, 275272 edges, 629 markings/sec, 285 secs
lola: sara is running 290 secs || 193822 markings, 280139 edges, 652 markings/sec, 290 secs
lola: sara is running 295 secs || 197099 markings, 285064 edges, 655 markings/sec, 295 secs
lola: sara is running 300 secs || 200415 markings, 290219 edges, 663 markings/sec, 300 secs
lola: sara is running 305 secs || 203570 markings, 295076 edges, 631 markings/sec, 305 secs
lola: sara is running 310 secs || 207187 markings, 301110 edges, 723 markings/sec, 310 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 <= p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619) OR (1 <= p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559))))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-6.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 7 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559 <= 2) OR (p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 <= 2) OR (p527 + 1 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18))))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 5643 markings, 8207 edges, 1129 markings/sec, 0 secs
lola: sara is running 5 secs || 11371 markings, 17194 edges, 1146 markings/sec, 5 secs
lola: sara is running 10 secs || 17137 markings, 26190 edges, 1153 markings/sec, 10 secs
lola: sara is running 15 secs || 22888 markings, 35464 edges, 1150 markings/sec, 15 secs
lola: sara is running 20 secs || 28685 markings, 45534 edges, 1159 markings/sec, 20 secs
lola: sara is running 25 secs || 34382 markings, 55278 edges, 1139 markings/sec, 25 secs
lola: sara is running 30 secs || 40177 markings, 65502 edges, 1159 markings/sec, 30 secs
lola: sara is running 35 secs || 45872 markings, 75819 edges, 1139 markings/sec, 35 secs
lola: sara is running 40 secs || 51608 markings, 86685 edges, 1147 markings/sec, 40 secs
lola: sara is running 45 secs || 57304 markings, 97021 edges, 1139 markings/sec, 45 secs
lola: sara is running 50 secs || 63050 markings, 107550 edges, 1149 markings/sec, 50 secs
lola: sara is running 55 secs || 68749 markings, 118366 edges, 1140 markings/sec, 55 secs
lola: sara is running 60 secs || 74385 markings, 129091 edges, 1127 markings/sec, 60 secs
lola: sara is running 65 secs || 80058 markings, 139877 edges, 1135 markings/sec, 65 secs
lola: sara is running 70 secs || 85599 markings, 150722 edges, 1108 markings/sec, 70 secs
lola: sara is running 75 secs || 91110 markings, 161379 edges, 1102 markings/sec, 75 secs
lola: sara is running 80 secs || 96542 markings, 171819 edges, 1086 markings/sec, 80 secs
lola: sara is running 85 secs || 101898 markings, 181258 edges, 1071 markings/sec, 85 secs
lola: sara is running 90 secs || 107107 markings, 190421 edges, 1042 markings/sec, 90 secs
lola: sara is running 95 secs || 112148 markings, 199962 edges, 1008 markings/sec, 95 secs
lola: sara is running 100 secs || 117314 markings, 210249 edges, 1033 markings/sec, 100 secs
lola: sara is running 105 secs || 122412 markings, 220212 edges, 1020 markings/sec, 105 secs
lola: sara is running 110 secs || 127800 markings, 230809 edges, 1078 markings/sec, 110 secs
lola: sara is running 115 secs || 133314 markings, 242139 edges, 1103 markings/sec, 115 secs
lola: sara is running 120 secs || 138801 markings, 252694 edges, 1097 markings/sec, 120 secs
lola: sara is running 125 secs || 144170 markings, 263702 edges, 1074 markings/sec, 125 secs
lola: sara is running 130 secs || 148992 markings, 272872 edges, 964 markings/sec, 130 secs
lola: sara is running 135 secs || 154195 markings, 283602 edges, 1041 markings/sec, 135 secs
lola: sara is running 140 secs || 159821 markings, 294756 edges, 1125 markings/sec, 140 secs
lola: sara is running 145 secs || 165469 markings, 306465 edges, 1130 markings/sec, 145 secs
lola: sara is running 150 secs || 171061 markings, 317535 edges, 1118 markings/sec, 150 secs
lola: sara is running 155 secs || 176577 markings, 328626 edges, 1103 markings/sec, 155 secs
lola: sara is running 160 secs || 181998 markings, 339335 edges, 1084 markings/sec, 160 secs
lola: sara is running 165 secs || 187158 markings, 349809 edges, 1032 markings/sec, 165 secs
lola: sara is running 170 secs || 192343 markings, 359983 edges, 1037 markings/sec, 170 secs
lola: sara is running 175 secs || 197653 markings, 370500 edges, 1062 markings/sec, 175 secs
lola: sara is running 180 secs || 203112 markings, 381478 edges, 1092 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p285)))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 1733 markings, 1738 edges, 347 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p604 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 ... (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 2224 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p635) OR (2 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + ... (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 2224 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 2091 markings, 2262 edges, 418 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559 <= 2)))
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 2224 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 751 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p573 + p572 + p571 + p570 + p569 + p568 + p567 + p566 + p565 + p564 + p563 + p562 + p561 + p560 + p559)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-11.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2224 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is invariant.
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 1001 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 <= p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619) AND (p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2224 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 SafeBus-COL-15-ReachabilityCardinality-12.sara.
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 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-15-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p543) AND (3 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + ... (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 2224 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 SafeBus-COL-15-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 2641 markings, 2874 edges, 528 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2996 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p635) AND (p635 <= p15 + p16 + p17 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p19 + p18) AND (p599 + p600 + p601 + p602 + p603 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p591 + p590 + p589 <= p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620))))
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 2224 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 SafeBus-COL-15-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-15-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 4750 markings, 4937 edges, 950 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes unknown yes no no no yes no yes no no no
FORMULA SafeBus-COL-15-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-15-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494805169106

--------------------
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="SafeBus-COL-15"
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/SafeBus-COL-15.tgz
mv SafeBus-COL-15 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 SafeBus-COL-15, 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 r068-csrt-149440963200205"
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 ;