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 ResAllocation-PT-R003C015, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963100083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494801690678


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
UpperBounds @ ResAllocation-PT-R003C015 @ 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: 150/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 90 places, 60 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 105 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C015-UpperBounds.task
lola: MAX(p_0_2) : MAX(r_13_1) : MAX(p_0_2) : MAX(r_7_0) : MAX(r_8_2) : MAX(p_14_1) : MAX(r_9_2) : MAX(r_12_1) : MAX(p_13_2) : MAX(r_4_1) : MAX(p_9_1) : MAX(p_8_0) : MAX(p_7_2) : MAX(p_1_1) : MAX(p_4_0) : MAX(r_2_2)
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(p_0_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2599939 markings, 6023531 edges, 519988 markings/sec, 0 secs
lola: 4677041 markings, 11989903 edges, 415420 markings/sec, 5 secs
lola: 6351299 markings, 17601945 edges, 334852 markings/sec, 10 secs
lola: 7600093 markings, 22914342 edges, 249759 markings/sec, 15 secs
lola: 8596199 markings, 27878910 edges, 199221 markings/sec, 20 secs
lola: 9607232 markings, 32264034 edges, 202207 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_13_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 3488139 markings, 6353228 edges, 697628 markings/sec, 0 secs
lola: 6110825 markings, 13540861 edges, 524537 markings/sec, 5 secs
lola: 8322665 markings, 20530217 edges, 442368 markings/sec, 10 secs
lola: 10309614 markings, 27720707 edges, 397390 markings/sec, 15 secs
lola: 12098886 markings, 34378046 edges, 357854 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_0_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2610150 markings, 6044473 edges, 522030 markings/sec, 0 secs
lola: 4696625 markings, 12043543 edges, 417295 markings/sec, 5 secs
lola: 6360978 markings, 17682155 edges, 332871 markings/sec, 10 secs
lola: 7625012 markings, 23025333 edges, 252807 markings/sec, 15 secs
lola: 8647385 markings, 28120935 edges, 204475 markings/sec, 20 secs
lola: 9615854 markings, 32766350 edges, 193694 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_7_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 1988095 markings, 6224794 edges, 397619 markings/sec, 0 secs
lola: 4315607 markings, 12974898 edges, 465502 markings/sec, 5 secs
lola: 5833573 markings, 20183192 edges, 303593 markings/sec, 10 secs
lola: 7280884 markings, 27165812 edges, 289462 markings/sec, 15 secs
lola: 8646149 markings, 34031851 edges, 273053 markings/sec, 20 secs
lola: 9748457 markings, 39810203 edges, 220462 markings/sec, 25 secs
lola: 10748181 markings, 45437075 edges, 199945 markings/sec, 30 secs
lola: 11603237 markings, 50298909 edges, 171011 markings/sec, 35 secs
lola: 12730476 markings, 55701151 edges, 225448 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_8_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 1983239 markings, 6268777 edges, 396648 markings/sec, 0 secs
lola: 4301721 markings, 12824597 edges, 463696 markings/sec, 5 secs
lola: 5754062 markings, 19495736 edges, 290468 markings/sec, 10 secs
lola: 6944557 markings, 25337141 edges, 238099 markings/sec, 15 secs
lola: 8393808 markings, 32104609 edges, 289850 markings/sec, 20 secs
lola: 9461582 markings, 37929845 edges, 213555 markings/sec, 25 secs
lola: 10393116 markings, 43016976 edges, 186307 markings/sec, 30 secs
lola: 11453213 markings, 48897494 edges, 212019 markings/sec, 35 secs
lola: 12660173 markings, 54918864 edges, 241392 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_14_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 4304621 markings, 6888921 edges, 860924 markings/sec, 0 secs
lola: 6951375 markings, 14797432 edges, 529351 markings/sec, 5 secs
lola: 9335763 markings, 22031451 edges, 476878 markings/sec, 10 secs
lola: 11405895 markings, 29655806 edges, 414026 markings/sec, 15 secs
lola: 13206555 markings, 37078922 edges, 360132 markings/sec, 20 secs
lola: 14979242 markings, 43899340 edges, 354537 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_9_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2686055 markings, 6514521 edges, 537211 markings/sec, 0 secs
lola: 4715038 markings, 13356998 edges, 405797 markings/sec, 5 secs
lola: 6271837 markings, 19853738 edges, 311360 markings/sec, 10 secs
lola: 7527767 markings, 25926059 edges, 251186 markings/sec, 15 secs
lola: 8619595 markings, 31358571 edges, 218366 markings/sec, 20 secs
lola: 9909316 markings, 37687480 edges, 257944 markings/sec, 25 secs
lola: 10922760 markings, 43611633 edges, 202689 markings/sec, 30 secs
lola: 12206231 markings, 50287690 edges, 256694 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_12_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 3148949 markings, 6973490 edges, 629790 markings/sec, 0 secs
lola: 4782753 markings, 14171778 edges, 326761 markings/sec, 5 secs
lola: 6937816 markings, 21787921 edges, 431013 markings/sec, 10 secs
lola: 8813595 markings, 29229829 edges, 375156 markings/sec, 15 secs
lola: 10425337 markings, 36588638 edges, 322348 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_13_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 3314569 markings, 5908992 edges, 662914 markings/sec, 0 secs
lola: 5820748 markings, 12633330 edges, 501236 markings/sec, 5 secs
lola: 8100624 markings, 20297967 edges, 455975 markings/sec, 10 secs
lola: 10001793 markings, 27908577 edges, 380234 markings/sec, 15 secs
lola: 11644393 markings, 35083394 edges, 328520 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_4_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2400836 markings, 6473568 edges, 480167 markings/sec, 0 secs
lola: 3909584 markings, 13020190 edges, 301750 markings/sec, 5 secs
lola: 5167954 markings, 18977910 edges, 251674 markings/sec, 10 secs
lola: 6297161 markings, 24388170 edges, 225841 markings/sec, 15 secs
lola: 7456088 markings, 30010459 edges, 231785 markings/sec, 20 secs
lola: 8415933 markings, 35454239 edges, 191969 markings/sec, 25 secs
lola: 9287325 markings, 40642433 edges, 174278 markings/sec, 30 secs
lola: 9992867 markings, 44892256 edges, 141108 markings/sec, 35 secs
lola: 10618352 markings, 48623366 edges, 125097 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_9_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2777170 markings, 6575270 edges, 555434 markings/sec, 0 secs
lola: 4919851 markings, 13001357 edges, 428536 markings/sec, 5 secs
lola: 6480527 markings, 19714271 edges, 312135 markings/sec, 10 secs
lola: 7797233 markings, 25653343 edges, 263341 markings/sec, 15 secs
lola: 8871862 markings, 31092113 edges, 214926 markings/sec, 20 secs
lola: 10334665 markings, 38048157 edges, 292561 markings/sec, 25 secs
lola: 11403606 markings, 44050497 edges, 213788 markings/sec, 30 secs
lola: 12698850 markings, 49984605 edges, 259049 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_8_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2546372 markings, 5987776 edges, 509274 markings/sec, 0 secs
lola: 4678812 markings, 12404618 edges, 426488 markings/sec, 5 secs
lola: 6274277 markings, 19121976 edges, 319093 markings/sec, 10 secs
lola: 7536212 markings, 24980734 edges, 252387 markings/sec, 15 secs
lola: 8647811 markings, 30327363 edges, 222320 markings/sec, 20 secs
lola: 9866551 markings, 36424345 edges, 243748 markings/sec, 25 secs
lola: 10896379 markings, 41915707 edges, 205966 markings/sec, 30 secs
lola: 11876706 markings, 47463347 edges, 196065 markings/sec, 35 secs
lola: 12813581 markings, 52440822 edges, 187375 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 12 will run for 770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_7_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2634068 markings, 6206739 edges, 526814 markings/sec, 0 secs
lola: 4494486 markings, 11936017 edges, 372084 markings/sec, 5 secs
lola: 6067193 markings, 18500883 edges, 314541 markings/sec, 10 secs
lola: 7490848 markings, 25109781 edges, 284731 markings/sec, 15 secs
lola: 8552614 markings, 30162352 edges, 212353 markings/sec, 20 secs
lola: 9671479 markings, 35897547 edges, 223773 markings/sec, 25 secs
lola: 10672023 markings, 41181783 edges, 200109 markings/sec, 30 secs
lola: 11629000 markings, 46352297 edges, 191395 markings/sec, 35 secs
lola: 12685932 markings, 51045037 edges, 211386 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: lola: ========================================
subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_1_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2676230 markings, 6592197 edges, 535246 markings/sec, 0 secs
lola: 4929983 markings, 12991182 edges, 450751 markings/sec, 5 secs
lola: 6702320 markings, 18926837 edges, 354467 markings/sec, 10 secs
lola: 7954853 markings, 24212261 edges, 250507 markings/sec, 15 secs
lola: 9024297 markings, 29065151 edges, 213889 markings/sec, 20 secs
lola: 9943115 markings, 33521347 edges, 183764 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 14 will run for 1500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_4_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2783188 markings, 5802088 edges, 556638 markings/sec, 0 secs
lola: 4665487 markings, 11795753 edges, 376460 markings/sec, 5 secs
lola: 6260146 markings, 18126385 edges, 318932 markings/sec, 10 secs
lola: 7416385 markings, 23808495 edges, 231248 markings/sec, 15 secs
lola: 8724839 markings, 29598973 edges, 261691 markings/sec, 20 secs
lola: 9756432 markings, 34717746 edges, 206319 markings/sec, 25 secs
lola: 10706923 markings, 39502070 edges, 190098 markings/sec, 30 secs
lola: 11529127 markings, 43938217 edges, 164441 markings/sec, 35 secs
lola: 12310763 markings, 48065134 edges, 156327 markings/sec, 40 secs
lola: 12912057 markings, 51512528 edges, 120259 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 15 will run for 2949 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_2_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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: 2320094 markings, 5995905 edges, 464019 markings/sec, 0 secs
lola: 4387301 markings, 12021559 edges, 413441 markings/sec, 5 secs
lola: 5913301 markings, 18106118 edges, 305200 markings/sec, 10 secs
lola: 7087878 markings, 23358777 edges, 234915 markings/sec, 15 secs
lola: 8240503 markings, 28821648 edges, 230525 markings/sec, 20 secs
lola: 9268243 markings, 34058695 edges, 205548 markings/sec, 25 secs
lola: 10062639 markings, 38410600 edges, 158879 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
FORMULA ResAllocation-PT-R003C015-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ResAllocation-PT-R003C015-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494802320882

--------------------
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="ResAllocation-PT-R003C015"
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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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 r068-csrt-149440963100083"
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 ;