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

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

=== Now, execution of the tool begins

BK_START 1463486425639

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ BridgeAndVehicles-PT-V20P10N20
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N20-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: 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-CTLCardinality.task
lola: read: ((CHOIX_1 + CHOIX_2 <= ATTENTE_A AND EX (!(CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2))) OR EG ((!(2 <= ROUTE_A) OR (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 +... (shortened)
lola: formula length: 7839
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-V20P10N20-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 (AX (-SUR_PONT_B + CAPACITE <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(-SUR_PONT_B + CAPACITE <= 0))
lola: processed formula length: 41
lola: 6565 rewrites
lola: formula mentions 2 of 78 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AX (SUR_PONT_A + -CONTROLEUR_2 + -CONTROLEUR_1 <= 0) U (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_ATTEN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX(SUR_PONT_A + -CONTROLEUR_2 + -CONTROLEUR_1 <= 0) U (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_ATTENT... (shortened)
lola: processed formula length: 502
lola: 6565 rewrites
lola: formula mentions 26 of 78 places; total mentions: 28
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(ROUTE_A + -VIDANGE_2 + -VIDANGE_1 > 0 U (-CONTROLEUR_2 + -CONTROLEUR_1 <= -3 AND -ATTENTE_B <= -1)) AND (AF (-NB_ATTENTE_B_9 + CAPACITE + -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 + -N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(ROUTE_A + -VIDANGE_2 + -VIDANGE_1 > 0 U (-CONTROLEUR_2 + -CONTROLEUR_1 <= -3 AND -ATTENTE_B <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(ROUTE_A + -VIDANGE_2 + -VIDANGE_1 > 0 U (-CONTROLEUR_2 + -CONTROLEUR_1 <= -3 AND -ATTENTE_B <= -1))
lola: processed formula length: 101
lola: 6564 rewrites
lola: formula mentions 6 of 78 places; total mentions: 6
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 4 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-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 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -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 <= -... (shortened)
lola: processed formula length: 402
lola: 6564 rewrites
lola: formula mentions 21 of 78 places; total mentions: 21
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 5 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG ((-SORTI_B + ATTENTE_A <= 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_ATTENTE_B_12 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !((-SORTI_B + ATTENTE_A <= 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 + -N... (shortened)
lola: processed formula length: 464
lola: 6565 rewrites
lola: formula mentions 23 of 78 places; total mentions: 24
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-ROUTE_A > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -ROUTE_A > -3)
lola: processed formula length: 23
lola: 6564 rewrites
lola: formula mentions 1 of 78 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (ROUTE_A + -VIDANGE_2 + -VIDANGE_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U ROUTE_A + -VIDANGE_2 + -VIDANGE_1 > 0))))
lola: processed formula length: 63
lola: 6565 rewrites
lola: formula mentions 3 of 78 places; total mentions: 3
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EX (-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 <= -3) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-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 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-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 <= -3)
lola: processed formula length: 396
lola: 6564 rewrites
lola: formula mentions 21 of 78 places; total mentions: 21
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((-SORTI_B + 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 <= 0 OR -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((-SORTI_B + 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 <= 0 OR -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_... (shortened)
lola: processed formula length: 746
lola: 6564 rewrites
lola: formula mentions 45 of 78 places; total mentions: 45
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 9 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (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 + -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 <= -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (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 + -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 <= -3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -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_ATT... (shortened)
lola: processed formula length: 418
lola: 6565 rewrites
lola: formula mentions 21 of 78 places; total mentions: 21
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ROUTE_A <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-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 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-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 + ATTENTE_A + -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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-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 + ATTENTE_A + -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_... (shortened)
lola: processed formula length: 419
lola: 6564 rewrites
lola: formula mentions 22 of 78 places; total mentions: 22
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 10 will run for 488 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 > -3) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 488 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 > -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 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (COMPTEUR_9 + -ROUTE_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) AND (AX (-SORTI_A > -2) OR (EG (SORTI_B + -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (COMPTEUR_9 + -ROUTE_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)
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 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-ATTENTE_B <= -1) AND A(-CAPACITE <= -3 U -SORTI_B > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-ATTENTE_B <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -ATTENTE_B <= -1)
lola: processed formula length: 26
lola: 6564 rewrites
lola: formula mentions 1 of 78 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 13 will run for 977 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-CAPACITE <= -3 U -SORTI_B > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-CAPACITE <= -3 U -SORTI_B > -3)
lola: processed formula length: 34
lola: 6564 rewrites
lola: formula mentions 2 of 78 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 977 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-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 1466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_A > 0) OR 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_ATT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_A > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_A > 0)))
lola: processed formula length: 59
lola: 6564 rewrites
lola: formula mentions 3 of 78 places; total mentions: 3
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
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: 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 15 will run for 2752 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 > -2 OR ... (shortened)
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 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2752 seconds at most (--localtimelimit=0)
lola: lola: ================================================================================

lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: RESULT
lola: summary: yes yes no no no no yes no yes yes yes no yes yes yes no
lola: ========================================

BK_STOP 1463487214187

--------------------
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="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-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 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-146347662300282"
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 ;