fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r062kn-blw3-146358896900259
Last Updated
June 30, 2016

About the Execution of LoLa for LamportFastMutEx-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
734.730 18885.00 35954.00 17.50 FFTFFFFTTTTTTTFF 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 LamportFastMutEx-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896900259
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463599848409

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ LamportFastMutEx-PT-4
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-15 TRUE 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-ReachabilityCardinality.task
lola: read: EF (!((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= x_0 + x_1 + x_2 + x_3 + x_4 OR (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 OR P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4)))) : AG ((!(!(P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 <=... (shortened)
lola: formula length: 8511
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-x_4 + P-CS_21_4 + P-CS_21_3 + P-CS_21_2 + P-CS_21_1 + P-CS_21_0 + -x_3 + -x_2 + -x_1 + -x_0 > 0 AND (-P-setbi_11_4 + -P-setbi_11_3 + -P-setbi_11_2 + -P-setbi_11_1 + -P-setbi_11_0 > -1 AND P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 <= 0 AND (-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0 <= 0 OR (P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_1 + P-setbi_5_0 + -P-start_1_4 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-sety_9_4 + -P-sety_9_3 + -P-sety_9_2 + -P-sety_9_1 + -P-sety_9_0 > -3 AND (-x_4 + P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + -x_3 + -x_2 + -x_1 + -x_0 > 0 AND 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-i... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 <= -1 AND 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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (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 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((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 AND (P-setbi_24_4 + P-setbi_24_3 + P-setbi_24_2 + P-setbi_24_1 + P-setbi_24_0 + -P-sety_9_4 + -P-sety_9_3 + -P-sety_9_2 + -P-sety_9_1 + -P-sety_9_0 > 0 OR -P-ifyi_15_4 + -P-ifyi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 > -1 AND -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 > -1) OR (-y_4 + -y_3 + -y_2 + -y_1 + -y_0 <= -1 OR (P-CS_21_4 + P-CS_21_3 + P-CS_21_2 + P-CS_21_1 + P-CS_21_0 + -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= 0 OR -P-start_1_4 + -P-start_1_3 + -P-start_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 8 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-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-b_4_false + -P-b_1_true + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 > 0 AND P-b_3_true + -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 + 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_fal... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-8.sara
lola: lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)========================================

lola: calling and running sara
lola: ========================================
lola: ...considering subproblem: AG ((((-P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= -2 OR -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -1) AND (P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + -P-b_3_true + 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-b_0_true + P-done_1_4 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: SUBRESULT
lola: result: no
lola: sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-8.sara.
The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: 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 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + -P-b_3_true + 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-b_0_true + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_1 + P-done_1_0 + -P-b_4_true + -P-b_1_false + -P-b_2_true + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_1 + P-done_0_0 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-11.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -1 AND (-y_4 + -y_3 + -y_2 + -y_1 + -y_0 <= -2 AND -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= -1)) OR 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: calling and running sara
lola: ========================================
lola: subprocess 13 will run for 1173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-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_11_4 + P-setbi_11_3 + P-setbi_11_2 + P-setbi_11_1 + P-setbi_11_0 + -P-b_4_false + -P-b_1_true > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-13.sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-i... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-y_4 + -y_3 + -y_2 + -y_1 + -y_0 <= -3 OR -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 <= -3) AND P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= 0) OR (-P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 <= -1 AND -P-wait_3_4 + -P-wait... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
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: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no no yes yes yes yes yes yes no no yes no no no no yes

BK_STOP 1463599867294

--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-146358896900259"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;