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 S_PermAdmissibility-COL-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650100347
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496378801607


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-COL-01: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PermAdmissibility-COL-01: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PermAdmissibility-COL-01 @ 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: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-01-LTLCardinality.task
lola: A (G (((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p153) U X ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p66))))) : A (F (F (X ((1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))) : A (G ((X ((p164 <= p1)) U X ((2 <= p181))))) : A (X (G (((p164 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U (p66 <= p0))))) : A (G (F (((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p155))))) : A (F (G (G (F ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163)))))) : A (F ((X ((2 <= p1)) U G ((2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41))))) : A ((3 <= p1)) : A ((F (G ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) U F (G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))) : A ((((p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) U (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U ((p66 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (3 <= p191)))) : A (G (((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U F ((2 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))))) : A ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)) : A (X (((p68 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U G ((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57))))) : A ((X (G ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p67))) U F (X ((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))) : A (X (F (F ((p181 <= p0))))) : A (G (X (G (G ((1 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p153) U X ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p66)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p153) U X ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p66)))))
lola: processed formula: A (G (((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p153) U X ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p66)))))
lola: processed formula length: 136
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))
lola: processed formula: A (F (X ((1 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((p164 <= p1)) U X ((2 <= p181)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((p164 <= p1) U (2 <= p181)))))
lola: processed formula: A (G (X (((p164 <= p1) U (2 <= p181)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p164 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U (p66 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p164 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U (p66 <= p0)))))
lola: processed formula: A (X (G (((p164 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U (p66 <= p0)))))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p155)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p155)))))
lola: processed formula: A (G (F (((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p155)))))
lola: processed formula length: 184
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (F ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))))
lola: processed formula: A (F (G (G (F ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((2 <= p1)) U G ((2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((2 <= p1)) U G ((2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))))
lola: processed formula: A (F ((X ((2 <= p1)) U G ((2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p1)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-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: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) U F (G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) U F (G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: processed formula: A ((F (G ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) U F (G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: processed formula length: 241
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) U (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U ((p66 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (3 <= p191))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) U (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U ((p66 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (3 <= p191))))
lola: processed formula: A ((((p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) U (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)) U ((p66 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (3 <= p191))))
lola: processed formula length: 276
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U F ((2 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U F ((2 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))))
lola: processed formula: A (G (((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U F ((2 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))))
lola: processed formula length: 121
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p68 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U G ((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p68 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U G ((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: processed formula: A (X (((p68 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U G ((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: processed formula length: 115
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p67))) U F (X ((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p67))) U F (X ((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)))))
lola: processed formula: A ((X (G ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p67))) U F (X ((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)))))
lola: processed formula length: 131
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((p181 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p181 <= p0))))
lola: processed formula: A (X (F ((p181 <= p0))))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (G ((1 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (G ((1 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))))))
lola: processed formula: A (G (X (G (G ((1 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
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: RESULT
lola:
SUMMARY: no yes no yes yes yes no no yes no no yes yes yes yes no
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496378808263

--------------------
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="S_PermAdmissibility-COL-01"
export BK_EXAMINATION="LTLCardinality"
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/S_PermAdmissibility-COL-01.tgz
mv S_PermAdmissibility-COL-01 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 S_PermAdmissibility-COL-01, 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 r118-blw7-149441650100347"
echo "====================================================================="
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 ;