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 mcc4mcc-structural
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 r035-ebro-152646315100150
=====================================================================

--------------------
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 1527084321939


BK_STOP 1527084569041

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-COL-V20P20N10 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 297195, 'Memory': 1145.86, 'Tool': 'lola'}, {'Time': 303712, 'Memory': 1177.64, 'Tool': 'lola'}, {'Time': 1769501, 'Memory': 1743.46, 'Tool': 'gspn'}, {'Time': 1788558, 'Memory': 1713.3, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V20P20N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N10: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-COL-V20P20N10 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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: ((2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62) OR A (F (((p63 + 1 <= p24) AND (3 <= p63))))) : ((A (G (((p36 <= p24) OR (2 <= p21)))) OR (E (F ((p23 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) OR (p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) AND (NOT(A (G ((p39 + p40 <= p63)))) OR (p22 <= 2))) : NOT(E (G ((((p24 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62) AND (p37 + p38 <= p65)) OR (p64 <= 2))))) : A (G ((1 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) : (A (G ((p41 <= p21))) AND (E (((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 <= p66 + p67) U (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND ((p64 <= 0) AND ((p22 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62) OR (3 <= p23)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1)))) : E ((E (X ((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 <= p66 + p67))) U E (G ((p37 + p38 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))) : A (G (((1 <= p23) OR ((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p41 <= 0))))) : (E (((p63 <= p41) U (p23 <= p63))) AND ((E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND A (F ((p41 <= p64)))) OR (p65 <= p64))) : E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) : (A (G (A (F ((p37 + p38 <= p65))))) OR (E (((3 <= p22) U (2 <= p37 + p38))) OR (1 <= p63))) : A ((A (F ((2 <= p65))) U ((3 <= p41) AND (2 <= p21) AND (3 <= p36)))) : E (X (E (F (((3 <= p63) AND (p21 <= p65)))))) : A (F (((p37 + p38 <= p23) AND (p22 <= p41) AND ((p24 <= p21) OR (2 <= p23)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p64) OR (2 <= p63) OR (2 <= p64))))) : (E (F (((3 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p39 + p40 <= p64) OR (p36 <= 1)))) AND E (X (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p66 + p67)))))) : A (G (NOT(E (F ((3 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62)))))) : A ((A (F ((2 <= p66 + p67))) U (2 <= p63)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62) OR A (F (((p63 + 1 <= p24) AND (3 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62)
lola: processed formula length: 130
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p63 + 1 <= p24) AND (3 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p63 + 1 <= p24) AND (3 <= p63))))
lola: processed formula: A (F (((p63 + 1 <= p24) AND (3 <= p63))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p36 <= p24) OR (2 <= p21)))) OR (E (F ((p23 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) OR (p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) AND (NOT(A (G ((p39 + p40 <= p63)))) OR (p22 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p36 <= p24) OR (2 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p23 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 11)
lola: sara is running 0 secs || 70691 markings, 133029 edges, 14138 markings/sec, 0 secs
lola: sara is running 5 secs || 143687 markings, 275592 edges, 14599 markings/sec, 5 secs
lola: sara is running 10 secs || 217807 markings, 423731 edges, 14824 markings/sec, 10 secs
lola: sara is running 15 secs || 294290 markings, 576610 edges, 15297 markings/sec, 15 secs
lola: sara is running 20 secs || 368522 markings, 726090 edges, 14846 markings/sec, 20 secs
lola: sara is running 25 secs || 442954 markings, 877396 edges, 14886 markings/sec, 25 secs
lola: sara is running 30 secs || 518165 markings, 1028784 edges, 15042 markings/sec, 30 secs
lola: sara is running 35 secs || 592915 markings, 1178547 edges, 14950 markings/sec, 35 secs
lola: sara is running 40 secs || 667790 markings, 1330062 edges, 14975 markings/sec, 40 secs
lola: sara is running 45 secs || 743732 markings, 1485368 edges, 15188 markings/sec, 45 secs
lola: sara is running 50 secs || 819358 markings, 1635570 edges, 15125 markings/sec, 50 secs
lola: sara is running 55 secs || 893096 markings, 1785693 edges, 14748 markings/sec, 55 secs
lola: sara is running 60 secs || 968309 markings, 1937741 edges, 15043 markings/sec, 60 secs
lola: sara is running 65 secs || 1043425 markings, 2089456 edges, 15023 markings/sec, 65 secs
lola: sara is running 70 secs || 1119339 markings, 2243572 edges, 15183 markings/sec, 70 secs
lola: sara is running 75 secs || 1194511 markings, 2395240 edges, 15034 markings/sec, 75 secs
lola: sara is running 80 secs || 1270008 markings, 2548652 edges, 15099 markings/sec, 80 secs
lola: sara is running 85 secs || 1346484 markings, 2703450 edges, 15295 markings/sec, 85 secs
lola: sara is running 90 secs || 1419804 markings, 2851628 edges, 14664 markings/sec, 90 secs
lola: sara is running 95 secs || 1495100 markings, 3006100 edges, 15059 markings/sec, 95 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1512921 markings, 3041063 edges
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)
lola: processed formula length: 196
lola: 3 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((((p24 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62) AND (p37 + p38 <= p65)) OR (p64 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p24) OR (p65 + 1 <= p37 + p38)) AND (3 <= p64))))
lola: processed formula: A (F ((((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p24) OR (p65 + 1 <= p37 + p38)) AND (3 <= p64))))
lola: processed formula length: 190
lola: 3 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p41 <= p21))) AND (E (((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 <= p66 + p67) U (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND ((p64 <= 0) AND ((p22 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p41 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 <= p66 + p67))) U E (G ((p37 + p38 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: processed formula: E(EX((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 <= p66 + p67)) U NOT(A(TRUE U (p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + 1 <= p37 + p38))))
========================================lola:
processed formula length: 245
lola: 4 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 170 markings, 170 edges
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p23) OR ((p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p41 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 71910 markings, 135348 edges, 14382 markings/sec, 0 secs
lola: sara is running 5 secs || 145411 markings, 278964 edges, 14700 markings/sec, 5 secs
lola: sara is running 10 secs || 219226 markings, 426439 edges, 14763 markings/sec, 10 secs
lola: sara is running 15 secs || 294616 markings, 577276 edges, 15078 markings/sec, 15 secs
lola: sara is running 20 secs || 368635 markings, 726294 edges, 14804 markings/sec, 20 secs
lola: sara is running 25 secs || 443166 markings, 877663 edges, 14906 markings/sec, 25 secs
lola: sara is running 30 secs || 518521 markings, 1029466 edges, 15071 markings/sec, 30 secs
lola: sara is running 35 secs || 593537 markings, 1179738 edges, 15003 markings/sec, 35 secs
lola: sara is running 40 secs || 668690 markings, 1332126 edges, 15031 markings/sec, 40 secs
lola: sara is running 45 secs || 744574 markings, 1487175 edges, 15177 markings/sec, 45 secs
lola: sara is running 50 secs || 819368 markings, 1635585 edges, 14959 markings/sec, 50 secs
lola: sara is running 55 secs || 894936 markings, 1789336 edges, 15114 markings/sec, 55 secs
lola: sara is running 60 secs || 969629 markings, 1940282 edges, 14939 markings/sec, 60 secs
lola: sara is running 65 secs || 1044927 markings, 2092391 edges, 15060 markings/sec, 65 secs
lola: sara is running 70 secs || 1120911 markings, 2247312 edges, 15197 markings/sec, 70 secs
lola: sara is running 75 secs || 1196097 markings, 2398567 edges, 15037 markings/sec, 75 secs
lola: sara is running 80 secs || 1270917 markings, 2550210 edges, 14964 markings/sec, 80 secs
lola: sara is running 85 secs || 1347119 markings, 2704613 edges, 15240 markings/sec, 85 secs
lola: sara is running 90 secs || 1422268 markings, 2856387 edges, 15030 markings/sec, 90 secs
lola: sara is running 95 secs || 1498150 markings, 3012014 edges, 15176 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1512921 markings, 3041063 edges
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p63 <= p41) U (p23 <= p63))) AND ((E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND A (F ((p41 <= p64)))) OR (p65 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p63 <= p41) U (p23 <= p63)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p63 <= p41) U (p23 <= p63))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9495 markings, 23510 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0)))
lola: processed formula length: 135
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 170 markings, 169 edges
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p41 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p41 <= p64)))
lola: processed formula: A (F ((p41 <= p64)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0)))
lola: processed formula length: 135
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 170 markings, 169 edges
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p37 + p38 <= p65))))) OR (E (((3 <= p22) U (2 <= p37 + p38))) OR (1 <= p63)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p37 + p38 <= p65)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p37 + p38 <= p65)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: 1589 markings, 2238 edges
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p22) U (2 <= p37 + p38)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p22) U (2 <= p37 + p38))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p63)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p63)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p65))) U ((3 <= p41) AND (2 <= p21) AND (3 <= p36))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (2 <= p65)) U ((3 <= p41) AND (2 <= p21) AND (3 <= p36)))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((3 <= p63) AND (p21 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U ((3 <= p63) AND (p21 <= p65))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 132 markings, 131 edges
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p37 + p38 <= p23) AND (p22 <= p41) AND ((p24 <= p21) OR (2 <= p23)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p64) OR (2 <= p63) OR (2 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p37 + p38 <= p23) AND (p22 <= p41) AND ((p24 <= p21) OR (2 <= p23)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p64) OR (2 <= p63) OR (2 <= p64)))))
lola: processed formula: A (F (((p37 + p38 <= p23) AND (p22 <= p41) AND ((p24 <= p21) OR (2 <= p23)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p64) OR (2 <= p63) OR (2 <= p64)))))
lola: processed formula length: 238
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 285 markings, 295 edges
lola: ========================================
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p39 + p40 <= p64) OR (p36 <= 1)))) AND E (X (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p66 + p67))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p39 + p40 <= p64) OR (p36 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p66 + p67)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (p66 + p67 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))
lola: processed formula length: 151
lola: 3 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 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: 881 markings, 1280 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((3 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14.sara
lola: ========================================
lola: subprocess 15 will run for 3337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p66 + p67))) U (2 <= p63)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (2 <= p66 + p67)) U (2 <= p63))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 0 unused bits
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: 170 markings, 170 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes yes yes no no yes no no yes no
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="mcc4mcc-structural"
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 mcc4mcc-structural"
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 r035-ebro-152646315100150"
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 '' CTLCardinality.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 ;