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 240K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 67K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is AirplaneLD-COL-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-qhx2-152646135600037
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526658258920


BK_STOP 1526658317776

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using AirplaneLD-COL-0200 as instance name.
Using AirplaneLD as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', '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': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 3379, 'Memory': 138.95, 'Tool': 'lola'}, {'Time': 5310, 'Memory': 342.17, 'Tool': 'itstools'}, {'Time': 5339, 'Memory': 343.79, 'Tool': 'itstools'}, {'Time': 6868, 'Memory': 2240.12, 'Tool': 'marcie'}, {'Time': 7372, 'Memory': 2240.07, 'Tool': 'marcie'}, {'Time': 18019, 'Memory': 435.14, 'Tool': 'gspn'}, {'Time': 22003, 'Memory': 493.11, 'Tool': 'gspn'}, {'Time': 274055, 'Memory': 2874.83, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
UpperBounds lola AirplaneLD-COL-0200...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
AirplaneLD-COL-0200: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
AirplaneLD-COL-0200: translating COL formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
UpperBounds @ AirplaneLD-COL-0200 @ 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: 3027/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1419 places, 1608 transitions, 814 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1215 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0200-UpperBounds.task
lola: MAX(p407) : MAX(p612) : MAX(p612) : MAX(p610 + p611) : MAX(p1018) : MAX(p400 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385 + p384 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p133 + p132 + p131 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p110 + p109 + p108 + p107 + p106 + p105 + p104 + p103 + p102 + p101 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p100 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2 + p1 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p1015) : MAX(p403) : MAX(p1016) : MAX(p614) : MAX(p614) : MAX(p403) : MAX(p0) : MAX(p406) : MAX(p999 + p998 + p997 + p996 + p995 + p994 + p993 + p992 + p991 + p990 + p989 + p988 + p987 + p986 + p985 + p984 + p983 + p982 + p981 + p980 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p966 + p965 + p964 + p963 + p962 + p961 + p960 + p959 + p958 + p957 + p956 + p955 + p954 + p953 + p952 + p951 + p950 + p949 + p948 + p947 + p946 + p945 + p944 + p943 + p942 + p941 + p940 + p939 + p938 + p937 + p936 + p935 + p934 + p933 + p932 + p931 + p930 + p929 + p928 + p927 + p926 + p925 + p924 + p923 + p922 + p921 + p920 + p919 + p918 + p917 + p916 + p915 + p914 + p913 + p912 + p911 + p910 + p909 + p908 + p907 + p906 + p905 + p904 + p903 + p902 + p901 + p900 + p899 + p898 + p897 + p896 + p895 + p894 + p893 + p892 + p891 + p890 + p889 + p888 + p887 + p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p832 + p831 + p830 + p829 + p828 + p827 + p826 + p825 + p824 + p823 + p822 + p821 + p820 + p819 + p818 + p817 + p816 + p815 + p814 + p813 + p812 + p811 + p810 + p809 + p808 + p807 + p806 + p805 + p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 + p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767 + p766 + p765 + p764 + p763 + p762 + p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754 + p753 + p752 + p751 + p750 + p749 + p748 + p747 + p746 + p745 + p744 + p743 + p742 + p741 + p740 + p739 + p738 + p737 + p736 + p735 + p734 + p733 + p732 + p731 + p730 + p729 + p728 + p727 + p726 + p725 + p724 + p723 + p722 + p721 + p720 + p719 + p718 + p717 + p716 + p715 + p714 + p713 + p712 + p711 + p710 + p709 + p708 + p707 + p706 + p705 + p704 + p703 + p702 + p701 + p700 + p699 + p698 + p697 + p696 + p695 + p694 + p693 + p692 + p691 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p690 + p689 + p688 + p687 + p686 + p685 + p684 + p683 + p682 + p681 + p680 + p679 + p678 + p677 + p676 + p675 + p674 + p673 + p672 + p671 + p670 + p669 + p668 + p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p656 + p655 + p654 + p653 + p652 + p651 + p650 + p649 + p648 + p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 + p624 + p623 + p622 + p621 + p620 + p619 + p618 + p617 + p616 + p615) : MAX(p1018)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p407)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p612)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p612)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p610 + p611)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 41222 markings, 81821 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1018)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: MAX(p400 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385 + p384 + p383 + p382 + p381 + p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 400
lola: produced by: state space
lola: The maximum value of the given expression is 400
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1015)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p403)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 41013 markings, 61314 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1016)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p614)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 11 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p614)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 11 markings, 12 edges
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p403)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 41013 markings, 61314 edges
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p406)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p999 + p998 + p997 + p996 + p995 + p994 + p993 + p992 + p991 + p990 + p989 + p988 + p987 + p986 + p985 + p984 + p983 + p982 + p981 + p980 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p966 + p965 + p964 + p963 + p962 + p961 + p960 + p959 + p958 + p957 + p956 + p955 + p954 + p953 + p952 + p951 + p950 + p949 + p948 + p947 + p946 + p945 + p944 + p943... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 401 markings, 400 edges
lola: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1018)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 400 1 1 1 1 1 1 1 1 1 1
FORMULA AirplaneLD-COL-0200-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-5 400 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="AirplaneLD-COL-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0200.tgz
mv AirplaneLD-COL-0200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is AirplaneLD-COL-0200, 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 r006-qhx2-152646135600037"
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 ;