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

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

=== Now, execution of the tool begins

BK_START 1463486106484

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ BridgeAndVehicles-PT-V10P10N10
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-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: 336/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 48 places, 288 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 373 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: read: (!(EF ((ROUTE_A <= ROUTE_A AND 2 <= ATTENTE_B))) OR (EG ((ROUTE_A <= ROUTE_A OR ROUTE_A <= SUR_PONT_B)) OR (((1 <= SORTI_A OR ROUTE_B <= VIDANGE_1 + VIDANGE_2) AND (SUR_PONT_B <= ATTENTE_A OR 2 <= VIDANGE_1 + VIDANGE_2)) OR ((3 <= ATTENTE_B AND 3 <= ROUTE_A) OR (CHOIX_1 + CHOIX_2 <= ROUTE_B AND ROUTE_A <= CHOIX_1 + CHOIX_2))))) : AF (EX ((ROUTE_B <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2... (shortened)
lola: formula length: 3946
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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-V10P10N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EX ((-NB_ATTENTE_A_10 + ROUTE_B + -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 AND COMPTEUR_9 + -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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((-NB_ATTENTE_A_10 + ROUTE_B + -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 AND COMPTEUR_9 + -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... (shortened)
lola: processed formula length: 577
lola: 1960 rewrites
lola: formula mentions 23 of 48 places; total mentions: 34
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: AF (AG (CONTROLEUR_2 + CONTROLEUR_1 + -CHOIX_2 + -CHOIX_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(CONTROLEUR_2 + CONTROLEUR_1 + -CHOIX_2 + -CHOIX_1 > 0))))
lola: processed formula length: 79
lola: 1960 rewrites
lola: formula mentions 4 of 48 places; total mentions: 4
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (E(-ROUTE_B <= -3 U -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 CTL
lola: processed formula: EX(E(-ROUTE_B <= -3 U -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: processed formula length: 236
lola: 1960 rewrites
lola: formula mentions 13 of 48 places; total mentions: 13
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CAPACITE <= -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 164 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AF (-ROUTE_B > -2) AND AF ((-SUR_PONT_B + CONTROLEUR_2 + CONTROLEUR_1 <= 0 AND -ROUTE_B <= -1))) OR E(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 R -CONTROLEUR_2 + ATTENTE_A + -CONTROLEUR_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-ROUTE_B > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -ROUTE_B > -2)
lola: processed formula length: 23
lola: 1959 rewrites
lola: formula mentions 1 of 48 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-SUR_PONT_B + CONTROLEUR_2 + CONTROLEUR_1 <= 0 AND -ROUTE_B <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-SUR_PONT_B + CONTROLEUR_2 + CONTROLEUR_1 <= 0 AND -ROUTE_B <= -1))
lola: processed formula length: 77
lola: 1959 rewrites
lola: formula mentions 4 of 48 places; total mentions: 4
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (COMPTEUR_9 + -ATTENTE_A + 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_A + 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: 169
lola: 1959 rewrites
lola: formula mentions 12 of 48 places; total mentions: 12
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EF (CONTROLEUR_2 + CONTROLEUR_1 + -VIDANGE_2 + -VIDANGE_1 <= 0) OR AX (-SORTI_B <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((E(TRUE U CONTROLEUR_2 + CONTROLEUR_1 + -VIDANGE_2 + -VIDANGE_1 <= 0) OR AX(-SORTI_B <= -2)))))
lola: processed formula length: 108
lola: 1961 rewrites
lola: formula mentions 5 of 48 places; total mentions: 5
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(-SUR_PONT_A <= -2 U SUR_PONT_B + -ROUTE_A <= 0) AND (EG ((-ROUTE_A <= -2 OR -ROUTE_B <= -1)) AND (-SUR_PONT_A + ATTENTE_A <= 0 OR (-ATTENTE_B <= -1 OR -ATTENTE_A <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-SUR_PONT_A <= -2 U SUR_PONT_B + -ROUTE_A <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-SUR_PONT_A <= -2 U SUR_PONT_B + -ROUTE_A <= 0)
lola: processed formula length: 49
lola: 1959 rewrites
lola: formula mentions 3 of 48 places; total mentions: 3
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-ROUTE_A <= -2 OR -ROUTE_B <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-ROUTE_A <= -2 OR -ROUTE_B <= -1))))
lola: processed formula length: 50
lola: 1959 rewrites
lola: formula mentions 2 of 48 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-CHOIX_2 + -CHOIX_1 <= -3 AND -VIDANGE_2 + -VIDANGE_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-CHOIX_2 + -CHOIX_1 <= -3 AND -VIDANGE_2 + -VIDANGE_1 <= -1))
lola: processed formula length: 71
lola: 1959 rewrites
lola: formula mentions 4 of 48 places; total mentions: 4
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-CAPACITE + ROUTE_A <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-CAPACITE + ROUTE_A <= 0))))
lola: processed formula length: 50
lola: 1960 rewrites
lola: formula mentions 2 of 48 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-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_10 <= -3 OR (-VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0 OR -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_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-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_10 <= -3 OR (-VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0 OR -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_A... (shortened)
lola: processed formula length: 474
lola: 1959 rewrites
lola: formula mentions 15 of 48 places; total mentions: 26
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((-ROUTE_B <= -2 AND (SUR_PONT_A + -CAPACITE <= 0 AND (-ROUTE_A <= -3 AND -ATTENTE_B <= -2)))) OR AF (-SORTI_A <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-ROUTE_B <= -2 AND (SUR_PONT_A + -CAPACITE <= 0 AND (-ROUTE_A <= -3 AND -ATTENTE_B <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-ROUTE_B <= -2 AND (SUR_PONT_A + -CAPACITE <= 0 AND (-ROUTE_A <= -3 AND -ATTENTE_B <= -2))))))
lola: processed formula length: 108
lola: 1959 rewrites
lola: formula mentions 5 of 48 places; total mentions: 5
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-SORTI_A <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -SORTI_A <= -1)
lola: processed formula length: 24
lola: 1959 rewrites
lola: formula mentions 1 of 48 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-CONTROLEUR_2 + -CONTROLEUR_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -CONTROLEUR_2 + -CONTROLEUR_1 <= -1)
lola: processed formula length: 45
lola: 1959 rewrites
lola: formula mentions 2 of 48 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A((-ROUTE_A <= -2 OR -NB_ATTENTE_A_10 + VIDANGE_2 + VIDANGE_1 + -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) U -ROUTE_A > -3) AND E(-COMPTEUR_9 + SORTI_A + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-ROUTE_A <= -2 OR -NB_ATTENTE_A_10 + VIDANGE_2 + VIDANGE_1 + -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) U -ROUTE_A > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-ROUTE_A <= -2 OR -NB_ATTENTE_A_10 + VIDANGE_2 + VIDANGE_1 + -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) U -ROUTE_A > -3)
lola: processed formula length: 264
lola: 1959 rewrites
lola: formula mentions 14 of 48 places; total mentions: 15
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-COMPTEUR_9 + SORTI_A + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= 0 U (-SORTI_B <= -2 OR -ATTENTE_A <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-COMPTEUR_9 + SORTI_A + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= 0 U (-SORTI_B <= -2 OR -ATTENTE_A <= -3))
lola: processed formula length: 209
lola: 1959 rewrites
lola: formula mentions 14 of 48 places; total mentions: 14
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (E(-NB_ATTENTE_A_10 + ATTENTE_B + -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 U -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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E(-NB_ATTENTE_A_10 + ATTENTE_B + -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 U -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... (shortened)
lola: processed formula length: 431
lola: 1960 rewrites
lola: formula mentions 23 of 48 places; total mentions: 23
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: RESULT
lola: summary: yes yes yes yes no yes yes yes no no yes yes yes yes yes no
lola: ========================================

BK_STOP 1463486127498

--------------------
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-V10P10N10"
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-V10P10N10.tgz
mv BridgeAndVehicles-PT-V10P10N10 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-V10P10N10, 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-146347662300264"
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 ;