About the Execution of LoLA for BridgeAndVehicles-COL-V20P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 588.380 | 816220.00 | 1599544.00 | 135.00 | FFFTFTTT?FFTFFTF | 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 212K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 39K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-COL-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306100150
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526524462819
info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ BridgeAndVehicles-COL-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-COL-V20P20N10-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p56 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)
lola: after: (p56 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p57 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p57 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p43 + p44)
lola: after: (1 <= p43 + p44)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p61 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p61 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p43 + p44)
lola: after: (1 <= p43 + p44)
lola: place invariant simplifies atomic proposition
lola: before: (p65 + p66 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)
lola: after: (p65 + p66 <= 1)
lola: LP says that atomic proposition is always true: (p65 + p66 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p65 + p66)
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p58)
lola: after: (1 <= p58)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p43 + p44)
lola: after: (1 <= p43 + p44)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= p43 + p44)
lola: (FALSE OR A (F (((p59 + 1 <= p57) AND (3 <= p59))))) : ((A (G (((p60 <= p57) OR (2 <= p64)))) OR (E (F ((p56 <= 1))) OR FALSE)) AND (NOT(A (G ((p63 + p62 <= p59)))) OR (p61 <= 2))) : NOT(E (G ((((p57 <= 1) AND (p65 + p66 <= p67)) OR (p58 <= 2))))) : A (G (TRUE)) : (A (G ((p0 <= p64))) AND (E (((1 <= p43 + p44) U FALSE)) AND ((p58 <= 0) AND ((p61 <= 1) OR (3 <= p56))))) : E ((E (X ((1 <= p43 + p44))) U E (G (TRUE)))) : A (G (((1 <= p56)))) : (E (((p59 <= p0) U (p56 <= p59))) AND ((E (G (TRUE)) AND A (F ((p0 <= p58)))) OR (p67 <= p58))) : E (G (TRUE)) : (A (G (A (F ((p65 + p66 <= p67))))) OR (E (((3 <= p61) U FALSE)) OR (1 <= p59))) : A ((A (F ((2 <= p67))) U ((3 <= p0) AND (2 <= p64) AND (3 <= p60)))) : E (X (E (F (((3 <= p59) AND (p64 <= p67)))))) : A (F (((p65 + p66 <= p56) AND (p61 <= p0) AND ((p57 <= p64) OR (2 <= p56)) AND ((1 <= p58) OR (2 <= p59) OR (2 <= p58))))) : (E (F (((p63 + p62 <= p58) OR (p60 <= 1)))) AND E (X (E (G ((1 <= p43 + p44)))))) : A (G (NOT(E (F (FALSE))))) : A ((A (F (FALSE)) U (2 <= p59)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:151
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:117
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:116
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:184
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 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: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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-COL-V20P20N10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 234 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: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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-COL-V20P20N10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 251 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: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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-COL-V20P20N10-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 270 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: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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-COL-V20P20N10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 293 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: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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-COL-V20P20N10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p59)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p59)
lola: processed formula length: 10
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.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-COL-V20P20N10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((3 <= p59) AND (p64 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: ((3 <= p59) AND (p64 <= p67))
lola: processed formula length: 29
lola: 45 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 24 markings, 23 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p63 + p62 <= p58) OR (p60 <= 1)))) AND E (X (E (G ((1 <= p43 + p44))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p63 + p62 <= p58) OR (p60 <= 1))))
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 (((p63 + p62 <= p58) OR (p60 <= 1))))
lola: processed formula length: 43
lola: 45 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: formula 0: ((p63 + p62 <= p58) OR (p60 <= 1))
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((1 <= p43 + p44)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (1 <= p43 + p44)
lola: processed formula length: 16
lola: 45 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 440 markings, 839 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p56))))
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 <= p56))))
lola: processed formula length: 20
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: formula 0: ((p56 <= 0))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3)
lola: sara is running 0 secs || 87802 markings, 218234 edges, 17560 markings/sec, 0 secs
lola: sara is running 5 secs || 173354 markings, 443639 edges, 17110 markings/sec, 5 secs
lola: sara is running 10 secs || 257790 markings, 668804 edges, 16887 markings/sec, 10 secs
lola: sara is running 15 secs || 339374 markings, 889999 edges, 16317 markings/sec, 15 secs
lola: sara is running 20 secs || 421320 markings, 1113028 edges, 16389 markings/sec, 20 secs
lola: sara is running 25 secs || 503276 markings, 1335423 edges, 16391 markings/sec, 25 secs
lola: sara is running 30 secs || 584885 markings, 1558087 edges, 16322 markings/sec, 30 secs
lola: sara is running 35 secs || 664543 markings, 1779298 edges, 15932 markings/sec, 35 secs
lola: sara is running 40 secs || 744732 markings, 1994950 edges, 16038 markings/sec, 40 secs
lola: sara is running 45 secs || 826686 markings, 2217053 edges, 16391 markings/sec, 45 secs
lola: sara is running 50 secs || 906943 markings, 2441739 edges, 16051 markings/sec, 50 secs
lola: sara is running 55 secs || 990041 markings, 2662479 edges, 16620 markings/sec, 55 secs
lola: sara is running 60 secs || 1070730 markings, 2886303 edges, 16138 markings/sec, 60 secs
lola: sara is running 65 secs || 1150082 markings, 3102634 edges, 15870 markings/sec, 65 secs
lola: sara is running 70 secs || 1232094 markings, 3326763 edges, 16402 markings/sec, 70 secs
lola: sara is running 75 secs || 1315898 markings, 3557941 edges, 16761 markings/sec, 75 secs
lola: sara is running 80 secs || 1397218 markings, 3788215 edges, 16264 markings/sec, 80 secs
lola: sara is running 85 secs || 1478465 markings, 4016885 edges, 16249 markings/sec, 85 secs
lola: sara is running 90 secs || 1562991 markings, 4243589 edges, 16905 markings/sec, 90 secs
lola: sara is running 95 secs || 1643079 markings, 4466449 edges, 16018 markings/sec, 95 secs
lola: sara is running 100 secs || 1723012 markings, 4695872 edges, 15987 markings/sec, 100 secs
lola: sara is running 105 secs || 1804157 markings, 4924329 edges, 16229 markings/sec, 105 secs
lola: sara is running 110 secs || 1885967 markings, 5148050 edges, 16362 markings/sec, 110 secs
lola: sara is running 115 secs || 1968339 markings, 5374429 edges, 16474 markings/sec, 115 secs
lola: sara is running 120 secs || 2048015 markings, 5601953 edges, 15935 markings/sec, 120 secs
lola: sara is running 125 secs || 2127761 markings, 5829001 edges, 15949 markings/sec, 125 secs
lola: sara is running 130 secs || 2207707 markings, 6055321 edges, 15989 markings/sec, 130 secs
lola: sara is running 135 secs || 2289578 markings, 6277754 edges, 16374 markings/sec, 135 secs
lola: sara is running 140 secs || 2370812 markings, 6501750 edges, 16247 markings/sec, 140 secs
lola: sara is running 145 secs || 2451708 markings, 6733245 edges, 16179 markings/sec, 145 secs
lola: sara is running 150 secs || 2532287 markings, 6962522 edges, 16116 markings/sec, 150 secs
lola: sara is running 155 secs || 2598690 markings, 7153343 edges, 13281 markings/sec, 155 secs
lola: sara is running 160 secs || 2679388 markings, 7378769 edges, 16140 markings/sec, 160 secs
lola: sara is running 165 secs || 2759423 markings, 7595516 edges, 16007 markings/sec, 165 secs
lola: sara is running 170 secs || 2840766 markings, 7825140 edges, 16269 markings/sec, 170 secs
lola: sara is running 175 secs || 2920924 markings, 8054024 edges, 16032 markings/sec, 175 secs
lola: sara is running 180 secs || 3000433 markings, 8283394 edges, 15902 markings/sec, 180 secs
lola: sara is running 185 secs || 3080003 markings, 8507246 edges, 15914 markings/sec, 185 secs
lola: sara is running 190 secs || 3162291 markings, 8738440 edges, 16458 markings/sec, 190 secs
lola: sara is running 195 secs || 3244540 markings, 8962639 edges, 16450 markings/sec, 195 secs
lola: sara is running 200 secs || 3324919 markings, 9190501 edges, 16076 markings/sec, 200 secs
lola: sara is running 205 secs || 3405704 markings, 9422662 edges, 16157 markings/sec, 205 secs
lola: sara is running 210 secs || 3485056 markings, 9648052 edges, 15870 markings/sec, 210 secs
lola: sara is running 215 secs || 3566162 markings, 9882498 edges, 16221 markings/sec, 215 secs
lola: sara is running 220 secs || 3647416 markings, 10112858 edges, 16251 markings/sec, 220 secs
lola: sara is running 225 secs || 3728031 markings, 10330159 edges, 16123 markings/sec, 225 secs
lola: sara is running 230 secs || 3810418 markings, 10561215 edges, 16477 markings/sec, 230 secs
lola: sara is running 235 secs || 3891599 markings, 10794460 edges, 16236 markings/sec, 235 secs
lola: sara is running 240 secs || 3970153 markings, 11018670 edges, 15711 markings/sec, 240 secs
lola: sara is running 245 secs || 4051333 markings, 11252853 edges, 16236 markings/sec, 245 secs
lola: sara is running 250 secs || 4130524 markings, 11478410 edges, 15838 markings/sec, 250 secs
lola: sara is running 255 secs || 4211602 markings, 11709047 edges, 16216 markings/sec, 255 secs
lola: sara is running 260 secs || 4291988 markings, 11924488 edges, 16077 markings/sec, 260 secs
lola: sara is running 265 secs || 4374390 markings, 12158247 edges, 16480 markings/sec, 265 secs
lola: sara is running 270 secs || 4454402 markings, 12389005 edges, 16002 markings/sec, 270 secs
lola: sara is running 275 secs || 4533753 markings, 12613939 edges, 15870 markings/sec, 275 secs
lola: sara is running 280 secs || 4614624 markings, 12849877 edges, 16174 markings/sec, 280 secs
lola: sara is running 285 secs || 4696034 markings, 13084943 edges, 16282 markings/sec, 285 secs
lola: sara is running 290 secs || 4777395 markings, 13317618 edges, 16272 markings/sec, 290 secs
lola: sara is running 295 secs || 4858555 markings, 13537130 edges, 16232 markings/sec, 295 secs
lola: sara is running 300 secs || 4941300 markings, 13764417 edges, 16549 markings/sec, 300 secs
lola: sara is running 305 secs || 5022585 markings, 13999032 edges, 16257 markings/sec, 305 secs
lola: sara is running 310 secs || 5103183 markings, 14228054 edges, 16120 markings/sec, 310 secs
lola: sara is running 315 secs || 5181505 markings, 14457881 edges, 15664 markings/sec, 315 secs
lola: sara is running 320 secs || 5263108 markings, 14690441 edges, 16321 markings/sec, 320 secs
lola: sara is running 325 secs || 5343613 markings, 14921588 edges, 16101 markings/sec, 325 secs
lola: sara is running 330 secs || 5425845 markings, 15157942 edges, 16446 markings/sec, 330 secs
lola: sara is running 335 secs || 5505222 markings, 15372961 edges, 15875 markings/sec, 335 secs
lola: sara is running 340 secs || 5588381 markings, 15602114 edges, 16632 markings/sec, 340 secs
lola: sara is running 345 secs || 5669631 markings, 15838566 edges, 16250 markings/sec, 345 secs
lola: sara is running 350 secs || 5750296 markings, 16066410 edges, 16133 markings/sec, 350 secs
lola: sara is running 355 secs || 5831191 markings, 16302142 edges, 16179 markings/sec, 355 secs
lola: sara is running 360 secs || 5911852 markings, 16537241 edges, 16132 markings/sec, 360 secs
lola: sara is running 365 secs || 5993436 markings, 16772583 edges, 16317 markings/sec, 365 secs
lola: sara is running 370 secs || 6074915 markings, 17008267 edges, 16296 markings/sec, 370 secs
lola: sara is running 375 secs || 6157132 markings, 17231024 edges, 16443 markings/sec, 375 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6191581 markings, 17324771 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p59 + 1 <= p57) AND (3 <= p59))))
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: ((p57 <= p59) OR (p59 <= 2))
lola: processed formula length: 29
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 does not eventually occur.
lola: 176 markings, 175 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((2 <= p57) OR (p67 + 1 <= p65 + p66)) AND (3 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (((p57 <= 1) AND (p65 + p66 <= p67)) OR (p58 <= 2))
lola: processed formula length: 52
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 does not eventually occur.
lola: 176 markings, 175 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p65 + p66 <= p56) AND (p61 <= p0) AND ((p57 <= p64) OR (2 <= p56)) AND ((1 <= p58) OR (2 <= p59) OR (2 <= p58)))))
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: ((p56 + 1 <= p65 + p66) OR (p0 + 1 <= p61) OR ((p64 + 1 <= p57) AND (p56 <= 1)) OR ((p58 <= 0) AND (p59 <= 1) AND (p58 <= 1)))
lola: processed formula length: 129
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 does not eventually occur.
lola: 62748 markings, 156173 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p67))) U ((3 <= p0) AND (2 <= p64) AND (3 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(A(TRUE U (2 <= p67)) U ((3 <= p0) AND (2 <= p64) AND (3 <= p60)))
lola: processed formula length: 67
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 195 markings, 195 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p65 + p66 <= p67))))) OR (1 <= p59))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p59)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p59)
lola: processed formula length: 10
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.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: ========================================
lola: subprocess 14 will run for 1567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p65 + p66 <= p67)))))
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:694
lola: processed formula: (p67 + 1 <= p65 + p66)
lola: processed formula length: 22
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 170 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p59 <= p0) U (p56 <= p59))) AND (A (F ((p0 <= p58))) OR (p67 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p67 <= p58)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p67 <= p58)
lola: processed formula length: 12
lola: 44 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.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: ========================================
lola: subprocess 15 will run for 3135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p59 <= p0) U (p56 <= p59)))
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 (((p59 <= p0) U (p56 <= p59)))
lola: processed formula length: 32
lola: 47 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: (p56 <= p59)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15-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: 128 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p60 <= p57) OR (2 <= p64)))) OR E (F ((p56 <= 1)))) AND (E (F ((p59 + 1 <= p63 + p62))) OR (p61 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p56 <= 1)))
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 ((p56 <= 1)))
lola: processed formula length: 18
lola: 45 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: formula 0: (p56 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 37)
lola: sara is running 0 secs || 85375 markings, 212051 edges, 17075 markings/sec, 0 secs
lola: sara is running 5 secs || 168776 markings, 432403 edges, 16680 markings/sec, 5 secs
lola: sara is running 10 secs || 251518 markings, 651568 edges, 16548 markings/sec, 10 secs
lola: sara is running 15 secs || 332664 markings, 871251 edges, 16229 markings/sec, 15 secs
lola: sara is running 20 secs || 411783 markings, 1086497 edges, 15824 markings/sec, 20 secs
lola: sara is running 25 secs || 491789 markings, 1303922 edges, 16001 markings/sec, 25 secs
lola: sara is running 30 secs || 572188 markings, 1527150 edges, 16080 markings/sec, 30 secs
lola: sara is running 35 secs || 653071 markings, 1745559 edges, 16177 markings/sec, 35 secs
lola: sara is running 40 secs || 735417 markings, 1967484 edges, 16469 markings/sec, 40 secs
lola: sara is running 45 secs || 816471 markings, 2189732 edges, 16211 markings/sec, 45 secs
lola: sara is running 50 secs || 897755 markings, 2413129 edges, 16257 markings/sec, 50 secs
lola: sara is running 55 secs || 979211 markings, 2634000 edges, 16291 markings/sec, 55 secs
lola: sara is running 60 secs || 1059477 markings, 2859843 edges, 16053 markings/sec, 60 secs
lola: sara is running 65 secs || 1141788 markings, 3080545 edges, 16462 markings/sec, 65 secs
lola: sara is running 70 secs || 1224095 markings, 3306095 edges, 16461 markings/sec, 70 secs
lola: sara is running 75 secs || 1307391 markings, 3534316 edges, 16659 markings/sec, 75 secs
lola: sara is running 80 secs || 1386995 markings, 3760006 edges, 15921 markings/sec, 80 secs
lola: sara is running 85 secs || 1468824 markings, 3990315 edges, 16366 markings/sec, 85 secs
lola: sara is running 90 secs || 1553508 markings, 4219527 edges, 16937 markings/sec, 90 secs
lola: sara is running 95 secs || 1636288 markings, 4448893 edges, 16556 markings/sec, 95 secs
lola: sara is running 100 secs || 1715965 markings, 4675464 edges, 15935 markings/sec, 100 secs
lola: sara is running 105 secs || 1795629 markings, 4902199 edges, 15933 markings/sec, 105 secs
lola: sara is running 110 secs || 1878735 markings, 5129279 edges, 16621 markings/sec, 110 secs
lola: sara is running 115 secs || 1961423 markings, 5356328 edges, 16538 markings/sec, 115 secs
lola: sara is running 120 secs || 2042569 markings, 5585217 edges, 16229 markings/sec, 120 secs
lola: sara is running 125 secs || 2123164 markings, 5815551 edges, 16119 markings/sec, 125 secs
lola: sara is running 130 secs || 2203083 markings, 6040800 edges, 15984 markings/sec, 130 secs
lola: sara is running 135 secs || 2284994 markings, 6265374 edges, 16382 markings/sec, 135 secs
lola: sara is running 140 secs || 2367456 markings, 6492727 edges, 16492 markings/sec, 140 secs
lola: sara is running 145 secs || 2448462 markings, 6723100 edges, 16201 markings/sec, 145 secs
lola: sara is running 150 secs || 2529410 markings, 6953177 edges, 16190 markings/sec, 150 secs
lola: sara is running 155 secs || 2610175 markings, 7184298 edges, 16153 markings/sec, 155 secs
lola: sara is running 160 secs || 2692125 markings, 7412797 edges, 16390 markings/sec, 160 secs
lola: sara is running 165 secs || 2774869 markings, 7636990 edges, 16549 markings/sec, 165 secs
lola: sara is running 170 secs || 2855574 markings, 7866772 edges, 16141 markings/sec, 170 secs
lola: sara is running 175 secs || 2936351 markings, 8096413 edges, 16155 markings/sec, 175 secs
lola: sara is running 180 secs || 3017146 markings, 8328847 edges, 16159 markings/sec, 180 secs
lola: sara is running 185 secs || 3097275 markings, 8559296 edges, 16026 markings/sec, 185 secs
lola: sara is running 190 secs || 3180175 markings, 8785792 edges, 16580 markings/sec, 190 secs
lola: sara is running 195 secs || 3262518 markings, 9010222 edges, 16469 markings/sec, 195 secs
lola: sara is running 200 secs || 3343365 markings, 9242822 edges, 16169 markings/sec, 200 secs
lola: sara is running 205 secs || 3423512 markings, 9470959 edges, 16029 markings/sec, 205 secs
lola: sara is running 210 secs || 3504462 markings, 9707150 edges, 16190 markings/sec, 210 secs
lola: sara is running 215 secs || 3585209 markings, 9934494 edges, 16149 markings/sec, 215 secs
lola: sara is running 220 secs || 3667498 markings, 10167085 edges, 16458 markings/sec, 220 secs
lola: sara is running 225 secs || 3748034 markings, 10383174 edges, 16107 markings/sec, 225 secs
lola: sara is running 230 secs || 3829629 markings, 10616023 edges, 16319 markings/sec, 230 secs
lola: sara is running 235 secs || 3907692 markings, 10838509 edges, 15613 markings/sec, 235 secs
lola: sara is running 240 secs || 3987554 markings, 11071307 edges, 15972 markings/sec, 240 secs
lola: sara is running 245 secs || 4066884 markings, 11295569 edges, 15866 markings/sec, 245 secs
lola: sara is running 250 secs || 4147386 markings, 11527213 edges, 16100 markings/sec, 250 secs
lola: sara is running 255 secs || 4229543 markings, 11757524 edges, 16431 markings/sec, 255 secs
lola: sara is running 260 secs || 4308591 markings, 11969984 edges, 15810 markings/sec, 260 secs
lola: sara is running 265 secs || 4391133 markings, 12204424 edges, 16508 markings/sec, 265 secs
lola: sara is running 270 secs || 4472242 markings, 12438602 edges, 16222 markings/sec, 270 secs
lola: sara is running 275 secs || 4552516 markings, 12670791 edges, 16055 markings/sec, 275 secs
lola: sara is running 280 secs || 4634710 markings, 12906513 edges, 16439 markings/sec, 280 secs
lola: sara is running 285 secs || 4714960 markings, 13136066 edges, 16050 markings/sec, 285 secs
lola: sara is running 290 secs || 4797471 markings, 13371800 edges, 16502 markings/sec, 290 secs
lola: sara is running 295 secs || 4875270 markings, 13581951 edges, 15560 markings/sec, 295 secs
lola: sara is running 300 secs || 4957642 markings, 13811091 edges, 16474 markings/sec, 300 secs
lola: sara is running 305 secs || 5038559 markings, 14042987 edges, 16183 markings/sec, 305 secs
lola: sara is running 310 secs || 5118604 markings, 14276212 edges, 16009 markings/sec, 310 secs
lola: sara is running 315 secs || 5197747 markings, 14502058 edges, 15829 markings/sec, 315 secs
lola: sara is running 320 secs || 5278053 markings, 14731678 edges, 16061 markings/sec, 320 secs
lola: sara is running 325 secs || 5360582 markings, 14966327 edges, 16506 markings/sec, 325 secs
lola: sara is running 330 secs || 5440906 markings, 15198760 edges, 16065 markings/sec, 330 secs
lola: sara is running 335 secs || 5522030 markings, 15418538 edges, 16225 markings/sec, 335 secs
lola: sara is running 340 secs || 5604527 markings, 15648614 edges, 16499 markings/sec, 340 secs
lola: sara is running 345 secs || 5686058 markings, 15882888 edges, 16306 markings/sec, 345 secs
lola: sara is running 350 secs || 5767122 markings, 16117470 edges, 16213 markings/sec, 350 secs
lola: sara is running 355 secs || 5848974 markings, 16355125 edges, 16370 markings/sec, 355 secs
lola: sara is running 360 secs || 5930966 markings, 16589025 edges, 16398 markings/sec, 360 secs
lola: sara is running 365 secs || 6012109 markings, 16822762 edges, 16229 markings/sec, 365 secs
lola: sara is running 370 secs || 6094294 markings, 17060333 edges, 16437 markings/sec, 370 secs
lola: sara is running 375 secs || 6176134 markings, 17282360 edges, 16368 markings/sec, 375 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6191581 markings, 17324771 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 (F ((p59 + 1 <= p63 + p62)))
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 ((p59 + 1 <= p63 + p62)))
lola: processed formula length: 30
lola: 45 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: formula 0: (p59 + 1 <= p63 + p62)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p60 <= p57) OR (2 <= p64))))
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 (((p60 <= p57) OR (2 <= p64))))
lola: processed formula length: 37
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: formula 0: ((p57 + 1 <= p60) AND (p64 <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-18-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes yes yes no no yes no no yes no
lola:
preliminary result: no no no yes no yes yes yes yes no no yes no no yes no
lola: memory consumption: 25012 KB
lola: time consumption: 816 seconds
BK_STOP 1526525279039
--------------------
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-COL-V20P20N10"
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-COL-V20P20N10.tgz
mv BridgeAndVehicles-COL-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-COL-V20P20N10, 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-152646306100150"
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 '
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 ;