About the Execution of LoLa for TokenRing-PT-030
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-2979
Executing tool lola
Input is TokenRing-PT-030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r134kn-smll-146384395400128
=====================================================================
--------------------
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 TokenRing-COL-030-UpperBounds-0
FORMULA_NAME TokenRing-COL-030-UpperBounds-1
FORMULA_NAME TokenRing-COL-030-UpperBounds-10
FORMULA_NAME TokenRing-COL-030-UpperBounds-11
FORMULA_NAME TokenRing-COL-030-UpperBounds-12
FORMULA_NAME TokenRing-COL-030-UpperBounds-13
FORMULA_NAME TokenRing-COL-030-UpperBounds-14
FORMULA_NAME TokenRing-COL-030-UpperBounds-15
FORMULA_NAME TokenRing-COL-030-UpperBounds-2
FORMULA_NAME TokenRing-COL-030-UpperBounds-3
FORMULA_NAME TokenRing-COL-030-UpperBounds-4
FORMULA_NAME TokenRing-COL-030-UpperBounds-5
FORMULA_NAME TokenRing-COL-030-UpperBounds-6
FORMULA_NAME TokenRing-COL-030-UpperBounds-7
FORMULA_NAME TokenRing-COL-030-UpperBounds-8
FORMULA_NAME TokenRing-COL-030-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1463858710605
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ TokenRing-PT-030
FORMULA TokenRing-COL-030-UpperBounds-0 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-1 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-2 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-3 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-4 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-5 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-6 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-7 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-8 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-9 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-10 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-11 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-12 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-13 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-14 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-030-UpperBounds-15 31 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 28892/65536 symbol table entries, 5543 collisions
lola: preprocessing...
lola: finding significant places
lola: 961 places, 27931 transitions, 930 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28892 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-COL-030-UpperBounds.task
lola: read: MAX(State_9_0 + State_18_5 + State_1_21 + State_21_9 + State_18_30 + State_28_19 + State_23_20 + State_18_24 + State_11_24 + State_10_6 + State_21_29 + State_21_23 + State_15_1 + State_8_21 + State_23_23 + State_6_11 + State_14_7 + State_4_30 + State_21_19 + State_8_15 + State_17_6 + State_5_28 + State_28_12 + State_23_30 + State_21_18 + State_2_9 + State_20_5 + State_12_14 + State_12_9 + State_22... (shortened)
lola: formula length: 205485
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 1 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 2 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 11 will run for 644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 12 will run for 805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 13 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 14 will run for 1610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: subprocess 15 will run for 3221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_6_30 + State_24_9 + State_12_9 + State_11_30 + State_23_30 + State_28_30 + State_9_30 + State_29_9 + State_16_9 + State_10_30 + State_22_30 + State_17_9 + State_0_9 + State_18_9 + State_15_30 + State_27_30 + State_8_30 + State_2_30 + State_30_9 + State_3_9 + State_14_30 + State_7_9 + State_26_30 + State_4_9 + State_5_9 + State_19_30 + State_1_30 + State_20_9 + State_13_30 + State_25_30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 31
lola: The maximum value of the given expression is 31
lola: ========================================
lola: RESULT
lola: summary: 31 31 31 31 31 31 31 31 31 31 31 31 31 31 31 31
BK_STOP 1463859029934
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-030"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/TokenRing-PT-030.tgz
mv TokenRing-PT-030 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is TokenRing-PT-030, 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 r134kn-smll-146384395400128"
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 '
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 ;