fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r220-ebro-152732362600081
Last Updated
June 26, 2018

About the Execution of LoLA for BridgeAndVehicles-PT-V20P10N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5080.400 219293.00 389874.00 25.10 FFTFTTTFTTTFTTTF normal

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 4.4M
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 209K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 594K 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.5K 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 72K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 205K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 190K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 543K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K 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 2.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V20P10N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r220-ebro-152732362600081
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527448623287

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N50 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N50 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N50 @ 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: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P10N50-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= VIDANGE_1 + VIDANGE_2)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= 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: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (2 <= 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: (1 <= 0)
lola: always false
lola: A ((G (X ((1 <= CHOIX_1 + CHOIX_2))) U G (G (FALSE)))) : A (G (X ((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B)))) : A ((SUR_PONT_B <= CAPACITE)) : A (FALSE) : A (X (X (F (F ((CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2)))))) : A (F ((G ((2 <= ROUTE_B)) U F ((1 <= VIDANGE_1 + VIDANGE_2))))) : A (X (F ((1 <= ATTENTE_A)))) : A (G (X (G (FALSE)))) : A ((NB_ATTENTE_A_11 <= COMPTEUR_35)) : A (F ((CONTROLEUR_1 <= NB_ATTENTE_A_5))) : A (F (F (((COMPTEUR_26 <= NB_ATTENTE_A_19) U (COMPTEUR_9 <= NB_ATTENTE_A_14))))) : A (G (G ((COMPTEUR_21 <= COMPTEUR_37)))) : A (X (X (X (X ((NB_ATTENTE_A_8 <= NB_ATTENTE_A_14)))))) : A ((COMPTEUR_18 <= NB_ATTENTE_A_15)) : A ((F (F ((COMPTEUR_12 <= COMPTEUR_7))) U F ((COMPTEUR_31 <= COMPTEUR_42)))) : A ((1 <= ATTENTE_B))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-0 FALSE 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: (SUR_PONT_B <= CAPACITE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SUR_PONT_B <= CAPACITE)
lola: processed formula length: 24
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-2 TRUE 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: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 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-V20P10N50-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-V20P10N50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NB_ATTENTE_A_11 <= COMPTEUR_35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_11 <= COMPTEUR_35)
lola: processed formula length: 32
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (COMPTEUR_18 <= NB_ATTENTE_A_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (COMPTEUR_18 <= NB_ATTENTE_A_15)
lola: processed formula length: 32
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= ATTENTE_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ATTENTE_B)
lola: processed formula length: 16
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-LTLCardinality.task
lola: processed formula with 1 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-V20P10N50-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((CHOIX_1 + CHOIX_2 <= CONTROLEUR_1 + CONTROLEUR_2)))))
lola: processed formula length: 66
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 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: 882 markings, 1283 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((NB_ATTENTE_A_8 <= NB_ATTENTE_A_14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((NB_ATTENTE_A_8 <= NB_ATTENTE_A_14))))))
lola: processed formula length: 55
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-LTLCardinality.task
lola: the resulting Büchi automaton has 6 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: 34 markings, 54 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= ATTENTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= ATTENTE_A))))
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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: 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: 6324 markings, 11540 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B))))
lola: processed formula length: 49
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 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: 165 markings, 165 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_21 <= COMPTEUR_37)))
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 ((COMPTEUR_21 <= COMPTEUR_37)))
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-LTLCardinality.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: formula 0: (COMPTEUR_37 + 1 <= COMPTEUR_21)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N50-LTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P10N50-LTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 252)
lola: sara is running 0 secs || 11713 markings, 24703 edges, 2343 markings/sec, 0 secs
lola: sara is running 5 secs || 22183 markings, 48222 edges, 2094 markings/sec, 5 secs
lola: sara is running 10 secs || 32145 markings, 71959 edges, 1992 markings/sec, 10 secs
lola: sara is running 15 secs || 42002 markings, 94514 edges, 1971 markings/sec, 15 secs
lola: sara is running 20 secs || 53422 markings, 122171 edges, 2284 markings/sec, 20 secs
lola: sara is running 25 secs || 62285 markings, 143449 edges, 1773 markings/sec, 25 secs
lola: sara is running 30 secs || 69815 markings, 162051 edges, 1506 markings/sec, 30 secs
lola: sara is running 35 secs || 81369 markings, 188389 edges, 2311 markings/sec, 35 secs
lola: sara is running 40 secs || 93590 markings, 219186 edges, 2444 markings/sec, 40 secs
lola: sara is running 45 secs || 101609 markings, 238514 edges, 1604 markings/sec, 45 secs
lola: sara is running 50 secs || 110116 markings, 259764 edges, 1701 markings/sec, 50 secs
lola: sara is running 55 secs || 118183 markings, 280056 edges, 1613 markings/sec, 55 secs
lola: sara is running 60 secs || 125530 markings, 298505 edges, 1469 markings/sec, 60 secs
lola: sara is running 65 secs || 135000 markings, 320949 edges, 1894 markings/sec, 65 secs
lola: sara is running 70 secs || 146875 markings, 349431 edges, 2375 markings/sec, 70 secs
lola: sara is running 75 secs || 159070 markings, 380681 edges, 2439 markings/sec, 75 secs
lola: sara is running 80 secs || 168502 markings, 404403 edges, 1886 markings/sec, 80 secs
lola: sara is running 85 secs || 175724 markings, 421954 edges, 1444 markings/sec, 85 secs
lola: sara is running 90 secs || 184580 markings, 443915 edges, 1771 markings/sec, 90 secs
lola: sara is running 95 secs || 192524 markings, 464179 edges, 1589 markings/sec, 95 secs
lola: sara is running 100 secs || 199991 markings, 483290 edges, 1493 markings/sec, 100 secs
lola: sara is running 105 secs || 207065 markings, 501548 edges, 1415 markings/sec, 105 secs
lola: sara is running 110 secs || 214326 markings, 519687 edges, 1452 markings/sec, 110 secs
lola: sara is running 115 secs || 220942 markings, 536254 edges, 1323 markings/sec, 115 secs
lola: sara is running 120 secs || 233607 markings, 566180 edges, 2533 markings/sec, 120 secs
lola: sara is running 125 secs || 244761 markings, 592690 edges, 2231 markings/sec, 125 secs
lola: sara is running 130 secs || 253424 markings, 614727 edges, 1733 markings/sec, 130 secs
lola: sara is running 135 secs || 267472 markings, 651074 edges, 2810 markings/sec, 135 secs
lola: sara is running 140 secs || 277195 markings, 675399 edges, 1945 markings/sec, 140 secs
lola: sara is running 145 secs || 283509 markings, 691790 edges, 1263 markings/sec, 145 secs
lola: sara is running 150 secs || 290474 markings, 708905 edges, 1393 markings/sec, 150 secs
lola: sara is running 155 secs || 300087 markings, 732848 edges, 1923 markings/sec, 155 secs
lola: sara is running 160 secs || 306151 markings, 748724 edges, 1213 markings/sec, 160 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CONTROLEUR_1 <= NB_ATTENTE_A_5)))
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_5 + 1 <= CONTROLEUR_1)
lola: processed formula length: 36
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((COMPTEUR_31 <= COMPTEUR_42)))
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: (COMPTEUR_42 + 1 <= COMPTEUR_31)
lola: processed formula length: 32
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((COMPTEUR_9 <= NB_ATTENTE_A_14)))
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_14 + 1 <= COMPTEUR_9)
lola: processed formula length: 35
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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-V20P10N50-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= VIDANGE_1 + VIDANGE_2)) OR (G ((2 <= ROUTE_B)) AND F ((1 <= VIDANGE_1 + VIDANGE_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((1 <= VIDANGE_1 + VIDANGE_2)) OR (G ((2 <= ROUTE_B)) AND F ((1 <= VIDANGE_1 + VIDANGE_2))))))
lola: processed formula length: 103
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N50-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 6033 markings, 14188 edges, 1207 markings/sec, 0 secs
lola: 9393 markings, 22337 edges, 672 markings/sec, 5 secs
lola: 14481 markings, 32330 edges, 1018 markings/sec, 10 secs
lola: 22311 markings, 45024 edges, 1566 markings/sec, 15 secs
lola: 28166 markings, 54605 edges, 1171 markings/sec, 20 secs
lola: 35469 markings, 74955 edges, 1461 markings/sec, 25 secs
lola: 42165 markings, 96763 edges, 1339 markings/sec, 30 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: 43616 markings, 100476 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N50-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes no yes yes yes no yes yes yes no
lola:
preliminary result: no no yes no yes yes yes no yes yes yes no yes yes yes no
lola: memory consumption: 35284 KB
lola: time consumption: 219 seconds

BK_STOP 1527448842580

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P10N50"
export BK_EXAMINATION="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-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 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-V20P10N50, 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-152732362600081"
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 ;