fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r028-blw3-149440264500569
Last Updated
June 27, 2017

About the Execution of LoLA for GPPP-PT-C1000N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6220.980 992247.00 995004.00 410.10 7 3 2000 7000 7 7 47 20 10 10 7 47 47 7 47 3000 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is GPPP-PT-C1000N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500569
=====================================================================


--------------------
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 GPPP-PT-C1000N0000000010-UpperBounds-0
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-1
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-15
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-2
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-3
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-4
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-5
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-6
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-7
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-8
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1494724674139


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
UpperBounds @ GPPP-PT-C1000N0000000010 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000000010-UpperBounds.task
lola: MAX(PEP) : MAX(FBP) : MAX(GSSG) : MAX(GSSG) : MAX(DHAP) : MAX(G6P) : MAX(ATP) : MAX(Lac) : MAX(Ru5P) : MAX(b1) : MAX(a1) : MAX(c2) : MAX(_1_3_BPG) : MAX(Lac) : MAX(Xu5P) : MAX(NADPplus)
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(PEP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 4372989 markings, 7253746 edges, 874598 markings/sec, 0 secs
lola: 8327402 markings, 13845188 edges, 790883 markings/sec, 5 secs
lola: 12175841 markings, 20324990 edges, 769688 markings/sec, 10 secs
lola: 16012407 markings, 27076499 edges, 767313 markings/sec, 15 secs
lola: 19778030 markings, 33886446 edges, 753125 markings/sec, 20 secs
lola: 23262458 markings, 40850081 edges, 696886 markings/sec, 25 secs
lola: 26538208 markings, 47627811 edges, 655150 markings/sec, 30 secs
lola: 29980271 markings, 53971877 edges, 688413 markings/sec, 35 secs
lola: 33739704 markings, 60797035 edges, 751887 markings/sec, 40 secs
lola: 37513179 markings, 67526976 edges, 754695 markings/sec, 45 secs
lola: 40267326 markings, 72825850 edges, 550829 markings/sec, 50 secs
lola: 43981501 markings, 79682611 edges, 742835 markings/sec, 55 secs
lola: 47102176 markings, 86233703 edges, 624135 markings/sec, 60 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(FBP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 3013200 markings, 9233270 edges, 602640 markings/sec, 0 secs
lola: 5834200 markings, 17978850 edges, 564200 markings/sec, 5 secs
lola: 8388275 markings, 25458398 edges, 510815 markings/sec, 10 secs
lola: 10924645 markings, 33091475 edges, 507274 markings/sec, 15 secs
lola: 13395842 markings, 40584705 edges, 494239 markings/sec, 20 secs
lola: 15989514 markings, 48488223 edges, 518734 markings/sec, 25 secs
lola: 18490703 markings, 56141910 edges, 500238 markings/sec, 30 secs
lola: 20978760 markings, 63740901 edges, 497611 markings/sec, 35 secs
lola: 23477986 markings, 71344974 edges, 499845 markings/sec, 40 secs
lola: 26049024 markings, 79226524 edges, 514208 markings/sec, 45 secs
lola: 28654356 markings, 87170371 edges, 521066 markings/sec, 50 secs
lola: 31195985 markings, 94933154 edges, 508326 markings/sec, 55 secs
lola: 33512711 markings, 102135496 edges, 463345 markings/sec, 60 secs
lola: 35663197 markings, 108867147 edges, 430097 markings/sec, 65 secs
lola: 37763982 markings, 115564229 edges, 420157 markings/sec, 70 secs
lola: 39728252 markings, 121788736 edges, 392854 markings/sec, 75 secs
lola: 41831334 markings, 128833193 edges, 420616 markings/sec, 80 secs
lola: 43831087 markings, 135438432 edges, 399951 markings/sec, 85 secs
lola: 45734908 markings, 142002771 edges, 380764 markings/sec, 90 secs
lola: 47604376 markings, 148454548 edges, 373894 markings/sec, 95 secs
lola: 49362299 markings, 155436342 edges, 351585 markings/sec, 100 secs
lola: 50944771 markings, 162022553 edges, 316494 markings/sec, 105 secs
lola: 52720542 markings, 168868701 edges, 355154 markings/sec, 110 secs
lola: 54482818 markings, 174859524 edges, 352455 markings/sec, 115 secs
lola: 56679858 markings, 182186175 edges, 439408 markings/sec, 120 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: ========================================
lola: 5102097 markings, 7725431 edges, 1020419 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 5115299 markings, 7746198 edges, 1023060 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DHAP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 3298271 markings, 9622136 edges, 659654 markings/sec, 0 secs
lola: 6114594 markings, 17503979 edges, 563265 markings/sec, 5 secs
lola: 8727051 markings, 24812888 edges, 522491 markings/sec, 10 secs
lola: 11358687 markings, 32174800 edges, 526327 markings/sec, 15 secs
lola: 13990789 markings, 39541914 edges, 526420 markings/sec, 20 secs
lola: 16256301 markings, 45998196 edges, 453102 markings/sec, 25 secs
lola: 18651880 markings, 53434726 edges, 479116 markings/sec, 30 secs
lola: 21076117 markings, 61103793 edges, 484847 markings/sec, 35 secs
lola: 23203257 markings, 68500018 edges, 425428 markings/sec, 40 secs
lola: 25258220 markings, 75767214 edges, 410993 markings/sec, 45 secs
lola: 27264292 markings, 82885685 edges, 401214 markings/sec, 50 secs
lola: 29369798 markings, 90381724 edges, 421101 markings/sec, 55 secs
lola: 31511336 markings, 98007540 edges, 428308 markings/sec, 60 secs
lola: 33664110 markings, 105678752 edges, 430555 markings/sec, 65 secs
lola: 36201228 markings, 113613293 edges, 507424 markings/sec, 70 secs
lola: 38367965 markings, 120779413 edges, 433347 markings/sec, 75 secs
lola: 40284040 markings, 128415737 edges, 383215 markings/sec, 80 secs
lola: 42223153 markings, 136172716 edges, 387823 markings/sec, 85 secs
lola: 44312453 markings, 144144588 edges, 417860 markings/sec, 90 secs
lola: 46576435 markings, 151791725 edges, 452796 markings/sec, 95 secs
lola: 48598572 markings, 159801231 edges, 404427 markings/sec, 100 secs
lola: 50085632 markings, 165734780 edges, 297412 markings/sec, 105 secs
lola: 51909406 markings, 172708696 edges, 364755 markings/sec, 110 secs
lola: 53978211 markings, 180282253 edges, 413761 markings/sec, 115 secs
lola: 55903262 markings, 187838034 edges, 385010 markings/sec, 120 secs
lola: 57818886 markings, 194881133 edges, 383125 markings/sec, 125 secs
lola: 59745671 markings, 202012358 edges, 385357 markings/sec, 130 secs
lola: 61696550 markings, 209238438 edges, 390176 markings/sec, 135 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: subprocess 5 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================lola:
...considering subproblem: MAX(G6P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 2415155 markings, 8072015 edges, 483031 markings/sec, 0 secs
lola: 4601777 markings, 16026657 edges, 437324 markings/sec, 5 secs
lola: 6710310 markings, 24031096 edges, 421707 markings/sec, 10 secs
lola: 8634537 markings, 31979974 edges, 384845 markings/sec, 15 secs
lola: 10548520 markings, 40033686 edges, 382797 markings/sec, 20 secs
lola: 12489102 markings, 48086572 edges, 388116 markings/sec, 25 secs
lola: 14385164 markings, 55338108 edges, 379212 markings/sec, 30 secs
lola: 16540933 markings, 62297526 edges, 431154 markings/sec, 35 secs
lola: 18375984 markings, 68883429 edges, 367010 markings/sec, 40 secs
lola: 20331683 markings, 76688947 edges, 391140 markings/sec, 45 secs
lola: 21911293 markings, 83680495 edges, 315922 markings/sec, 50 secs
lola: 23812452 markings, 91039545 edges, 380232 markings/sec, 55 secs
lola: 25269240 markings, 98377690 edges, 291358 markings/sec, 60 secs
lola: 27008247 markings, 105681313 edges, 347801 markings/sec, 65 secs
lola: 29083368 markings, 113182156 edges, 415024 markings/sec, 70 secs
lola: 30491233 markings, 120208508 edges, 281573 markings/sec, 75 secs
lola: 31928843 markings, 126598500 edges, 287522 markings/sec, 80 secs
lola: 33570693 markings, 134050225 edges, 328370 markings/sec, 85 secs
lola: 35003703 markings, 140995087 edges, 286602 markings/sec, 90 secs
lola: 36638277 markings, 148431245 edges, 326915 markings/sec, 95 secs
lola: 37978031 markings, 155399908 edges, 267951 markings/sec, 100 secs
lola: 39658071 markings, 162752186 edges, 336008 markings/sec, 105 secs
lola: 41056944 markings, 170024197 edges, 279775 markings/sec, 110 secs
lola: 42736838 markings, 177453747 edges, 335979 markings/sec, 115 secs
lola: 44127863 markings, 184651299 edges, 278205 markings/sec, 120 secs
lola: 45790189 markings, 192098923 edges, 332465 markings/sec, 125 secs
lola: 47240935 markings, 199275916 edges, 290149 markings/sec, 130 secs
lola: 48822021 markings, 206707744 edges, 316217 markings/sec, 135 secs
lola: 50331711 markings, 213802397 edges, 301938 markings/sec, 140 secs
lola: 51856929 markings, 221313986 edges, 305044 markings/sec, 145 secs
lola: 53466385 markings, 228874648 edges, 321891 markings/sec, 150 secs
lola: 55050351 markings, 236229193 edges, 316793 markings/sec, 155 secs
lola: 56576142 markings, 243551873 edges, 305158 markings/sec, 160 secs
lola: 58100085 markings, 250907116 edges, 304789 markings/sec, 165 secs
lola: 59673474 markings, 258387921 edges, 314678 markings/sec, 170 secs
lola: 61240241 markings, 265767575 edges, 313353 markings/sec, 175 secs
lola: 62828759 markings, 273299001 edges, 317704 markings/sec, 180 secs
lola: 64368212 markings, 280676742 edges, 307891 markings/sec, 185 secs
lola: 65972552 markings, 288267816 edges, 320868 markings/sec, 190 secs
lola: 67653481 markings, 296150824 edges, 336186 markings/sec, 195 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(ATP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 3497609 markings, 9338205 edges, 699522 markings/sec, 0 secs
lola: 6705658 markings, 17858979 edges, 641610 markings/sec, 5 secs
lola: 9734404 markings, 26264878 edges, 605749 markings/sec, 10 secs
lola: 12491240 markings, 34535540 edges, 551367 markings/sec, 15 secs
lola: 15409308 markings, 42958274 edges, 583614 markings/sec, 20 secs
lola: 18216274 markings, 50860583 edges, 561393 markings/sec, 25 secs
lola: 20841078 markings, 58819953 edges, 524961 markings/sec, 30 secs
lola: 23244037 markings, 66384276 edges, 480592 markings/sec, 35 secs
lola: 25804655 markings, 74410616 edges, 512124 markings/sec, 40 secs
lola: 28123769 markings, 82072005 edges, 463823 markings/sec, 45 secs
lola: 30744960 markings, 90129442 edges, 524238 markings/sec, 50 secs
lola: 33197646 markings, 97982978 edges, 490537 markings/sec, 55 secs
lola: 35555585 markings, 105513147 edges, 471588 markings/sec, 60 secs
lola: 37955241 markings, 113168669 edges, 479931 markings/sec, 65 secs
lola: 40594108 markings, 121077828 edges, 527773 markings/sec, 70 secs
lola: 43356630 markings, 128565376 edges, 552504 markings/sec, 75 secs
lola: 45798007 markings, 136211010 edges, 488275 markings/sec, 80 secs
lola: 48342452 markings, 143262326 edges, 508889 markings/sec, 85 secs
lola: 50595053 markings, 150220698 edges, 450520 markings/sec, 90 secs
lola: 52657104 markings, 156823196 edges, 412410 markings/sec, 95 secs
lola: 54668866 markings, 163220023 edges, 402352 markings/sec, 100 secs
lola: 56898920 markings, 170413496 edges, 446011 markings/sec, 105 secs
lola: 59281273 markings, 177981890 edges, 476471 markings/sec, 110 secs
lola: 61502168 markings, 185098436 edges, 444179 markings/sec, 115 secs
lola: 63529073 markings, 191492988 edges, 405381 markings/sec, 120 secs
lola: 65946576 markings, 199059622 edges, 483501 markings/sec, 125 secs
lola: 68612999 markings, 206464513 edges, 533285 markings/sec, 130 secs
lola: 70894147 markings, 213573159 edges, 456230 markings/sec, 135 secs
lola: 73041496 markings, 220480972 edges, 429470 markings/sec, 140 secs
lola: 75227052 markings, 227516758 edges, 437111 markings/sec, 145 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 7 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Lac)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 4768656 markings, 8260049 edges, 953731 markings/sec, 0 secs
lola: 9281174 markings, 15918276 edges, 902504 markings/sec, 5 secs
lola: 13143195 markings, 22975527 edges, 772404 markings/sec, 10 secs
lola: 17680608 markings, 30075840 edges, 907483 markings/sec, 15 secs
lola: 21910042 markings, 37220881 edges, 845887 markings/sec, 20 secs
lola: 26082654 markings, 43807534 edges, 834522 markings/sec, 25 secs
lola: 29645467 markings, 50604735 edges, 712563 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: subprocess 8 will run for 349 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Ru5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: ========================================
lola: 5219627 markings, 7903214 edges, 1043925 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(b1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 5210193 markings, 7888865 edges, 1042039 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 3000
lola: produced by: state space
lola: The maximum value of the given expression is 3000
lola: ========================================
lola: subprocess 10 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(a1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: ========================================
lola: subprocess 11 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(c2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 3920926 markings, 9481712 edges, 784185 markings/sec, 0 secs
lola: 7223903 markings, 17377036 edges, 660595 markings/sec, 5 secs
lola: 10442746 markings, 25064942 edges, 643769 markings/sec, 10 secs
lola: 13699820 markings, 32840857 edges, 651415 markings/sec, 15 secs
lola: 17014122 markings, 41045271 edges, 662860 markings/sec, 20 secs
lola: 19972750 markings, 48882797 edges, 591726 markings/sec, 25 secs
lola: 22530235 markings, 56529575 edges, 511497 markings/sec, 30 secs
lola: 25052267 markings, 64111854 edges, 504406 markings/sec, 35 secs
lola: 27596185 markings, 71772643 edges, 508784 markings/sec, 40 secs
lola: 30154209 markings, 79479522 edges, 511605 markings/sec, 45 secs
lola: 32950407 markings, 87480632 edges, 559240 markings/sec, 50 secs
lola: 35786933 markings, 95374905 edges, 567305 markings/sec, 55 secs
lola: 38532488 markings, 103457448 edges, 549111 markings/sec, 60 secs
lola: 41389599 markings, 111617169 edges, 571422 markings/sec, 65 secs
lola: 43681316 markings, 118485073 edges, 458343 markings/sec, 70 secs
lola: 46432650 markings, 126391532 edges, 550267 markings/sec, 75 secs
lola: 48784799 markings, 133819161 edges, 470430 markings/sec, 80 secs
lola: 51167129 markings, 141367837 edges, 476466 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 7000
lola: produced by: state space
lola: The maximum value of the given expression is 7000
lola: ========================================
lola: subprocess 12 will run for 672 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(_1_3_BPG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 3856452 markings, 9326629 edges, 771290 markings/sec, 0 secs
lola: 7131167 markings, 17156374 edges, 654943 markings/sec, 5 secs
lola: 10298431 markings, 24720794 edges, 633453 markings/sec, 10 secs
lola: 13472279 markings, 32298371 edges, 634770 markings/sec, 15 secs
lola: 16764832 markings, 40408204 edges, 658511 markings/sec, 20 secs
lola: 19715494 markings, 48120450 edges, 590132 markings/sec, 25 secs
lola: 22241743 markings, 55664959 edges, 505250 markings/sec, 30 secs
lola: 24735102 markings, 63152601 edges, 498672 markings/sec, 35 secs
lola: 27240428 markings, 70696724 edges, 501065 markings/sec, 40 secs
lola: 29754023 markings, 78274902 edges, 502719 markings/sec, 45 secs
lola: 32429672 markings, 86156015 edges, 535130 markings/sec, 50 secs
lola: 35333127 markings, 94018018 edges, 580691 markings/sec, 55 secs
lola: 37971293 markings, 101917046 edges, 527633 markings/sec, 60 secs
lola: 40878799 markings, 110103443 edges, 581501 markings/sec, 65 secs
lola: 43225860 markings, 117117685 edges, 469412 markings/sec, 70 secs
lola: 45922969 markings, 124816156 edges, 539422 markings/sec, 75 secs
lola: 48285502 markings, 132238181 edges, 472507 markings/sec, 80 secs
lola: 50635589 markings, 139683389 edges, 470017 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: subprocess 13 will run for 865 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Lac)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: ========================================
lola: 4782443 markings, 8280740 edges, 956489 markings/sec, 0 secs
lola: 9118387 markings, 15651643 edges, 867189 markings/sec, 5 secs
lola: 12966475 markings, 22711940 edges, 769618 markings/sec, 10 secs
lola: 17535774 markings, 29802986 edges, 913860 markings/sec, 15 secs
lola: 21745397 markings, 36964614 edges, 841925 markings/sec, 20 secs
lola: 25984613 markings, 43646116 edges, 847843 markings/sec, 25 secs
lola: 29546241 markings, 50409832 edges, 712326 markings/sec, 30 secs
lola: 32935976 markings, 57116124 edges, 677947 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 14 will run for 1277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Xu5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 15 will run for 2554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NADPplus)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 5271977 markings, 7982110 edges, 1054395 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: RESULT
lola:
SUMMARY: 7 3 10 10 7 47 47 7 47 3000 2000 7000 7 7 47 20
lola: ========================================
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-0 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-4 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-5 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-6 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-7 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-8 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-9 3000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-10 2000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-11 7000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-13 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-14 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-15 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494725666386

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C1000N0000000010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is GPPP-PT-C1000N0000000010, 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 r028-blw3-149440264500569"
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 ;