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 BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662300306
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463488844466

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ BridgeAndVehicles-PT-V20P20N10
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P20N10-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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability.task
lola: read: EF (((((((((((((((((((((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1)) OR FIREABLE(decision_2_1)) OR FIREABLE(decision_3_1)) OR FIREABLE(decision_4_1)) OR FIREABLE(decision_5_1)) OR FIREABLE(decision_6_1)) OR FIREABLE(decision_7_1)) OR FIREABLE(decision_8_1)) OR FIREABLE(decision_9_1)) OR FIREABLE(decision_0_2)) OR FIREABLE(decision_1_2)) OR FIREABLE(decision_2_2)) OR FIREABLE(decision_3_2)) OR... (shortened)
lola: formula length: 148729
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(decision_0_1) OR (FIREABLE(decision_1_1) OR (FIREABLE(decision_2_1) OR (FIREABLE(decision_3_1) OR (FIREABLE(decision_4_1) OR (FIREABLE(decision_5_1) OR (FIREABLE(decision_6_1) OR (FIREABLE(decision_7_1) OR (FIREABLE(decision_8_1) OR (FIREABLE(decision_9_1) OR (FIREABLE(decision_0_2) OR (FIREABLE(decision_1_2) OR (FIREABLE(decision_2_2) OR (FIREABLE(decision_3_2) OR (FIREABLE(decisio... (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 244 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 52840 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability.sara.
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 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_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 244 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 4 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(altern_cpt_10_1) OR FIREABLE(altern_cpt_10_2)) AND (! FIREABLE(timeout_B_1_0_2_0) AND (! FIREABLE(timeout_B_2_0_2_0) AND (! FIREABLE(timeout_B_3_0_2_0) AND (! FIREABLE(timeout_B_4_0_2_0) AND (! FIREABLE(timeout_B_5_0_2_0) AND (! FIREABLE(timeout_B_6_0_2_0) AND (! FIREABLE(timeout_B_7_0_2_0) AND (! FIREABLE(timeout_B_8_0_2_0) AND (! FIREABLE(timeout_B_9_0_2_0) AND (! FIREABLE(timeout... (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 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistrement_B_1) OR (FIREABLE(enregistrement_B_2) OR (FIREABLE(enregistrement_B_3) OR (FIREABLE(enregistrement_B_4) OR (FIREABLE(enregistrement_B_5) OR (FIREABLE(enregistrement_B_6) OR (FIREABLE(enregistrement_B_7) OR (FIREABLE(enregistrement_B_8) OR (FIREABLE(enregistrement_B_9) OR (FIREABLE(enregistrement_B_10) OR (FIREABLE(enregistrement_B_11) ... (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 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(liberation_B) AND (FIREABLE(altern_cpt_10_1) OR (FIREABLE(altern_cpt_10_2) OR ((FIREABLE(liberation_B) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2))) OR ((FIREABLE(timeout_A_0_0_1_1) OR (FIREABLE(timeout_A_0_1_1_1) OR (FIREABLE(timeout_A_0_2_1_1) OR (FIREABLE(timeout_A_0_3_1_1) OR (FIREABLE(timeout_A_0_4_1_1) OR (FIREABLE(timeout_A_0_5_1_1) OR (FIREABLE(timeout_A_0_6_1_1) ... (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 244 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 2875 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR (FIREABLE(enregistrement_A_4) OR (FIREABLE(enregistrement_A_5) OR (FIREABLE(enregistrement_A_6) OR (FIREABLE(enregistrement_A_7) OR (FIREABLE(enregistrement_A_8) OR (FIREABLE(enregistrement_A_9) OR (FIREABLE(enregistrement_A_10) OR (FIREABLE(enregistrement_A_11) O... (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 244 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 17592186044328 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 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(altern_cpt_10_1) AND ! FIREABLE(altern_cpt_10_2)) OR (! FIREABLE(altern_cpt_10_1) AND ! FIREABLE(altern_cpt_10_2))))
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 244 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 16 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrement_A_1) OR (FIREABLE(enregistrement_A_2) OR (FIREABLE(enregistrement_A_3) OR (FIREABLE(enregistrement_A_4) OR (FIREABLE(enregistrement_A_5) OR (FIREABLE(enregistrement_A_6) OR (FIREABLE(enregistrement_A_7) OR (FIREABLE(enregistrement_A_8) OR (FIREABLE(enregistrement_A_9) OR (FIREABLE(enregistrement_A_10) OR (FIREABLE(enregistrement_A_11) O... (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 244 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 8388562 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 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(timeout_B_1_0_2_0) AND (! FIREABLE(timeout_B_2_0_2_0) AND (! FIREABLE(timeout_B_3_0_2_0) AND (! FIREABLE(timeout_B_4_0_2_0) AND (! FIREABLE(timeout_B_5_0_2_0) AND (! FIREABLE(timeout_B_6_0_2_0) AND (! FIREABLE(timeout_B_7_0_2_0) AND (! FIREABLE(timeout_B_8_0_2_0) AND (! FIREABLE(timeout_B_9_0_2_0) AND (! FIREABLE(timeout_B_10_0_2_0) AND (! FIREABLE(timeout_B_11_0_2_0) AND (! FIR... (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 244 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 390500 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(basculement_1) AND ! FIREABLE(basculement_2)) OR (! FIREABLE(liberation_A) OR (! FIREABLE(liberation_B) OR ((FIREABLE(decision_0_1) OR (FIREABLE(decision_1_1) OR (FIREABLE(decision_2_1) OR (FIREABLE(decision_3_1) OR (FIREABLE(decision_4_1) OR (FIREABLE(decision_5_1) OR (FIREABLE(decision_6_1) OR (FIREABLE(decision_7_1) OR (FIREABLE(decision_8_1) OR (FIREABLE(decision_9_1) OR (FIRE... (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 244 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 25165988 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(basculement_1) OR (FIREABLE(basculement_2) OR (FIREABLE(altern_cpt_10_1) OR (FIREABLE(altern_cpt_10_2) OR ((! FIREABLE(altern_cpt_10_1) AND ! FIREABLE(altern_cpt_10_2)) OR (! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enregistrement_A_2) AND (! FIREABLE(enregistrement_A_3) AND (! FIREABLE(enregistrement_A_4) AND (! FIREABLE(enregistrement_A_5) 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 244 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 3370 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityFireability-10.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 11 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(liberation_A) OR (! FIREABLE(autorisation_B_2_1) AND (! FIREABLE(autorisation_B_2_2) AND (! FIREABLE(autorisation_B_2_3) AND (! FIREABLE(autorisation_B_2_4) AND (! FIREABLE(autorisation_B_2_5) AND (! FIREABLE(autorisation_B_2_6) AND (! FIREABLE(autorisation_B_2_7) AND (! FIREABLE(autorisation_B_2_8) AND (! FIREABLE(autorisation_B_2_9) AND (! FIREABLE(autorisation_B_2_10) AND (! F... (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 244 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 123145302323788 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 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(liberation_B) AND (FIREABLE(timeout_B_1_0_2_0) OR (FIREABLE(timeout_B_2_0_2_0) OR (FIREABLE(timeout_B_3_0_2_0) OR (FIREABLE(timeout_B_4_0_2_0) OR (FIREABLE(timeout_B_5_0_2_0) OR (FIREABLE(timeout_B_6_0_2_0) OR (FIREABLE(timeout_B_7_0_2_0) OR (FIREABLE(timeout_B_8_0_2_0) OR (FIREABLE(timeout_B_9_0_2_0) OR (FIREABLE(timeout_B_10_0_2_0) OR (FIREABLE(timeout_B_11_0_2_0) OR (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 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_10_1) OR (FIREABLE(altern_cpt_10_2) OR (! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enregistrement_A_2) AND (! FIREABLE(enregistrement_A_3) AND (! FIREABLE(enregistrement_A_4) AND (! FIREABLE(enregistrement_A_5) AND (! FIREABLE(enregistrement_A_6) AND (! FIREABLE(enregistrement_A_7) AND (! FIREABLE(enregistrement_A_8) AND (! FIREABLE(... (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 244 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 313490669326 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 1302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(enregistrement_A_0) AND (! FIREABLE(enregistrement_A_1) AND (! FIREABLE(enregistrement_A_2) AND (! FIREABLE(enregistrement_A_3) AND (! FIREABLE(enregistrement_A_4) AND (! FIREABLE(enregistrement_A_5) AND (! FIREABLE(enregistrement_A_6) AND (! FIREABLE(enregistrement_A_7) AND (! FIREABLE(enregistrement_A_8) AND (! FIREABLE(enregistrement_A_9) AND (! FIREABLE(enregistrement_A_10) A... (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 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(enregistrement_B_0) AND (! FIREABLE(enregistrement_B_1) AND (! FIREABLE(enregistrement_B_2) AND (! FIREABLE(enregistrement_B_3) AND (! FIREABLE(enregistrement_B_4) AND (! FIREABLE(enregistrement_B_5) AND (! FIREABLE(enregistrement_B_6) AND (! FIREABLE(enregistrement_B_7) AND (! FIREABLE(enregistrement_B_8) AND (! FIREABLE(enregistrement_B_9) AND (! FIREABLE(enregistrement_B_10) 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 244 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 5943374488 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: no yes yes no yes no no no yes yes yes no no yes no no

BK_STOP 1463490320128

--------------------
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="BridgeAndVehicles-PT-V20P20N10"
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/BridgeAndVehicles-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 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 BridgeAndVehicles-PT-V20P20N10, 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 r002kn-ebro-146347662300306"
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 ;