About the Execution of M4M.struct for QuasiCertifProtocol-COL-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10106.980 | 877248.00 | 1718034.00 | 3271.00 | FFF?TTTFTF?TTFTF | 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 264K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 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 15K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is QuasiCertifProtocol-COL-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-qhx2-152673584400033
=====================================================================
--------------------
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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527982435202
BK_STOP 1527983312450
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-18 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 249276, 'Memory': 8099.35, 'Tool': 'lola'}, {'Time': 249384, 'Memory': 3867.16, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-COL-18...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-18 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-18-ReachabilityCardinality.task
lola: A (G ((p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 <= p97))) : A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p0) OR (p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p77 + 1 <= p520)))) : A (G ((p519 <= p921 + p902 + p883 + p864 + p845 + p826 + p807 + p788 + p769 + p750 + p731 + p712 + p693 + p674 + p655 + p636 + p617 + p598 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939))) : E (F (((p1017 <= 0) AND (p518 + 1 <= p981 + p980 + p979 + p978 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996) AND (2 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480) AND (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p138 + p157 + p176 + p195 + p214 + p233 + p252 + p271 + p290 + p309 + p328 + p442 + p423 + p404 + p347 + p366 + p385 + p384 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p346 + p345 + p400 + p401 + p402 + p403 + p344 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p343 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p342 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p308 + p307 + p306 + p305 + p304 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120) AND ((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1017) OR (p921 + p902 + p883 + p864 + p845 + p826 + p807 + p788 + p769 + p750 + p731 + p712 + p693 + p674 + p655 + p636 + p617 + p598 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p77))))) : E (F ((1 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p58))) : E (F ((3 <= p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96))) : E (F (((2 <= p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958) AND (p1016 <= 0) AND ((3 <= p1) OR (p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 <= p1) OR (p1 <= 1))))) : E (F (((p981 + p980 + p979 + p978 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 <= 0) AND (p0 + 1 <= p99) AND ((p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977 + 1 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480) OR (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p138 + p157 + p176 + p195 + p214 + p233 + p252 + p271 + p290 + p309 + p328 + p442 + p423 + p404 + p347 + p366 + p385 + p384 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p346 + p345 + p400 + p401 + p402 + p403 + p344 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p343 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p342 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p308 + p307 + p306 + p305 + p304 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120))))) : A (G (((2 <= p520) OR (p578 <= 0) OR (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 <= p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379)))) : E (F ((((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + 1 <= p1015 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1004 + p1003 + p1002 + p1001 + p1000 + p997 + p998 + p999) OR (p98 <= p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977)) AND (3 <= p0)))) : A (G (((3 <= p0) OR (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 <= p921 + p902 + p883 + p864 + p845 + p826 + p807 + p788 + p769 + p750 + p731 + p712 + p693 + p674 + p655 + p636 + p617 + p598 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939) OR ((p519 <= p1016) AND (1 <= p0)) OR (((2 <= p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499) OR (p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p77)) AND ((p1 <= p558 + p557 + p556 + p555 + p554 + p553 + p552 + p551 + p550 + p549 + p548 + p547 + p546 + p545 + p544 + p543 + p542 + p541 + p540) OR (p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 +
p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977 <= p99)))))) : E (F ((3 <= p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379))) : A (G (((p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + 1 <= p97) OR (p1016 <= 2)))) : A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379) OR (p520 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))) : E (F ((p539 + p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p526 + p525 + p524 + p523 + p522 + p521 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21))) : E (F (((p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499 + 1 <= p97) AND (2 <= p0) AND (p539 + p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p526 + p525 + p524 + p523 + p522 + p521 <= p1017))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 <= p97)))
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 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p0) OR (p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p77 + 1 <= p520))))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p519 <= p921 + p902 + p883 + p864 + p845 + p826 + p807 + p788 + p769 + p750 + p731 + p712 + p693 + p674 + p655 + p636 + p617 + p598 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + ... (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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1017 <= 0) AND (p518 + 1 <= p981 + p980 + p979 + p978 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996) AND (2 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480) AND (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 261113 markings, 313336 edges, 52223 markings/sec, 0 secs
lola: sara is running 5 secs || 522679 markings, 641437 edges, 52313 markings/sec, 5 secs
lola: sara is running 10 secs || 770803 markings, 963348 edges, 49625 markings/sec, 10 secs
lola: sara is running 15 secs || 1020152 markings, 1281725 edges, 49870 markings/sec, 15 secs
lola: sara is running 20 secs || 1261164 markings, 1594503 edges, 48202 markings/sec, 20 secs
lola: sara is running 25 secs || 1503172 markings, 1911638 edges, 48402 markings/sec, 25 secs
lola: sara is running 30 secs || 1741954 markings, 2231976 edges, 47756 markings/sec, 30 secs
lola: sara is running 35 secs || 1980692 markings, 2561537 edges, 47748 markings/sec, 35 secs
lola: sara is running 40 secs || 2228619 markings, 2873327 edges, 49585 markings/sec, 40 secs
lola: sara is running 45 secs || 2463925 markings, 3185271 edges, 47061 markings/sec, 45 secs
lola: sara is running 50 secs || 2681055 markings, 3468223 edges, 43426 markings/sec, 50 secs
lola: sara is running 55 secs || 2894205 markings, 3757074 edges, 42630 markings/sec, 55 secs
lola: sara is running 60 secs || 3131447 markings, 4079814 edges, 47448 markings/sec, 60 secs
lola: sara is running 65 secs || 3363093 markings, 4388234 edges, 46329 markings/sec, 65 secs
lola: sara is running 70 secs || 3609947 markings, 4726921 edges, 49371 markings/sec, 70 secs
lola: sara is running 75 secs || 3848695 markings, 5053602 edges, 47750 markings/sec, 75 secs
lola: sara is running 80 secs || 4090828 markings, 5394046 edges, 48427 markings/sec, 80 secs
lola: sara is running 85 secs || 4325190 markings, 5736281 edges, 46872 markings/sec, 85 secs
lola: sara is running 90 secs || 4492593 markings, 6575796 edges, 33481 markings/sec, 90 secs
lola: sara is running 95 secs || 4637164 markings, 7381161 edges, 28914 markings/sec, 95 secs
lola: sara is running 100 secs || 4792618 markings, 8037591 edges, 31091 markings/sec, 100 secs
lola: sara is running 105 secs || 4948903 markings, 8599315 edges, 31257 markings/sec, 105 secs
lola: sara is running 110 secs || 5107047 markings, 9416498 edges, 31629 markings/sec, 110 secs
lola: sara is running 115 secs || 5268623 markings, 10051889 edges, 32315 markings/sec, 115 secs
lola: sara is running 120 secs || 5423646 markings, 10749436 edges, 31005 markings/sec, 120 secs
lola: sara is running 125 secs || 5568567 markings, 11649389 edges, 28984 markings/sec, 125 secs
lola: sara is running 130 secs || 5719533 markings, 12477215 edges, 30193 markings/sec, 130 secs
lola: sara is running 135 secs || 5872913 markings, 13218567 edges, 30676 markings/sec, 135 secs
lola: sara is running 140 secs || 6021580 markings, 13941188 edges, 29733 markings/sec, 140 secs
lola: sara is running 145 secs || 6168210 markings, 14659784 edges, 29326 markings/sec, 145 secs
lola: sara is running 150 secs || 6310433 markings, 15399627 edges, 28445 markings/sec, 150 secs
lola: sara is running 155 secs || 6471063 markings, 16260517 edges, 32126 markings/sec, 155 secs
lola: sara is running 160 secs || 6625388 markings, 17337138 edges, 30865 markings/sec, 160 secs
lola: sara is running 165 secs || 6717617 markings, 18340353 edges, 18446 markings/sec, 165 secs
lola: sara is running 170 secs || 6860358 markings, 19052504 edges, 28548 markings/sec, 170 secs
lola: sara is running 175 secs || 7030017 markings, 19619723 edges, 33932 markings/sec, 175 secs
lola: sara is running 180 secs || 7183668 markings, 20285102 edges, 30730 markings/sec, 180 secs
lola: sara is running 185 secs || 7328450 markings, 20989373 edges, 28956 markings/sec, 185 secs
lola: sara is running 190 secs || 7481547 markings, 21705330 edges, 30619 markings/sec, 190 secs
lola: sara is running 195 secs || 7625151 markings, 22390767 edges, 28721 markings/sec, 195 secs
lola: sara is running 200 secs || 7783397 markings, 23303797 edges, 31649 markings/sec, 200 secs
lola: sara is running 205 secs || 7900350 markings, 24128124 edges, 23391 markings/sec, 205 secs
lola: sara is running 210 secs || 8051642 markings, 24736578 edges, 30258 markings/sec, 210 secs
lola: sara is running 215 secs || 8196188 markings, 25436259 edges, 28909 markings/sec, 215 secs
lola: sara is running 220 secs || 8334176 markings, 26311201 edges, 27598 markings/sec, 220 secs
lola: sara is running 225 secs || 8499854 markings, 27064901 edges, 33136 markings/sec, 225 secs
lola: sara is running 230 secs || 8614739 markings, 27993092 edges, 22977 markings/sec, 230 secs
lola: sara is running 235 secs || 8722540 markings, 28839918 edges, 21560 markings/sec, 235 secs
lola: sara is running 240 secs || 8823250 markings, 29719649 edges, 20142 markings/sec, 240 secs
lola: sara is running 245 secs || 8921794 markings, 30610072 edges, 19709 markings/sec, 245 secs
lola: sara is running 250 secs || 9026415 markings, 31521684 edges, 20924 markings/sec, 250 secs
lola: sara is running 255 secs || 9204826 markings, 32374135 edges, 35682 markings/sec, 255 secs
lola: sara is running 260 secs || 9311752 markings, 33351660 edges, 21385 markings/sec, 260 secs
lola: sara is running 265 secs || 9415672 markings, 34375209 edges, 20784 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p58)))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96)))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958) AND (p1016 <= 0) AND ((3 <= p1) OR (p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 <= p1) OR (p1 <= 1)))))
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 1180 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: The predicate is reachable.
state equation: calling and running sara
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-6.sara.
lola: ========================================
lola: ...considering subproblem: E (F (((p981 + p980 + p979 + p978 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 <= 0) AND (p0 + 1 <= p99) AND ((p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977 + 1 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p520) OR (p578 <= 0) OR (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 <= p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379))))
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 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + 1 <= p1015 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1004 + p1003 + p1002 + p1001 + p1000 + p997 + p998 + p999) OR (p98 <= p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p0) OR (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 <= p921 + p902 + p883 + p864 + p845 + p826 + p807 + p788 + p769 + p750 + p731 + p712 + p693 + p674 + p655 + p636 + p617 + p598 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 +... (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 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 99406 markings, 809977 edges, 19881 markings/sec, 0 secs
lola: sara is running 5 secs || 209313 markings, 1813166 edges, 21981 markings/sec, 5 secs
lola: sara is running 10 secs || 309643 markings, 2766632 edges, 20066 markings/sec, 10 secs
lola: sara is running 15 secs || 415552 markings, 3805273 edges, 21182 markings/sec, 15 secs
lola: sara is running 20 secs || 511351 markings, 4820177 edges, 19160 markings/sec, 20 secs
lola: sara is running 25 secs || 640079 markings, 5939187 edges, 25746 markings/sec, 25 secs
lola: sara is running 30 secs || 779838 markings, 7261222 edges, 27952 markings/sec, 30 secs
lola: sara is running 35 secs || 917471 markings, 8583581 edges, 27527 markings/sec, 35 secs
lola: sara is running 40 secs || 1053049 markings, 9987535 edges, 27116 markings/sec, 40 secs
lola: sara is running 45 secs || 1203040 markings, 11263626 edges, 29998 markings/sec, 45 secs
lola: sara is running 50 secs || 1345923 markings, 12616800 edges, 28577 markings/sec, 50 secs
lola: sara is running 55 secs || 1486625 markings, 13992379 edges, 28140 markings/sec, 55 secs
lola: sara is running 60 secs || 1627938 markings, 15366154 edges, 28263 markings/sec, 60 secs
lola: sara is running 65 secs || 1754163 markings, 16490159 edges, 25245 markings/sec, 65 secs
lola: sara is running 70 secs || 1876333 markings, 17651651 edges, 24434 markings/sec, 70 secs
lola: sara is running 75 secs || 1996342 markings, 18828185 edges, 24002 markings/sec, 75 secs
lola: sara is running 80 secs || 2131770 markings, 20179741 edges, 27086 markings/sec, 80 secs
lola: sara is running 85 secs || 2279725 markings, 21482137 edges, 29591 markings/sec, 85 secs
lola: sara is running 90 secs || 2422154 markings, 22840338 edges, 28486 markings/sec, 90 secs
lola: sara is running 95 secs || 2560758 markings, 24225389 edges, 27721 markings/sec, 95 secs
lola: sara is running 100 secs || 2703616 markings, 25560006 edges, 28572 markings/sec, 100 secs
lola: sara is running 105 secs || 2848773 markings, 26894310 edges, 29031 markings/sec, 105 secs
lola: sara is running 110 secs || 2992113 markings, 28260192 edges, 28668 markings/sec, 110 secs
lola: sara is running 115 secs || 3122735 markings, 29608728 edges, 26124 markings/sec, 115 secs
lola: sara is running 120 secs || 3267415 markings, 30898405 edges, 28936 markings/sec, 120 secs
lola: sara is running 125 secs || 3409500 markings, 32253214 edges, 28417 markings/sec, 125 secs
lola: sara is running 130 secs || 3553366 markings, 33614811 edges, 28773 markings/sec, 130 secs
lola: sara is running 135 secs || 3690314 markings, 35006051 edges, 27390 markings/sec, 135 secs
lola: sara is running 140 secs || 3839482 markings, 36302174 edges, 29834 markings/sec, 140 secs
lola: sara is running 145 secs || 3969777 markings, 37540731 edges, 26059 markings/sec, 145 secs
lola: sara is running 150 secs || 4089904 markings, 38713855 edges, 24025 markings/sec, 150 secs
lola: sara is running 155 secs || 4206405 markings, 39925278 edges, 23300 markings/sec, 155 secs
lola: sara is running 160 secs || 4332153 markings, 41008090 edges, 25150 markings/sec, 160 secs
lola: sara is running 165 secs || 4452519 markings, 42156736 edges, 24073 markings/sec, 165 secs
lola: sara is running 170 secs || 4574078 markings, 43297370 edges, 24312 markings/sec, 170 secs
lola: sara is running 175 secs || 4690424 markings, 44494563 edges, 23269 markings/sec, 175 secs
lola: sara is running 180 secs || 4815066 markings, 45608991 edges, 24928 markings/sec, 180 secs
lola: sara is running 185 secs || 4937585 markings, 46731714 edges, 24504 markings/sec, 185 secs
lola: sara is running 190 secs || 5057561 markings, 47871250 edges, 23995 markings/sec, 190 secs
lola: sara is running 195 secs || 5174551 markings, 49050561 edges, 23398 markings/sec, 195 secs
lola: sara is running 200 secs || 5292979 markings, 50189924 edges, 23686 markings/sec, 200 secs
lola: sara is running 205 secs || 5416600 markings, 51282642 edges, 24724 markings/sec, 205 secs
lola: sara is running 210 secs || 5540258 markings, 52462826 edges, 24732 markings/sec, 210 secs
lola: sara is running 215 secs || 5662131 markings, 53649413 edges, 24375 markings/sec, 215 secs
lola: sara is running 220 secs || 5773035 markings, 54823069 edges, 22181 markings/sec, 220 secs
lola: sara is running 225 secs || 5894808 markings, 55862530 edges, 24355 markings/sec, 225 secs
lola: sara is running 230 secs || 6010474 markings, 56937849 edges, 23133 markings/sec, 230 secs
lola: sara is running 235 secs || 6136790 markings, 58134101 edges, 25263 markings/sec, 235 secs
lola: sara is running 240 secs || 6258206 markings, 59384170 edges, 24283 markings/sec, 240 secs
lola: sara is running 245 secs || 6387136 markings, 60543086 edges, 25786 markings/sec, 245 secs
lola: sara is running 250 secs || 6514302 markings, 61712398 edges, 25433 markings/sec, 250 secs
lola: sara is running 255 secs || 6640135 markings, 62905756 edges, 25167 markings/sec, 255 secs
lola: sara is running 260 secs || 6761306 markings, 64133297 edges, 24234 markings/sec, 260 secs
lola: sara is running 265 secs || 6887810 markings, 65319920 edges, 25301 markings/sec, 265 secs
lola: sara is running 270 secs || 7016082 markings, 66481808 edges, 25654 markings/sec, 270 secs
lola: sara is running 275 secs || 7133912 markings, 67597152 edges, 23566 markings/sec, 275 secs
lola: sara is running 280 secs || 7257107 markings, 68815883 edges, 24639 markings/sec, 280 secs
lola: sara is running 285 secs || 7380267 markings, 70029844 edges, 24632 markings/sec, 285 secs
lola: sara is running 290 secs || 7509633 markings, 71168514 edges, 25873 markings/sec, 290 secs
lola: sara is running 295 secs || 7634419 markings, 72360949 edges, 24957 markings/sec, 295 secs
lola: sara is running 300 secs || 7760927 markings, 73588956 edges, 25302 markings/sec, 300 secs
lola: sara is running 305 secs || 7884313 markings, 74849389 edges, 24677 markings/sec, 305 secs
lola: sara is running 310 secs || 8017280 markings, 75999473 edges, 26593 markings/sec, 310 secs
lola: sara is running 315 secs || 8140757 markings, 77180457 edges, 24695 markings/sec, 315 secs
lola: sara is running 320 secs || 8265951 markings, 78385974 edges, 25039 markings/sec, 320 secs
lola: sara is running 325 secs || 8377055 markings, 79546898 edges, 22221 markings/sec, 325 secs
lola: sara is running 330 secs || 8509190 markings, 80694537 edges, 26427 markings/sec, 330 secs
lola: sara is running 335 secs || 8638621 markings, 81912282 edges, 25886 markings/sec, 335 secs
lola: sara is running 340 secs || 8772690 markings, 83189508 edges, 26814 markings/sec, 340 secs
lola: sara is running 345 secs || 8898165 markings, 84491714 edges, 25095 markings/sec, 345 secs
lola: sara is running 350 secs || 9030657 markings, 85648342 edges, 26498 markings/sec, 350 secs
lola: sara is running 355 secs || 9151157 markings, 86770603 edges, 24100 markings/sec, 355 secs
lola: sara is running 360 secs || 9278540 markings, 87978724 edges, 25477 markings/sec, 360 secs
lola: sara is running 365 secs || 9400267 markings, 89225191 edges, 24345 markings/sec, 365 secs
lola: sara is running 370 secs || 9539922 markings, 90490468 edges, 27931 markings/sec, 370 secs
lola: sara is running 375 secs || 9678408 markings, 91781005 edges, 27697 markings/sec, 375 secs
lola: sara is running 380 secs || 9812722 markings, 93060829 edges, 26863 markings/sec, 380 secs
lola: sara is running 385 secs || 9940043 markings, 94375572 edges, 25464 markings/sec, 385 secs
lola: sara is running 390 secs || 10042148 markings, 95275878 edges, 20421 markings/sec, 390 secs
lola: sara is running 395 secs || 10145607 markings, 96207761 edges, 20692 markings/sec, 395 secs
lola: sara is running 400 secs || 10232921 markings, 97061760 edges, 17463 markings/sec, 400 secs
lola: sara is running 405 secs || 10332873 markings, 97997460 edges, 19990 markings/sec, 405 secs
lola: sara is running 410 secs || 10423265 markings, 98919047 edges, 18078 markings/sec, 410 secs
lola: sara is running 415 secs || 10517833 markings, 99852223 edges, 18914 markings/sec, 415 secs
lola: sara is running 420 secs || 10618715 markings, 100739990 edges, 20176 markings/sec, 420 secs
lola: sara is running 425 secs || 10715403 markings, 101631051 edges, 19338 markings/sec, 425 secs
lola: sara is running 430 secs || 10813024 markings, 102557317 edges, 19524 markings/sec, 430 secs
lola: sara is running 435 secs || 10901420 markings, 103420849 edges, 17679 markings/sec, 435 secs
lola: sara is running 440 secs || 10985546 markings, 104304195 edges, 16825 markings/sec, 440 secs
lola: sara is running 445 secs || 11079531 markings, 105146126 edges, 18797 markings/sec, 445 secs
lola: sara is running 450 secs || 11173454 markings, 105981858 edges, 18785 markings/sec, 450 secs
lola: sara is running 455 secs || 11262159 markings, 106837954 edges, 17741 markings/sec, 455 secs
lola: sara is running 460 secs || 11354869 markings, 107696950 edges, 18542 markings/sec, 460 secs
lola: sara is running 465 secs || 11443562 markings, 108580364 edges, 17739 markings/sec, 465 secs
lola: sara is running 470 secs || 11526496 markings, 109476256 edges, 16587 markings/sec, 470 secs
lola: sara is running 475 secs || 11627547 markings, 110326953 edges, 20210 markings/sec, 475 secs
lola: sara is running 480 secs || 11723519 markings, 111199759 edges, 19194 markings/sec, 480 secs
lola: sara is running 485 secs || 11815623 markings, 112086456 edges, 18421 markings/sec, 485 secs
lola: sara is running 490 secs || 11910099 markings, 112986277 edges, 18895 markings/sec, 490 secs
lola: sara is running 495 secs || 12003447 markings, 113933471 edges, 18670 markings/sec, 495 secs
lola: sara is running 500 secs || 12109466 markings, 114945123 edges, 21204 markings/sec, 500 secs
lola: sara is running 505 secs || 12221732 markings, 115940095 edges, 22453 markings/sec, 505 secs
lola: sara is running 510 secs || 12329007 markings, 116976995 edges, 21455 markings/sec, 510 secs
lola: sara is running 515 secs || 12440170 markings, 118026993 edges, 22233 markings/sec, 515 secs
lola: sara is running 520 secs || 12541955 markings, 119065196 edges, 20357 markings/sec, 520 secs
lola: sara is running 525 secs || 12645203 markings, 120027395 edges, 20650 markings/sec, 525 secs
lola: sara is running 530 secs || 12757192 markings, 121018035 edges, 22398 markings/sec, 530 secs
lola: sara is running 535 secs || 12864988 markings, 122054578 edges, 21559 markings/sec, 535 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379)))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 12 will run for 679 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + 1 <= p97) OR (p1016 <= 2))))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 905 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379) OR (p520 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p539 + p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p526 + p525 + p524 + p523 + p522 + p521 <= p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21)))
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 1180 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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-14.sara.
lola: 21 markings, 20 edges
lola: subprocess 15 will run for 2715 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499 + 1 <= p97) AND (2 <= p0) AND (p539 + p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p526 + p525 + p524 + p523 + p522 + p521 <= p1017))))
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 1180 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: ========================================
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: RESULT
lola:
SUMMARY: no no no unknown yes yes yes no yes no unknown yes yes no yes no
lola: ========================================
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
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/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 mcc4mcc-structural"
echo " Input is QuasiCertifProtocol-COL-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-qhx2-152673584400033"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;