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 LamportFastMutEx-PT-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896900257
=====================================================================

--------------------
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 LamportFastMutEx-COL-4-LTLCardinality-0
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-1
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-15
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-2
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-3
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-4
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-5
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-6
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-7
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-8
FORMULA_NAME LamportFastMutEx-COL-4-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463599792413

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ LamportFastMutEx-PT-4
FORMULA LamportFastMutEx-COL-4-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-LTLCardinality-15 FALSE 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: 365/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 327 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-4-LTLCardinality.task
lola: read: AG (X (F (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4))) : AG (F (F (F (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4)))) : AX (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) : AF ((F (2 <= ... (shortened)
lola: formula length: 3386
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (F (P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= 0)))
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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-P-setx_3_4 + -P-setx_3_3 + -P-setx_3_2 + -P-setx_3_1 + -P-setx_3_0 + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= 0))
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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= -1)
lola: processed formula length: 87
lola: 2482 rewrites
lola: formula mentions 5 of 135 places; total mentions: 5
lola: closed formula file LamportFastMutEx-COL-4-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((F (-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -2) U X (-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 <= -2)))
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 16 bytes per marking, with 30 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (-P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 <= -2)) U -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 <= -2)
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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file LamportFastMutEx-COL-4-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((G (-x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -3) U F (P-b_3_true + P-b_0_true + P-b_4_true + P-b_1_false + P-b_2_true + P-b_0_false + P-b_2_false + P-b_3_false + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 + P-b_4_false + P-b_1_true <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((-P-wait_3_4 + -P-wait_3_3 + -P-wait_3_2 + -P-wait_3_1 + -P-wait_3_0 + -P-wait_2_4 + -P-wait_2_3 + -P-wait_2_2 + -P-wait_2_1 + -P-wait_2_0 + -P-wait_1_4 + -P-wait_1_3 + -P-wait_1_2 + -P-wait_1_1 + -P-wait_1_0 + -P-wait_4_0 + -P-wait_0_4 + -P-wait_0_3 + -P-wait_0_2 + -P-wait_0_1 + -P-wait_0_0 + -P-wait_4_1 + -P-wait_4_2 + -P-wait_4_3 + -P-wait_4_4 <= -3 U -P-sety_9_4 + -P-sety_9_3 + -P-sety_... (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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 <= 0)
lola: processed formula length: 156
lola: 2482 rewrites
lola: formula mentions 10 of 135 places; total mentions: 10
lola: closed formula file LamportFastMutEx-COL-4-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-P-setx_3_4 + -P-setx_3_3 + -P-setx_3_2 + -P-setx_3_1 + -P-setx_3_0 + P-setbi_11_4 + P-setbi_11_3 + P-setbi_11_2 + P-setbi_11_1 + P-setbi_11_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -P-setx_3_4 + -P-setx_3_3 + -P-setx_3_2 + -P-setx_3_1 + -P-setx_3_0 + P-setbi_11_4 + P-setbi_11_3 + P-setbi_11_2 + P-setbi_11_1 + P-setbi_11_0 <= 0)
lola: processed formula length: 157
lola: 2482 rewrites
lola: formula mentions 10 of 135 places; total mentions: 10
lola: closed formula file LamportFastMutEx-COL-4-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((G (-P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= -3) U X (y_4 + y_3 + y_2 + y_1 + y_0 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (F (P-b_3_true + P-b_0_true + P-b_4_true + P-b_1_false + P-b_2_true + P-b_0_false + P-b_2_false + P-b_3_false + -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 + P-b_4_false + P-b_1_true <= 0))))
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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (F (P-setx_3_4 + P-setx_3_3 + P-setx_3_2 + P-setx_3_1 + P-setx_3_0 + -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= 0)))
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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-P-done_4_4 + -P-done_4_3 + -P-done_4_2 + -P-done_4_1 + -P-done_4_0 + -P-done_3_4 + -P-done_3_3 + -P-done_3_2 + -P-done_3_1 + -P-done_3_0 + -P-done_2_4 + -P-done_2_3 + -P-done_2_2 + -P-done_2_1 + -P-done_2_0 + -P-done_1_4 + -P-done_1_3 + -P-done_1_2 + -P-done_1_1 + -P-done_1_0 + -P-done_0_4 + -P-done_0_3 + -P-done_0_2 + -P-done_0_1 + -P-done_0_0 <= -3 U -P-done_4_4 + -P-done_4_3 + -P-done_4_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 1712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 + P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file LamportFastMutEx-COL-4-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 <= -3) U -P-sety_9_4 + -P-sety_9_3 + -P-sety_9_2 + -P-sety_9_1 + -P-sety_9_0 <= -2)
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 16 bytes per marking, with 30 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola: summary: no no no yes no no no no yes yes no no no yes no no
lola: ========================================

BK_STOP 1463599930558

--------------------
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="LamportFastMutEx-PT-4"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 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 LamportFastMutEx-PT-4, 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 r062kn-blw3-146358896900257"
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 '' LTLCardinality.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 ;