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 |
| 593.270 | 3600000.00 | 756007.00 | 594.40 | TFFTTFTTTTTFTTTF | 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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306100152
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526525151948
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 ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ 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-ReachabilityCardinality.task
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 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p55 + p56 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p55 + p56 <= 1)
lola: LP says that atomic proposition is always true: (p55 + p56 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p27 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p27 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p0 <= p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67)
lola: after: (p0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p0)
lola: after: (1 <= p0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67)
lola: after: (2 <= 0)
lola: always false
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p55 + p56 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p55 + p56 <= 1)
lola: LP says that atomic proposition is always true: (p55 + p56 <= 1)
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 <= p29 + p30)
lola: after: (1 <= p29 + p30)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67 <= p22)
lola: after: (1 <= p22)
lola: LP says that atomic proposition is always false: (3 <= p24 + p25)
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: always true
lola: LP says that atomic proposition is always false: (3 <= p24 + p25)
lola: place invariant simplifies atomic proposition
lola: before: (p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67 <= p27)
lola: after: (1 <= p27)
lola: A (G (((p55 + p56 <= p0)))) : A (G ((2 <= p27))) : E (F ((p0 <= p55 + p56))) : A (G (())) : E (F (((p53 + 1 <= p24 + p25) AND (p27 <= 2) AND (p23 <= 0)))) : A (G (((1 <= p22) OR ((2 <= p27) AND (p53 + 1 <= p0))))) : A (G (((p53 <= 2) OR (p0 <= 2) OR (2 <= p0)))) : A (G ((1 <= p0))) : A (G (())) : A (G (())) : E (F (((p24 + p25 + 1 <= p28) AND (p31 <= 2) AND (2 <= p0)))) : E (F ((p0 <= p24 + p25))) : E (F (((p28 <= p55 + p56) AND ((2 <= p0) OR (p53 <= p0)) AND (1 <= p26) AND (p31 <= p29 + p30) AND (p29 + p30 <= 0)))) : A (G (())) : A (G (())) : E (F (()))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 18 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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-ReachabilityCardinality-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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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-ReachabilityCardinality-8 TRUE 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: 18 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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-ReachabilityCardinality-9 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: 18 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 292 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: 18 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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-ReachabilityCardinality-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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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-ReachabilityCardinality-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: A (G ((1 <= p0)))
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 <= p0)))
lola: processed formula length: 17
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: (p0 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 92602 markings, 148474 edges, 18520 markings/sec, 0 secs
lola: sara is running 5 secs || 185906 markings, 296132 edges, 18661 markings/sec, 5 secs
lola: sara is running 10 secs || 278492 markings, 441338 edges, 18517 markings/sec, 10 secs
lola: sara is running 15 secs || 368450 markings, 580739 edges, 17992 markings/sec, 15 secs
lola: sara is running 20 secs || 461151 markings, 722085 edges, 18540 markings/sec, 20 secs
lola: sara is running 25 secs || 553656 markings, 862411 edges, 18501 markings/sec, 25 secs
lola: sara is running 30 secs || 646427 markings, 1001062 edges, 18554 markings/sec, 30 secs
lola: sara is running 35 secs || 739250 markings, 1139222 edges, 18565 markings/sec, 35 secs
lola: sara is running 40 secs || 834457 markings, 1280030 edges, 19041 markings/sec, 40 secs
lola: sara is running 45 secs || 929640 markings, 1419866 edges, 19037 markings/sec, 45 secs
lola: sara is running 50 secs || 1026202 markings, 1560880 edges, 19312 markings/sec, 50 secs
lola: sara is running 55 secs || 1119696 markings, 1698419 edges, 18699 markings/sec, 55 secs
lola: sara is running 60 secs || 1217055 markings, 1839701 edges, 19472 markings/sec, 60 secs
lola: sara is running 65 secs || 1311373 markings, 1977849 edges, 18864 markings/sec, 65 secs
lola: sara is running 70 secs || 1406891 markings, 2115972 edges, 19104 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1458261 markings, 2191053 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p27)))
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 ((2 <= p27)))
lola: processed formula length: 18
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: (p27 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p53 <= 2) OR (p0 <= 2) OR (2 <= p0))))
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 (((p53 <= 2) OR (p0 <= 2) OR (2 <= p0))))
lola: processed formula length: 48
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: ((3 <= p53) AND (3 <= p0) AND (p0 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= p55 + p56)))
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 ((p0 <= p55 + p56)))
lola: processed formula length: 25
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: (p0 <= p55 + p56)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 85886 markings, 137317 edges, 17177 markings/sec, 0 secs
lola: sara is running 5 secs || 174264 markings, 277781 edges, 17676 markings/sec, 5 secs
lola: sara is running 10 secs || 263916 markings, 420182 edges, 17930 markings/sec, 10 secs
lola: sara is running 15 secs || 356105 markings, 564556 edges, 18438 markings/sec, 15 secs
lola: sara is running 20 secs || 450709 markings, 711623 edges, 18921 markings/sec, 20 secs
lola: sara is running 25 secs || 549603 markings, 862911 edges, 19779 markings/sec, 25 secs
lola: sara is running 30 secs || 639070 markings, 1005760 edges, 17893 markings/sec, 30 secs
lola: sara is running 35 secs || 737445 markings, 1153921 edges, 19675 markings/sec, 35 secs
lola: sara is running 40 secs || 828455 markings, 1299248 edges, 18202 markings/sec, 40 secs
lola: sara is running 45 secs || 931175 markings, 1453972 edges, 20544 markings/sec, 45 secs
lola: sara is running 50 secs || 1018852 markings, 1594210 edges, 17535 markings/sec, 50 secs
lola: sara is running 55 secs || 1113100 markings, 1741314 edges, 18850 markings/sec, 55 secs
lola: sara is running 60 secs || 1216471 markings, 1893415 edges, 20674 markings/sec, 60 secs
lola: sara is running 65 secs || 1309678 markings, 2042217 edges, 18641 markings/sec, 65 secs
lola: sara is running 70 secs || 1405078 markings, 2191365 edges, 19080 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1458260 markings, 2274435 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p55 + p56 <= p0))))
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 (((p55 + p56 <= p0))))
lola: processed formula length: 27
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: ((p0 + 1 <= p55 + p56))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 87182 markings, 139432 edges, 17436 markings/sec, 0 secs
lola: sara is running 5 secs || 176374 markings, 281139 edges, 17838 markings/sec, 5 secs
lola: sara is running 10 secs || 267277 markings, 425642 edges, 18181 markings/sec, 10 secs
lola: sara is running 15 secs || 360321 markings, 571440 edges, 18609 markings/sec, 15 secs
lola: sara is running 20 secs || 454514 markings, 717348 edges, 18839 markings/sec, 20 secs
lola: sara is running 25 secs || 553653 markings, 869076 edges, 19828 markings/sec, 25 secs
lola: sara is running 30 secs || 642042 markings, 1010404 edges, 17678 markings/sec, 30 secs
lola: sara is running 35 secs || 741333 markings, 1160394 edges, 19858 markings/sec, 35 secs
lola: sara is running 40 secs || 832444 markings, 1305496 edges, 18222 markings/sec, 40 secs
lola: sara is running 45 secs || 936611 markings, 1462241 edges, 20833 markings/sec, 45 secs
lola: sara is running 50 secs || 1024829 markings, 1602613 edges, 17644 markings/sec, 50 secs
lola: sara is running 55 secs || 1121142 markings, 1753099 edges, 19263 markings/sec, 55 secs
lola: sara is running 60 secs || 1222780 markings, 1903964 edges, 20328 markings/sec, 60 secs
lola: sara is running 65 secs || 1316414 markings, 2053108 edges, 18727 markings/sec, 65 secs
lola: sara is running 70 secs || 1411015 markings, 2200877 edges, 18920 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1458260 markings, 2274435 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= p24 + p25)))
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 ((p0 <= p24 + p25)))
lola: processed formula length: 25
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: (p0 <= p24 + p25)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 142)
lola: sara is running 0 secs || 92791 markings, 149022 edges, 18558 markings/sec, 0 secs
lola: sara is running 5 secs || 186740 markings, 297859 edges, 18790 markings/sec, 5 secs
lola: sara is running 10 secs || 281934 markings, 446998 edges, 19039 markings/sec, 10 secs
lola: sara is running 15 secs || 375031 markings, 591935 edges, 18619 markings/sec, 15 secs
lola: sara is running 20 secs || 472652 markings, 739847 edges, 19524 markings/sec, 20 secs
lola: sara is running 25 secs || 569027 markings, 885664 edges, 19275 markings/sec, 25 secs
lola: sara is running 30 secs || 666807 markings, 1031785 edges, 19556 markings/sec, 30 secs
lola: sara is running 35 secs || 764656 markings, 1177154 edges, 19570 markings/sec, 35 secs
lola: sara is running 40 secs || 864356 markings, 1324563 edges, 19940 markings/sec, 40 secs
lola: sara is running 45 secs || 965261 markings, 1472762 edges, 20181 markings/sec, 45 secs
lola: sara is running 50 secs || 1065675 markings, 1619847 edges, 20083 markings/sec, 50 secs
lola: sara is running 55 secs || 1165172 markings, 1765015 edges, 19899 markings/sec, 55 secs
lola: sara is running 60 secs || 1265891 markings, 1912130 edges, 20144 markings/sec, 60 secs
lola: sara is running 65 secs || 1368388 markings, 2060914 edges, 20499 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1458261 markings, 2191053 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p22) OR ((2 <= p27) AND (p53 + 1 <= p0)))))
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 <= p22) OR ((2 <= p27) AND (p53 + 1 <= p0)))))
lola: processed formula length: 57
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: ((p22 <= 0) AND ((p27 <= 1) OR (p0 <= p53)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p53 + 1 <= p24 + p25) AND (p27 <= 2) AND (p23 <= 0))))
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 (((p53 + 1 <= p24 + p25) AND (p27 <= 2) AND (p23 <= 0))))
lola: processed formula length: 62
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: ((p53 + 1 <= p24 + p25) AND (p27 <= 2) AND (p23 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-13-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 109 markings, 108 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p24 + p25 + 1 <= p28) AND (p31 <= 2) AND (2 <= p0))))
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 (((p24 + p25 + 1 <= p28) AND (p31 <= 2) AND (2 <= p0))))
lola: processed formula length: 61
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: ((p24 + p25 + 1 <= p28) AND (p31 <= 2) AND (2 <= p0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p28 <= p55 + p56) AND ((2 <= p0) OR (p53 <= p0)) AND (1 <= p26) AND (p31 <= p29 + p30) AND (p29 + p30 <= 0))))
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 (((p28 <= p55 + p56) AND ((2 <= p0) OR (p53 <= p0)) AND (1 <= p26) AND (p31 <= p29 + p30) AND (p29 + p30 <= 0))))
lola: processed formula length: 119
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality.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: ((p28 <= p55 + p56) AND ((2 <= p0) OR (p53 <= p0)) AND (1 <= p26) AND (p31 <= p29 + p30) AND (p29 + p30 <= 0))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes yes yes yes yes no yes yes yes no
lola:
preliminary result: yes no no yes yes no yes yes yes yes yes no yes yes yes no
lola: memory consumption: 24560 KB
lola: time consumption: 363 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-152646306100152"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;