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 1.2M
-rw-r--r-- 1 mcc users 6.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 55K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K 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 4.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 34K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 598K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V20P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306300269
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526557641500

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ BridgeAndVehicles-PT-V20P10N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (SUR_PONT_A <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + 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: (SUR_PONT_A <= 1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= VIDANGE_1 + VIDANGE_2)
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 <= SORTI_B)
lola: after: (1 <= SORTI_B)
lola: place invariant simplifies atomic proposition
lola: before: (CONTROLEUR_1 + CONTROLEUR_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: (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: (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)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (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 <= CAPACITE)
lola: after: (1 <= CAPACITE)
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 <= CONTROLEUR_1 + CONTROLEUR_2)
lola: after: (1 <= CONTROLEUR_1 + CONTROLEUR_2)
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 <= 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)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (CHOIX_1 + CHOIX_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 + 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)
lola: after: (CHOIX_1 + CHOIX_2 <= 1)
lola: LP says that atomic proposition is always true: (CHOIX_1 + CHOIX_2 <= 1)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_15)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_11)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_14)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_7)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_3)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_11)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_0)
lola: NOT(A (F (((CAPACITE <= 1) AND (2 <= SUR_PONT_A))))) : NOT(A (F (()))) : ((((2 <= ROUTE_A) AND E (F (FALSE))) OR (A (G ((1 <= SORTI_B))) AND (((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2))))) AND E (((ROUTE_B <= ATTENTE_A) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))))) : (A (((SORTI_A <= ROUTE_A) U ((1 <= VIDANGE_1 + VIDANGE_2) AND (2 <= ATTENTE_A)))) AND (E (F ((CHOIX_1 + CHOIX_2 <= SORTI_A))) OR E (X (((2 <= ROUTE_B)))))) : A (G ((A (G ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))) OR A (G ((1 <= CAPACITE)))))) : A (G (NOT(E (G ((3 <= ROUTE_A)))))) : (A (X (E (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))))) OR E (G ((ATTENTE_B <= 0)))) : NOT(E (G (()))) : NOT(A (G (()))) : A (F ((((CHOIX_1 + 1 <= SORTI_B) OR ((1 <= NB_ATTENTE_A_17) AND (NB_ATTENTE_B_16 <= NB_ATTENTE_B_18))) AND E (X ((NB_ATTENTE_B_13 <= NB_ATTENTE_A_11)))))) : NOT(E (G (E (F (FALSE))))) : E (G (A (G (TRUE)))) : (E (G (((NB_ATTENTE_A_16 <= COMPTEUR_10) AND (NB_ATTENTE_B_17 <= 0)))) OR ((NB_ATTENTE_A_12 <= NB_ATTENTE_A_20) AND E (X (())))) : ((E (F (())) AND E (F ((NB_ATTENTE_A_18 + 1 <= NB_ATTENTE_B_20)))) AND E (((NB_ATTENTE_B_8 + 1 <= CAPACITE) U ()))) : E (G ((NB_ATTENTE_B_14 + 1 <= COMPTEUR_0))) : NOT(A (F (E (G ((COMPTEUR_6 <= NB_ATTENTE_B_17))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:118
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:118
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 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: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 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: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 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: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 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: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 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: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((SORTI_A <= ROUTE_A) U ((1 <= VIDANGE_1 + VIDANGE_2) AND (2 <= ATTENTE_A)))) AND (E (F ((CHOIX_1 + CHOIX_2 <= SORTI_A))) OR E (X (((2 <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CHOIX_1 + CHOIX_2 <= SORTI_A)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((CHOIX_1 + CHOIX_2 <= SORTI_A)))
lola: processed formula length: 38
lola: 53 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((SORTI_A <= ROUTE_A) U ((1 <= VIDANGE_1 + VIDANGE_2) AND (2 <= ATTENTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((SORTI_A <= ROUTE_A) U ((1 <= VIDANGE_1 + VIDANGE_2) AND (2 <= ATTENTE_A))))
lola: processed formula length: 80
lola: 56 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 60 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2))))) OR E (G ((ATTENTE_B <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((ATTENTE_B <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((ATTENTE_B <= 0)))
lola: processed formula length: 24
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 706 markings, 975 edges
lola: ========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((1 <= CONTROLEUR_1 + CONTROLEUR_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (CONTROLEUR_1 + CONTROLEUR_2 <= 0))))
lola: processed formula length: 53
lola: 55 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((CHOIX_1 + 1 <= SORTI_B) OR ((1 <= NB_ATTENTE_A_17) AND (NB_ATTENTE_B_16 <= NB_ATTENTE_B_18))) AND E (X ((NB_ATTENTE_B_13 <= NB_ATTENTE_A_11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (((CHOIX_1 + 1 <= SORTI_B) OR ((1 <= NB_ATTENTE_A_17) AND (NB_ATTENTE_B_16 <= NB_ATTENTE_B_18))) AND EX((NB_ATTENTE_B_13 <= NB_ATTENTE_A_11))))
lola: processed formula length: 153
lola: 54 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 299341 markings, 662109 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((ROUTE_A <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= ROUTE_A)
lola: processed formula length: 14
lola: 54 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 94287 markings, 152839 edges, 18857 markings/sec, 0 secs
lola: 189161 markings, 312609 edges, 18975 markings/sec, 5 secs
lola: 279093 markings, 463801 edges, 17986 markings/sec, 10 secs
lola: 370070 markings, 617003 edges, 18195 markings/sec, 15 secs
lola: 456764 markings, 761590 edges, 17339 markings/sec, 20 secs
lola: 539943 markings, 900270 edges, 16636 markings/sec, 25 secs
lola: 624378 markings, 1040994 edges, 16887 markings/sec, 30 secs
lola: 707906 markings, 1180092 edges, 16706 markings/sec, 35 secs
lola: 790387 markings, 1316321 edges, 16496 markings/sec, 40 secs
lola: 872308 markings, 1451538 edges, 16384 markings/sec, 45 secs
lola: 954607 markings, 1587427 edges, 16460 markings/sec, 50 secs
lola: 1037007 markings, 1724429 edges, 16480 markings/sec, 55 secs
lola: 1117744 markings, 1856591 edges, 16147 markings/sec, 60 secs
lola: 1198521 markings, 1989520 edges, 16155 markings/sec, 65 secs
lola: 1279487 markings, 2123697 edges, 16193 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 1338247 markings, 2219335 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= CAPACITE) OR (SUR_PONT_A <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((2 <= CAPACITE) OR (SUR_PONT_A <= 1))))
lola: processed formula length: 47
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 170 markings, 169 edges

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NB_ATTENTE_B_14 + 1 <= COMPTEUR_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NB_ATTENTE_B_14 + 1 <= COMPTEUR_0)))
lola: processed formula length: 43
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 294 markings, 553 edges

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NB_ATTENTE_A_16 <= COMPTEUR_10) AND (NB_ATTENTE_B_17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((NB_ATTENTE_A_16 <= COMPTEUR_10) AND (NB_ATTENTE_B_17 <= 0))))
lola: processed formula length: 69
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 170 markings, 169 edges

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1154 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((NB_ATTENTE_B_17 + 1 <= COMPTEUR_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (NB_ATTENTE_B_17 + 1 <= COMPTEUR_6)))))
lola: processed formula length: 65
lola: 54 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 130483 markings, 396439 edges

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))) OR A (G ((1 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (E(TRUE U (ATTENTE_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2)) AND E(TRUE U (CAPACITE <= 0)))))
lola: processed formula length: 103
lola: 60 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 268 markings, 529 edges

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= SORTI_B))) AND ((((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2))) AND E (((ROUTE_B <= ATTENTE_A) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2)))
lola: processed formula length: 128
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((ROUTE_B <= ATTENTE_A) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((ROUTE_B <= ATTENTE_A) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))))
lola: processed formula length: 75
lola: 55 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= SORTI_B))) AND ((((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2))) AND E (((ROUTE_B <= ATTENTE_A) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((CONTROLEUR_1 + CONTROLEUR_2 <= ROUTE_A)) OR ((ATTENTE_A <= CONTROLEUR_1 + CONTROLEUR_2) AND (SORTI_A <= CHOIX_1 + CHOIX_2)))
lola: processed formula length: 128
lola: 52 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: ...considering subproblem: A (G ((1 <= SORTI_B)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= SORTI_B)))
lola: processed formula length: 22
lola: 54 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (SORTI_B <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-CTLCardinality-17-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no no no yes yes yes yes no no no
lola:
preliminary result: yes yes no no no yes no no no yes yes yes yes no no no
lola: memory consumption: 25432 KB
lola: time consumption: 109 seconds

BK_STOP 1526557750268

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