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

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

=== Now, execution of the tool begins

BK_START 1463606660291

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ LamportFastMutEx-PT-7
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-7-ReachabilityFireability-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: 800/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 264 places, 536 transitions, 182 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 762 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-7-ReachabilityFireability.task
lola: read: EF ((!((((((((((((((((((FIREABLE(T-setbi_2_1) OR FIREABLE(T-setbi_2_2)) OR FIREABLE(T-setbi_2_3)) OR FIREABLE(T-setbi_2_4)) OR FIREABLE(T-setbi_2_5)) OR FIREABLE(T-setbi_2_6)) OR FIREABLE(T-setbi_2_7)) OR FIREABLE(T-setbi_2_8)) OR FIREABLE(T-setbi_2_9)) OR FIREABLE(T-setbi_2_10)) OR FIREABLE(T-setbi_2_11)) OR FIREABLE(T-setbi_2_12)) OR FIREABLE(T-setbi_2_13)) OR FIREABLE(T-setbi_2_14)) OR FIREABLE... (shortened)
lola: formula length: 53216
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 ((! FIREABLE(T-setbi_2_1) AND (! FIREABLE(T-setbi_2_2) AND (! FIREABLE(T-setbi_2_3) AND (! FIREABLE(T-setbi_2_4) AND (! FIREABLE(T-setbi_2_5) AND (! FIREABLE(T-setbi_2_6) AND (! FIREABLE(T-setbi_2_7) AND (! FIREABLE(T-setbi_2_8) AND (! FIREABLE(T-setbi_2_9) AND (! FIREABLE(T-setbi_2_10) AND (! FIREABLE(T-setbi_2_11) AND (! FIREABLE(T-setbi_2_12) AND (! FIREABLE(T-setbi_2_13) AND (! FIREABLE(T-s... (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 24 bytes per marking, with 10 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 2862736340894739027640451072 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-awaity_1) OR (FIREABLE(T-awaity_2) OR (FIREABLE(T-awaity_3) OR (FIREABLE(T-awaity_4) OR (FIREABLE(T-awaity_5) OR (FIREABLE(T-awaity_6) OR (FIREABLE(T-awaity_7) OR FIREABLE(T-awaity_8)))))))))
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 24 bytes per marking, with 10 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 16 literals
lola: write sara problem file to LamportFastMutEx-COL-7-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T-xnei_10_2) AND (! FIREABLE(T-xnei_10_3) AND (! FIREABLE(T-xnei_10_4) AND (! FIREABLE(T-xnei_10_5) AND (! FIREABLE(T-xnei_10_6) AND (! FIREABLE(T-xnei_10_7) AND (! FIREABLE(T-xnei_10_8) AND (! FIREABLE(T-xnei_10_9) AND (! FIREABLE(T-xnei_10_11) AND (! FIREABLE(T-xnei_10_12) AND (! FIREABLE(T-xnei_10_13) AND (! FIREABLE(T-xnei_10_14) AND (! FIREABLE(T-xnei_10_15) AND (! FIREABLE(T-... (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 24 bytes per marking, with 10 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-setbi_2_1) OR (FIREABLE(T-setbi_2_2) OR (FIREABLE(T-setbi_2_3) OR (FIREABLE(T-setbi_2_4) OR (FIREABLE(T-setbi_2_5) OR (FIREABLE(T-setbi_2_6) OR (FIREABLE(T-setbi_2_7) OR (FIREABLE(T-setbi_2_8) OR (FIREABLE(T-setbi_2_9) OR (FIREABLE(T-setbi_2_10) OR (FIREABLE(T-setbi_2_11) OR (FIREABLE(T-setbi_2_12) OR (FIREABLE(T-setbi_2_13) OR (FIREABLE(T-setbi_2_14) OR (FIREABLE(T-setbi_2_15) OR ... (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 24 bytes per marking, with 10 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 262108 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-sety0_23_1) AND (! FIREABLE(T-sety0_23_2) AND (! FIREABLE(T-sety0_23_3) AND (! FIREABLE(T-sety0_23_4) AND (! FIREABLE(T-sety0_23_5) AND (! FIREABLE(T-sety0_23_6) AND (! FIREABLE(T-sety0_23_7) AND (! FIREABLE(T-sety0_23_8) AND (! FIREABLE(T-sety0_23_9) AND (! FIREABLE(T-sety0_23_10) AND (! FIREABLE(T-sety0_23_11) AND (! FIREABLE(T-sety0_23_12) AND (! FIREABLE(T-sety0_23_13) AND (!... (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 24 bytes per marking, with 10 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 reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-setx_3_1) OR (FIREABLE(T-setx_3_2) OR (FIREABLE(T-setx_3_3) OR (FIREABLE(T-setx_3_4) OR (FIREABLE(T-setx_3_5) OR (FIREABLE(T-setx_3_6) OR (FIREABLE(T-setx_3_7) OR (FIREABLE(T-setx_3_8) OR (FIREABLE(T-setx_3_9) OR (FIREABLE(T-setx_3_10) OR (FIREABLE(T-setx_3_11) OR (FIREABLE(T-setx_3_12) OR (FIREABLE(T-setx_3_13) OR (FIREABLE(T-setx_3_14) OR (FIREABLE(T-setx_3_15) OR (FIREABLE(T-set... (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 24 bytes per marking, with 10 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 38701305960130778119536640 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-setbi_5_1) AND (! FIREABLE(T-setbi_5_2) AND (! FIREABLE(T-setbi_5_3) AND (! FIREABLE(T-setbi_5_4) AND (! FIREABLE(T-setbi_5_5) AND (! FIREABLE(T-setbi_5_6) AND (! FIREABLE(T-setbi_5_7) AND (! FIREABLE(T-setbi_5_8) AND (! FIREABLE(T-setbi_5_9) AND (! FIREABLE(T-setbi_5_10) AND (! FIREABLE(T-setbi_5_11) AND (! FIREABLE(T-setbi_5_12) AND (! FIREABLE(T-setbi_5_13) AND (! FIREABLE(T-s... (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 24 bytes per marking, with 10 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 175787485578526426757349769216 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-xnei_10_2) AND (! FIREABLE(T-xnei_10_3) AND (! FIREABLE(T-xnei_10_4) AND (! FIREABLE(T-xnei_10_5) AND (! FIREABLE(T-xnei_10_6) AND (! FIREABLE(T-xnei_10_7) AND (! FIREABLE(T-xnei_10_8) AND (! FIREABLE(T-xnei_10_9) AND (! FIREABLE(T-xnei_10_11) AND (! FIREABLE(T-xnei_10_12) AND (! FIREABLE(T-xnei_10_13) AND (! FIREABLE(T-xnei_10_14) AND (! FIREABLE(T-xnei_10_15) AND (! FIREABLE(T... (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 24 bytes per marking, with 10 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 1792 literals
lola: write sara problem file to LamportFastMutEx-COL-7-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-7-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3670)
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-xnei_10_2) OR (FIREABLE(T-xnei_10_3) OR (FIREABLE(T-xnei_10_4) OR (FIREABLE(T-xnei_10_5) OR (FIREABLE(T-xnei_10_6) OR (FIREABLE(T-xnei_10_7) OR (FIREABLE(T-xnei_10_8) OR (FIREABLE(T-xnei_10_9) OR (FIREABLE(T-xnei_10_11) OR (FIREABLE(T-xnei_10_12) OR (FIREABLE(T-xnei_10_13) OR (FIREABLE(T-xnei_10_14) OR (FIREABLE(T-xnei_10_15) OR (FIREABLE(T-xnei_10_16) OR (FIREABLE(T-xnei_10_17) OR... (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 24 bytes per marking, with 10 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 112 literals
lola: write sara problem file to LamportFastMutEx-COL-7-ReachabilityFireability-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(T-yne0_4_2) AND (! FIREABLE(T-yne0_4_3) AND (! FIREABLE(T-yne0_4_4) AND (! FIREABLE(T-yne0_4_5) AND (! FIREABLE(T-yne0_4_6) AND (! FIREABLE(T-yne0_4_7) AND (! FIREABLE(T-yne0_4_8) AND (! FIREABLE(T-yne0_4_10) AND (! FIREABLE(T-yne0_4_11) AND (! FIREABLE(T-yne0_4_12) AND (! FIREABLE(T-yne0_4_13) AND (! FIREABLE(T-yne0_4_14) AND (! FIREABLE(T-yne0_4_15) AND (! FIREABLE(T-yne0_4_16)... (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 24 bytes per marking, with 10 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 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-forod_13_1) OR (FIREABLE(T-forod_13_2) OR (FIREABLE(T-forod_13_3) OR (FIREABLE(T-forod_13_4) OR (FIREABLE(T-forod_13_5) OR (FIREABLE(T-forod_13_6) OR (FIREABLE(T-forod_13_7) OR FIREABLE(T-forod_13_8)))))))))
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 24 bytes per marking, with 10 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 64 literals
lola: write sara problem file to LamportFastMutEx-COL-7-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-sety_9_1) AND (! FIREABLE(T-sety_9_2) AND (! FIREABLE(T-sety_9_3) AND (! FIREABLE(T-sety_9_4) AND (! FIREABLE(T-sety_9_5) AND (! FIREABLE(T-sety_9_6) AND (! FIREABLE(T-sety_9_7) AND (! FIREABLE(T-sety_9_8) AND (! FIREABLE(T-sety_9_9) AND (! FIREABLE(T-sety_9_10) AND (! FIREABLE(T-sety_9_11) AND (! FIREABLE(T-sety_9_12) AND (! FIREABLE(T-sety_9_13) AND (! FIREABLE(T-sety_9_14) AN... (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 24 bytes per marking, with 10 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 274878349568 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-forod_13_1) OR (FIREABLE(T-forod_13_2) OR (FIREABLE(T-forod_13_3) OR (FIREABLE(T-forod_13_4) OR (FIREABLE(T-forod_13_5) OR (FIREABLE(T-forod_13_6) OR (FIREABLE(T-forod_13_7) OR FIREABLE(T-forod_13_8)))))))))
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 24 bytes per marking, with 10 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 64 literals
lola: write sara problem file to LamportFastMutEx-COL-7-ReachabilityFireability-12.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T-sety_9_1) AND (! FIREABLE(T-sety_9_2) AND (! FIREABLE(T-sety_9_3) AND (! FIREABLE(T-sety_9_4) AND (! FIREABLE(T-sety_9_5) AND (! FIREABLE(T-sety_9_6) AND (! FIREABLE(T-sety_9_7) AND (! FIREABLE(T-sety_9_8) AND (! FIREABLE(T-sety_9_9) AND (! FIREABLE(T-sety_9_10) AND (! FIREABLE(T-sety_9_11) AND (! FIREABLE(T-sety_9_12) AND (! FIREABLE(T-sety_9_13) AND (! FIREABLE(T-sety_9_14) A... (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 24 bytes per marking, with 10 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 3025266028088907530240 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-setbi_5_1) OR (FIREABLE(T-setbi_5_2) OR (FIREABLE(T-setbi_5_3) OR (FIREABLE(T-setbi_5_4) OR (FIREABLE(T-setbi_5_5) OR (FIREABLE(T-setbi_5_6) OR (FIREABLE(T-setbi_5_7) OR (FIREABLE(T-setbi_5_8) OR (FIREABLE(T-setbi_5_9) OR (FIREABLE(T-setbi_5_10) OR (FIREABLE(T-setbi_5_11) OR (FIREABLE(T-setbi_5_12) OR (FIREABLE(T-setbi_5_13) OR (FIREABLE(T-setbi_5_14) OR (FIREABLE(T-setbi_5_15) OR... (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 24 bytes per marking, with 10 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 reachable.
lola: ========================================
lola: subprocess 15 will run for 3406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-setbi_2_1) OR (FIREABLE(T-setbi_2_2) OR (FIREABLE(T-setbi_2_3) OR (FIREABLE(T-setbi_2_4) OR (FIREABLE(T-setbi_2_5) OR (FIREABLE(T-setbi_2_6) OR (FIREABLE(T-setbi_2_7) OR (FIREABLE(T-setbi_2_8) OR (FIREABLE(T-setbi_2_9) OR (FIREABLE(T-setbi_2_10) OR (FIREABLE(T-setbi_2_11) OR (FIREABLE(T-setbi_2_12) OR (FIREABLE(T-setbi_2_13) OR (FIREABLE(T-setbi_2_14) OR (FIREABLE(T-setbi_2_15) OR ... (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 24 bytes per marking, with 10 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 1600078467994571893492537729005169563878293504 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: yes yes no no yes no yes no yes no yes no yes yes yes no

BK_STOP 1463606794910

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