Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBNT-COL-S10J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231500075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496305710676


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBNT-COL-S10J60: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBNT-COL-S10J60: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_PolyORBNT-COL-S10J60 @ 3535 seconds
----- Start make result stdout -----
lola: LoLA will run for 3535 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14274/65536 symbol table entries, 4496 collisions
lola: preprocessing...
lola: finding significant places
lola: 1294 places, 12980 transitions, 1142 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3558 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J60-CTLCardinality.task
lola: A (G (((p445 <= p314) OR (2 <= 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 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559) OR ((3 <= p0) AND (2 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308)) OR (p313 + 1 <= p315) OR ((2 <= 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) AND (1 <= p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458))))) : A (G ((A (F ((3 <= p311))) AND E (F ((p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p627 + p626 + p625 + p624 + p623 + p622 + p621 <= p312)))))) : E ((((1 <= p447) AND ((1 <= p447) OR (1 <= 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))) U A (G ((p498 <= p446))))) : NOT(E (G ((p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 <= p311)))) : A (G ((p313 <= p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p627 + p626 + p625 + p624 + p623 + p622 + p621))) : A (G ((((3 <= p483) AND (1 <= p1293)) OR (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 <= 1) OR (p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 <= p446)))) : NOT(E (G (A (F ((p443 <= p495)))))) : E ((E (F ((p444 <= p440))) U (p442 + 1 <= p462))) : E (F (E (X (((2 <= p314) AND (1 <= p309)))))) : A ((((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 <= p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484) OR (2 <= p459) OR (2 <= p1) OR (1 <= p2)) U (((2 <= p125) AND (2 <= p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482)) OR (p3 + p4 + p5 + p6 + p7 + p8 + p9 + 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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p99 + 1 <= p443)))) : E ((((p1292 + 1 <= p461) OR (p497 + 1 <= p445)) U A (G ((p441 <= p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p627 + p626 + p625 + p624 + p623 + p622 + p621))))) : NOT((NOT(E (F ((1 <= p483)))) OR (p441 + 1 <= 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))) : A (G (E (X ((p483 <= 1))))) : A (G ((3 <= p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458))) : (E (G (A (F ((p444 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472))))) AND A (F ((p1292 + 1 <= p448)))) : (((A (G ((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 <= p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482))) OR (p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + 1 <= p312)) AND (p442 <= p445)) AND E (X (((2 <= p462) OR (p1293 <= p0) OR (1 <= p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p445 <= p314) OR (2 <= 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 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551... (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 4568 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality.sara.
lola: sara is running 0 secs || 1748 markings, 2801 edges, 350 markings/sec, 0 secs
lola: sara is running 5 secs || 3378 markings, 6059 edges, 326 markings/sec, 5 secs
lola: sara is running 10 secs || 5039 markings, 9336 edges, 332 markings/sec, 10 secs
lola: sara is running 15 secs || 6699 markings, 12660 edges, 332 markings/sec, 15 secs
lola: sara is running 20 secs || 8321 markings, 15848 edges, 324 markings/sec, 20 secs
lola: sara is running 25 secs || 10012 markings, 19001 edges, 338 markings/sec, 25 secs
lola: sara is running 30 secs || 11688 markings, 22438 edges, 335 markings/sec, 30 secs
lola: sara is running 35 secs || 13342 markings, 25799 edges, 331 markings/sec, 35 secs
lola: sara is running 40 secs || 15017 markings, 29116 edges, 335 markings/sec, 40 secs
lola: sara is running 45 secs || 16704 markings, 32624 edges, 337 markings/sec, 45 secs
lola: sara is running 50 secs || 18446 markings, 35957 edges, 348 markings/sec, 50 secs
lola: sara is running 55 secs || 20137 markings, 39404 edges, 338 markings/sec, 55 secs
lola: sara is running 60 secs || 21794 markings, 42636 edges, 331 markings/sec, 60 secs
lola: sara is running 65 secs || 23494 markings, 45817 edges, 340 markings/sec, 65 secs
lola: sara is running 70 secs || 25152 markings, 49191 edges, 332 markings/sec, 70 secs
lola: sara is running 75 secs || 26852 markings, 52752 edges, 340 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 28591 markings, 56069 edges, 348 markings/sec, 80 secs
lola: sara is running 85 secs || 30276 markings, 59484 edges, 337 markings/sec, 85 secs
lola: sara is running 90 secs || 31979 markings, 63046 edges, 341 markings/sec, 90 secs
lola: sara is running 95 secs || 33724 markings, 66373 edges, 349 markings/sec, 95 secs
lola: sara is running 100 secs || 35409 markings, 69776 edges, 337 markings/sec, 100 secs
lola: sara is running 105 secs || 37107 markings, 73376 edges, 340 markings/sec, 105 secs
lola: sara is running 110 secs || 38854 markings, 76922 edges, 349 markings/sec, 110 secs
lola: sara is running 115 secs || 40544 markings, 80425 edges, 338 markings/sec, 115 secs
lola: sara is running 120 secs || 42238 markings, 83925 edges, 339 markings/sec, 120 secs
lola: sara is running 125 secs || 43976 markings, 87297 edges, 348 markings/sec, 125 secs
lola: sara is running 130 secs || 45683 markings, 90729 edges, 341 markings/sec, 130 secs
lola: sara is running 135 secs || 47381 markings, 94189 edges, 340 markings/sec, 135 secs
lola: sara is running 140 secs || 49091 markings, 97691 edges, 342 markings/sec, 140 secs
lola: sara is running 145 secs || 50820 markings, 101023 edges, 346 markings/sec, 145 secs
lola: sara is running 150 secs || 52522 markings, 104801 edges, 340 markings/sec, 150 secs
lola: sara is running 155 secs || 54212 markings, 108275 edges, 338 markings/sec, 155 secs
lola: sara is running 160 secs || 55933 markings, 111685 edges, 344 markings/sec, 160 secs
lola: sara is running 165 secs || 57662 markings, 115097 edges, 346 markings/sec, 165 secs
lola: sara is running 170 secs || 59352 markings, 118843 edges, 338 markings/sec, 170 secs
lola: sara is running 175 secs || 61050 markings, 122329 edges, 340 markings/sec, 175 secs
lola: sara is running 180 secs || 62773 markings, 125764 edges, 345 markings/sec, 180 secs
lola: sara is running 185 secs || 64495 markings, 129138 edges, 344 markings/sec, 185 secs
lola: sara is running 190 secs || 66199 markings, 132912 edges, 341 markings/sec, 190 secs
lola: sara is running 195 secs || 67892 markings, 136346 edges, 339 markings/sec, 195 secs
lola: sara is running 200 secs || 69596 markings, 139878 edges, 341 markings/sec, 200 secs
lola: sara is running 205 secs || 71326 markings, 143521 edges, 346 markings/sec, 205 secs
lola: sara is running 210 secs || 73036 markings, 146949 edges, 342 markings/sec, 210 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((3 <= p311))) AND E (F ((p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= p311)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= p311)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p447) AND ((1 <= p447) OR (1 <= 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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= p447) AND ((1 <= p447) OR (1 <= 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 + p... (shortened)
lola: processed formula length: 506
lola: 3 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 220913 markings, 437005 edges, 3069646524116893696 markings/sec, 0 secs
lola: 402382 markings, 850665 edges, 36294 markings/sec, 5 secs
lola: 603782 markings, 1256254 edges, 40280 markings/sec, 10 secs
lola: 779186 markings, 1661467 edges, 35081 markings/sec, 15 secs
lola: 980182 markings, 2063503 edges, 40199 markings/sec, 20 secs
lola: 1157704 markings, 2460252 edges, 35504 markings/sec, 25 secs
lola: 1353965 markings, 2865894 edges, 39252 markings/sec, 30 secs
lola: 1533393 markings, 3262130 edges, 35886 markings/sec, 35 secs
lola: 1725366 markings, 3663715 edges, 38395 markings/sec, 40 secs
lola: 1907329 markings, 4060228 edges, 36393 markings/sec, 45 secs
lola: 2093782 markings, 4456220 edges, 37291 markings/sec, 50 secs
lola: 2279615 markings, 4854637 edges, 37167 markings/sec, 55 secs
lola: 2461132 markings, 5246369 edges, 36303 markings/sec, 60 secs
lola: 2650053 markings, 5645069 edges, 37784 markings/sec, 65 secs
lola: 2825968 markings, 6032337 edges, 35183 markings/sec, 70 secs
lola: 3018053 markings, 6429879 edges, 38417 markings/sec, 75 secs
lola: 3192047 markings, 6820251 edges, 34799 markings/sec, 80 secs
lola: 3387202 markings, 7217325 edges, 39031 markings/sec, 85 secs
lola: 3558905 markings, 7591957 edges, 34341 markings/sec, 90 secs
lola: 3759216 markings, 7981946 edges, 40062 markings/sec, 95 secs
lola: 3923169 markings, 8366139 edges, 32791 markings/sec, 100 secs
lola: 4118651 markings, 8757528 edges, 39096 markings/sec, 105 secs
lola: 4285396 markings, 9138282 edges, 33349 markings/sec, 110 secs
lola: 4475915 markings, 9529231 edges, 38104 markings/sec, 115 secs
lola: 4641020 markings, 9916090 edges, 33021 markings/sec, 120 secs
lola: 4832922 markings, 10300279 edges, 38380 markings/sec, 125 secs
lola: 5005564 markings, 10682009 edges, 34528 markings/sec, 130 secs
lola: 5187111 markings, 11066360 edges, 36309 markings/sec, 135 secs
lola: 5367574 markings, 11453594 edges, 36093 markings/sec, 140 secs
lola: 5542349 markings, 11834244 edges, 34955 markings/sec, 145 secs
lola: 5728074 markings, 12221864 edges, 37145 markings/sec, 150 secs
lola: 5898819 markings, 12604461 edges, 34149 markings/sec, 155 secs
lola: 6090424 markings, 12993660 edges, 38321 markings/sec, 160 secs
lola: 6256355 markings, 13355154 edges, 33186 markings/sec, 165 secs
lola: 6451092 markings, 13738436 edges, 38947 markings/sec, 170 secs
lola: 6613338 markings, 14107981 edges, 32449 markings/sec, 175 secs
lola: 6799472 markings, 14493550 edges, 37227 markings/sec, 180 secs
lola: 6959842 markings, 14871566 edges, 32074 markings/sec, 185 secs
lola: 7154432 markings, 15260929 edges, 38918 markings/sec, 190 secs
lola: 7326555 markings, 15642335 edges, 34425 markings/sec, 195 secs
lola: 7515751 markings, 16040086 edges, 37839 markings/sec, 200 secs
lola: 7695103 markings, 16428464 edges, 35870 markings/sec, 205 secs
lola: 7879810 markings, 16824163 edges, 36941 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 <= p311))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p311 + 1 <= p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482))
lola: processed formula length: 91
lola: 4 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p313 <= p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p627 + ... (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 4568 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 PolyORBNT-COL-S10J60-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-4.sara.
lola: sara is running 0 secs || 1746 markings, 2324 edges, 349 markings/sec, 0 secs
lola: sara is running 5 secs || 3465 markings, 4608 edges, 344 markings/sec, 5 secs
lola: sara is running 10 secs || 5163 markings, 6903 edges, 340 markings/sec, 10 secs
lola: sara is running 15 secs || 6871 markings, 9206 edges, 342 markings/sec, 15 secs
lola: sara is running 20 secs || 8582 markings, 11496 edges, 342 markings/sec, 20 secs
lola: sara is running 25 secs || 10300 markings, 13788 edges, 344 markings/sec, 25 secs
lola: sara is running 30 secs || 12058 markings, 16172 edges, 352 markings/sec, 30 secs
lola: sara is running 35 secs || 13767 markings, 18460 edges, 342 markings/sec, 35 secs
lola: sara is running 40 secs || 15474 markings, 20732 edges, 341 markings/sec, 40 secs
lola: sara is running 45 secs || 17218 markings, 23108 edges, 349 markings/sec, 45 secs
lola: sara is running 50 secs || 19076 markings, 25567 edges, 372 markings/sec, 50 secs
lola: sara is running 55 secs || 20927 markings, 28077 edges, 370 markings/sec, 55 secs
lola: sara is running 60 secs || 22785 markings, 30561 edges, 372 markings/sec, 60 secs
lola: sara is running 65 secs || 24621 markings, 38651 edges, 367 markings/sec, 65 secs
lola: sara is running 70 secs || 26474 markings, 41130 edges, 371 markings/sec, 70 secs
lola: sara is running 75 secs || 28340 markings, 43622 edges, 373 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 30184 markings, 46119 edges, 369 markings/sec, 80 secs
lola: sara is running 85 secs || 32028 markings, 48578 edges, 369 markings/sec, 85 secs
lola: sara is running 90 secs || 33879 markings, 51072 edges, 370 markings/sec, 90 secs
lola: sara is running 95 secs || 35739 markings, 53583 edges, 372 markings/sec, 95 secs
lola: sara is running 100 secs || 37605 markings, 56060 edges, 373 markings/sec, 100 secs
lola: sara is running 105 secs || 39450 markings, 58555 edges, 369 markings/sec, 105 secs

lola: sara is running 110 secs || 41303 markings, 61049 edges, 371 markings/sec, 110 secs
lola: sara is running 115 secs || 43170 markings, 63530 edges, 373 markings/sec, 115 secs
lola: sara is running 120 secs || 45024 markings, 66043 edges, 371 markings/sec, 120 secs
lola: sara is running 125 secs || 46886 markings, 74134 edges, 372 markings/sec, 125 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p483) AND (1 <= p1293)) OR (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 + ... (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 4568 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((p443 <= p495))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p443 <= p495))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p444 <= p440))) U (p442 + 1 <= p462)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p444 <= p440)) U (p442 + 1 <= p462))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (((2 <= p314) AND (1 <= p309))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(((2 <= p314) AND (1 <= p309))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 114553 markings, 280969 edges, 2933637760394723328 markings/sec, 0 secs
lola: 229824 markings, 525835 edges, 23054 markings/sec, 5 secs
lola: 339231 markings, 801631 edges, 21881 markings/sec, 10 secs
lola: 453397 markings, 1067378 edges, 22833 markings/sec, 15 secs
lola: 558888 markings, 1362105 edges, 21098 markings/sec, 20 secs
lola: 675108 markings, 1592237 edges, 23244 markings/sec, 25 secs
lola: 778659 markings, 1880822 edges, 20710 markings/sec, 30 secs
lola: 891539 markings, 2159767 edges, 22576 markings/sec, 35 secs
lola: 1000179 markings, 2420424 edges, 21728 markings/sec, 40 secs
lola: 1109395 markings, 2676791 edges, 21843 markings/sec, 45 secs
lola: 1215680 markings, 2957314 edges, 21257 markings/sec, 50 secs
lola: 1325756 markings, 3247724 edges, 22015 markings/sec, 55 secs
lola: 1439405 markings, 3474842 edges, 22730 markings/sec, 60 secs
lola: 1545547 markings, 3747480 edges, 21228 markings/sec, 65 secs
lola: 1656752 markings, 4017916 edges, 22241 markings/sec, 70 secs
lola: 1761915 markings, 4297929 edges, 21033 markings/sec, 75 secs
lola: 1877428 markings, 4526713 edges, 23103 markings/sec, 80 secs
lola: 1979609 markings, 4812722 edges, 20436 markings/sec, 85 secs
lola: 2091272 markings, 5088481 edges, 22333 markings/sec, 90 secs
lola: 2198246 markings, 5346416 edges, 21395 markings/sec, 95 secs
lola: 2306943 markings, 5599861 edges, 21739 markings/sec, 100 secs
lola: 2410675 markings, 5879084 edges, 20746 markings/sec, 105 secs
lola: 2521638 markings, 6158380 edges, 22193 markings/sec, 110 secs
lola: 2632572 markings, 6391216 edges, 22187 markings/sec, 115 secs
lola: 2737685 markings, 6656479 edges, 21023 markings/sec, 120 secs
lola: 2848882 markings, 6920164 edges, 22239 markings/sec, 125 secs
lola: 2951272 markings, 7206911 edges, 20478 markings/sec, 130 secs
lola: 3065837 markings, 7433622 edges, 22913 markings/sec, 135 secs
lola: 3167637 markings, 7710941 edges, 20360 markings/sec, 140 secs
lola: 3277996 markings, 7982515 edges, 22072 markings/sec, 145 secs
lola: 3382981 markings, 8246500 edges, 20997 markings/sec, 150 secs
lola: 3498188 markings, 8474413 edges, 23041 markings/sec, 155 secs
lola: 3595080 markings, 8758994 edges, 19378 markings/sec, 160 secs
lola: 3703008 markings, 9038954 edges, 21586 markings/sec, 165 secs
lola: 3811076 markings, 9278516 edges, 21614 markings/sec, 170 secs
lola: 3916012 markings, 9529411 edges, 20987 markings/sec, 175 secs
lola: 4019221 markings, 9800383 edges, 20642 markings/sec, 180 secs
lola: 4127402 markings, 10079423 edges, 21636 markings/sec, 185 secs
lola: 4236585 markings, 10305787 edges, 21837 markings/sec, 190 secs
lola: 4338933 markings, 10565633 edges, 20470 markings/sec, 195 secs
lola: 4447950 markings, 10825455 edges, 21803 markings/sec, 200 secs
lola: 4548882 markings, 11108797 edges, 20186 markings/sec, 205 secs
lola: 4661432 markings, 11331486 edges, 22510 markings/sec, 210 secs
lola: 4761203 markings, 11600051 edges, 19954 markings/sec, 215 secs
lola: 4869099 markings, 11864668 edges, 21579 markings/sec, 220 secs
lola: 4971594 markings, 12130416 edges, 20499 markings/sec, 225 secs
lola: 5085275 markings, 12355304 edges, 22736 markings/sec, 230 secs
lola: 5182294 markings, 12631639 edges, 19404 markings/sec, 235 secs
lola: 5291250 markings, 12900163 edges, 21791 markings/sec, 240 secs
lola: 5394391 markings, 13151943 edges, 20628 markings/sec, 245 secs
lola: 5507050 markings, 13378329 edges, 22532 markings/sec, 250 secs
lola: 5602210 markings, 13659968 edges, 19032 markings/sec, 255 secs
lola: 5708980 markings, 13937002 edges, 21354 markings/sec, 260 secs
lola: 5816401 markings, 14172412 edges, 21484 markings/sec, 265 secs
lola: 5919777 markings, 14421628 edges, 20675 markings/sec, 270 secs
lola: 6022282 markings, 14689118 edges, 20501 markings/sec, 275 secs
lola: 6128753 markings, 14965712 edges, 21294 markings/sec, 280 secs
lola: 6237048 markings, 15189714 edges, 21659 markings/sec, 285 secs
lola: 6337689 markings, 15444769 edges, 20128 markings/sec, 290 secs
lola: 6445293 markings, 15704555 edges, 21521 markings/sec, 295 secs
lola: 6545696 markings, 15985873 edges, 20081 markings/sec, 300 secs
lola: 6657085 markings, 16205955 edges, 22278 markings/sec, 305 secs
lola: 6755943 markings, 16468765 edges, 19772 markings/sec, 310 secs
lola: 6863155 markings, 16731191 edges, 21442 markings/sec, 315 secs
lola: 6963776 markings, 16998155 edges, 20124 markings/sec, 320 secs
lola: 7076182 markings, 17220739 edges, 22481 markings/sec, 325 secs
lola: 7172542 markings, 17488487 edges, 19272 markings/sec, 330 secs
lola: 7281644 markings, 17756902 edges, 21820 markings/sec, 335 secs
lola: 7385217 markings, 18017224 edges, 20715 markings/sec, 340 secs
lola: 7499136 markings, 18242701 edges, 22784 markings/sec, 345 secs
lola: 7594952 markings, 18523415 edges, 19163 markings/sec, 350 secs
lola: 7704297 markings, 18807117 edges, 21869 markings/sec, 355 secs
lola: 7812810 markings, 19048521 edges, 21703 markings/sec, 360 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((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 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((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... (shortened)
lola: processed formula length: 1409
lola: 1 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p1292 + 1 <= p461) OR (p497 + 1 <= p445)) U A (G ((p441 <= p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p1292 + 1 <= p461) OR (p497 + 1 <= p445)) U NOT(E(TRUE U (p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p... (shortened)
lola: processed formula length: 503
lola: 3 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (F ((1 <= p483)))) OR (p441 + 1 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p483)))
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 4568 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 PolyORBNT-COL-S10J60-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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 + ... (shortened)
lola: processed formula length: 434
lola: 8 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p483 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p483 <= 1)))))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 865 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458)))
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 4568 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 PolyORBNT-COL-S10J60-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-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 1298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((p444 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472))))) AND A (F ((p1292 + 1 <= p448))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p444 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p444 <= p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472)))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p1292 + 1 <= p448)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p1292 + 1 <= p448))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 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 PolyORBNT-COL-S10J60-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-15.sara.
lola: sara is running 0 secs || 1651 markings, 3641 edges, 330 markings/sec, 0 secs
lola: sara is running 5 secs || 3273 markings, 7223 edges, 324 markings/sec, 5 secs
lola: sara is running 10 secs || 4986 markings, 11144 edges, 343 markings/sec, 10 secs
lola: sara is running 15 secs || 6729 markings, 14953 edges, 349 markings/sec, 15 secs
lola: sara is running 20 secs || 8464 markings, 18922 edges, 347 markings/sec, 20 secs
lola: sara is running 25 secs || 10209 markings, 22784 edges, 349 markings/sec, 25 secs
lola: sara is running 30 secs || 11931 markings, 26710 edges, 344 markings/sec, 30 secs
lola: sara is running 35 secs || 13597 markings, 30375 edges, 333 markings/sec, 35 secs
lola: sara is running 40 secs || 15260 markings, 34167 edges, 333 markings/sec, 40 secs
lola: sara is running 45 secs || 16932 markings, 37871 edges, 334 markings/sec, 45 secs
lola: sara is running 50 secs || 18593 markings, 41695 edges, 332 markings/sec, 50 secs
lola: sara is running 55 secs || 20263 markings, 45408 edges, 334 markings/sec, 55 secs
lola: sara is running 60 secs || 21929 markings, 49116 edges, 333 markings/sec, 60 secs
lola: sara is running 65 secs || 23588 markings, 52893 edges, 332 markings/sec, 65 secs
lola: sara is running 70 secs || 25264 markings, 56557 edges, 335 markings/sec, 70 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 75 secs || 26923 markings, 60363 edges, 332 markings/sec, 75 secs

lola: sara is running 80 secs || 28592 markings, 64069 edges, 334 markings/sec, 80 secs
lola: sara is running 85 secs || 30253 markings, 67836 edges, 332 markings/sec, 85 secs
lola: sara is running 90 secs || 31920 markings, 71582 edges, 333 markings/sec, 90 secs
lola: sara is running 95 secs || 33590 markings, 75285 edges, 334 markings/sec, 95 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p442 <= p445)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p442 <= p445)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= p462) OR (p1293 <= p0) OR (1 <= p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= p462) OR (p1293 <= p0) OR (1 <= p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482)))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no unknown no no no no yes unknown no no yes no no no unknown
lola: ========================================
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496306756889

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_PolyORBNT-COL-S10J60"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_PolyORBNT-COL-S10J60.tgz
mv S_PolyORBNT-COL-S10J60 execution

# this is for BenchKit: explicit launching of the test

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