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.1M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K 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 2.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 107K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K 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-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r220-ebro-152732362600083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527448716676

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N10 @ 3569 seconds
lola: LoLA will run for 3569 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-V20P20N10-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1 + VIDANGE_2)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: A (X (G (F (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))) : A (X ((X ((1 <= VIDANGE_1 + VIDANGE_2)) U X ((1 <= ROUTE_A))))) : A ((G (G ((ROUTE_A <= CAPACITE))) U ((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE)))) : A ((G ((CAPACITE <= ATTENTE_A)) U ((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A)))) : A (X (X ((3 <= ROUTE_A)))) : A (X (X (G (X ((2 <= SUR_PONT_A)))))) : A (X (F ((FALSE U FALSE)))) : A (F (G (X (F ((2 <= ROUTE_B)))))) : A (F (G (X (F ((COMPTEUR_1 <= COMPTEUR_4)))))) : A (G ((X ((CHOIX_2 <= NB_ATTENTE_B_6)) U F ((NB_ATTENTE_B_17 <= COMPTEUR_4))))) : A (F ((VIDANGE_2 <= NB_ATTENTE_A_7))) : A ((NB_ATTENTE_A_8 <= NB_ATTENTE_B_7)) : A (F ((NB_ATTENTE_A_9 <= NB_ATTENTE_B_4))) : A ((1 <= ROUTE_B)) : A (F (F ((NB_ATTENTE_A_12 <= NB_ATTENTE_B_1)))) : A ((NB_ATTENTE_B_18 <= NB_ATTENTE_A_9))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.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-V20P20N10-LTLCardinality-6 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: (NB_ATTENTE_A_8 <= NB_ATTENTE_B_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_8 <= NB_ATTENTE_B_7)
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 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-V20P20N10-LTLCardinality-11 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: (1 <= ROUTE_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ROUTE_B)
lola: processed formula length: 14
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 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-V20P20N10-LTLCardinality-13 TRUE 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: (NB_ATTENTE_B_18 <= NB_ATTENTE_A_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_B_18 <= NB_ATTENTE_A_9)
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 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-V20P20N10-LTLCardinality-15 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: A (X (X ((3 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((3 <= ROUTE_A))))
lola: processed formula length: 26
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-4 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: A (X (X (X (G ((2 <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((2 <= SUR_PONT_A))))))
lola: processed formula length: 37
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-5 FALSE 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: A (X (X (((1 <= VIDANGE_1 + VIDANGE_2) U (1 <= ROUTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((1 <= VIDANGE_1 + VIDANGE_2) U (1 <= ROUTE_A)))))
lola: processed formula length: 59
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((VIDANGE_2 <= NB_ATTENTE_A_7)))
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: (NB_ATTENTE_A_7 + 1 <= VIDANGE_2)
lola: processed formula length: 33
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_A_12 <= NB_ATTENTE_B_1)))
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: (NB_ATTENTE_B_1 + 1 <= NB_ATTENTE_A_12)
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_A_9 <= NB_ATTENTE_B_4)))
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: (NB_ATTENTE_B_4 + 1 <= NB_ATTENTE_A_9)
lola: processed formula length: 38
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.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: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= ROUTE_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= ROUTE_B))))
lola: processed formula length: 26
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((COMPTEUR_1 <= COMPTEUR_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((COMPTEUR_1 <= COMPTEUR_4))))
lola: processed formula length: 38
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 183 markings, 191 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((NB_ATTENTE_B_17 <= COMPTEUR_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((NB_ATTENTE_B_17 <= COMPTEUR_4))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 50853 markings, 88983 edges, 10171 markings/sec, 0 secs
lola: 98550 markings, 173971 edges, 9539 markings/sec, 5 secs
lola: 144598 markings, 255144 edges, 9210 markings/sec, 10 secs
lola: 191575 markings, 339901 edges, 9395 markings/sec, 15 secs
lola: 238097 markings, 425048 edges, 9304 markings/sec, 20 secs
lola: 283929 markings, 509118 edges, 9166 markings/sec, 25 secs
lola: 329034 markings, 592564 edges, 9021 markings/sec, 30 secs
lola: 375176 markings, 677757 edges, 9228 markings/sec, 35 secs
lola: 419276 markings, 758857 edges, 8820 markings/sec, 40 secs
lola: 465566 markings, 844535 edges, 9258 markings/sec, 45 secs
lola: 509673 markings, 925970 edges, 8821 markings/sec, 50 secs
lola: 557622 markings, 1014115 edges, 9590 markings/sec, 55 secs
lola: 601482 markings, 1094599 edges, 8772 markings/sec, 60 secs
lola: 648605 markings, 1181768 edges, 9425 markings/sec, 65 secs
lola: 693027 markings, 1263265 edges, 8884 markings/sec, 70 secs
lola: 736906 markings, 1343373 edges, 8776 markings/sec, 75 secs
lola: 784816 markings, 1432568 edges, 9582 markings/sec, 80 secs
lola: 828865 markings, 1513197 edges, 8810 markings/sec, 85 secs
lola: 876789 markings, 1601291 edges, 9585 markings/sec, 90 secs
lola: 922590 markings, 1685457 edges, 9160 markings/sec, 95 secs
lola: 966874 markings, 1765825 edges, 8857 markings/sec, 100 secs
lola: 1015342 markings, 1855113 edges, 9694 markings/sec, 105 secs
lola: 1061350 markings, 1939873 edges, 9202 markings/sec, 110 secs
lola: 1105559 markings, 2020037 edges, 8842 markings/sec, 115 secs
lola: 1153790 markings, 2108507 edges, 9646 markings/sec, 120 secs
lola: 1200036 markings, 2193690 edges, 9249 markings/sec, 125 secs
lola: 1244117 markings, 2273697 edges, 8816 markings/sec, 130 secs
lola: 1287980 markings, 2353402 edges, 8773 markings/sec, 135 secs
lola: 1338845 markings, 2447789 edges, 10173 markings/sec, 140 secs
lola: 1384432 markings, 2532164 edges, 9117 markings/sec, 145 secs
lola: 1428681 markings, 2613476 edges, 8850 markings/sec, 150 secs
lola: 1476840 markings, 2702147 edges, 9632 markings/sec, 155 secs
lola: 1525557 markings, 2793010 edges, 9743 markings/sec, 160 secs
lola: 1571619 markings, 2878171 edges, 9212 markings/sec, 165 secs
lola: 1616322 markings, 2960425 edges, 8941 markings/sec, 170 secs
lola: 1666222 markings, 3052969 edges, 9980 markings/sec, 175 secs
lola: 1714370 markings, 3142498 edges, 9630 markings/sec, 180 secs
lola: 1760565 markings, 3227819 edges, 9239 markings/sec, 185 secs
lola: 1805911 markings, 3311202 edges, 9069 markings/sec, 190 secs
lola: 1855168 markings, 3401905 edges, 9851 markings/sec, 195 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1869949 markings, 3430182 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((CHOIX_1 + CHOIX_2 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((CHOIX_1 + CHOIX_2 <= CAPACITE))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 113652 markings, 354868 edges, 22730 markings/sec, 0 secs
lola: 220033 markings, 698876 edges, 21276 markings/sec, 5 secs
lola: 323827 markings, 1040695 edges, 20759 markings/sec, 10 secs
lola: 420174 markings, 1365724 edges, 19269 markings/sec, 15 secs
lola: 514667 markings, 1684955 edges, 18899 markings/sec, 20 secs
lola: 606284 markings, 2000125 edges, 18323 markings/sec, 25 secs
lola: 700983 markings, 2321403 edges, 18940 markings/sec, 30 secs
lola: 793635 markings, 2636939 edges, 18530 markings/sec, 35 secs
lola: 883867 markings, 2950685 edges, 18046 markings/sec, 40 secs
lola: 977245 markings, 3268115 edges, 18676 markings/sec, 45 secs
lola: 1067345 markings, 3576773 edges, 18020 markings/sec, 50 secs
lola: 1160883 markings, 3901286 edges, 18708 markings/sec, 55 secs
lola: 1252229 markings, 4213583 edges, 18269 markings/sec, 60 secs
lola: 1345134 markings, 4537262 edges, 18581 markings/sec, 65 secs
lola: 1437511 markings, 4853750 edges, 18475 markings/sec, 70 secs
lola: 1531861 markings, 5183385 edges, 18870 markings/sec, 75 secs
lola: 1622866 markings, 5495657 edges, 18201 markings/sec, 80 secs
lola: 1718348 markings, 5828847 edges, 19096 markings/sec, 85 secs
lola: 1811589 markings, 6153600 edges, 18648 markings/sec, 90 secs
lola: 1914404 markings, 6503407 edges, 20563 markings/sec, 95 secs
lola: 2006703 markings, 6823355 edges, 18460 markings/sec, 100 secs
lola: 2098749 markings, 7144260 edges, 18409 markings/sec, 105 secs
lola: 2193032 markings, 7472206 edges, 18857 markings/sec, 110 secs
lola: 2297986 markings, 7830020 edges, 20991 markings/sec, 115 secs
lola: 2390986 markings, 8152926 edges, 18600 markings/sec, 120 secs
lola: 2482872 markings, 8476345 edges, 18377 markings/sec, 125 secs
lola: 2575691 markings, 8803598 edges, 18564 markings/sec, 130 secs
lola: 2680504 markings, 9160957 edges, 20963 markings/sec, 135 secs
lola: 2774675 markings, 9489949 edges, 18834 markings/sec, 140 secs
lola: 2863807 markings, 9802182 edges, 17826 markings/sec, 145 secs
lola: 2954048 markings, 10119448 edges, 18048 markings/sec, 150 secs
lola: 3047009 markings, 10449844 edges, 18592 markings/sec, 155 secs
lola: 3150755 markings, 10803875 edges, 20749 markings/sec, 160 secs
lola: 3240584 markings, 11117408 edges, 17966 markings/sec, 165 secs
lola: 3331816 markings, 11439710 edges, 18246 markings/sec, 170 secs
lola: 3421056 markings, 11754722 edges, 17848 markings/sec, 175 secs
lola: 3511859 markings, 12076404 edges, 18161 markings/sec, 180 secs
lola: 3612091 markings, 12424390 edges, 20046 markings/sec, 185 secs
lola: 3710064 markings, 12765537 edges, 19595 markings/sec, 190 secs
lola: 3798126 markings, 13076260 edges, 17612 markings/sec, 195 secs
lola: 3886807 markings, 13389408 edges, 17736 markings/sec, 200 secs
lola: 3975521 markings, 13705758 edges, 17743 markings/sec, 205 secs
lola: 4064686 markings, 14024664 edges, 17833 markings/sec, 210 secs
lola: 4169086 markings, 14383773 edges, 20880 markings/sec, 215 secs
lola: 4263377 markings, 14714323 edges, 18858 markings/sec, 220 secs
lola: 4352478 markings, 15030492 edges, 17820 markings/sec, 225 secs
lola: 4441665 markings, 15346068 edges, 17837 markings/sec, 230 secs
lola: 4529788 markings, 15660542 edges, 17625 markings/sec, 235 secs
lola: 4618076 markings, 15976352 edges, 17658 markings/sec, 240 secs
lola: 4718562 markings, 16326263 edges, 20097 markings/sec, 245 secs
lola: 4816668 markings, 16671159 edges, 19621 markings/sec, 250 secs
lola: 4906313 markings, 16987517 edges, 17929 markings/sec, 255 secs
lola: 4993824 markings, 17300773 edges, 17502 markings/sec, 260 secs
lola: 5081891 markings, 17614501 edges, 17613 markings/sec, 265 secs
lola: 5168999 markings, 17926281 edges, 17422 markings/sec, 270 secs
lola: 5258813 markings, 18248687 edges, 17963 markings/sec, 275 secs
lola: 5364022 markings, 18613661 edges, 21042 markings/sec, 280 secs
lola: 5459496 markings, 18950499 edges, 19095 markings/sec, 285 secs
lola: 5547021 markings, 19262133 edges, 17505 markings/sec, 290 secs
lola: 5634484 markings, 19573654 edges, 17493 markings/sec, 295 secs
lola: 5719978 markings, 19878756 edges, 17099 markings/sec, 300 secs
lola: 5809406 markings, 20202555 edges, 17886 markings/sec, 305 secs
lola: 5899898 markings, 20527785 edges, 18098 markings/sec, 310 secs
lola: 6004404 markings, 20891908 edges, 20901 markings/sec, 315 secs
lola: 6100140 markings, 21228971 edges, 19147 markings/sec, 320 secs
lola: 6188961 markings, 21545460 edges, 17764 markings/sec, 325 secs
lola: 6275942 markings, 21857844 edges, 17396 markings/sec, 330 secs
lola: 6365658 markings, 22179629 edges, 17943 markings/sec, 335 secs
lola: 6452266 markings, 22493747 edges, 17322 markings/sec, 340 secs
lola: 6538250 markings, 22801851 edges, 17197 markings/sec, 345 secs
lola: 6635462 markings, 23146940 edges, 19442 markings/sec, 350 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6732570 markings, 23488006 edges
lola:
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A)) OR (G ((CAPACITE <= ATTENTE_A)) AND F ((3 <= ROUTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A)) OR (G ((CAPACITE <= ATTENTE_A)) AND F ((3 <= ROUTE_A)))))
lola: processed formula length: 102
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3008 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE)) OR (G ((ROUTE_A <= CAPACITE)) AND F ((2 <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE)) OR (G ((ROUTE_A <= CAPACITE)) AND F ((2 <= CAPACITE)))))
lola: processed formula length: 125
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no no yes yes yes yes yes yes yes
lola:
preliminary result: yes yes yes yes yes no no no no yes yes yes yes yes yes yes
lola: memory consumption: 21656 KB
lola: time consumption: 561 seconds

BK_STOP 1527449278531

--------------------
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-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
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-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 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-V20P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r220-ebro-152732362600083"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;