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

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

=== Now, execution of the tool begins

BK_START 1463493129649

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ BridgeAndVehicles-PT-V50P50N10
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-2 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-3 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-5 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-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: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: read: A(EF (ROUTE_A <= SUR_PONT_B) U (!(SUR_PONT_A <= ROUTE_B) AND !(COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 <= CAPACITE))) : EG ((!((ROUTE_B <= ATTENTE_A OR SORTI_B <= CONTROLEUR_1 + CONTROLEUR_2)) OR ATTENTE_B <= CONTROLEUR_1 + CONTROLEUR_2)) : (AG (ROUTE_B <= CAPACITE) OR !(((SORTI_A <= ROUTE_B OR !(... (shortened)
lola: formula length: 10352
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (-SUR_PONT_B + ROUTE_A <= 0) U (SUR_PONT_A + -ROUTE_B > 0 AND COMPTEUR_9 + -CAPACITE + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_10 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U -SUR_PONT_B + ROUTE_A <= 0) U (SUR_PONT_A + -ROUTE_B > 0 AND COMPTEUR_9 + -CAPACITE + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_10 > 0))
lola: processed formula length: 231
lola: 15408 rewrites
lola: formula mentions 16 of 128 places; total mentions: 16
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-ATTENTE_A + ROUTE_B > 0 AND SORTI_B + -CONTROLEUR_2 + -CONTROLEUR_1 > 0) OR -CONTROLEUR_2 + -CONTROLEUR_1 + ATTENTE_B <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-ATTENTE_A + ROUTE_B > 0 AND SORTI_B + -CONTROLEUR_2 + -CONTROLEUR_1 > 0) OR -CONTROLEUR_2 + -CONTROLEUR_1 + ATTENTE_B <= 0))))
lola: processed formula length: 142
lola: 15407 rewrites
lola: formula mentions 6 of 128 places; total mentions: 8
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-CAPACITE + ROUTE_B <= 0) OR ((-ROUTE_B + SORTI_A > 0 AND -SORTI_B <= -1) OR EG (-SORTI_B > -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CAPACITE + ROUTE_B <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-ROUTE_B + SORTI_A > 0 AND -SORTI_B <= -1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-SORTI_B > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-SORTI_B > -2)))
lola: processed formula length: 29
lola: 15407 rewrites
lola: formula mentions 1 of 128 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EX (NB_ATTENTE_B_9 + -ATTENTE_A + 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_50 + NB_ATTENTE_B_49 + NB_ATTENTE_B_48 + NB_ATTENTE_B_47 + NB_ATTENTE_B_46 + NB_ATTENTE_B_45 + NB_ATTENTE_B_44 + NB_ATTENTE_B_43 + NB_ATTENTE_B_42 + NB_ATTENTE_B_41 + NB_ATTENTE_B_40 + NB_ATTENTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((EX(NB_ATTENTE_B_9 + -ATTENTE_A + 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_50 + NB_ATTENTE_B_49 + NB_ATTENTE_B_48 + NB_ATTENTE_B_47 + NB_ATTENTE_B_46 + NB_ATTENTE_B_45 + NB_ATTENTE_B_44 + NB_ATTENTE_B_43 + NB_ATTENTE_B_42 + NB_ATTENTE_B_41 + NB_ATTENTE_B_40 + NB... (shortened)
lola: processed formula length: 1889
lola: 15408 rewrites
lola: formula mentions 105 of 128 places; total mentions: 105
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-SUR_PONT_B + CHOIX_2 + CHOIX_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -SUR_PONT_B + CHOIX_2 + CHOIX_1 <= 0)
lola: processed formula length: 46
lola: 15407 rewrites
lola: formula mentions 3 of 128 places; total mentions: 3
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((NB_ATTENTE_A_50 + NB_ATTENTE_A_49 + NB_ATTENTE_A_48 + NB_ATTENTE_A_47 + NB_ATTENTE_A_46 + NB_ATTENTE_A_45 + NB_ATTENTE_A_44 + NB_ATTENTE_A_43 + NB_ATTENTE_A_42 + NB_ATTENTE_A_41 + NB_ATTENTE_A_40 + NB_ATTENTE_A_39 + NB_ATTENTE_A_38 + NB_ATTENTE_A_37 + NB_ATTENTE_A_36 + NB_ATTENTE_A_35 + NB_ATTENTE_A_34 + NB_ATTENTE_A_33 + NB_ATTENTE_A_32 + NB_ATTENTE_A_31 + NB_ATTENTE_A_30 + NB_ATTENTE_A_29 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((NB_ATTENTE_A_50 + NB_ATTENTE_A_49 + NB_ATTENTE_A_48 + NB_ATTENTE_A_47 + NB_ATTENTE_A_46 + NB_ATTENTE_A_45 + NB_ATTENTE_A_44 + NB_ATTENTE_A_43 + NB_ATTENTE_A_42 + NB_ATTENTE_A_41 + NB_ATTENTE_A_40 + NB_ATTENTE_A_39 + NB_ATTENTE_A_38 + NB_ATTENTE_A_37 + NB_ATTENTE_A_36 + NB_ATTENTE_A_35 + NB_ATTENTE_A_34 + NB_ATTENTE_A_33 + NB_ATTENTE_A_32 + NB_ATTENTE_A_31 + NB_ATTENTE_A_30 + NB_ATTEN... (shortened)
lola: processed formula length: 1978
lola: 15407 rewrites
lola: formula mentions 57 of 128 places; total mentions: 108
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-SUR_PONT_B + SORTI_A > 0 OR (-ATTENTE_A + SORTI_A <= 0 OR -COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= -1)) U -CHOIX_2 + -CHOIX_1 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-SUR_PONT_B + SORTI_A > 0 OR (-ATTENTE_A + SORTI_A <= 0 OR -COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= -1)) U -CHOIX_2 + -CHOIX_1 <= -3)
lola: processed formula length: 251
lola: 15407 rewrites
lola: formula mentions 16 of 128 places; total mentions: 17
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EG (SUR_PONT_B + -ROUTE_A <= 0) U (-ROUTE_B > -1 OR (-SORTI_B <= -2 OR -ATTENTE_A + ROUTE_B <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(A(TRUE U !(SUR_PONT_B + -ROUTE_A <= 0))) U (-ROUTE_B > -1 OR (-SORTI_B <= -2 OR -ATTENTE_A + ROUTE_B <= 0)))
lola: processed formula length: 112
lola: 15408 rewrites
lola: formula mentions 5 of 128 places; total mentions: 6
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((SUR_PONT_B + -SORTI_A <= 0 OR -NB_ATTENTE_A_50 + -NB_ATTENTE_A_49 + -NB_ATTENTE_A_48 + -NB_ATTENTE_A_47 + -NB_ATTENTE_A_46 + -NB_ATTENTE_A_45 + -NB_ATTENTE_A_44 + -NB_ATTENTE_A_43 + -NB_ATTENTE_A_42 + -NB_ATTENTE_A_41 + -NB_ATTENTE_A_40 + -NB_ATTENTE_A_39 + -NB_ATTENTE_A_38 + -NB_ATTENTE_A_37 + -NB_ATTENTE_A_36 + -NB_ATTENTE_A_35 + -NB_ATTENTE_A_34 + -NB_ATTENTE_A_33 + -NB_ATTENTE_A_32 + -NB_ATT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SUR_PONT_B + -SORTI_A <= 0 OR -NB_ATTENTE_A_50 + -NB_ATTENTE_A_49 + -NB_ATTENTE_A_48 + -NB_ATTENTE_A_47 + -NB_ATTENTE_A_46 + -NB_ATTENTE_A_45 + -NB_ATTENTE_A_44 + -NB_ATTENTE_A_43 + -NB_ATTENTE_A_42 + -NB_ATTENTE_A_41 + -NB_ATTENTE_A_40 + -NB_ATTENTE_A_39 + -NB_ATTENTE_A_38 + -NB_ATTENTE_A_37 + -NB_ATTENTE_A_36 + -NB_ATTENTE_A_35 + -NB_ATTENTE_A_34 + -NB_ATTENTE_A_33 + -NB_ATTENTE_A_32 + -NB_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-VIDANGE_2 + -VIDANGE_1 <= -2 OR -SUR_PONT_B + NB_ATTENTE_A_50 + NB_ATTENTE_A_49 + NB_ATTENTE_A_48 + NB_ATTENTE_A_47 + NB_ATTENTE_A_46 + NB_ATTENTE_A_45 + NB_ATTENTE_A_44 + NB_ATTENTE_A_43 + NB_ATTENTE_A_42 + NB_ATTENTE_A_41 + NB_ATTENTE_A_40 + NB_ATTENTE_A_39 + NB_ATTENTE_A_38 + NB_ATTENTE_A_37 + NB_ATTENTE_A_36 + NB_ATTENTE_A_35 + NB_ATTENTE_A_34 + NB_ATTENTE_A_33 + NB_ATTENTE_A_32 + NB_ATT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-VIDANGE_2 + -VIDANGE_1 <= -2 OR -SUR_PONT_B + NB_ATTENTE_A_50 + NB_ATTENTE_A_49 + NB_ATTENTE_A_48 + NB_ATTENTE_A_47 + NB_ATTENTE_A_46 + NB_ATTENTE_A_45 + NB_ATTENTE_A_44 + NB_ATTENTE_A_43 + NB_ATTENTE_A_42 + NB_ATTENTE_A_41 + NB_ATTENTE_A_40 + NB_ATTENTE_A_39 + NB_ATTENTE_A_38 + NB_ATTENTE_A_37 + NB_ATTENTE_A_36 + NB_ATTENTE_A_35 + NB_ATTENTE_A_34 + NB_ATTENTE_A_33 + NB_ATTENTE_A_32 + N... (shortened)
lola: processed formula length: 969
lola: 15407 rewrites
lola: formula mentions 54 of 128 places; total mentions: 54
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-COMPTEUR_9 + ROUTE_B + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 > 0 OR -NB_ATTENTE_B_9 + VIDANGE_2 + VIDANGE_1 + -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_50 + -NB_AT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-SUR_PONT_B + ATTENTE_A <= 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AF (-CHOIX_2 + -CHOIX_1 <= -3) AND (-CONTROLEUR_2 + ATTENTE_A + -CONTROLEUR_1 > 0 AND COMPTEUR_9 + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_10 + -CHOIX_2 + -CHOIX_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U -CHOIX_2 + -CHOIX_1 <= -3) AND (-CONTROLEUR_2 + ATTENTE_A + -CONTROLEUR_1 > 0 AND COMPTEUR_9 + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_10 + -CHOIX_2 + -CHOIX_1 <= 0)))
lola: processed formula length: 272
lola: 15408 rewrites
lola: formula mentions 16 of 128 places; total mentions: 18
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-SORTI_B <= -3 U AF (-VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-SORTI_B <= -3 U A(TRUE U -VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0))
lola: processed formula length: 78
lola: 15408 rewrites
lola: formula mentions 5 of 128 places; total mentions: 5
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-SUR_PONT_B > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-SUR_PONT_B > -3)))
lola: processed formula length: 32
lola: 15407 rewrites
lola: formula mentions 1 of 128 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SORTI_B + -CHOIX_2 + -CHOIX_1 > 0 OR AG ((-SUR_PONT_A + ATTENTE_A > 0 OR -SORTI_B > -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: SORTI_B + -CHOIX_2 + -CHOIX_1 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-SUR_PONT_A + ATTENTE_A > 0 OR -SORTI_B > -3))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((SUR_PONT_A + -SORTI_A <= 0 OR (AF (-SORTI_A <= -3) OR EX (CONTROLEUR_2 + CONTROLEUR_1 + -ROUTE_A <= 0))) AND (EF (-SUR_PONT_A > -3) AND AG (-VIDANGE_2 + -VIDANGE_1 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: SUR_PONT_A + -SORTI_A <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-SUR_PONT_A > -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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 15 will run for 2730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-VIDANGE_2 + -VIDANGE_1 > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-CONTROLEUR_2 + -CONTROLEUR_1 <= -3 OR -ATTENTE_B + SORTI_A <= 0) AND AF ((CAPACITE + -ROUTE_A <= 0 AND -SUR_PONT_A + 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_50 + NB_ATTENTE_B_49 + NB_ATTENTE_B_48 + NB_ATTENTE_B_47 + NB_ATTENTE_B_46 + NB_ATTENTE_B_45 + NB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-CONTROLEUR_2 + -CONTROLEUR_1 <= -3 OR -ATTENTE_B + SORTI_A <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 1820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((CAPACITE + -ROUTE_A <= 0 AND -SUR_PONT_A + 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_50 + NB_ATTENTE_B_49 + NB_ATTENTE_B_48 + NB_ATTENTE_B_47 + NB_ATTENTE_B_46 + NB_ATTENTE_B_45 + NB_ATTENTE_B_44 + NB_ATTENTE_B_43 + NB_ATTENTE_B_42 + NB_ATTENTE_B_41 + NB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (CAPACITE + -ROUTE_A <= 0 AND -SUR_PONT_A + 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_50 + NB_ATTENTE_B_49 + NB_ATTENTE_B_48 + NB_ATTENTE_B_47 + NB_ATTENTE_B_46 + NB_ATTENTE_B_45 + NB_ATTENTE_B_44 + NB_ATTENTE_B_43 + NB_ATTENTE_B_42 + NB_ATTENTE_B_41... (shortened)
lola: processed formula length: 965
lola: 15407 rewrites
lola: formula mentions 54 of 128 places; total mentions: 54
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 1820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-COMPTEUR_9 + ATTENTE_B + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-COMPTEUR_9 + ATTENTE_B + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= 0)))
lola: processed formula length: 185
lola: 15407 rewrites
lola: formula mentions 12 of 128 places; total mentions: 12
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: RESULT
lola: summary: no yes unknown unknown yes unknown no yes yes no yes yes no unknown no yes
lola: ========================================

BK_STOP 1463494850910

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