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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is DrinkVendingMachine-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264000196
=====================================================================

--------------------
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 DrinkVendingMachine-COL-10-ReachabilityCardinality-0
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-1
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-15
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-2
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-3
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-4
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-5
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-6
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-7
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-8
FORMULA_NAME DrinkVendingMachine-COL-10-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494677620571


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DrinkVendingMachine-COL-10 @ 3540 seconds
----- 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: 111280/65536 symbol table entries, 87056 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 111160 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48320 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-10-ReachabilityCardinality.task
lola: E (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))) : A (G ((3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : E (F ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR ((2 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND (p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79))) AND ((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80))))) : A (G ((2 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : A (G (((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110)))) : A (G ((2 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : A (G ((((2 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) OR (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110))))) : E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110))))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)) AND (p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)))) : E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= 2) OR ((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 2) AND (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))))) : A (G ((((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) AND (2 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80)) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= 1) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0) OR ((1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80))))) : A (G (((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))) : A (G ((((1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) AND ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= 0))))) : E (F ((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79))) : E (F ((((2 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) AND ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))))) : E (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR ((2 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND (p90 + p91 + ... (shortened)
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 8 bytes per marking, with 4 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110))))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) OR (p119 + p118 + p11... (shortened)
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 8 bytes per marking, with 4 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 555 markings, 804 edges, 111 markings/sec, 5 secs
lola: sara is running 10 secs || 1499 markings, 3727 edges, 189 markings/sec, 10 secs
lola: sara is running 15 secs || 2377 markings, 6164 edges, 176 markings/sec, 15 secs
lola: sara is running 20 secs || 3199 markings, 8482 edges, 164 markings/sec, 20 secs
lola: sara is running 25 secs || 3977 markings, 11220 edges, 156 markings/sec, 25 secs
lola: sara is running 30 secs || 4938 markings, 13816 edges, 192 markings/sec, 30 secs
lola: sara is running 35 secs || 5876 markings, 17081 edges, 188 markings/sec, 35 secs
lola: sara is running 40 secs || 6781 markings, 20262 edges, 181 markings/sec, 40 secs
lola: sara is running 45 secs || 7700 markings, 23821 edges, 184 markings/sec, 45 secs
lola: sara is running 50 secs || 8621 markings, 26912 edges, 184 markings/sec, 50 secs
lola: sara is running 55 secs || 9518 markings, 30404 edges, 179 markings/sec, 55 secs
lola: sara is running 60 secs || 10435 markings, 34149 edges, 183 markings/sec, 60 secs
lola: sara is running 65 secs || 11379 markings, 37828 edges, 189 markings/sec, 65 secs
lola: sara is running 70 secs || 12270 markings, 40929 edges, 178 markings/sec, 70 secs
lola: sara is running 75 secs || 13176 markings, 44679 edges, 181 markings/sec, 75 secs
lola: sara is running 80 secs || 14107 markings, 48365 edges, 186 markings/sec, 80 secs
lola: sara is running 85 secs || 15039 markings, 50952 edges, 186 markings/sec, 85 secs
lola: sara is running 90 secs || 16008 markings, 54326 edges, 194 markings/sec, 90 secs
lola: sara is running 95 secs || 16954 markings, 57557 edges, 189 markings/sec, 95 secs
lola: sara is running 100 secs || 17893 markings, 61223 edges, 188 markings/sec, 100 secs
lola: sara is running 105 secs || 18850 markings, 64851 edges, 191 markings/sec, 105 secs
lola: sara is running 110 secs || 19781 markings, 68251 edges, 186 markings/sec, 110 secs
lola: sara is running 115 secs || 20609 markings, 71370 edges, 166 markings/sec, 115 secs
lola: sara is running 120 secs || 21421 markings, 74550 edges, 162 markings/sec, 120 secs
lola: sara is running 125 secs || 22191 markings, 77328 edges, 154 markings/sec, 125 secs
lola: sara is running 130 secs || 22989 markings, 79659 edges, 160 markings/sec, 130 secs
lola: sara is running 135 secs || 23821 markings, 82294 edges, 166 markings/sec, 135 secs
lola: sara is running 140 secs || 24565 markings, 84823 edges, 149 markings/sec, 140 secs
lola: sara is running 145 secs || 25303 markings, 87411 edges, 148 markings/sec, 145 secs
lola: sara is running 150 secs || 26085 markings, 90133 edges, 156 markings/sec, 150 secs
lola: sara is running 155 secs || 26842 markings, 93139 edges, 151 markings/sec, 155 secs
lola: sara is running 160 secs || 27624 markings, 95834 edges, 156 markings/sec, 160 secs
lola: sara is running 165 secs || 28441 markings, 98912 edges, 163 markings/sec, 165 secs
lola: sara is running 170 secs || 29266 markings, 101970 edges, 165 markings/sec, 170 secs
lola: sara is running 175 secs || 30145 markings, 104667 edges, 176 markings/sec, 175 secs
lola: sara is running 180 secs || 31162 markings, 107791 edges, 203 markings/sec, 180 secs
lola: sara is running 185 secs || 32137 markings, 110844 edges, 195 markings/sec, 185 secs
lola: sara is running 190 secs || 33061 markings, 114173 edges, 185 markings/sec, 190 secs
lola: sara is running 195 secs || 33930 markings, 117159 edges, 174 markings/sec, 195 secs
lola: sara is running 200 secs || 34923 markings, 120887 edges, 199 markings/sec, 200 secs
lola: sara is running 205 secs || 35943 markings, 124685 edges, 204 markings/sec, 205 secs
lola: sara is running 210 secs || 36995 markings, 129193 edges, 210 markings/sec, 210 secs
lola: sara is running 215 secs || 38002 markings, 132910 edges, 201 markings/sec, 215 secs
lola: sara is running 220 secs || 39019 markings, 136764 edges, 203 markings/sec, 220 secs
lola: sara is running 225 secs || 39982 markings, 140705 edges, 193 markings/sec, 225 secs
lola: sara is running 230 secs || 40845 markings, 144245 edges, 173 markings/sec, 230 secs
lola: sara is running 235 secs || 41667 markings, 147174 edges, 164 markings/sec, 235 secs
lola: sara is running 240 secs || 42509 markings, 150669 edges, 168 markings/sec, 240 secs
lola: sara is running 245 secs || 43271 markings, 153706 edges, 152 markings/sec, 245 secs
lola: sara is running 250 secs || 44094 markings, 157023 edges, 165 markings/sec, 250 secs
lola: sara is running 255 secs || 44876 markings, 160151 edges, 156 markings/sec, 255 secs
lola: sara is running 260 secs || 45731 markings, 163118 edges, 171 markings/sec, 260 secs
lola: sara is running 265 secs || 46497 markings, 166476 edges, 153 markings/sec, 265 secs
lola: sara is running 270 secs || 47250 markings, 169519 edges, 151 markings/sec, 270 secs
lola: sara is running 275 secs || 48082 markings, 173142 edges, 166 markings/sec, 275 secs
lola: sara is running 280 secs || 48887 markings, 175122 edges, 161 markings/sec, 280 secs
lola: sara is running 285 secs || 49717 markings, 177926 edges, 166 markings/sec, 285 secs
lola: sara is running 290 secs || 50498 markings, 180764 edges, 156 markings/sec, 290 secs
lola: sara is running 295 secs || 51346 markings, 183719 edges, 170 markings/sec, 295 secs
lola: sara is running 300 secs || 52087 markings, 186298 edges, 148 markings/sec, 300 secs
lola: sara is running 305 secs || 52906 markings, 189226 edges, 164 markings/sec, 305 secs
lola: sara is running 310 secs || 53672 markings, 192141 edges, 153 markings/sec, 310 secs
lola: sara is running 315 secs || 54404 markings, 195190 edges, 146 markings/sec, 315 secs
lola: sara is running 320 secs || 55109 markings, 197191 edges, 141 markings/sec, 320 secs
lola: sara is running 325 secs || 55833 markings, 200151 edges, 145 markings/sec, 325 secs
lola: sara is running 330 secs || 56446 markings, 202433 edges, 123 markings/sec, 330 secs
lola: sara is running 335 secs || 57170 markings, 205254 edges, 145 markings/sec, 335 secs
lola: sara is running 340 secs || 58007 markings, 207407 edges, 167 markings/sec, 340 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + ... (shortened)
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + 1 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80) AND ((p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + ... (shortened)
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 8 bytes per marking, with 4 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110 <= 2)... (shortened)
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 8 bytes per marking, with 4 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) AND (2 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80)) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= 1... (shortened)
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 8 bytes per marking, with 4 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65... (shortened)
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 8 bytes per marking, with 4 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 771 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p111 + p110) OR (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + ... (shortened)
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 8 bytes per marking, with 4 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1026 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (3 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p119 + p118 + p11... (shortened)
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 8 bytes per marking, with 4 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 69 markings, 68 edges, 14 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3060 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no unknown yes yes yes no no no yes yes yes
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494678109277

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="DrinkVendingMachine-COL-10"
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/DrinkVendingMachine-COL-10.tgz
mv DrinkVendingMachine-COL-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is DrinkVendingMachine-COL-10, 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-blw3-149440264000196"
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 ;