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 S_BridgeAndVehicles-PT-V80P20N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433133000396
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464463184456

bkconf 3600
===========================================================================================
===========================================================================================
S_BridgeAndVehicles-PT-V80P20N20: translating Petri net model.pnml into LoLA format
S_BridgeAndVehicles-PT-V80P20N20: translating formula ReachabilityFireability into LoLA format
===========================================================================================
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityFireability.xml
touch formulae;


in benchkit_head lolaszeit 3521
ReachabilityFireability @ S_BridgeAndVehicles-PT-V80P20N20
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3521 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3926/65536 symbol table entries, 230 collisions
lola: preprocessing...
lola: finding significant places
lola: 198 places, 3728 transitions, 191 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4253 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability.task
lola: read: AG (!((!(!((FIREABLE(basculement_1) OR FIREABLE(basculement_2)))) AND (((((((((((((((((((((((((((((((((((((((FIREABLE(decision_1_0) OR FIREABLE(decision_2_0)) OR FIREABLE(decision_1_1)) OR FIREABLE(decision_2_1)) OR FIREABLE(decision_1_2)) OR FIREABLE(decision_2_2)) OR FIREABLE(decision_1_3)) OR FIREABLE(decision_2_3)) OR FIREABLE(decision_1_4)) OR FIREABLE(decision_2_4)) OR FIREABLE(decision_1_5)... (shortened)
lola: formula length: 761609
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(basculement_1) AND ! FIREABLE(basculement_2)) OR (! FIREABLE(decision_1_0) AND (! FIREABLE(decision_2_0) AND (! FIREABLE(decision_1_1) AND (! FIREABLE(decision_2_1) AND (! FIREABLE(decision_1_2) AND (! FIREABLE(decision_2_2) AND (! FIREABLE(decision_1_3) AND (! FIREABLE(decision_2_3) AND (! FIREABLE(decision_1_4) AND (! FIREABLE(decision_2_4) AND (! FIREABLE(decision_1_5) 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 764 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 320 literals
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability.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 1 will run for 152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_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 764 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: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(altern_cpt_1_20) AND (! FIREABLE(altern_cpt_2_20) AND ((FIREABLE(liberation_B) AND (FIREABLE(liberation_A) AND (FIREABLE(liberation_B) OR (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(enreg... (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 764 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 77371252455336258591260672 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 176 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) 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 764 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 9671406556917032323907584 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 190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((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 reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 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 7050901236775884250807224869496688644767721253222377062400 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 190 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 764 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 9671406556917032323907584 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 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_20) OR FIREABLE(altern_cpt_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 764 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: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(basculement_1) OR (FIREABLE(basculement_2) OR ((! FIREABLE(altern_cpt_1_20) AND ! FIREABLE(altern_cpt_2_20)) OR (FIREABLE(decision_1_0) OR (FIREABLE(decision_2_0) OR (FIREABLE(decision_1_1) OR (FIREABLE(decision_2_1) OR (FIREABLE(decision_1_2) OR (FIREABLE(decision_2_2) OR (FIREABLE(decision_1_3) OR (FIREABLE(decision_2_3) OR (FIREABLE(decision_1_4) OR (FIREABLE(decision_2_4) OR (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 764 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 4266105115771598 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 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(liberation_A) OR (FIREABLE(liberation_B) OR ((FIREABLE(timeout_B_2_1_0_0) OR (FIREABLE(timeout_B_2_2_0_0) OR (FIREABLE(timeout_B_2_3_0_0) OR (FIREABLE(timeout_B_2_4_0_0) OR (FIREABLE(timeout_B_2_5_0_0) OR (FIREABLE(timeout_B_2_6_0_0) OR (FIREABLE(timeout_B_2_7_0_0) OR (FIREABLE(timeout_B_2_8_0_0) OR (FIREABLE(timeout_B_2_9_0_0) OR (FIREABLE(timeout_B_2_10_0_0) OR (FIREABLE(timeout_B... (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 764 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 inf literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(altern_cpt_1_20) AND ! FIREABLE(altern_cpt_2_20)) OR FIREABLE(liberation_A)))
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 764 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 6 literals
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-9.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(altern_cpt_1_20) OR (FIREABLE(altern_cpt_2_20) OR (((FIREABLE(autorisation_B_2_1) OR (FIREABLE(autorisation_B_2_2) OR (FIREABLE(autorisation_B_2_3) OR (FIREABLE(autorisation_B_2_4) OR (FIREABLE(autorisation_B_2_5) OR (FIREABLE(autorisation_B_2_6) OR (FIREABLE(autorisation_B_2_7) OR (FIREABLE(autorisation_B_2_8) OR (FIREABLE(autorisation_B_2_9) OR (FIREABLE(autorisation_B_2_10) OR (FI... (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 764 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 11 will run for 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(timeout_A_1_0_0_1) AND (! FIREABLE(timeout_A_1_0_1_1) AND (! FIREABLE(timeout_A_1_0_2_1) AND (! FIREABLE(timeout_A_1_0_3_1) AND (! FIREABLE(timeout_A_1_0_4_1) AND (! FIREABLE(timeout_A_1_0_5_1) AND (! FIREABLE(timeout_A_1_0_6_1) AND (! FIREABLE(timeout_A_1_0_7_1) AND (! FIREABLE(timeout_A_1_0_8_1) AND (! FIREABLE(timeout_A_1_0_9_1) AND (! FIREABLE(timeout_A_1_0_10_1) AND (! FIREAB... (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 764 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 45858250815287617679991120899080192 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 367 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) 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 764 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 1275349039847536204506162266112 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(altern_cpt_1_20) OR (FIREABLE(altern_cpt_2_20) OR (FIREABLE(autorisation_B_2_1) OR (FIREABLE(autorisation_B_2_2) OR (FIREABLE(autorisation_B_2_3) OR (FIREABLE(autorisation_B_2_4) OR (FIREABLE(autorisation_B_2_5) OR (FIREABLE(autorisation_B_2_6) OR (FIREABLE(autorisation_B_2_7) OR (FIREABLE(autorisation_B_2_8) OR (FIREABLE(autorisation_B_2_9) OR (FIREABLE(autorisation_B_2_10) OR (FIR... (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 764 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 793055337667196601168297984 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 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(basculement_1) AND (! FIREABLE(basculement_2) AND ! FIREABLE(liberation_B))) OR (! FIREABLE(timeout_A_1_0_0_1) AND (! FIREABLE(timeout_A_1_0_1_1) AND (! FIREABLE(timeout_A_1_0_2_1) AND (! FIREABLE(timeout_A_1_0_3_1) AND (! FIREABLE(timeout_A_1_0_4_1) AND (! FIREABLE(timeout_A_1_0_5_1) AND (! FIREABLE(timeout_A_1_0_6_1) AND (! FIREABLE(timeout_A_1_0_7_1) AND (! FIREABLE(timeout_A_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 764 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 28560 literals
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N20-ReachabilityFireability-14.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 15 will run for 550 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 764 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 9671406556917032323907584 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 yes no unknown no yes no unknown no no unknown unknown yes unknown no

BK_STOP 1464466175891

--------------------
content from stderr:

parsing of model.pnml complete

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="S_BridgeAndVehicles-PT-V80P20N20"
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/S_BridgeAndVehicles-PT-V80P20N20.tgz
mv S_BridgeAndVehicles-PT-V80P20N20 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 S_BridgeAndVehicles-PT-V80P20N20, 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 r170kn-ebro-146433133000396"
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 ;