fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r126-smll-152673528400129
Last Updated
June 26, 2018

About the Execution of Irma.full for PolyORBLF-COL-S06J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10492.720 563017.00 537017.00 2054.50 TTTFTFFTT?FFTTTF 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)
..................
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-COL-S06J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528400129
=====================================================================


--------------------
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-S06J06T08-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J06T08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526826986579


BK_STOP 1526827549596

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-COL-S06J06T08 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1320441, 'Memory': 14307.08, 'Tool': 'lola'}, {'Time': 1384337, 'Memory': 15948.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S06J06T08...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S06J06T08: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S06J06T08: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S06J06T08 @ 3535 seconds
----- Start make result stderr -----
----- 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: 15228/65536 symbol table entries, 5390 collisions
lola: preprocessing...
lola: finding significant places
lola: 894 places, 14334 transitions, 832 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4215 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: ((2 <= p716) OR E (F (((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + 1 <= p825 + p826 + p827 + p828 + p829 + p830 + p831) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 <= 0))))) : E (G (NOT(A (X ((3 <= p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377)))))) : A (F (E (G ((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 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= 1))))) : A (X (NOT(E (G ((p709 + p710 + p711 + p712 + p713 + p714 + p715 <= p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816)))))) : NOT(A (F (((p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + 1 <= p39 + p38 + p33 + p34 + p35 + p36 + p37 + p40) OR (p105 + 1 <= p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858))))) : A (G ((p512 <= p751))) : A (F (A (X (((2 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (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 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 <= p586 + p587 + p588 + p589 + p590 + p592 + p593 + p594 + p595 + p596 + p598 + p599 + p600 + p601 + p602 + p604 + p605 + p606 + p607 + p608 + p610 + p611 + p612 + p613 + p614 + p616 + p617 + p618 + p619 + p620 + p622 + p623 + p624 + p625 + p626 + p627 + p621 + p615 + p609 + p603 + p597 + p591)))))) : E ((((p850 + p849 + p848 + p847 + p846 + p845 <= p0) OR (2 <= p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409) OR (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 + 1 <= p586 + p587 + p588 + p589 + p590 + p592 + p593 + p594 + p595 + p596 + p598 + p599 + p600 + p601 + p602 + p604 + p605 + p606 + p607 + p608 + p610 + p611 + p612 + p613 + p614 + p616 + p617 + p618 + p619 + p620 + p622 + p623 + p624 + p625 + p626 + p627 + p621 + p615 + p609 + p603 + p597 + p591)) U E (G ((1 <= p751))))) : E (G ((p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 <= p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377))) : E (X (E (F (((3 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) OR (3 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249)))))) : E (X (A (F (((1 <= p105) OR (p760 <= p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385)))))) : A (G (((p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 <= 0) AND ((p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 <= 2) OR (p869 + 1 <= p691))))) : (E (((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1) U (p410 + p411 + p412 + p413 + p414 + p415 + 1 <= p0))) OR E (F (((p832 + 1 <= p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423) OR (p410 + p411 + p412 + p413 + p414 + p415 + 1 <= p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759))))) : E (X (NOT(A (F ((1 <= p634 + p633 + p632 + p631 + p630 + p629)))))) : A (F (E (G (())))) : A (F (((p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + 1 <= p844) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 + 1 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) AND ((p105 <= p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877) OR (p628 <= p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759) OR (p741 <= p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p716) OR E (F (((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + 1 <= p825 + p826 + p827 + p828 + p829 + p830 + p831) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p716)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p716)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + 1 <= p825 + p826 + p827 + p828 + p829 + p830 + p831) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 <= 0))))
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 3328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J06T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((3 <= 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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((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 + p... (shortened)
lola: processed formula length: 420
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 409 markings, 423 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((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 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p90 + p91 + p92 + p93 + p94 + p95 + p96 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (2 <= 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 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p90 + p91 + p92 + p93 + p94 + p95 + p96))))
lola: processed formula length: 365
lola: 3 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((p709 + p710 + p711 + p712 + p713 + p714 + p715 <= p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p8... (shortened)
lola: processed formula length: 459
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + 1 <= p39 + p38 + p33 + p34 + p35 + p36 + p37 + p40) OR (p105 + 1 <= p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + 1 <= p39 + p38 + p33 + p34 + p35 + p36 + p37 + p40) OR (p105 + 1 <= p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858))))
lola: processed formula length: 197
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p512 <= p751)))
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 3328 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-S06J06T08-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1396 markings, 1419 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((2 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (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 + p560 + p561 + p562 + p563 + p564 + p565 + p566 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((2 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (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 + p560 + p561 + p562 + p563 + p564 + p565 + p566 +... (shortened)
lola: processed formula length: 711
lola: 2 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 483 markings, 497 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p850 + p849 + p848 + p847 + p846 + p845 <= p0) OR (2 <= p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409) OR (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p850 + p849 + p848 + p847 + p846 + p845 <= p0) OR (2 <= p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409) OR (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 +... (shortened)
lola: processed formula length: 785
lola: 3 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 <= 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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (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 + p... (shortened)
lola: processed formula length: 467
lola: 2 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((3 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) OR (3 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U ((3 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) OR (3 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249))))
lola: processed formula length: 141
lola: 2 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 126338 markings, 407702 edges, 3689348869717491712 markings/sec, 0 secs
lola: 179749 markings, 635303 edges, 10682 markings/sec, 5 secs
lola: 291128 markings, 1146158 edges, 22276 markings/sec, 10 secs
lola: 393142 markings, 1481735 edges, 20403 markings/sec, 15 secs
lola: 480040 markings, 1889020 edges, 17380 markings/sec, 20 secs
lola: 545683 markings, 2207949 edges, 13129 markings/sec, 25 secs
lola: 676746 markings, 2686739 edges, 26213 markings/sec, 30 secs
lola: 730147 markings, 2916180 edges, 10680 markings/sec, 35 secs
lola: 822731 markings, 3343867 edges, 18517 markings/sec, 40 secs
lola: 919767 markings, 3788934 edges, 19407 markings/sec, 45 secs
lola: 997501 markings, 4147536 edges, 15547 markings/sec, 50 secs
lola: 1066497 markings, 4482882 edges, 13799 markings/sec, 55 secs
lola: 1193262 markings, 4942816 edges, 25353 markings/sec, 60 secs
lola: 1244245 markings, 5162786 edges, 10197 markings/sec, 65 secs
lola: 1312689 markings, 5488029 edges, 13689 markings/sec, 70 secs
lola: 1469258 markings, 6053505 edges, 31314 markings/sec, 75 secs
lola: 1543089 markings, 6354044 edges, 14766 markings/sec, 80 secs
lola: 1641777 markings, 6742631 edges, 19738 markings/sec, 85 secs
lola: 1715923 markings, 7093055 edges, 14829 markings/sec, 90 secs
lola: 1887604 markings, 7847210 edges, 34336 markings/sec, 95 secs
lola: 1946530 markings, 8124552 edges, 11785 markings/sec, 100 secs
lola: 2141796 markings, 8917540 edges, 39053 markings/sec, 105 secs
lola: 2314485 markings, 9723680 edges, 34538 markings/sec, 110 secs
lola: 2494975 markings, 10471285 edges, 36098 markings/sec, 115 secs
lola: 2580651 markings, 10864309 edges, 17135 markings/sec, 120 secs
lola: 2671803 markings, 11221017 edges, 18230 markings/sec, 125 secs
lola: 2762575 markings, 11570733 edges, 18154 markings/sec, 130 secs
lola: 2856074 markings, 11951087 edges, 18700 markings/sec, 135 secs
lola: 2941380 markings, 12305757 edges, 17061 markings/sec, 140 secs
lola: 3026938 markings, 12676133 edges, 17112 markings/sec, 145 secs
lola: 3106543 markings, 13019288 edges, 15921 markings/sec, 150 secs
lola: 3193738 markings, 13371766 edges, 17439 markings/sec, 155 secs
lola: 3281691 markings, 13719279 edges, 17591 markings/sec, 160 secs
lola: 3365802 markings, 14075828 edges, 16822 markings/sec, 165 secs
lola: 3447981 markings, 14434943 edges, 16436 markings/sec, 170 secs
lola: 3526399 markings, 14770421 edges, 15684 markings/sec, 175 secs
lola: 3612043 markings, 15116632 edges, 17129 markings/sec, 180 secs
lola: 3690118 markings, 15458521 edges, 15615 markings/sec, 185 secs
lola: 3765521 markings, 15775355 edges, 15081 markings/sec, 190 secs
lola: 3840948 markings, 16097520 edges, 15085 markings/sec, 195 secs
lola: 3910502 markings, 16390188 edges, 13911 markings/sec, 200 secs
lola: 3976628 markings, 16669345 edges, 13225 markings/sec, 205 secs
lola: 4068297 markings, 17031930 edges, 18334 markings/sec, 210 secs
lola: 4153710 markings, 17472797 edges, 17083 markings/sec, 215 secs
lola: 4232259 markings, 17880254 edges, 15710 markings/sec, 220 secs
lola: 4309223 markings, 18283919 edges, 15393 markings/sec, 225 secs
lola: 4383382 markings, 18671160 edges, 14832 markings/sec, 230 secs
lola: 4471787 markings, 19055667 edges, 17681 markings/sec, 235 secs
lola: 4646535 markings, 19700005 edges, 34950 markings/sec, 240 secs
lola: 4818111 markings, 20465159 edges, 34315 markings/sec, 245 secs
lola: 4996356 markings, 21177718 edges, 35649 markings/sec, 250 secs
lola: 5083326 markings, 21546419 edges, 17394 markings/sec, 255 secs
lola: 5172877 markings, 21896006 edges, 17910 markings/sec, 260 secs
lola: 5259115 markings, 22234780 edges, 17248 markings/sec, 265 secs
lola: 5352642 markings, 22607557 edges, 18705 markings/sec, 270 secs
lola: 5440228 markings, 22977600 edges, 17517 markings/sec, 275 secs
lola: 5528461 markings, 23340775 edges, 17647 markings/sec, 280 secs
lola: 5608817 markings, 23680471 edges, 16071 markings/sec, 285 secs
lola: 5699427 markings, 24028553 edges, 18122 markings/sec, 290 secs
lola: 5783094 markings, 24369687 edges, 16733 markings/sec, 295 secs
lola: 5864373 markings, 24719111 edges, 16256 markings/sec, 300 secs
lola: 5943809 markings, 25059114 edges, 15887 markings/sec, 305 secs
lola: 6027123 markings, 25394966 edges, 16663 markings/sec, 310 secs
lola: 6105607 markings, 25727378 edges, 15697 markings/sec, 315 secs
lola: 6179358 markings, 26048414 edges, 14750 markings/sec, 320 secs
lola: 6256646 markings, 26366575 edges, 15458 markings/sec, 325 secs
lola: 6325437 markings, 26659226 edges, 13758 markings/sec, 330 secs
lola: 6391660 markings, 26938397 edges, 13245 markings/sec, 335 secs
lola: 6461225 markings, 27202173 edges, 13913 markings/sec, 340 secs
lola: 6557371 markings, 27659089 edges, 19229 markings/sec, 345 secs
lola: 6638222 markings, 28073166 edges, 16170 markings/sec, 350 secs
lola: 6716155 markings, 28481767 edges, 15587 markings/sec, 355 secs
lola: 6789901 markings, 28868311 edges, 14749 markings/sec, 360 secs
lola: 6857135 markings, 29220928 edges, 13447 markings/sec, 365 secs
lola: 6933018 markings, 29544861 edges, 15177 markings/sec, 370 secs
lola: 7002495 markings, 29841688 edges, 13895 markings/sec, 375 secs
lola: 7108293 markings, 30298530 edges, 21160 markings/sec, 380 secs
lola: 7177151 markings, 30624840 edges, 13772 markings/sec, 385 secs
lola: 7333814 markings, 31269582 edges, 31333 markings/sec, 390 secs
lola: 7495080 markings, 32023562 edges, 32253 markings/sec, 395 secs
lola: 7659000 markings, 32673387 edges, 32784 markings/sec, 400 secs
lola: 7777130 markings, 33275737 edges, 23626 markings/sec, 405 secs
lola: 7899852 markings, 33772300 edges, 24544 markings/sec, 410 secs
lola: 8038756 markings, 34405964 edges, 27781 markings/sec, 415 secs
lola: 8106256 markings, 34628014 edges, 13500 markings/sec, 420 secs
lola: 8183395 markings, 34933610 edges, 15428 markings/sec, 425 secs
lola: 8254526 markings, 35221755 edges, 14226 markings/sec, 430 secs
lola: 8341301 markings, 35627415 edges, 17355 markings/sec, 435 secs
lola: 8440626 markings, 36046643 edges, 19865 markings/sec, 440 secs
lola: 8486334 markings, 36239536 edges, 9142 markings/sec, 445 secs
lola: 8558686 markings, 36598449 edges, 14470 markings/sec, 450 secs
lola: 8673446 markings, 36958805 edges, 22952 markings/sec, 455 secs
lola: 8732365 markings, 37241808 edges, 11784 markings/sec, 460 secs
lola: 8839128 markings, 37677404 edges, 21353 markings/sec, 465 secs
lola: 8921809 markings, 38008012 edges, 16536 markings/sec, 470 secs
lola: 9046500 markings, 38597070 edges, 24938 markings/sec, 475 secs
lola: 9179763 markings, 39195806 edges, 26653 markings/sec, 480 secs
lola: 9271051 markings, 39603060 edges, 18258 markings/sec, 485 secs
lola: 9357618 markings, 39944548 edges, 17313 markings/sec, 490 secs
lola: 9447256 markings, 40292220 edges, 17928 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p105) OR (p760 <= p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((1 <= p105) OR (p760 <= p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385))))
lola: processed formula length: 95
lola: 2 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 83 markings, 85 edges
lola: ========================================
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 <= 0) AND ((p693 + p694 + p695 + p696 + p697 + p698 + p699... (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 3328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J06T08-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-CTLCardinality-11.sara.
lola: sara is running 0 secs || 4381 markings, 4484 edges, 876 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4601 markings, 4713 edges
lola: ========================================
lola: subprocess 12 will run for 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1) U (p410 + p411 + p412 + p413 + p414 + p415 + 1 <= p0))) OR E (F (((p832 + 1 <= p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423) OR (p410 + p411 + p412 + p413 + p414 + p415 + 1 <= p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1) U (p410 + p411 + p412 + p413 + p414 + p415 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1) U (p410 + p411 + p412 + p413 + p414 + p415 + 1 <= p0))
lola: processed formula length: 117
lola: 1 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 113 markings, 126 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1007 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (F ((1 <= p634 + p633 + p632 + p631 + p630 + p629))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (1 <= p634 + p633 + p632 + p631 + p630 + p629))))
lola: processed formula length: 65
lola: 6 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3022 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + 1 <= p844) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 + 1 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) AND ((p105 <= p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877) OR (p628 <= p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759) OR (p741 <= p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + 1 <= p844) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 + 1 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) AND ((p105 <= p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877) OR (p628 <= p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759) OR (p741 <= p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511)))))
lola: processed formula: A (F (((p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + 1 <= p844) AND (p709 + p710 + p711 + p712 + p713 + p714 + p715 + 1 <= p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401) AND ((p105 <= p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877) OR (p628 <= p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759) OR (p741 <= p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511)))))
lola: processed formula length: 397
lola: 0 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3332 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 171 markings, 171 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no no yes yes unknown no no yes yes yes no
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T08-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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-S06J06T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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-S06J06T08.tgz
mv PolyORBLF-COL-S06J06T08 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PolyORBLF-COL-S06J06T08, 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 r126-smll-152673528400129"
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 ;