Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326000005.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is PhilosophersDyn-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326000005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.5K Feb 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 1 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 32K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552848787848

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 LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ 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-LTLCardinality.task
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 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: A (G (((p160 + p161 + p162 + p163 + p169 + p168 + p167 + p166 + p165 + p164 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))) : A (X ((X ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)) U X ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))))) : A ((F (F ((3 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))) U F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))) : A (G ((G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) U X ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))))) : A (G (X (((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U (3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))))) : A (X (F (((p160 + p161 + p162 + p163 + p169 + p168 + p167 + p166 + p165 + p164 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) U (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : A (F (((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U X ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : A (X (F (F (G ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)))))) : A ((X (X ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))) U X (X ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))))) : A (X (F (F (F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))) : A ((X ((3 <= p160 + p161 + p162 + p163 + p169 + p168 + p167 + p166 + p165 + p164)) U ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U TRUE))) : A ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) : A ((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) : A ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) : A ((((1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U (1 <= p160 + p161 + p162 + p163 + p169 + p168 + p167 + p166 + p165 + p164)) U G (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))) : A ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
check_solution: Variable C2010 = -10 is below its lower bound 0
check_solution: Constraint R72 = 0 is above its equality of -1
check_solution: Constraint R73 = 0 is above its equality of -1
check_solution: Constraint R74 = 0 is above its equality of -1
check_solution: Constraint R75 = 0 is above its equality of -1
check_solution: Constraint R155 = 0 is above its equality of -1
check_solution: Constraint R156 = 0 is above its equality of -1
check_solution: Constraint R157 = 0 is above its equality of -1
check_solution: Constraint R158 = 0 is above its equality of -1
check_solution: Constraint R159 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 10)
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0
check_solution: Constraint R12 = 1e+30 is above its equality of 0
check_solution: Constraint R13 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 0.5)

lola: ========================================
FORMULA PhilosophersDyn-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: processed formula length: 64
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: processed formula length: 64
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 54
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)
lola: processed formula length: 64
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50) U (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50) U (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50)))))
lola: processed formula length: 201
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))
lola: processed formula length: 132
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46 markings, 90 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + ... (shortened)
lola: processed formula length: 801
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)) OR (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND X (F ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)) OR (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND X (F ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))))))
lola: processed formula length: 285
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 15 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)) AND ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)) AND ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (3 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40))))))
lola: processed formula length: 277
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 66
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46 markings, 90 edges
lola:
FORMULA PhilosophersDyn-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + ... (shortened)
lola: processed formula length: 676
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46 markings, 90 edges
lola:
FORMULA PhilosophersDyn-COL-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40)))
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: (p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 124
lola: 31 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 <= p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50))))
lola: processed formula length: 132
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 12 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 ... (shortened)
lola: processed formula length: 732
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola:
FORMULA PhilosophersDyn-COL-10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 ... (shortened)
lola: processed formula length: 732
lola: 29 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes no no yes yes no no no no no
lola:
preliminary result: no no yes no no yes yes no no yes yes no no no no no
lola: memory consumption: 47260 KB
lola: time consumption: 152 seconds

BK_STOP 1552848940888

--------------------
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="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is PhilosophersDyn-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-smll-155272326000005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;