fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r048-smll-149440869800300
Last Updated
June 27, 2017

About the Execution of LoLA for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15952.910 758733.00 1010013.00 1890.30 FTTTFTTF?TTT??FF normal

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 PolyORBLF-COL-S02J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869800300
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494615224818


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-COL-S02J06T08 @ 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: 2124/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: E (G ((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p90 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409))) : (E (F ((((2 <= p497) OR (p47 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489)) AND (p127 + p128 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115)))) AND ((p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 <= 0) AND ((p620 + p619 + p618 + p617 + p616 + p615 + p614 <= 2) OR (p82 <= 1) OR (p688 <= p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472)))) : (NOT(NOT(E (G ((p47 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210))))) OR E (F (E (F ((2 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521)))))) : NOT(((((1 <= p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464) OR (p385 <= p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671) OR (p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 <= p82)) OR A (G ((1 <= p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537)))) AND A (F (((2 <= p129 + p130) OR (2 <= p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384)))))) : (((2 <= p453) AND A (((p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 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 <= p97 + p96 + p95 + p94 + p93 + p92 + p91 + p98) U (p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 <= p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393)))) AND (E (G (((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) OR (p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 <= p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628)))) OR A (F (((3 <= p99) AND (p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 <= p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537)))))) : E ((((p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + 1 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) OR (p82 + 1 <= p456)) U E (G ((p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 <= p456))))) : ((((1 <= p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593) AND (3 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)) OR E (((p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 <= p347 + p348 + p349 + p350 + p351 + p352 + p353) U (2 <= p490 + p491 + p492 + p493 + p494 + p495 + p496)))) OR (((p97 + p96 + p95 + p94 + p93 + p92 + p91 + p98 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) OR (p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p8 + p9 + p15 + p14 + p13 + p12 + p11 + p10) OR (2 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489) OR ((2 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427) AND (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p90 <= p497) AND (p99 + 1 <= p452))) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107))) : E (F (E (((1 <= p117) U (2 <= p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464))))) : A (G (E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602) OR (p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 <= p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613)))))) : (NOT(NOT(E (G ((2 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202))))) OR E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))) : A ((((p118 <= 2) OR (p604 + p605 <= 2)) U (p663 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638))) : (E (G ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= 0))) OR ((3 <= p455) AND (p8 + p9 + p15 + p14 + p13 + p12 + p11 + p10 <= p473) AND (p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + 1 <= p629) AND (p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 <= 2) AND (2 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638))) : (E (G (A (X ((p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= p118))))) AND E (G (((p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 <= 0) OR (p630 + 1 <= p47))))) : NOT(A (G (E (G ((p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 <= p127 + p128)))))) : E (F ((E (F ((2 <= p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639))) AND E (G ((p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638)))))) : A (G (E (((2 <= p453) U (2 <= p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p89 + p88 + p87 + p86 + p85 + p84 + p83 + p90 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p90)))
lola: processed formula length: 179
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((2 <= p497) OR (p47 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489)) AND (p127 + p128 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115)))) AND ((p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 <= 0) AND ((p620 + p619 + p618 + p617 + p616 + p615 + p614 <= 2) OR (p82 <= 1) OR (p688 <= p465 + p466 + p467 + p46... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p497) OR (p47 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489)) AND (p127 + p128 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115))))
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 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T08-CTLCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 <= 0) AND ((p620 + p619 + p618 + p617 + p616 + p615 + p614 <= 2) OR (p82 <= 1) OR (p688 <= p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 <= 0) AND ((p620 + p619 + p618 + p617 + p616 + p615 + p614 <= 2) OR (p82 <= 1) OR (p688 <= p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472)))
lola: processed formula length: 261
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 4 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(E (G ((p47 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210))))) OR E (F (E (F ((2 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p47 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + 1 <= p47)))
lola: processed formula length: 81
lola: 9 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521)))
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 2544 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 PolyORBLF-COL-S02J06T08-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T08-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 103153 markings, 112525 edges, 20631 markings/sec, 0 secs
lola: sara is running 5 secs || 204594 markings, 228199 edges, 20288 markings/sec, 5 secs
lola: sara is running 10 secs || 305158 markings, 344939 edges, 20113 markings/sec, 10 secs
lola: sara is running 15 secs || 404759 markings, 463338 edges, 19920 markings/sec, 15 secs
lola: sara is running 20 secs || 503842 markings, 582390 edges, 19817 markings/sec, 20 secs
lola: sara is running 25 secs || 602485 markings, 702218 edges, 19729 markings/sec, 25 secs
lola: sara is running 30 secs || 700256 markings, 822215 edges, 19554 markings/sec, 30 secs
lola: sara is running 35 secs || 798109 markings, 942431 edges, 19571 markings/sec, 35 secs
lola: sara is running 40 secs || 894986 markings, 1063478 edges, 19375 markings/sec, 40 secs
lola: sara is running 45 secs || 991953 markings, 1184223 edges, 19393 markings/sec, 45 secs
lola: sara is running 50 secs || 1088646 markings, 1305073 edges, 19339 markings/sec, 50 secs
lola: sara is running 55 secs || 1185375 markings, 1426771 edges, 19346 markings/sec, 55 secs
lola: sara is running 60 secs || 1282011 markings, 1548404 edges, 19327 markings/sec, 60 secs
lola: sara is running 65 secs || 1378549 markings, 1669504 edges, 19308 markings/sec, 65 secs
lola: sara is running 70 secs || 1474539 markings, 1789072 edges, 19198 markings/sec, 70 secs
lola: sara is running 75 secs || 1570653 markings, 1910643 edges, 19223 markings/sec, 75 secs
lola: sara is running 80 secs || 1666640 markings, 2033039 edges, 19197 markings/sec, 80 secs
lola: sara is running 85 secs || 1762271 markings, 2157299 edges, 19126 markings/sec, 85 secs
lola: sara is running 90 secs || 1858264 markings, 2278194 edges, 19199 markings/sec, 90 secs
lola: sara is running 95 secs || 1954092 markings, 2401368 edges, 19166 markings/sec, 95 secs
lola: sara is running 100 secs || 2049664 markings, 2524876 edges, 19114 markings/sec, 100 secs
lola: sara is running 105 secs || 2145215 markings, 2648532 edges, 19110 markings/sec, 105 secs
lola: sara is running 110 secs || 2240466 markings, 2772930 edges, 19050 markings/sec, 110 secs
lola: sara is running 115 secs || 2335573 markings, 2896606 edges, 19021 markings/sec, 115 secs
lola: sara is running 120 secs || 2430695 markings, 3020976 edges, 19024 markings/sec, 120 secs
lola: sara is running 125 secs || 2526011 markings, 3144655 edges, 19063 markings/sec, 125 secs
lola: sara is running 130 secs || 2621011 markings, 3268916 edges, 19000 markings/sec, 130 secs
lola: sara is running 135 secs || 2716215 markings, 3391978 edges, 19041 markings/sec, 135 secs
lola: sara is running 140 secs || 2811016 markings, 3517643 edges, 18960 markings/sec, 140 secs
lola: sara is running 145 secs || 2905947 markings, 3642229 edges, 18986 markings/sec, 145 secs
lola: sara is running 150 secs || 3001042 markings, 3766765 edges, 19019 markings/sec, 150 secs
lola: sara is running 155 secs || 3095512 markings, 3890689 edges, 18894 markings/sec, 155 secs
lola: sara is running 160 secs || 3190017 markings, 4016435 edges, 18901 markings/sec, 160 secs
lola: sara is running 165 secs || 3284392 markings, 4140677 edges, 18875 markings/sec, 165 secs
lola: sara is running 170 secs || 3378731 markings, 4265052 edges, 18868 markings/sec, 170 secs
lola: sara is running 175 secs || 3472945 markings, 4391249 edges, 18843 markings/sec, 175 secs
lola: sara is running 180 secs || 3566550 markings, 4515486 edges, 18721 markings/sec, 180 secs
lola: sara is running 185 secs || 3660224 markings, 4640208 edges, 18735 markings/sec, 185 secs
lola: sara is running 190 secs || 3753913 markings, 4768054 edges, 18738 markings/sec, 190 secs
lola: sara is running 195 secs || 3847472 markings, 4894785 edges, 18712 markings/sec, 195 secs
lola: sara is running 200 secs || 3941035 markings, 5020260 edges, 18713 markings/sec, 200 secs
lola: sara is running 205 secs || 4034223 markings, 5147878 edges, 18638 markings/sec, 205 secs
lola: sara is running 210 secs || 4128132 markings, 5268895 edges, 18782 markings/sec, 210 secs
lola: sara is running 215 secs || 4221306 markings, 5395581 edges, 18635 markings/sec, 215 secs
lola: sara is running 220 secs || 4314123 markings, 5522619 edges, 18563 markings/sec, 220 secs
lola: sara is running 225 secs || 4407444 markings, 5648756 edges, 18664 markings/sec, 225 secs
lola: sara is running 230 secs || 4500783 markings, 5773698 edges, 18668 markings/sec, 230 secs
lola: sara is running 235 secs || 4593740 markings, 5901541 edges, 18591 markings/sec, 235 secs
lola: sara is running 240 secs || 4686306 markings, 6027829 edges, 18513 markings/sec, 240 secs
lola: sara is running 245 secs || 4779311 markings, 6153599 edges, 18601 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((1 <= p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464) OR (p385 <= p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671) OR (p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 <= p82)) OR A (G ((1 <= p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537)))) AND A (F (((2 <= p129 + p130) OR (2 <= p377 + p378 + p379 + p380 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 <= 0) AND (p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + 1 <= p385) AND (p82 + 1 <= p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 <= 0) AND (p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + 1 <= p385) AND (p82 + 1 <= p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419))
lola: processed formula length: 205
lola: 9 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 3 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 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p129 + p130 <= 1) AND (p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p129 + p130) OR (2 <= p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384))))
lola: processed formula length: 100
lola: 11 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p453) AND A (((p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p453)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p453)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-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 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 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 <= p9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 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 <= p97 ... (shortened)
lola: processed formula length: 614
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((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 + ... (shortened)
lola: processed formula length: 590
lola: 3 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + 1 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) OR (p82 + 1 <= p456)) U E (G ((p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 <= p456)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking CTL
lola: processed formula: E(((p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + 1 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) OR (p82 + 1 <= p456)) U NOT(A(TRUE U (p456 + 1 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409))))
lola: processed formula length: 284
lola: 3 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: 699945 markings, 953484 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1375986 markings, 1866043 edges, 135208 markings/sec, 5 secs
lola: 1987153 markings, 2682470 edges, 122233 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593) AN... (shortened)
lola: processed formula length: 463
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 <= p347 + p348 + p349 + p350 + p351 + p352 + p353) U (2 <= p490 + p491 + p492 + p493 + p494 + p495 + p496)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 <= p347 + p348 + p349 + p350 + p351 + p352 + p353) U (2 <= p490 + p491 + p492 + p493 + p494 + p495 + p496))
lola: processed formula length: 220
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: 790562 markings, 902050 edges, 2919226186611556352 markings/sec, 0 secs
lola: 1502531 markings, 1735155 edges, 142394 markings/sec, 5 secs
lola: 2189436 markings, 2547438 edges, 137381 markings/sec, 10 secs
lola: 2852347 markings, 3340547 edges, 132582 markings/sec, 15 secs
lola: 3506178 markings, 4127770 edges, 130766 markings/sec, 20 secs
lola: 4150256 markings, 4910421 edges, 128816 markings/sec, 25 secs
lola: 4785932 markings, 5685960 edges, 127135 markings/sec, 30 secs
lola: 5413582 markings, 6456317 edges, 125530 markings/sec, 35 secs
lola: 6030767 markings, 7213442 edges, 123437 markings/sec, 40 secs
lola: 6637442 markings, 7961765 edges, 121335 markings/sec, 45 secs
lola: 7236946 markings, 8705910 edges, 119901 markings/sec, 50 secs
lola: 7834961 markings, 9451555 edges, 119603 markings/sec, 55 secs
lola: 8429956 markings, 10193999 edges, 118999 markings/sec, 60 secs
lola: 9018473 markings, 10934206 edges, 117703 markings/sec, 65 secs
lola: 9600340 markings, 11664602 edges, 116373 markings/sec, 70 secs
lola: 10182381 markings, 12390750 edges, 116408 markings/sec, 75 secs
lola: 10757332 markings, 13114813 edges, 114990 markings/sec, 80 secs
lola: 11326885 markings, 13825341 edges, 113911 markings/sec, 85 secs
lola: 11891179 markings, 14542181 edges, 112859 markings/sec, 90 secs
lola: 12458080 markings, 15256129 edges, 113380 markings/sec, 95 secs
lola: 13016572 markings, 15959092 edges, 111698 markings/sec, 100 secs
lola: 13569536 markings, 16661437 edges, 110593 markings/sec, 105 secs
lola: 14121778 markings, 17366154 edges, 110448 markings/sec, 110 secs
lola: 14670867 markings, 18065100 edges, 109818 markings/sec, 115 secs
lola: 15217801 markings, 18764286 edges, 109387 markings/sec, 120 secs
lola: 15764542 markings, 19466211 edges, 109348 markings/sec, 125 secs
lola: 16306452 markings, 20159306 edges, 108382 markings/sec, 130 secs
lola: 16854471 markings, 20859377 edges, 109604 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p97 + p96 + p95 + p94 + p93 + p92 + p91 + p98 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) OR (p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p8 + p9 + p15 + p14 + p13 + p12 + p11 + p10) OR (2 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489) OR ((2 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427) AND (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p90 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p97 + p96 + p95 + p94 + p93 + p92 + p91 + p98 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505) OR (p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p8 + p9 + p15 + p14 + p13 + p12 + p11 + p10) OR (2 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489) OR ((2 <= p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427) AND (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p90 <= p... (shortened)
lola: processed formula length: 494
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 7 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
lola: ========================================
========================================
lola: ...considering subproblem: E (F (E (((1 <= p117) U (2 <= p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E((1 <= p117) U (2 <= p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464)))
lola: processed formula length: 87
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: 687295 markings, 1236961 edges, 3225184263615807488 markings/sec, 0 secs
lola: 1244023 markings, 2393195 edges, 111346 markings/sec, 5 secs
lola: 1765371 markings, 3527894 edges, 104270 markings/sec, 10 secs
lola: 2280500 markings, 4640542 edges, 103026 markings/sec, 15 secs
lola: 2770931 markings, 5744069 edges, 98086 markings/sec, 20 secs
lola: 3243098 markings, 6817522 edges, 94433 markings/sec, 25 secs
lola: 3709832 markings, 7889177 edges, 93347 markings/sec, 30 secs
lola: 4171570 markings, 8951582 edges, 92348 markings/sec, 35 secs
lola: 4625482 markings, 10007929 edges, 90782 markings/sec, 40 secs
lola: 5064448 markings, 11038405 edges, 87793 markings/sec, 45 secs
lola: 5505474 markings, 12070053 edges, 88205 markings/sec, 50 secs
lola: 5944330 markings, 13093457 edges, 87771 markings/sec, 55 secs
lola: 6370448 markings, 14126852 edges, 85224 markings/sec, 60 secs
lola: 6803195 markings, 15143103 edges, 86549 markings/sec, 65 secs
lola: 7236010 markings, 16153481 edges, 86563 markings/sec, 70 secs
lola: 7655758 markings, 17154628 edges, 83950 markings/sec, 75 secs
lola: 8073117 markings, 18166995 edges, 83472 markings/sec, 80 secs
lola: 8489948 markings, 19176990 edges, 83366 markings/sec, 85 secs
lola: 8906887 markings, 20185495 edges, 83388 markings/sec, 90 secs
lola: 9323802 markings, 21195627 edges, 83383 markings/sec, 95 secs
lola: 9732593 markings, 22187187 edges, 81758 markings/sec, 100 secs
lola: 10140995 markings, 23178560 edges, 81680 markings/sec, 105 secs
lola: 10540551 markings, 24184070 edges, 79911 markings/sec, 110 secs
lola: 10935738 markings, 25182115 edges, 79037 markings/sec, 115 secs
lola: 11333900 markings, 26151743 edges, 79632 markings/sec, 120 secs
lola: 11737617 markings, 27152373 edges, 80743 markings/sec, 125 secs
lola: 12131276 markings, 28137961 edges, 78732 markings/sec, 130 secs
lola: 12533375 markings, 29104326 edges, 80420 markings/sec, 135 secs
lola: 12925886 markings, 30071591 edges, 78502 markings/sec, 140 secs
lola: 13309301 markings, 31025809 edges, 76683 markings/sec, 145 secs
lola: 13695836 markings, 31928358 edges, 77307 markings/sec, 150 secs
lola: 14078949 markings, 32849554 edges, 76623 markings/sec, 155 secs
lola: 14467019 markings, 33780140 edges, 77614 markings/sec, 160 secs
lola: 14847818 markings, 34728592 edges, 76160 markings/sec, 165 secs
lola: 15240402 markings, 35700466 edges, 78517 markings/sec, 170 secs
lola: 15626078 markings, 36672004 edges, 77135 markings/sec, 175 secs
lola: 16014369 markings, 37638163 edges, 77658 markings/sec, 180 secs
lola: 16405301 markings, 38621339 edges, 78186 markings/sec, 185 secs
lola: 16792448 markings, 39582712 edges, 77429 markings/sec, 190 secs
lola: 17177170 markings, 40533348 edges, 76944 markings/sec, 195 secs
lola: 17548020 markings, 41458316 edges, 74170 markings/sec, 200 secs
lola: 17903227 markings, 42363753 edges, 71041 markings/sec, 205 secs
lola: 18277121 markings, 43294397 edges, 74779 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602) OR (p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 <= p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602) OR (p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 <= p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613))))))
lola: processed formula length: 239
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(E (G ((2 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202))))) OR E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= 1)))
lola: processed formula length: 75
lola: 8 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107)))
lola: processed formula length: 131
lola: 8 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: SUBRESULT
lola: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: subprocess 10 will run for 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p118 <= 2) OR (p604 + p605 <= 2)) U (p663 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(((p118 <= 2) OR (p604 + p605 <= 2)) U (p663 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638))
lola: processed formula length: 105
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= 0))) OR ((3 <= p455) AND (p8 + p9 + p15 + p14 + p13 + p12 + p11 + p10 <= p473) AND (p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + 1 <= p629) AND (p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 <= 2) AND (2 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 12 will run for 725 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= p118))))) AND E (G (((p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 <= 0) OR (p630 + 1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 12 will run for 725 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= p118)))))
lola: processed formula length: 87
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: subprocess 13 will run for 967 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 <= p127 + p128))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (p127 + p128 + 1 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435)))
lola: processed formula length: 94
lola: 7 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 14 will run for 1449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((2 <= p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639))) AND E (G ((p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (2 <= p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639)) AND NOT(A(TRUE U (p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + 1 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451)))))
lola: processed formula length: 218
lola: 4 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 746177 markings, 1148879 edges, 3067841400901992448 markings/sec, 0 secs
lola: 1424278 markings, 2259381 edges, 135620 markings/sec, 5 secs
lola: 2041824 markings, 3429835 edges, 123509 markings/sec, 10 secs
lola: 2580328 markings, 4604543 edges, 107701 markings/sec, 15 secs
lola: 3180320 markings, 5668658 edges, 119998 markings/sec, 20 secs
lola: 3747515 markings, 6780391 edges, 113439 markings/sec, 25 secs
lola: 4287114 markings, 7956440 edges, 107920 markings/sec, 30 secs
lola: 4824558 markings, 9007594 edges, 107489 markings/sec, 35 secs
lola: 5321966 markings, 10170899 edges, 99482 markings/sec, 40 secs
lola: 5852719 markings, 11151674 edges, 106151 markings/sec, 45 secs
lola: 6341182 markings, 12206357 edges, 97693 markings/sec, 50 secs
lola: 6818625 markings, 13148984 edges, 95489 markings/sec, 55 secs
lola: 7361303 markings, 14216021 edges, 108536 markings/sec, 60 secs
lola: 7877677 markings, 15319421 edges, 103275 markings/sec, 65 secs
lola: 8347707 markings, 16384182 edges, 94006 markings/sec, 70 secs
lola: 8806135 markings, 17349860 edges, 91686 markings/sec, 75 secs
lola: 9333851 markings, 18493964 edges, 105543 markings/sec, 80 secs
lola: 9935838 markings, 19706987 edges, 120397 markings/sec, 85 secs
lola: 10476447 markings, 20902119 edges, 108122 markings/sec, 90 secs
lola: 10979597 markings, 22028351 edges, 100630 markings/sec, 95 secs
lola: 11441040 markings, 23310500 edges, 92289 markings/sec, 100 secs
lola: 11904645 markings, 24372114 edges, 92721 markings/sec, 105 secs
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 2788 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((2 <= p453) U (2 <= p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((2 <= p453) U (2 <= p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639)))))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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: 577660 markings, 1232680 edges, 3225184263615807488 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no yes unknown yes yes yes unknown unknown no no yes yes no yes yes no
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494615983551

--------------------
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="PolyORBLF-COL-S02J06T08"
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/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 PolyORBLF-COL-S02J06T08, 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 r048-smll-149440869800300"
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 ;