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 PhaseVariation-PT-D30CS010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088300189
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463701870098

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PhaseVariation-PT-D30CS010
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-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: 33679/65536 symbol table entries, 10484 collisions
lola: preprocessing...
lola: finding significant places
lola: 2702 places, 30977 transitions, 1801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D30CS010-ReachabilityFireability.task
lola: read: EF (((((FIREABLE(division2_mutate_7_23_A_8_22) AND FIREABLE(division2_mutate_27_6_B_26_6)) AND (FIREABLE(division2_mutate_20_7_A_19_6) AND FIREABLE(division2_replicate_5_16_B_4_17))) OR ((FIREABLE(division2_mutate_28_12_A_27_11) AND FIREABLE(division2_mutate_5_20_B_4_20)) OR (FIREABLE(division2_replicate_19_20_B_20_20) AND FIREABLE(division2_mutate_8_7_B_8_8)))) AND !(!((FIREABLE(division2_replica... (shortened)
lola: formula length: 3721
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(division2_mutate_7_23_A_8_22) AND (FIREABLE(division2_mutate_27_6_B_26_6) AND (FIREABLE(division2_mutate_20_7_A_19_6) AND FIREABLE(division2_replicate_5_16_B_4_17)))) OR ((FIREABLE(division2_mutate_28_12_A_27_11) AND FIREABLE(division2_mutate_5_20_B_4_20)) OR (FIREABLE(division2_replicate_19_20_B_20_20) AND FIREABLE(division2_mutate_8_7_B_8_8)))) AND (FIREABLE(division2_replicate_2... (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 7204 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: Transformation into DNF: expect 66 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(division2_replicate_11_2_B_12_2) OR (FIREABLE(division2_replicate_22_16_B_21_15) OR (FIREABLE(division2_mutate_8_5_B_9_6) AND FIREABLE(division1_mutate_26_13_A)))) AND (! FIREABLE(division2_replicate_5_26_A_6_25) AND (! FIREABLE(division2_replicate_14_21_B_13_20) AND FIREABLE(division2_mutate_25_7_B_24_6)))))
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 7204 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: Transformation into DNF: expect 195 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-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: EF ((FIREABLE(division2_mutate_15_9_B_14_10) AND ((! FIREABLE(division2_replicate_17_17_B_17_18) OR ! FIREABLE(division1_mutate_27_30_B)) AND (FIREABLE(division2_mutate_9_17_B_8_17) AND ((FIREABLE(division2_replicate_9_17_B_8_17) OR FIREABLE(division2_replicate_12_20_B_11_19)) AND ((FIREABLE(division2_replicate_27_20_B_28_21) AND FIREABLE(division2_replicate_1_24_B_2_25)) OR ! FIREABLE(division2_m... (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 7204 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: Transformation into DNF: expect 402 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_replicate_11_17_A_11_16))
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 7204 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_replicate_6_9_B_6_8) AND (FIREABLE(division2_replicate_20_6_A_21_6) AND (FIREABLE(division2_mutate_28_16_B_29_16) AND FIREABLE(division2_replicate_15_4_A_14_3)))))
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 7204 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: Transformation into DNF: expect 12 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-4.sara.
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: EF ((! FIREABLE(division2_mutate_12_29_A_11_28) AND (! FIREABLE(division2_replicate_18_4_B_18_3) AND ((FIREABLE(division2_mutate_18_15_A_17_14) AND (FIREABLE(division2_mutate_7_26_B_6_26) OR FIREABLE(division2_replicate_19_6_B_20_6))) OR FIREABLE(division1_mutate_2_8_A)))))
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 7204 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: Transformation into DNF: expect 177 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division1_replicate_6_8_B) AND ! FIREABLE(division2_mutate_8_6_B_7_7)))
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 7204 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: Transformation into DNF: expect 12 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-6.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(division2_replicate_10_4_B_9_5))
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 7204 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_replicate_11_3_A_10_2))
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 7204 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(division2_mutate_9_13_A_10_12) AND FIREABLE(division2_mutate_19_19_B_19_20)) OR ! FIREABLE(division2_mutate_2_26_B_2_25)))
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 7204 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: Transformation into DNF: expect 24 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(division2_mutate_30_15_A_30_14))
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 7204 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(division2_replicate_25_29_A_26_28) AND FIREABLE(division2_mutate_25_30_A_26_29)) OR FIREABLE(division1_replicate_1_28_B)) AND (FIREABLE(division2_replicate_5_29_B_5_28) AND (FIREABLE(division2_replicate_18_11_A_18_12) AND (! FIREABLE(division2_mutate_21_12_B_21_11) AND (! FIREABLE(division2_replicate_10_23_A_9_24) AND ((FIREABLE(division2_replicate_16_30_B_15_29) OR FIREABLE(divisi... (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 7204 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: Transformation into DNF: expect 510 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(division2_mutate_15_22_A_14_21) OR FIREABLE(division2_mutate_13_11_B_12_12)))
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 7204 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: Transformation into DNF: expect 12 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(division2_mutate_18_14_A_18_15) AND (FIREABLE(division2_mutate_26_19_B_25_18) AND (FIREABLE(division2_replicate_28_20_B_27_20) OR FIREABLE(division2_mutate_30_17_A_30_16)))) OR ((! FIREABLE(division2_replicate_25_27_B_24_28) OR ! FIREABLE(division1_replicate_18_5_A)) AND FIREABLE(division2_mutate_13_27_A_14_27))))
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 7204 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: Transformation into DNF: expect 42 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_mutate_1_17_A_2_17) AND (FIREABLE(division2_mutate_3_22_B_3_21) OR (! FIREABLE(division2_mutate_16_27_B_17_28) AND (FIREABLE(division2_mutate_26_8_A_26_9) AND FIREABLE(division2_replicate_3_21_A_2_20))))))
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 7204 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: Transformation into DNF: expect 36 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(division2_replicate_20_28_B_19_27) OR (FIREABLE(division2_replicate_19_19_A_19_20) OR (FIREABLE(division2_mutate_25_2_A_26_1) OR ((! FIREABLE(division2_replicate_26_22_A_25_21) AND (FIREABLE(division2_replicate_4_28_A_4_27) AND FIREABLE(division2_replicate_24_2_B_25_2))) OR (FIREABLE(division2_mutate_7_30_A_6_30) OR FIREABLE(division2_mutate_6_13_B_7_12)))))))
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 7204 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: Transformation into DNF: expect 36 literals
lola: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes yes yes yes unknown no yes no yes unknown no yes yes yes

BK_STOP 1463702868332

--------------------
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="PhaseVariation-PT-D30CS010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PhaseVariation-PT-D30CS010.tgz
mv PhaseVariation-PT-D30CS010 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 PhaseVariation-PT-D30CS010, 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 r086kn-ebro-146369088300189"
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 ;