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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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 (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p104) U X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p164))))) : A (F (F (X ((1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) : A (G ((X ((p8 <= p55)) U X ((2 <= p54))))) : A (X (G (((p8 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180) U (p164 <= p191))))) : A (G (F (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) U (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p44))))) : A (F (G (G (F ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147)))))) : A (F ((X ((2 <= p55)) U G ((2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))))) : A ((3 <= p55)) : A ((F (G ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))) U F (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) : A ((((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95) U (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U ((p164 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p34)))) : A (G (((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U F ((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113))))) : A ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)) : A (X (((p181 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U G ((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))))) : A ((X (G ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p131))) U F (X ((2 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))))) : A (X (F (F ((p54 <= p191))))) : A (G (X (G (G ((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))))))
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 (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p104) U X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p164)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p104) U X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p164)))))
lola: processed formula: A (G (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p104) U X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p164)))))
lola: processed formula length: 127
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 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))
lola: processed formula: A (F (X ((1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))
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 ((p8 <= p55)) U X ((2 <= p54)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((p8 <= p55) U (2 <= p54)))))
lola: processed formula: A (G (X (((p8 <= p55) U (2 <= p54)))))
lola: processed formula length: 38
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 (((p8 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180) U (p164 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p8 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180) U (p164 <= p191)))))
lola: processed formula: A (X (G (((p8 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180) U (p164 <= p191)))))
lola: processed formula length: 92
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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) U (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) U (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p44)))))
lola: processed formula: A (G (F (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) U (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p44)))))
lola: processed formula length: 175
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 ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (F ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))))))
lola: processed formula: A (F (G (G (F ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))))))
lola: processed formula length: 124
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 <= p55)) U G ((2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((2 <= p55)) U G ((2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))))
lola: processed formula: A (F ((X ((2 <= p55)) U G ((2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))))
lola: processed formula length: 83
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 <= p55))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p55)
lola: processed formula length: 10
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 ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))) U F (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))) U F (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: processed formula: A ((F (G ((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))) U F (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: processed formula length: 225
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 ((((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95) U (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U ((p164 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95) U (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U ((p164 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p34))))
lola: processed formula: A ((((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95) U (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U ((p164 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p34))))
lola: processed formula length: 284
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 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U F ((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U F ((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113)))))
lola: processed formula: A (G (((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U F ((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113)))))
lola: processed formula length: 129
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 ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)
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 (((p181 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U G ((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p181 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U G ((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))
lola: processed formula: A (X (((p181 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U G ((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))
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 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 ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p131))) U F (X ((2 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p131))) U F (X ((2 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))
lola: processed formula: A ((X (G ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p131))) U F (X ((2 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))
lola: processed formula length: 140
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 ((p54 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p54 <= p191))))
lola: processed formula: A (X (F ((p54 <= p191))))
lola: processed formula length: 25
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 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (G ((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))))))
lola: processed formula: A (G (X (G (G ((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))))))
lola: processed formula length: 72
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 1494648248015

--------------------
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="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/PermAdmissibility-COL-01.tgz
mv 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 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 r038-blw7-149440484900347"
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 ;