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 244K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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.8K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 75K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeoElection-COL-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200247
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-3-UpperBounds-00
FORMULA_NAME NeoElection-COL-3-UpperBounds-01
FORMULA_NAME NeoElection-COL-3-UpperBounds-02
FORMULA_NAME NeoElection-COL-3-UpperBounds-03
FORMULA_NAME NeoElection-COL-3-UpperBounds-04
FORMULA_NAME NeoElection-COL-3-UpperBounds-05
FORMULA_NAME NeoElection-COL-3-UpperBounds-06
FORMULA_NAME NeoElection-COL-3-UpperBounds-07
FORMULA_NAME NeoElection-COL-3-UpperBounds-08
FORMULA_NAME NeoElection-COL-3-UpperBounds-09
FORMULA_NAME NeoElection-COL-3-UpperBounds-10
FORMULA_NAME NeoElection-COL-3-UpperBounds-11
FORMULA_NAME NeoElection-COL-3-UpperBounds-12
FORMULA_NAME NeoElection-COL-3-UpperBounds-13
FORMULA_NAME NeoElection-COL-3-UpperBounds-14
FORMULA_NAME NeoElection-COL-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527023402970

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-COL-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NeoElection-COL-3 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ NeoElection-COL-3 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2020/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 972
lola: finding significant places
lola: 972 places, 1048 transitions, 304 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 536 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-3-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (p460 + p461 + p462 + p463 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p958 + p957 + p956 + p955 + p954 + p953 + p952 + p950 + p949 + p948 + p947 + p946 + p945 + p944 + p942 + p941 + p940 + p939 + p938 + p937 + p936 + p934 + p933 + p932 + p931 + p930 + p929 + p928 + p935 + p943 + p951 + p959 <= 0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p58 + p57 + p55 + p54 + p52 + p51 + p49 + p48 + p46 + p45 + p43 + p42 + p40 + p39 + p37 + p36 + p34 + p33 + p31 + p30 + p28 + p27 + p25 + p24 + p22 + p21 + p19 + p18 + p16 + p15 + p13 + p12 + p14 + p17 + p20 + p23 + p26 + p29 + p32 + p35 + p38 + p41 + p44 + p47 + p50 + p53 + p56 + p59 <= 0)
lola: after: (9 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525 + p520 + p521 + p522 + p523 + p524 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p902 + p903 <= 0)
lola: after: (p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525 <= 0)
lola: LP says that atomic proposition is always true: (p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 + p212 + p216 + p220 + p224 + p228 + p232 + p233 + p234 + p235 + p236 + p240 + p244 + p248 + p252 + p256 + p257 + p258 + p259 + p260 + p264 + p268 + p272 + p276 + p280 + p281 + p282 + p283 + p284 + p288 + p292 + p296 + p300 + p304 + p305 + p306 + p307 + p308 + p312 + p316 + p320 + p324 + p328 + p329 + p330 + p331 + p332 + p336 + p340 + p344 + p348 + p352 + p353 + p354 + p355 + p356 + p360 + p364 + p440 + p436 + p368 + p432 + p428 + p427 + p372 + p426 + p425 + p424 + p376 + p377 + p378 + p379 + p380 + p420 + p416 + p412 + p384 + p408 + p404 + p403 + p388 + p402 + p401 + p400 + p392 + p396 + p394 + p395 + p393 + p397 + p398 + p399 + p391 + p390 + p389 + p387 + p386 + p405 + p406 + p407 + p385 + p409 + p410 + p411 + p383 + p413 + p414 + p415 + p382 + p417 + p418 + p419 + p381 + p421 + p422 + p423 + p375 + p374 + p373 + p371 + p370 + p429 + p430 + p431 + p369 + p433 + p434 + p435 + p367 + p437 + p438 + p439 + p366 + p441 + p442 + p443 + p365 + p363 + p362 + p361 + p359 + p358 + p357 + p351 + p350 + p349 + p347 + p346 + p345 + p343 + p342 + p341 + p339 + p338 + p337 + p335 + p334 + p333 + p327 + p326 + p325 + p323 + p322 + p321 + p319 + p318 + p317 + p315 + p314 + p313 + p311 + p310 + p309 + p303 + p302 + p301 + p299 + p298 + p297 + p295 + p294 + p293 + p291 + p290 + p289 + p287 + p286 + p285 + p279 + p278 + p277 + p275 + p274 + p273 + p271 + p270 + p269 + p267 + p266 + p265 + p263 + p262 + p261 + p255 + p254 + p253 + p251 + p250 + p249 + p247 + p246 + p245 + p243 + p242 + p241 + p239 + p238 + p237 + p231 + p230 + p229 + p227 + p226 + p225 + p223 + p222 + p221 + p219 + p218 + p217 + p215 + p214 + p213 + p207 + p206 + p205 + p203 + p202 + p201 + p199 + p198 + p197 + p195 + p194 + p193 + p191 + p190 + p189 + p183 + p182 + p181 + p179 + p178 + p177 + p175 + p174 + p173 + p171 + p170 + p169 + p167 + p166 + p165 + p159 + p158 + p157 + p155 + p154 + p153 + p151 + p150 + p149 + p147 + p146 + p145 + p143 + p142 + p141 + p135 + p134 + p133 + p131 + p130 + p129 + p127 + p126 + p125 + p123 + p122 + p121 + p119 + p118 + p117 + p61 + p62 + p63 + p111 + p110 + p109 + p107 + p106 + p69 + p70 + p71 + p105 + p73 + p74 + p75 + p103 + p77 + p78 + p79 + p102 + p81 + p82 + p83 + p101 + p85 + p86 + p87 + p93 + p94 + p95 + p97 + p98 + p99 <= 0)
lola: after: (p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 + p212 + p216 + p220 + p224 + p228 + p232 + p233 + p234 + p235 + p236 + p240 + p244 + p248 + p252 + p256 + p257 + p258 + p259 + p260 + p264 + p268 + p272 + p276 + p280 + p281 + p282 + p283 + p284 + p288 + p292 + p296 + p300 + p304 + p305 + p306 + p307 + p308 + p312 + p316 + p320 + p324 + p328 + p329 + p330 + p331 + p332 + p336 + p340 + p344 + p348 + p352 + p353 + p354 + p355 + p356 + p360 + p364 + p440 + p436 + p368 + p432 + p428 + p427 + p372 + p426 + p425 + p424 + p376 + p377 + p378 + p379 + p380 + p420 + p416 + p412 + p384 + p408 + p404 + p403 + p388 + p402 + p401 + p400 + p392 + p396 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p958 + p957 + p956 + p955 + p954 + p953 + p952 + p950 + p949 + p948 + p947 + p946 + p945 + p944 + p942 + p941 + p940 + p939 + p938 + p937 + p936 + p934 + p933 + p932 + p931 + p930 + p929 + p928 + p935 + p943 + p951 + p959 <= 0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525 + p520 + p521 + p522 + p523 + p524 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p902 + p903 <= 0)
lola: after: (p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525 <= 0)
lola: LP says that atomic proposition is always true: (p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p958 + p957 + p956 + p955 + p954 + p953 + p952 + p950 + p949 + p948 + p947 + p946 + p945 + p944 + p942 + p941 + p940 + p939 + p938 + p937 + p936 + p934 + p933 + p932 + p931 + p930 + p929 + p928 + p935 + p943 + p951 + p959 <= 0)
lola: after: (3 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p460 + p461 + p462 + p463 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always true: (p467 + p466 + p465 + p464 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 + p212 + p216 + p220 + p224 + p228 + p232 + p233 + p234 + p235 + p236 + p240 + p244 + p248 + p252 + p256 + p257 + p258 + p259 + p260 + p264 + p268 + p272 + p276 + p280 + p281 + p282 + p283 + p284 + p288 + p292 + p296 + p300 + p304 + p305 + p306 + p307 + p308 + p312 + p316 + p320 + p324 + p328 + p329 + p330 + p331 + p332 + p336 + p340 + p344 + p348 + p352 + p353 + p354 + p355 + p356 + p360 + p364 + p440 + p436 + p368 + p432 + p428 + p427 + p372 + p426 + p425 + p424 + p376 + p377 + p378 + p379 + p380 + p420 + p416 + p412 + p384 + p408 + p404 + p403 + p388 + p402 + p401 + p400 + p392 + p396 + p394 + p395 + p393 + p397 + p398 + p399 + p391 + p390 + p389 + p387 + p386 + p405 + p406 + p407 + p385 + p409 + p410 + p411 + p383 + p413 + p414 + p415 + p382 + p417 + p418 + p419 + p381 + p421 + p422 + p423 + p375 + p374 + p373 + p371 + p370 + p429 + p430 + p431 + p369 + p433 + p434 + p435 + p367 + p437 + p438 + p439 + p366 + p441 + p442 + p443 + p365 + p363 + p362 + p361 + p359 + p358 + p357 + p351 + p350 + p349 + p347 + p346 + p345 + p343 + p342 + p341 + p339 + p338 + p337 + p335 + p334 + p333 + p327 + p326 + p325 + p323 + p322 + p321 + p319 + p318 + p317 + p315 + p314 + p313 + p311 + p310 + p309 + p303 + p302 + p301 + p299 + p298 + p297 + p295 + p294 + p293 + p291 + p290 + p289 + p287 + p286 + p285 + p279 + p278 + p277 + p275 + p274 + p273 + p271 + p270 + p269 + p267 + p266 + p265 + p263 + p262 + p261 + p255 + p254 + p253 + p251 + p250 + p249 + p247 + p246 + p245 + p243 + p242 + p241 + p239 + p238 + p237 + p231 + p230 + p229 + p227 + p226 + p225 + p223 + p222 + p221 + p219 + p218 + p217 + p215 + p214 + p213 + p207 + p206 + p205 + p203 + p202 + p201 + p199 + p198 + p197 + p195 + p194 + p193 + p191 + p190 + p189 + p183 + p182 + p181 + p179 + p178 + p177 + p175 + p174 + p173 + p171 + p170 + p169 + p167 + p166 + p165 + p159 + p158 + p157 + p155 + p154 + p153 + p151 + p150 + p149 + p147 + p146 + p145 + p143 + p142 + p141 + p135 + p134 + p133 + p131 + p130 + p129 + p127 + p126 + p125 + p123 + p122 + p121 + p119 + p118 + p117 + p61 + p62 + p63 + p111 + p110 + p109 + p107 + p106 + p69 + p70 + p71 + p105 + p73 + p74 + p75 + p103 + p77 + p78 + p79 + p102 + p81 + p82 + p83 + p101 + p85 + p86 + p87 + p93 + p94 + p95 + p97 + p98 + p99 <= 0)
lola: after: (p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 + p212 + p216 + p220 + p224 + p228 + p232 + p233 + p234 + p235 + p236 + p240 + p244 + p248 + p252 + p256 + p257 + p258 + p259 + p260 + p264 + p268 + p272 + p276 + p280 + p281 + p282 + p283 + p284 + p288 + p292 + p296 + p300 + p304 + p305 + p306 + p307 + p308 + p312 + p316 + p320 + p324 + p328 + p329 + p330 + p331 + p332 + p336 + p340 + p344 + p348 + p352 + p353 + p354 + p355 + p356 + p360 + p364 + p440 + p436 + p368 + p432 + p428 + p427 + p372 + p426 + p425 + p424 + p376 + p377 + p378 + p379 + p380 + p420 + p416 + p412 + p384 + p408 + p404 + p403 + p388 + p402 + p401 + p400 + p392 + p396 <= 0)
lola: LP says that atomic proposition is always true: (p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p460 + p461 + p462 + p463 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: MAX(0) : MAX(0) : MAX(0) : MAX(p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525) : MAX(p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 + p212 + p216 + p220 + p224 + p228 + p232 + p233 + p234 + p235 + p236 + p240 + p244 + p248 + p252 + p256 + p257 + p258 + p259 + p260 + p264 + p268 + p272 + p276 + p280 + p281 + p282 + p283 + p284 + p288 + p292 + p296 + p300 + p304 + p305 + p306 + p307 + p308 + p312 + p316 + p320 + p324 + p328 + p329 + p330 + p331 + p332 + p336 + p340 + p344 + p348 + p352 + p353 + p354 + p355 + p356 + p360 + p364 + p440 + p436 + p368 + p432 + p428 + p427 + p372 + p426 + p425 + p424 + p376 + p377 + p378 + p379 + p380 + p420 + p416 + p412 + p384 + p408 + p404 + p403 + p388 + p402 + p401 + p400 + p392 + p396) : MAX(0) : MAX(p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525) : MAX(p519 + p518 + p517 + p516) : MAX(0) : MAX(p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904) : MAX(p459 + p458 + p457 + p456) : MAX(0) : MAX(p467 + p466 + p465 + p464) : MAX(p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 + p212 + p216 + p220 + p224 + p228 + p232 + p233 + p234 + p235 + p236 + p240 + p244 + p248 + p252 + p256 + p257 + p258 + p259 + p260 + p264 + p268 + p272 + p276 + p280 + p281 + p282 + p283 + p284 + p288 + p292 + p296 + p300 + p304 + p305 + p306 + p307 + p308 + p312 + p316 + p320 + p324 + p328 + p329 + p330 + p331 + p332 + p336 + p340 + p344 + p348 + p352 + p353 + p354 + p355 + p356 + p360 + p364 + p440 + p436 + p368 + p432 + p428 + p427 + p372 + p426 + p425 + p424 + p376 + p377 + p378 + p379 + p380 + p420 + p416 + p412 + p384 + p408 + p404 + p403 + p388 + p402 + p401 + p400 + p392 + p396) : MAX(p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904) : MAX(0)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-0 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-1 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 9
lola: SUBRESULT
lola: result: 9
lola: produced by: state space
lola: The maximum value of the given expression is 9
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-2 9 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525)
lola: processed formula length: 338
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-3 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-5 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p887 + p886 + p885 + p863 + p862 + p861 + p839 + p838 + p837 + p815 + p814 + p813 + p791 + p790 + p789 + p767 + p766 + p765 + p743 + p742 + p741 + p719 + p718 + p717 + p695 + p694 + p693 + p671 + p670 + p669 + p647 + p646 + p645 + p623 + p622 + p621 + p599 + p598 + p597 + p575 + p574 + p573 + p551 + p550 + p549 + p527 + p526 + p525)
lola: processed formula length: 338
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-6 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-8 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904)
lola: processed formula length: 86
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-9 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-11 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p467 + p466 + p465 + p464)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p467 + p466 + p465 + p464)
lola: processed formula length: 30
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-12 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904)
lola: processed formula length: 86
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-14 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-15 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p519 + p518 + p517 + p516)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p519 + p518 + p517 + p516)
lola: processed formula length: 30
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 43 markings, 42 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-7 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p459 + p458 + p457 + p456)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p459 + p458 + p457 + p456)
lola: processed formula length: 30
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 43 markings, 42 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-10 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 +... (shortened)
lola: processed formula length: 994
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4294967295
lola: 227038 markings, 685909 edges, 45408 markings/sec, 0 secs
lola: 452281 markings, 1487189 edges, 45049 markings/sec, 5 secs
lola: 693821 markings, 2274720 edges, 48308 markings/sec, 10 secs
lola: 943985 markings, 3083339 edges, 50033 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 962855 markings, 3139899 edges
lola: ========================================

FORMULA NeoElection-COL-3-UpperBounds-4 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p96 + p92 + p91 + p90 + p89 + p88 + p100 + p84 + p80 + p76 + p104 + p72 + p68 + p67 + p108 + p66 + p65 + p64 + p112 + p113 + p114 + p115 + p116 + p60 + p120 + p124 + p128 + p132 + p136 + p137 + p138 + p139 + p140 + p144 + p148 + p152 + p156 + p160 + p161 + p162 + p163 + p164 + p168 + p172 + p176 + p180 + p184 + p185 + p186 + p187 + p188 + p192 + p196 + p200 + p204 + p208 + p209 + p210 + p211 +... (shortened)
lola: processed formula length: 994
lola: 0 rewrites
lola: closed formula file NeoElection-COL-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4294967295
lola: 259471 markings, 785579 edges, 51894 markings/sec, 0 secs
lola: 500597 markings, 1645874 edges, 48225 markings/sec, 5 secs
lola: 762444 markings, 2494828 edges, 52369 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 962855 markings, 3139899 edges

FORMULA NeoElection-COL-3-UpperBounds-13 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 0 3 9 0 6 3 0 3 3 0 3 0 0 6 0 0
lola:
preliminary result: 0 3 9 0 6 3 0 3 3 0 3 0 0 6 0 0
lola: ========================================
lola: memory consumption: 18468 KB
lola: time consumption: 40 seconds

BK_STOP 1527023443731

--------------------
content from 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="NeoElection-COL-3"
export BK_EXAMINATION="UpperBounds"
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/NeoElection-COL-3.tgz
mv NeoElection-COL-3 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 lola"
echo " Input is NeoElection-COL-3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469200247"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;