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-V20P10N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662300286
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463486985437

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ BridgeAndVehicles-PT-V20P10N20
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-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: 1046/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 78 places, 968 transitions, 71 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1133 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality.task
lola: read: AG ((!(2 <= SORTI_B) OR (!(ATTENTE_B <= SORTI_B) OR (SORTI_B <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 + NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_A... (shortened)
lola: formula length: 6649
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-SORTI_B > -2 OR (-SORTI_B + ATTENTE_B > 0 OR (SORTI_B + -NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_AT... (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 284 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-V20P10N20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ROUTE_B > -3 AND (-SORTI_B > -2 AND -CAPACITE <= -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 284 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 BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality.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 (-NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 + -NB_ATTENTE_A_15 + -NB_ATTENTE_A_14 + -NB_ATTENTE_A_13 + -NB_ATTENTE_A_12 + -NB_ATTENTE_A_11 + -NB_ATTENTE_A_10 + -NB_ATTENTE_A_9 + -NB_ATTENTE_A_8 + -NB_ATTENTE_A_7 + -NB_ATTENTE_A_6 + -NB_ATTENTE_A_5 + -NB_ATTENTE_A_4 + -NB_ATTENTE_A_3 + -NB_ATTENTE_A_2 + -NB_ATTENTE_A_1 + -NB_ATTENTE_A_0 + CHOIX_2... (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 284 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 1 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-2.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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((CONTROLEUR_2 + -ATTENTE_A + CONTROLEUR_1 <= 0 OR -ROUTE_A <= -2) AND COMPTEUR_9 + -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 + -NB_ATTENTE_A_15 + -NB_ATTENTE_A_14 + -NB_ATTENTE_A_13 + -NB_ATTENTE_A_12 + -NB_ATTENTE_A_11 + -NB_ATTENTE_A_10 + -NB_ATTENTE_A_9 + -NB_ATTENTE_A_8 + -NB_ATTENTE_A_7 + -NB_ATTENTE_A_6 + -NB_ATTENTE_A_5 + -NB_ATTENTE_... (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 284 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 14 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ATTENTE_B <= -3 AND -VIDANGE_2 + -VIDANGE_1 <= -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 284 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 2 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((SUR_PONT_B + -CAPACITE > 0 AND CAPACITE + -ROUTE_A > 0) OR -COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 > -3))
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 284 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 invariant.
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-6.sara
lola: lola: ========================================calling and running sara

lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-6.sara.
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-CAPACITE > -2 AND (SUR_PONT_B + -ATTENTE_B > 0 AND (-VIDANGE_2 + -VIDANGE_1 <= -3 OR -SUR_PONT_A + CONTROLEUR_2 + CONTROLEUR_1 > 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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-V20P10N20-ReachabilityCardinality-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ROUTE_B <= -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 284 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 1 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-CHOIX_2 + -CHOIX_1 > -3 OR (-ATTENTE_A + ATTENTE_B > 0 AND -SUR_PONT_B + NB_ATTENTE_A_20 + NB_ATTENTE_A_19 + NB_ATTENTE_A_18 + NB_ATTENTE_A_17 + NB_ATTENTE_A_16 + NB_ATTENTE_A_15 + NB_ATTENTE_A_14 + NB_ATTENTE_A_13 + NB_ATTENTE_A_12 + NB_ATTENTE_A_11 + NB_ATTENTE_A_10 + NB_ATTENTE_A_9 + NB_ATTENTE_A_8 + NB_ATTENTE_A_7 + NB_ATTENTE_A_6 + NB_ATTENTE_A_5 + NB_ATTENTE_A_4 + NB_ATTENTE_A_3 + NB_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 284 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-V20P10N20-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (NB_ATTENTE_A_20 + NB_ATTENTE_A_19 + NB_ATTENTE_A_18 + NB_ATTENTE_A_17 + NB_ATTENTE_A_16 + NB_ATTENTE_A_15 + NB_ATTENTE_A_14 + NB_ATTENTE_A_13 + NB_ATTENTE_A_12 + NB_ATTENTE_A_11 + NB_ATTENTE_A_10 + -CAPACITE + NB_ATTENTE_A_9 + NB_ATTENTE_A_8 + NB_ATTENTE_A_7 + NB_ATTENTE_A_6 + NB_ATTENTE_A_5 + NB_ATTENTE_A_4 + NB_ATTENTE_A_3 + NB_ATTENTE_A_2 + NB_ATTENTE_A_1 + NB_ATTENTE_A_0 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 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 1 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-11.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ROUTE_B > -3 OR (-SUR_PONT_B <= -2 OR (-ATTENTE_A + VIDANGE_2 + VIDANGE_1 <= 0 OR (-SORTI_A <= -2 OR -VIDANGE_2 + -VIDANGE_1 > -3)))))
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 284 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 5 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-12.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 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-COMPTEUR_9 + CONTROLEUR_2 + CONTROLEUR_1 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 <= 0 OR (SUR_PONT_B + -SORTI_B > 0 OR (-COMPTEUR_9 + -COMPTEUR... (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 284 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-V20P10N20-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-13.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 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 <= -1 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 284 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 invariant.
lola: Transformation into DNF: expect 6 literals
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-COMPTEUR_9 + SORTI_A + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 <= 0 OR -CHOIX_2 + -CHOIX_1 <= -1) AND -NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_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 284 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 7 literals
lola: write sara problem file to BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N20-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes yes no no yes yes yes yes no yes yes yes yes yes no

BK_STOP 1463486988552

--------------------
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-V20P10N20"
export BK_EXAMINATION="ReachabilityCardinality"
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-V20P10N20.tgz
mv BridgeAndVehicles-PT-V20P10N20 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-V20P10N20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002kn-ebro-146347662300286"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;