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 204K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 32K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470000843
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527062656558

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ PhilosophersDyn-COL-10 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2480/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-10-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: NOT(E (G (TRUE))) : A ((A (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) U ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + 1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)))) : NOT(E (F (((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))) : E (G (NOT(A (X ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))) : NOT(A (F (A (F ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))) : ((A (F ((3 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) AND A (F (FALSE))) AND E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))))) : NOT(E (F (A (G (TRUE))))) : (E ((((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) U ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))) AND (E (F ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 1))) AND ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR (2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) : NOT(((((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND E (X ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))) OR (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 1) OR (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= 0)) AND A (F ((3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))) : E ((E (X ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))) U A (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)) OR NOT(E (F (((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))))) : A (((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) U A (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : A (((1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) U A (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : A (G (E (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))))) : A (F (E (G (((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))))) : A (G ((E (X ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) OR E (X (TRUE)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
check_solution: Constraint R1 = 6.91811743551e-310 is above its upper bound -3
check_solution: Constraint R22 = 0 is above its equality of -1
check_solution: Constraint R23 = 0 is above its equality of -1
check_solution: Constraint R24 = 0 is above its equality of -1
check_solution: Constraint R25 = 0 is above its equality of -1
check_solution: Constraint R26 = 0 is above its equality of -1
check_solution: Constraint R27 = 0 is above its equality of -1
check_solution: Constraint R28 = 0 is above its equality of -1
check_solution: Constraint R29 = 0 is above its equality of -1
check_solution: Constraint R30 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 3 (rel. error 1)

FORMULA PhilosophersDyn-COL-10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: ========================================
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

FORMULA PhilosophersDyn-COL-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))))
lola: processed formula length: 168
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 624 markings, 1601 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)) OR A (X ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= 0)))) AND (((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (1 <= p159 + p158 + p157... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150))
lola: processed formula length: 155
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: processed formula with 2 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 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))
lola: processed formula length: 201
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 2)))
lola: processed formula length: 82
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))) U A (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(EX((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) U A(TRUE U (2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: processed formula length: 234
lola: 47 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 231 markings, 357 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) OR NOT DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:288
lola: processed formula: NOT(E(TRUE U (NOT(EX((p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))) AND DEADLOCK)))
lola: processed formula length: 179
lola: 48 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 8 markings, 7 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) OR (p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= 2))))
lola: processed formula length: 233
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: ((p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) AND (3 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-10-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 16111 markings, 45064 edges, 3222 markings/sec, 0 secs
lola: sara is running 5 secs || 32716 markings, 94550 edges, 3321 markings/sec, 5 secs
lola: sara is running 10 secs || 49324 markings, 143042 edges, 3322 markings/sec, 10 secs
lola: sara is running 15 secs || 66374 markings, 196301 edges, 3410 markings/sec, 15 secs
lola: sara is running 20 secs || 82523 markings, 246839 edges, 3230 markings/sec, 20 secs
lola: sara is running 25 secs || 99121 markings, 299152 edges, 3320 markings/sec, 25 secs
lola: sara is running 30 secs || 115440 markings, 350297 edges, 3264 markings/sec, 30 secs
lola: sara is running 35 secs || 131678 markings, 401840 edges, 3248 markings/sec, 35 secs
lola: sara is running 40 secs || 148652 markings, 455934 edges, 3395 markings/sec, 40 secs
lola: sara is running 45 secs || 165578 markings, 510303 edges, 3385 markings/sec, 45 secs
lola: sara is running 50 secs || 181412 markings, 559897 edges, 3167 markings/sec, 50 secs
lola: sara is running 55 secs || 197172 markings, 610145 edges, 3152 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 199051 markings, 617350 edges
lola:
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))
lola: processed formula length: 255
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= 2)))
lola: processed formula length: 82
lola: 44 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 1)
lola: processed formula length: 74
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 201 markings, 300 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 +... (shortened)
lola: processed formula length: 614
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1) OR (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)))))
lola: processed formula length: 230
lola: 47 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8 markings, 15 edges

FORMULA PhilosophersDyn-COL-10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(A(TRUE U (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p... (shortened)
lola: processed formula length: 835
lola: 46 rewrites
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: 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: 52 markings, 105 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + 1 <= p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)) OR A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1) OR (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no yes yes yes no no unknown yes no unknown no no no no no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 66996 KB
lola: time consumption: 1876 seconds
lola: time limit reached - aborting
lola:
preliminary result: no no yes yes yes no no unknown yes no unknown no no no no no
lola:
preliminary result: no no yes yes yes no no unknown yes no unknown no no no no no
lola: memory consumption: 66996 KB
lola: time consumption: 3569 seconds

BK_TIME_CONFINEMENT_REACHED

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PhilosophersDyn-COL-10, 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 r112-csrt-152666470000843"
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 ;