About the Execution of LoLa for TokenRing-PT-040
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9196.570 | 3539886.00 | 3549109.00 | 10494.50 | TTTTTT??TT?TTTT? | 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-2979
Executing tool lola
Input is TokenRing-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r134kn-smll-146384395500140
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-COL-040-LTLCardinality-0
FORMULA_NAME TokenRing-COL-040-LTLCardinality-1
FORMULA_NAME TokenRing-COL-040-LTLCardinality-10
FORMULA_NAME TokenRing-COL-040-LTLCardinality-11
FORMULA_NAME TokenRing-COL-040-LTLCardinality-12
FORMULA_NAME TokenRing-COL-040-LTLCardinality-13
FORMULA_NAME TokenRing-COL-040-LTLCardinality-14
FORMULA_NAME TokenRing-COL-040-LTLCardinality-15
FORMULA_NAME TokenRing-COL-040-LTLCardinality-2
FORMULA_NAME TokenRing-COL-040-LTLCardinality-3
FORMULA_NAME TokenRing-COL-040-LTLCardinality-4
FORMULA_NAME TokenRing-COL-040-LTLCardinality-5
FORMULA_NAME TokenRing-COL-040-LTLCardinality-6
FORMULA_NAME TokenRing-COL-040-LTLCardinality-7
FORMULA_NAME TokenRing-COL-040-LTLCardinality-8
FORMULA_NAME TokenRing-COL-040-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463867873703
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ TokenRing-PT-040
FORMULA TokenRing-COL-040-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-4 CANNOT_COMPUTE
FORMULA TokenRing-COL-040-LTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-9 CANNOT_COMPUTE
FORMULA TokenRing-COL-040-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA TokenRing-COL-040-LTLCardinality-14 CANNOT_COMPUTE
FORMULA TokenRing-COL-040-LTLCardinality-15 CANNOT_COMPUTE
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: 67322/65536 symbol table entries, 32756 collisions
lola: preprocessing...
lola: finding significant places
lola: 1681 places, 65641 transitions, 1640 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 67322 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-COL-040-LTLCardinality.task
lola: read: A2 <= State_20_35 + State_9_0 + State_9_4 + State_40_40 + State_37_15 + State_17_28 + State_13_7 + State_25_28 + State_5_23 + State_40_24 + State_18_29 + State_2_15 + State_3_39 + State_28_15 + State_24_18 + State_17_18 + State_32_4 + State_18_22 + State_37_17 + State_5_1 + State_3_16 + State_39_17 + State_19_8 + State_15_35 + State_26_5 + State_32_22 + State_36_14 + State_22_11 + State_39_4 + Sta... (shortened)
lola: formula length: 386338
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 94 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 100 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (X (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -... (shortened)
lola: processed formula length: 24408
lola: 36590301 rewrites
lola: formula mentions 1681 of 1681 places; total mentions: 1681
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -St... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State_31_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file TokenRing-COL-040-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -State... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (X (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (X (F (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 14 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (X (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -S... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-State_6_40 + -State_36_40 + -State_24_9 + -State_12_9 + -State_11_40 + -State_23_40 + -State_35_40 + -State_28_40 + -State_9_40 + -State_29_9 + -State_16_9 + -State_10_40 + -State_17_9 + -State_22_40 + -State_0_9 + -State_18_9 + -State_15_40 + -State_27_40 + -State_39_40 + -State_8_40 + -State_40_40 + -State_2_40 + -State_30_9 + -State_3_9 + -State_14_40 + -State_26_40 + -State_38_40 + -St... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6560 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes yes yes yes unknown yes yes yes yes unknown yes yes yes yes unknown unknown
BK_STOP 1463871413589
--------------------
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-040"
export BK_EXAMINATION="LTLCardinality"
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-040.tgz
mv TokenRing-PT-040 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-040, examination is LTLCardinality"
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-146384395500140"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;