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)
...................
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 311K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V10P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306300262
=====================================================================

--------------------
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-PT-V10P10N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526557509590

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V10P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V10P10N10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ BridgeAndVehicles-PT-V10P10N10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 336/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1536
lola: finding significant places
lola: 48 places, 288 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 373 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (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)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= 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)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= NB_ATTENTE_B_10 + 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)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (CONTROLEUR_1 + CONTROLEUR_2 <= NB_ATTENTE_B_10 + 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)
lola: after: (CONTROLEUR_1 + CONTROLEUR_2 <= 1)
lola: LP says that atomic proposition is always true: (CONTROLEUR_1 + CONTROLEUR_2 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= NB_ATTENTE_B_10 + 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)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= CAPACITE)
lola: after: (1 <= CAPACITE)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_2)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_7)
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_2)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_2)
lola: (A (F ((3 <= ROUTE_B))) AND E (G ((SUR_PONT_A <= SUR_PONT_B)))) : A (F (A (G (FALSE)))) : A (F ((() AND A (G ((SORTI_B <= SUR_PONT_B)))))) : (((2 <= CAPACITE) OR ((ROUTE_B <= 2) AND E (F (TRUE)))) AND E (F (E (G (TRUE))))) : E (F (FALSE)) : (NOT(A (X (()))) AND A (G (E (F ((1 <= SUR_PONT_B)))))) : NOT(E (F (()))) : NOT(A ((((3 <= ROUTE_B) OR (1 <= CAPACITE)) U ((1 <= SORTI_B) AND (2 <= ROUTE_B))))) : E (G (((1 <= COMPTEUR_5) OR (NB_ATTENTE_A_2 <= COMPTEUR_6) OR (NB_ATTENTE_B_3 <= NB_ATTENTE_B_5) OR (1 <= CONTROLEUR_2)))) : (E (G ((((COMPTEUR_6 <= ATTENTE_B) OR (NB_ATTENTE_B_7 <= ATTENTE_A)) AND (SUR_PONT_A <= VIDANGE_1)))) AND TRUE) : E (G (((NB_ATTENTE_A_0 <= NB_ATTENTE_B_7) OR (SORTI_A <= NB_ATTENTE_A_3)))) : NOT(E (X (E (F (FALSE))))) : E (G ((A (X ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_6))) OR E (X ((3 <= CAPACITE)))))) : NOT(E ((((NB_ATTENTE_B_9 <= COMPTEUR_4) OR (1 <= VIDANGE_2)) U ()))) : A (F ((E (X ((2 <= SORTI_B))) AND E (F ((NB_ATTENTE_A_8 <= CHOIX_2)))))) : E (G ((((COMPTEUR_3 <= COMPTEUR_4) AND ((2 <= CAPACITE) OR (NB_ATTENTE_A_7 <= NB_ATTENTE_B_2))) AND E (F ((COMPTEUR_5 <= NB_ATTENTE_B_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= CAPACITE) OR (ROUTE_B <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: ((2 <= CAPACITE) OR (ROUTE_B <= 2))
lola: processed formula length: 35
lola: 43 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_6))) OR E (X ((3 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(A(TRUE U (NOT(AX((NB_ATTENTE_A_0 <= NB_ATTENTE_A_6))) AND NOT(EX((3 <= CAPACITE))))))
lola: processed formula length: 89
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 88 markings, 87 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((2 <= SORTI_B))) AND E (F ((NB_ATTENTE_A_8 <= CHOIX_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (EX((2 <= SORTI_B)) AND E(TRUE U (NB_ATTENTE_A_8 <= CHOIX_2))))
lola: processed formula length: 72
lola: 45 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 55537 markings, 156713 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NB_ATTENTE_A_0 <= NB_ATTENTE_B_7) OR (SORTI_A <= NB_ATTENTE_A_3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((NB_ATTENTE_A_0 <= NB_ATTENTE_B_7) OR (SORTI_A <= NB_ATTENTE_A_3))))
lola: processed formula length: 76
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 133182 markings, 317837 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((COMPTEUR_6 <= ATTENTE_B) OR (NB_ATTENTE_B_7 <= ATTENTE_A)) AND (SUR_PONT_A <= VIDANGE_1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((COMPTEUR_6 <= ATTENTE_B) OR (NB_ATTENTE_B_7 <= ATTENTE_A)) AND (SUR_PONT_A <= VIDANGE_1))))
lola: processed formula length: 101
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 3719 markings, 6578 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= COMPTEUR_5) OR (NB_ATTENTE_A_2 <= COMPTEUR_6) OR (NB_ATTENTE_B_3 <= NB_ATTENTE_B_5) OR (1 <= CONTROLEUR_2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= COMPTEUR_5) OR (NB_ATTENTE_A_2 <= COMPTEUR_6) OR (NB_ATTENTE_B_3 <= NB_ATTENTE_B_5) OR (1 <= CONTROLEUR_2))))
lola: processed formula length: 125
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 86 markings, 85 edges
lola:
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((COMPTEUR_3 <= COMPTEUR_4) AND ((2 <= CAPACITE) OR (NB_ATTENTE_A_7 <= NB_ATTENTE_B_2))) AND E (F ((COMPTEUR_5 <= NB_ATTENTE_B_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (((COMPTEUR_4 + 1 <= COMPTEUR_3) OR ((CAPACITE <= 1) AND (NB_ATTENTE_B_2 + 1 <= NB_ATTENTE_A_7))) OR NOT(E(TRUE U (COMPTEUR_5 <= NB_ATTENTE_B_2))))))
lola: processed formula length: 163
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11638 markings, 37693 edges
lola:
========================================FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((ROUTE_B <= 2) AND (CAPACITE <= 0)) R ((SORTI_B <= 0) OR (ROUTE_B <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E ((((ROUTE_B <= 2) AND (CAPACITE <= 0)) R ((SORTI_B <= 0) OR (ROUTE_B <= 1))))
lola: processed formula length: 80
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND A (G (E (F ((1 <= SUR_PONT_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= SUR_PONT_B)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (1 <= SUR_PONT_B)
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 89 markings, 88 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((SORTI_B <= SUR_PONT_B)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (SUR_PONT_B + 1 <= SORTI_B)
lola: processed formula length: 27
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 86 markings, 85 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= ROUTE_B))) AND E (G ((SUR_PONT_A <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (ROUTE_B <= 2)
lola: processed formula length: 14
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
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: ========================================
lola: ...considering subproblem: (A (F ((3 <= ROUTE_B))) AND E (G ((SUR_PONT_A <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (ROUTE_B <= 2)
lola: processed formula length: 14
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((SUR_PONT_A <= SUR_PONT_B)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((SUR_PONT_A <= SUR_PONT_B)))
lola: processed formula length: 34
lola: 42 rewrites
lola: closed formula file BridgeAndVehicles-PT-V10P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 9964 markings, 27452 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes yes yes no no yes yes yes yes yes
lola:
preliminary result: no no no yes no no yes yes yes no no yes yes yes yes yes
lola: memory consumption: 23892 KB
lola: time consumption: 11 seconds

BK_STOP 1526557520634

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V10P10N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V10P10N10.tgz
mv BridgeAndVehicles-PT-V10P10N10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-PT-V10P10N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-ebro-152646306300262"
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 ;