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

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

=== Now, execution of the tool begins

BK_START 1463487104221

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ BridgeAndVehicles-PT-V20P10N50
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-15 CANNOT_COMPUTE
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: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: read: (AG (1 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) AND (AG ((COMPTEUR_0 + ... (shortened)
lola: formula length: 11967
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-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 <= -1) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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 <= -1)
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 404 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: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((COMPTEUR_9 + -CONTROLEUR_2 + -CONTROLEUR_1 + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_50 + COMPTEUR_49 + COMPTEUR_48 + COMPTEUR_47 + COMPTEUR_46 + COMPTEUR_45 + COMPTEUR_44 + COMPTEUR_43 + COMPTEUR_42 + COMPTEUR_41 + COMPTEUR_40 + COMPTEUR_39 + COMPTEUR_38 + COMPTEUR_37 + COMPTEUR_36 + COMPTEUR_35 + COMPTEUR_... (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 404 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (EF (EX (-ROUTE_B <= -3)) AND A(SUR_PONT_B + -ROUTE_A <= 0 U (-CAPACITE <= -1 AND -ATTENTE_A + CAPACITE <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (-ROUTE_B <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(-ROUTE_B <= -3))
lola: processed formula length: 28
lola: 19469 rewrites
lola: formula mentions 1 of 108 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(SUR_PONT_B + -ROUTE_A <= 0 U (-CAPACITE <= -1 AND -ATTENTE_A + CAPACITE <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(SUR_PONT_B + -ROUTE_A <= 0 U (-CAPACITE <= -1 AND -ATTENTE_A + CAPACITE <= 0))
lola: processed formula length: 80
lola: 19468 rewrites
lola: formula mentions 4 of 108 places; total mentions: 5
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (-ATTENTE_A > -3) AND (EG (-NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-ATTENTE_A > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-ATTENTE_A > -3)
lola: processed formula length: 19
lola: 19468 rewrites
lola: formula mentions 1 of 108 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 > -2)
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_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 ... (shortened)
lola: processed formula length: 407
lola: 19468 rewrites
lola: formula mentions 21 of 108 places; total mentions: 21
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 285 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_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 <= -3 OR... (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_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 <= ... (shortened)
lola: processed formula length: 820
lola: 19468 rewrites
lola: formula mentions 22 of 108 places; total mentions: 43
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (EG (-VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0)) AND (EG (-CONTROLEUR_2 + -CONTROLEUR_1 > -3) OR (((-CHOIX_2 + -CHOIX_1 <= -2 OR -VIDANGE_2 + -VIDANGE_1 <= -1) AND -ROUTE_A + VIDANGE_2 + VIDANGE_1 <= 0) OR (-ROUTE_A > -2 AND -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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (-VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(-VIDANGE_2 + -VIDANGE_1 + CHOIX_2 + CHOIX_1 <= 0))))
lola: processed formula length: 68
lola: 19469 rewrites
lola: formula mentions 4 of 108 places; total mentions: 4
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-CHOIX_2 + -CHOIX_1 > -2 OR SUR_PONT_A + -ROUTE_A > 0) AND -COMPTEUR_9 + 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_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-CHOIX_2 + -CHOIX_1 > -2 OR SUR_PONT_A + -ROUTE_A > 0) AND -COMPTEUR_9 + 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 ... (shortened)
lola: processed formula length: 1203
lola: 19468 rewrites
lola: formula mentions 76 of 108 places; total mentions: 76
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 311 seconds at most (--localtimelimit=0)
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-V20P10N50-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (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_20 + NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_16 + NB_ATTENTE_B_15 + NB_ATTENTE_B_14 + NB_ATTENTE_B_13 + NB_ATTENTE_B_12 + NB_ATTENTE_B_11 + NB_ATTENTE_B_10 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U 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_20 + NB_ATTENTE_B_19 + NB_ATTENTE_B_18 + NB_ATTENTE_B_17 + NB_ATTENTE_B_16 + NB_ATTENTE_B_15 + NB_ATTENTE_B_14 + NB_ATTENTE_B_13 + NB_ATTENTE_B_12 + NB_ATTENTE_B_11 + NB_ATTENTE_B_10... (shortened)
lola: processed formula length: 406
lola: 19468 rewrites
lola: formula mentions 23 of 108 places; total mentions: 23
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((EX (-SUR_PONT_B <= -1) OR (SUR_PONT_B + -ATTENTE_B <= 0 AND SUR_PONT_B + -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 + -NB_ATTENTE_A_15 + -NB_ATTENTE_A_14 + -NB_ATTENTE_A_13 + -NB_ATTENTE_A_12 + -NB_ATTENTE_A_11 + -NB_ATTENTE_A_10 + -NB_ATTENTE_A_9 + -NB_ATTENTE_A_8 + -NB_ATTENTE_A_7 + -NB_ATTENTE_A_6 + -NB_ATTENTE_A_5 + -NB_ATTENTE_A_4 + -NB_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((EX(-SUR_PONT_B <= -1) OR (SUR_PONT_B + -ATTENTE_B <= 0 AND SUR_PONT_B + -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 + -NB_ATTENTE_A_15 + -NB_ATTENTE_A_14 + -NB_ATTENTE_A_13 + -NB_ATTENTE_A_12 + -NB_ATTENTE_A_11 + -NB_ATTENTE_A_10 + -NB_ATTENTE_A_9 + -NB_ATTENTE_A_8 + -NB_ATTENTE_A_7 + -NB_ATTENTE_A_6 + -NB_ATTENTE_A_5 + -NB_ATTENTE_A_4... (shortened)
lola: processed formula length: 482
lola: 19469 rewrites
lola: formula mentions 23 of 108 places; total mentions: 25
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 > -3 AND -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-NB_ATTENTE_B_9 + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B_10 > -3 AND -... (shortened)
lola: processed formula length: 837
lola: 19469 rewrites
lola: formula mentions 44 of 108 places; total mentions: 44
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 9 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (AX (-ROUTE_B + VIDANGE_2 + VIDANGE_1 <= 0)) AND (EG ((-NB_ATTENTE_B_9 + ATTENTE_B + -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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AX (-ROUTE_B + VIDANGE_2 + VIDANGE_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(-ROUTE_B + VIDANGE_2 + VIDANGE_1 <= 0))
lola: processed formula length: 45
lola: 19469 rewrites
lola: formula mentions 3 of 108 places; total mentions: 3
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-NB_ATTENTE_B_9 + ATTENTE_B + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_ATTENTE_B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-NB_ATTENTE_B_9 + ATTENTE_B + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_20 + -NB_ATTENTE_B_19 + -NB_ATTENTE_B_18 + -NB_ATTENTE_B_17 + -NB_ATTENTE_B_16 + -NB_ATTENTE_B_15 + -NB_ATTENTE_B_14 + -NB_ATTENTE_B_13 + -NB_ATTENTE_B_12 + -NB_ATTENTE_B_11 + -NB_... (shortened)
lola: processed formula length: 817
lola: 19468 rewrites
lola: formula mentions 43 of 108 places; total mentions: 43
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (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 + CHO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(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_ATT... (shortened)
lola: processed formula length: 436
lola: 19469 rewrites
lola: formula mentions 23 of 108 places; total mentions: 23
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 11 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-SORTI_A > -2))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -SORTI_A > -2))))
lola: processed formula length: 39
lola: 19469 rewrites
lola: formula mentions 1 of 108 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 12 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AF ((-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_B <= 0 AND -ATTENTE_A + ATTENTE_B <= 0)) AND NB_ATTENTE_B_9 + -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 + -NB_ATTENTE_A_15 + -NB_ATTENTE_A_14 + -NB_ATTENTE_A_13 + -NB_ATTENTE_A_12 + -NB_ATTENTE_A_11 + -NB_ATTENTE_A_10 + NB_ATTENTE_B_8 + NB_ATTENTE_B_7 + NB_ATTENTE_B_6 + NB_ATTENTE_B_5 + NB_ATTENTE_B_4 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_B <= 0 AND -ATTENTE_A + ATTENTE_B <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_B <= 0 AND -ATTENTE_A + ATTENTE_B <= 0))
lola: processed formula length: 88
lola: 19468 rewrites
lola: formula mentions 5 of 108 places; total mentions: 5
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 1047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NB_ATTENTE_B_9 + -NB_ATTENTE_A_20 + -NB_ATTENTE_A_19 + -NB_ATTENTE_A_18 + -NB_ATTENTE_A_17 + -NB_ATTENTE_A_16 + -NB_ATTENTE_A_15 + -NB_ATTENTE_A_14 + -NB_ATTENTE_A_13 + -NB_ATTENTE_A_12 + -NB_ATTENTE_A_11 + -NB_ATTENTE_A_10 + NB_ATTENTE_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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-SUR_PONT_A + CONTROLEUR_2 + CONTROLEUR_1 <= 0 AND (-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 + ROUTE_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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-SUR_PONT_A + CONTROLEUR_2 + CONTROLEUR_1 <= 0 AND (-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 + ROUTE_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... (shortened)
lola: processed formula length: 494
lola: 19468 rewrites
lola: formula mentions 27 of 108 places; total mentions: 27
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 14 will run for 1570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((SUR_PONT_A + -ROUTE_B <= 0 AND SUR_PONT_B + -SUR_PONT_A <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((SUR_PONT_A + -ROUTE_B <= 0 AND SUR_PONT_B + -SUR_PONT_A <= 0)))))
lola: processed formula length: 88
lola: 19469 rewrites
lola: formula mentions 3 of 108 places; total mentions: 4
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 15 will run for 2677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_50 + -COMPTEUR_49 + -COMPTEUR_48 + -COMPTEUR_47 + -COMPTEUR_46 + -COMPTEUR_45 + -COMPTEUR_44 + -COMPTEUR_43 + -COMPTEUR_42 + -COMPTEUR_41 + -COMPTEUR_40 + -COMPTEUR_39 + -COMPTEUR_38 + -COMPTEUR_37 + -COMPTEUR_36 + -COMPTEUR_35 + -COMPTEUR_34 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_50 + -COMPTEUR_49 + -COMPTEUR_48 + -COMPTEUR_47 + -COMPTEUR_46 + -COMPTEUR_45 + -COMPTEUR_44 + -COMPTEUR_43 + -COMPTEUR_42 + -COMPTEUR_41 + -COMPTEUR_40 + -COMPTEUR_39 + -COMPTEUR_38 + -COMPTEUR_37 + -COMPTEUR_36 + -COMPTEUR_35 + -COMPTEUR_34 + ... (shortened)
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 404 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: no no yes no yes no yes no yes yes no no yes no yes unknown

BK_STOP 1463487968553

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