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.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.6K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 4.0K 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-V20P10N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306100131
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526520624853

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V20P10N10 @ 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-V20P10N10-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p67 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p67 <= 1)
lola: LP says that atomic proposition is always false: (2 <= p30 + p31)
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 <= p67)
lola: after: (1 <= p67)
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 <= p67)
lola: after: (1 <= p67)
lola: LP says that atomic proposition is always false: (2 <= p30 + p31)
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: place invariant simplifies atomic proposition
lola: before: (p27 <= p65 + p64 + p63 + p62 + p61 + p56 + p57 + p58 + p59 + p60 + p66)
lola: after: (p27 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 <= p23)
lola: after: (1 <= p23)
lola: LP says that atomic proposition is always false: (3 <= p24 + p25)
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 <= p0)
lola: after: (1 <= p0)
lola: place invariant simplifies atomic proposition
lola: before: (p65 + p64 + p63 + p62 + p61 + p56 + p57 + p58 + p59 + p60 + p66 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p28 + p29)
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: 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)
lola: after: (1 <= p32)
lola: place invariant simplifies atomic proposition
lola: before: (p22 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: after: (p22 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
lola: after: (0 <= 0)
lola: always true
lola: A (G (((p24 + p25 + 1 <= p67) OR (2 <= p67) OR (p33 + 1 <= p28 + p29) OR (p23 <= 1)))) : A (G ((((2 <= p0) AND (3 <= p32)) OR (p30 + p31 + 1 <= p26)))) : A (G (((p23 <= p32) OR (1 <= p67)))) : E (F ((p67 <= 0))) : A (G ((1 <= p67))) : E (F (((3 <= p55) AND (p27 <= 2) AND (((p33 <= p0) AND (3 <= p23)))))) : A (G (((p0 <= 0) OR (p22 <= 0) OR ((1 <= p23) AND (3 <= p26) AND (p30 + p31 <= p32))))) : E (F (FALSE)) : E (F ((p27 <= 1))) : E (F (((1 <= p23) AND (p67 <= p32)))) : A (G ((p0 <= p67))) : E (F (((p26 <= 2) AND (p55 <= 0)))) : A (G (())) : E (F (FALSE)) : A (G (())) : E (F (()))
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: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: 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 220 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: 15 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-ReachabilityCardinality-7 FALSE 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: 15 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-ReachabilityCardinality-12 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 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: 15 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-ReachabilityCardinality-14 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p67 <= 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 ((p67 <= 0)))
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: (p67 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-5-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: 21 markings, 20 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p27 <= 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 ((p27 <= 1)))
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: (p27 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p67)))
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 <= p67)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: (p67 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-7-0.sara
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= p67)))
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 ((p0 <= p67)))
lola: processed formula length: 19
lola: 17 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: (p67 + 1 <= p0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 56 markings, 55 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p26 <= 2) AND (p55 <= 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 (((p26 <= 2) AND (p55 <= 0))))
lola: processed formula length: 35
lola: 16 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: ((p26 <= 2) AND (p55 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-9-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p23 <= p32) OR (1 <= p67))))
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 (((p23 <= p32) OR (1 <= p67))))
lola: processed formula length: 37
lola: 17 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: ((p32 + 1 <= p23) AND (p67 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p23) AND (p67 <= p32))))
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 (((1 <= p23) AND (p67 <= p32))))
lola: processed formula length: 37
lola: 16 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: ((1 <= p23) AND (p67 <= p32))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p55) AND (p27 <= 2) AND (((p33 <= p0) AND (3 <= p23))))))
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 (((3 <= p55) AND (p27 <= 2) AND (((p33 <= p0) AND (3 <= p23))))))
lola: processed formula length: 70
lola: 16 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: ((3 <= p55) AND (p27 <= 2) AND (((p33 <= p0) AND (3 <= p23))))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-12-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: 31 markings, 30 edges

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p0) AND (3 <= p32)) OR (p30 + p31 + 1 <= p26))))
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 <= p0) AND (3 <= p32)) OR (p30 + p31 + 1 <= p26))))
lola: processed formula length: 63
lola: 17 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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) OR (p32 <= 2)) AND (p26 <= p30 + p31))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 95303 markings, 238042 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1759 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 <= 0) OR (p22 <= 0) OR ((1 <= p23) AND (3 <= p26) AND (p30 + p31 <= p32)))))
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 (((p0 <= 0) OR (p22 <= 0) OR ((1 <= p23) AND (3 <= p26) AND (p30 + p31 <= p32)))))
lola: processed formula length: 89
lola: 17 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: ((1 <= p0) AND (1 <= p22) AND ((p23 <= 0) OR (p26 <= 2) OR (p32 + 1 <= p30 + p31)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 82783 markings, 225556 edges, 16557 markings/sec, 0 secs
sara: warning, failure of lp_solve (at job 359)
lola: sara is running 5 secs || 173196 markings, 470771 edges, 18083 markings/sec, 5 secs
lola: sara is running 10 secs || 265100 markings, 719273 edges, 18381 markings/sec, 10 secs
lola: sara is running 15 secs || 355729 markings, 965552 edges, 18126 markings/sec, 15 secs
lola: sara is running 20 secs || 447429 markings, 1216732 edges, 18340 markings/sec, 20 secs
lola: sara is running 25 secs || 542561 markings, 1477032 edges, 19026 markings/sec, 25 secs
lola: sara is running 30 secs || 630510 markings, 1714848 edges, 17590 markings/sec, 30 secs
lola: sara is running 35 secs || 727609 markings, 1986297 edges, 19420 markings/sec, 35 secs
lola: sara is running 40 secs || 815160 markings, 2223382 edges, 17510 markings/sec, 40 secs
lola: sara is running 45 secs || 912822 markings, 2497481 edges, 19532 markings/sec, 45 secs
lola: sara is running 50 secs || 1001338 markings, 2742109 edges, 17703 markings/sec, 50 secs
lola: sara is running 55 secs || 1091354 markings, 2982061 edges, 18003 markings/sec, 55 secs
lola: sara is running 60 secs || 1185861 markings, 3253194 edges, 18901 markings/sec, 60 secs
lola: sara is running 65 secs || 1276683 markings, 3510061 edges, 18164 markings/sec, 65 secs
lola: sara is running 70 secs || 1364480 markings, 3743004 edges, 17559 markings/sec, 70 secs
lola: sara is running 75 secs || 1456258 markings, 3997086 edges, 18356 markings/sec, 75 secs
lola: sara is running 80 secs || 1551497 markings, 4281636 edges, 19048 markings/sec, 80 secs
lola: sara is running 85 secs || 1638242 markings, 4515420 edges, 17349 markings/sec, 85 secs
lola: sara is running 90 secs || 1728105 markings, 4756375 edges, 17973 markings/sec, 90 secs
lola: sara is running 95 secs || 1817525 markings, 5007717 edges, 17884 markings/sec, 95 secs
lola: sara is running 100 secs || 1912991 markings, 5293048 edges, 19093 markings/sec, 100 secs
lola: sara is running 105 secs || 2000103 markings, 5531409 edges, 17422 markings/sec, 105 secs
lola: sara is running 110 secs || 2085273 markings, 5757639 edges, 17034 markings/sec, 110 secs
lola: sara is running 115 secs || 2176070 markings, 6011624 edges, 18159 markings/sec, 115 secs
lola: sara is running 120 secs || 2266565 markings, 6272834 edges, 18099 markings/sec, 120 secs
lola: sara is running 125 secs || 2360186 markings, 6548741 edges, 18724 markings/sec, 125 secs
lola: sara is running 130 secs || 2444276 markings, 6772054 edges, 16818 markings/sec, 130 secs
lola: sara is running 135 secs || 2532309 markings, 7007462 edges, 17607 markings/sec, 135 secs
lola: sara is running 140 secs || 2622127 markings, 7262067 edges, 17964 markings/sec, 140 secs
lola: sara is running 145 secs || 2711373 markings, 7519585 edges, 17849 markings/sec, 145 secs
lola: sara is running 150 secs || 2806615 markings, 7804290 edges, 19048 markings/sec, 150 secs
lola: sara is running 155 secs || 2891858 markings, 8030432 edges, 17049 markings/sec, 155 secs
lola: sara is running 160 secs || 2978253 markings, 8260571 edges, 17279 markings/sec, 160 secs
lola: sara is running 165 secs || 3069372 markings, 8518018 edges, 18224 markings/sec, 165 secs
lola: sara is running 170 secs || 3158094 markings, 8767405 edges, 17744 markings/sec, 170 secs
lola: sara is running 175 secs || 3249832 markings, 9040130 edges, 18348 markings/sec, 175 secs
lola: sara is running 180 secs || 3340922 markings, 9301449 edges, 18218 markings/sec, 180 secs
lola: sara is running 185 secs || 3427004 markings, 9529028 edges, 17216 markings/sec, 185 secs
lola: sara is running 190 secs || 3514537 markings, 9763279 edges, 17507 markings/sec, 190 secs
lola: sara is running 195 secs || 3604593 markings, 10018891 edges, 18011 markings/sec, 195 secs
lola: sara is running 200 secs || 3693562 markings, 10273114 edges, 17794 markings/sec, 200 secs
lola: sara is running 205 secs || 3784641 markings, 10543429 edges, 18216 markings/sec, 205 secs
lola: sara is running 210 secs || 3876728 markings, 10809490 edges, 18417 markings/sec, 210 secs
lola: sara is running 215 secs || 3962553 markings, 11037769 edges, 17165 markings/sec, 215 secs
lola: sara is running 220 secs || 4048891 markings, 11268066 edges, 17268 markings/sec, 220 secs
lola: sara is running 225 secs || 4139845 markings, 11527210 edges, 18191 markings/sec, 225 secs
lola: sara is running 230 secs || 4227302 markings, 11769874 edges, 17491 markings/sec, 230 secs
lola: sara is running 235 secs || 4313802 markings, 12023283 edges, 17300 markings/sec, 235 secs
lola: sara is running 240 secs || 4409802 markings, 12311053 edges, 19200 markings/sec, 240 secs
lola: sara is running 245 secs || 4496747 markings, 12551452 edges, 17389 markings/sec, 245 secs
lola: sara is running 250 secs || 4582615 markings, 12778025 edges, 17174 markings/sec, 250 secs
lola: sara is running 255 secs || 4669404 markings, 13011631 edges, 17358 markings/sec, 255 secs
lola: sara is running 260 secs || 4759590 markings, 13270879 edges, 18037 markings/sec, 260 secs
lola: sara is running 265 secs || 4847150 markings, 13515128 edges, 17512 markings/sec, 265 secs
lola: sara is running 270 secs || 4933042 markings, 13766322 edges, 17178 markings/sec, 270 secs
lola: sara is running 275 secs || 5027955 markings, 14049607 edges, 18983 markings/sec, 275 secs
lola: sara is running 280 secs || 5116299 markings, 14301186 edges, 17669 markings/sec, 280 secs
lola: sara is running 285 secs || 5201467 markings, 14525974 edges, 17034 markings/sec, 285 secs
lola: sara is running 290 secs || 5287527 markings, 14755512 edges, 17212 markings/sec, 290 secs
lola: sara is running 295 secs || 5379022 markings, 15007040 edges, 18299 markings/sec, 295 secs
lola: sara is running 300 secs || 5465923 markings, 15250047 edges, 17380 markings/sec, 300 secs
lola: sara is running 305 secs || 5552622 markings, 15498519 edges, 17340 markings/sec, 305 secs
lola: sara is running 310 secs || 5639978 markings, 15745116 edges, 17471 markings/sec, 310 secs
lola: sara is running 315 secs || 5723668 markings, 15988552 edges, 16738 markings/sec, 315 secs
lola: sara is running 320 secs || 5806194 markings, 16245260 edges, 16505 markings/sec, 320 secs
lola: sara is running 325 secs || 5886571 markings, 16480400 edges, 16075 markings/sec, 325 secs
lola: sara is running 330 secs || 5971360 markings, 16704166 edges, 16958 markings/sec, 330 secs
lola: sara is running 335 secs || 6056522 markings, 16927621 edges, 17032 markings/sec, 335 secs
lola: sara is running 340 secs || 6142138 markings, 17163921 edges, 17123 markings/sec, 340 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6167028 markings, 17237101 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p24 + p25 + 1 <= p67) OR (2 <= p67) OR (p33 + 1 <= p28 + p29) OR (p23 <= 1))))
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 (((p24 + p25 + 1 <= p67) OR (2 <= p67) OR (p33 + 1 <= p28 + p29) OR (p23 <= 1))))
lola: processed formula length: 89
lola: 17 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: ((p67 <= p24 + p25) AND (p67 <= 1) AND (p28 + p29 <= p33) AND (2 <= p23))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityCardinality-0 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 no yes yes no yes yes no yes no
lola:
preliminary result: no no no yes no yes yes no yes yes no yes yes no yes no
lola: memory consumption: 24472 KB
lola: time consumption: 397 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-V20P10N10"
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-V20P10N10.tgz
mv BridgeAndVehicles-COL-V20P10N10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-COL-V20P10N10, 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-152646306100131"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;