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

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

=== Now, execution of the tool begins

BK_START 1463496191054

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ BridgeAndVehicles-PT-V80P20N10
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-0 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-2 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-4 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-5 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N10-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: 2296/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: read: AF ((EG (3 <= ATTENTE_A) AND !(2 <= SORTI_A))) : (!((AG (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) OR ((SORTI_A <= SUR_PONT_B OR 3 <= ROUTE_A) OR 2 <= VIDANGE_1 + VIDANGE_2))) OR A((3 <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 OR SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) U 1 <= CONTROLEUR_1 + CONTROL... (shortened)
lola: formula length: 12347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((EG (-ATTENTE_A <= -3) AND -SORTI_A > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (!(A(TRUE U !(-ATTENTE_A <= -3))) AND -SORTI_A > -2))
lola: processed formula length: 62
lola: 27365 rewrites
lola: formula mentions 2 of 188 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (VIDANGE_2 + VIDANGE_1 + -CHOIX_2 + -CHOIX_1 > 0) AND (-SUR_PONT_B + SORTI_A > 0 AND (-ROUTE_A > -3 AND -VIDANGE_2 + -VIDANGE_1 > -2))) OR A((-COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= -3 OR SUR_PONT_A + -VIDANGE_2 + -VIDANGE_1 <= 0) U -CONTROLEUR_2 + -CONTROLEUR_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (VIDANGE_2 + VIDANGE_1 + -CHOIX_2 + -CHOIX_1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-SUR_PONT_B + SORTI_A > 0 AND (-ROUTE_A > -3 AND -VIDANGE_2 + -VIDANGE_1 > -2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= -3 OR SUR_PONT_A + -VIDANGE_2 + -VIDANGE_1 <= 0) U -CONTROLEUR_2 + -CONTROLEUR_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 <= -3 OR SUR_PONT_A + -VIDANGE_2 + -VIDANGE_1 <= 0) U -CONTROLEUR_2 + -CONTROLEUR_1 <= -1)
lola: processed formula length: 246
lola: 27364 rewrites
lola: formula mentions 16 of 188 places; total mentions: 16
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AF (ROUTE_B + -ATTENTE_B <= 0) OR AG (-SORTI_B <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U ROUTE_B + -ATTENTE_B <= 0) OR !(E(TRUE U !(-SORTI_B <= -2)))))
lola: processed formula length: 81
lola: 27366 rewrites
lola: formula mentions 3 of 188 places; total mentions: 3
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((SORTI_B + -CAPACITE > 0 OR (-COMPTEUR_9 + ROUTE_A + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_10 > 0 AND -CONTROLEUR_2 + -CONTROLEUR_1 > -2)))
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 724 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 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (EG (-ROUTE_B <= -2)) AND AX ((CONTROLEUR_2 + CONTROLEUR_1 + -ATTENTE_B <= 0 OR (-CAPACITE <= -3 OR -ROUTE_B <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (-ROUTE_B <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(-ROUTE_B <= -2))))
lola: processed formula length: 34
lola: 27365 rewrites
lola: formula mentions 1 of 188 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((AF (-SORTI_B + NB_ATTENTE_A_80 + NB_ATTENTE_A_79 + NB_ATTENTE_A_78 + NB_ATTENTE_A_77 + NB_ATTENTE_A_76 + NB_ATTENTE_A_75 + NB_ATTENTE_A_74 + NB_ATTENTE_A_73 + NB_ATTENTE_A_72 + NB_ATTENTE_A_71 + NB_ATTENTE_A_70 + NB_ATTENTE_A_69 + NB_ATTENTE_A_68 + NB_ATTENTE_A_67 + NB_ATTENTE_A_66 + NB_ATTENTE_A_65 + NB_ATTENTE_A_64 + NB_ATTENTE_A_63 + NB_ATTENTE_A_62 + NB_ATTENTE_A_61 + NB_ATTENTE_A_60 + NB_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-SORTI_B + NB_ATTENTE_A_80 + NB_ATTENTE_A_79 + NB_ATTENTE_A_78 + NB_ATTENTE_A_77 + NB_ATTENTE_A_76 + NB_ATTENTE_A_75 + NB_ATTENTE_A_74 + NB_ATTENTE_A_73 + NB_ATTENTE_A_72 + NB_ATTENTE_A_71 + NB_ATTENTE_A_70 + NB_ATTENTE_A_69 + NB_ATTENTE_A_68 + NB_ATTENTE_A_67 + NB_ATTENTE_A_66 + NB_ATTENTE_A_65 + NB_ATTENTE_A_64 + NB_ATTENTE_A_63 + NB_ATTENTE_A_62 + NB_ATTENTE_A_61 + NB_ATTENTE_A_60 + NB_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -SORTI_B + NB_ATTENTE_A_80 + NB_ATTENTE_A_79 + NB_ATTENTE_A_78 + NB_ATTENTE_A_77 + NB_ATTENTE_A_76 + NB_ATTENTE_A_75 + NB_ATTENTE_A_74 + NB_ATTENTE_A_73 + NB_ATTENTE_A_72 + NB_ATTENTE_A_71 + NB_ATTENTE_A_70 + NB_ATTENTE_A_69 + NB_ATTENTE_A_68 + NB_ATTENTE_A_67 + NB_ATTENTE_A_66 + NB_ATTENTE_A_65 + NB_ATTENTE_A_64 + NB_ATTENTE_A_63 + NB_ATTENTE_A_62 + NB_ATTENTE_A_61 + NB_ATTENTE_A_60 + NB... (shortened)
lola: processed formula length: 1471
lola: 27364 rewrites
lola: formula mentions 82 of 188 places; total mentions: 82
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 256 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-V80P20N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG (-SUR_PONT_B > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !(-SUR_PONT_B > -3))))
lola: processed formula length: 42
lola: 27365 rewrites
lola: formula mentions 1 of 188 places; total mentions: 1
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-CONTROLEUR_2 + -CONTROLEUR_1 + CHOIX_2 + CHOIX_1 <= 0 U EF (-SORTI_B <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-CONTROLEUR_2 + -CONTROLEUR_1 + CHOIX_2 + CHOIX_1 <= 0 U E(TRUE U -SORTI_B <= -3))
lola: processed formula length: 84
lola: 27365 rewrites
lola: formula mentions 5 of 188 places; total mentions: 5
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-CHOIX_2 + -CHOIX_1 > -1 AND (-COMPTEUR_9 + NB_ATTENTE_A_80 + NB_ATTENTE_A_79 + NB_ATTENTE_A_78 + NB_ATTENTE_A_77 + NB_ATTENTE_A_76 + NB_ATTENTE_A_75 + NB_ATTENTE_A_74 + NB_ATTENTE_A_73 + NB_ATTENTE_A_72 + NB_ATTENTE_A_71 + NB_ATTENTE_A_70 + NB_ATTENTE_A_69 + NB_ATTENTE_A_68 + NB_ATTENTE_A_67 + NB_ATTENTE_A_66 + NB_ATTENTE_A_65 + NB_ATTENTE_A_64 + NB_ATTENTE_A_63 + NB_ATTENTE_A_62 + NB_ATTENT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-CHOIX_2 + -CHOIX_1 > -1 AND (-COMPTEUR_9 + NB_ATTENTE_A_80 + NB_ATTENTE_A_79 + NB_ATTENTE_A_78 + NB_ATTENTE_A_77 + NB_ATTENTE_A_76 + NB_ATTENTE_A_75 + NB_ATTENTE_A_74 + NB_ATTENTE_A_73 + NB_ATTENTE_A_72 + NB_ATTENTE_A_71 + NB_ATTENTE_A_70 + NB_ATTENTE_A_69 + NB_ATTENTE_A_68 + NB_ATTENTE_A_67 + NB_ATTENTE_A_66 + NB_ATTENTE_A_65 + NB_ATTENTE_A_64 + NB_ATTENTE_A_63 + NB_ATTENTE_A_62 + NB_A... (shortened)
lola: processed formula length: 1714
lola: 27365 rewrites
lola: formula mentions 97 of 188 places; total mentions: 97
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-CAPACITE <= -2 OR SUR_PONT_A + -NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_ATTENTE_A_62 + -N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-CAPACITE <= -2 OR SUR_PONT_A + -NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_ATTENTE_... (shortened)
lola: processed formula length: 1581
lola: 27364 rewrites
lola: formula mentions 83 of 188 places; total mentions: 83
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 11 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AF (-SUR_PONT_B <= -1) OR AX (-SORTI_A <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U -SUR_PONT_B <= -1) OR AX(-SORTI_A <= -1)))
lola: processed formula length: 61
lola: 27366 rewrites
lola: formula mentions 2 of 188 places; total mentions: 2
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 12 will run for 601 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-V80P20N10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-ATTENTE_A <= -2 OR (ATTENTE_B + -CHOIX_2 + -CHOIX_1 <= 0 OR -CAPACITE > -1)) 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_80 + -NB_ATTENTE_B_79 + -NB_ATTENTE_B_78 + -NB_ATTENTE_B_77 + -NB_ATTENTE_B_76 + -NB_ATTENTE_B_75 + -NB_ATTENTE_B_74 + -NB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-ATTENTE_A <= -2 OR (ATTENTE_B + -CHOIX_2 + -CHOIX_1 <= 0 OR -CAPACITE > -1)) 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_80 + -NB_ATTENTE_B_79 + -NB_ATTENTE_B_78 + -NB_ATTENTE_B_77 + -NB_ATTENTE_B_76 + -NB_ATTENTE_B_75 + -NB_ATTENTE_B_74 + -NB... (shortened)
lola: processed formula length: 1715
lola: 27364 rewrites
lola: formula mentions 89 of 188 places; total mentions: 91
lola: closed formula file BridgeAndVehicles-COL-V80P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ROUTE_A <= -2)
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 724 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 15 will run for 1603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_ATTENTE_A_62 + -NB_ATTENTE_A_61 + -NB_ATTENTE_A_6... (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 724 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 unreachable.
lola: RESULT
lola: summary: unknown yes unknown no unknown unknown yes yes yes no yes yes no unknown no no
lola: ========================================

BK_STOP 1463498129160

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