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

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

=== Now, execution of the tool begins

BK_START 1496379233916


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PermAdmissibility-COL-02: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PermAdmissibility-COL-02 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 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-02-LTLCardinality.task
lola: A (G (F (X (G ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))))) : A ((2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154)) : A (G (X (X ((p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 <= p174))))) : A (F (G (X (G ((1 <= p146)))))) : A (G (G ((p8 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)))) : A (X (F (F (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p27)))))) : A (F (F (G ((p145 <= p136))))) : A (F ((F ((3 <= p155)) U X ((p145 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126))))) : A (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p199))) : A (X (X (F ((p127 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135))))) : A ((X ((3 <= p199)) U F (F ((2 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99))))) : A (F (F (G (X ((p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))))) : A (G ((p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99))) : A (X (G (X ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) : A (X (((p27 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U X ((p174 <= p199))))) : A ((1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36))
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 (F (X (G ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (G ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))))
lola: processed formula: A (G (F (X (G ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X ((p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 <= p174)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X ((p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 <= p174)))))
lola: processed formula: A (G (X (X ((p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 <= p174)))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((1 <= p146))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((1 <= p146))))))
lola: processed formula: A (F (G (X (G ((1 <= p146))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((p8 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((p8 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))
lola: processed formula: A (G (G ((p8 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p27))))
lola: processed formula: A (X (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p27))))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G ((p145 <= p136)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p145 <= p136))))
lola: processed formula: A (F (G ((p145 <= p136))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 538289 markings, 1394625 edges, 107658 markings/sec, 0 secs
lola: 1153780 markings, 3115681 edges, 123098 markings/sec, 5 secs
lola: 1673732 markings, 4460283 edges, 103990 markings/sec, 10 secs
lola: 2162350 markings, 5736586 edges, 97724 markings/sec, 15 secs
lola: 2859590 markings, 7865026 edges, 139448 markings/sec, 20 secs
lola: 3466298 markings, 9617472 edges, 121342 markings/sec, 25 secs
lola: 4002821 markings, 11094390 edges, 107305 markings/sec, 30 secs
lola: 4517039 markings, 12509421 edges, 102844 markings/sec, 35 secs
lola: 4959162 markings, 13700792 edges, 88425 markings/sec, 40 secs
lola: 5565243 markings, 15446853 edges, 121216 markings/sec, 45 secs
lola: 6191708 markings, 17334789 edges, 125293 markings/sec, 50 secs
lola: 6754892 markings, 19003363 edges, 112637 markings/sec, 55 secs
lola: 7337670 markings, 20838088 edges, 116556 markings/sec, 60 secs
lola: 7955335 markings, 22657819 edges, 123533 markings/sec, 65 secs
lola: 8525885 markings, 24274074 edges, 114110 markings/sec, 70 secs
lola: 9120379 markings, 25984842 edges, 118899 markings/sec, 75 secs
lola: 9673819 markings, 27549980 edges, 110688 markings/sec, 80 secs
lola: 10272431 markings, 29329396 edges, 119722 markings/sec, 85 secs
lola: 10855556 markings, 31071062 edges, 116625 markings/sec, 90 secs
lola: 11396382 markings, 32585094 edges, 108165 markings/sec, 95 secs
lola: 11850668 markings, 33816874 edges, 90857 markings/sec, 100 secs
lola: 12138609 markings, 34574490 edges, 57588 markings/sec, 105 secs
lola: 12711676 markings, 36128701 edges, 114613 markings/sec, 110 secs
lola: 13263219 markings, 37636163 edges, 110309 markings/sec, 115 secs
lola: 13779504 markings, 38973260 edges, 103257 markings/sec, 120 secs
lola: 14109977 markings, 39871195 edges, 66095 markings/sec, 125 secs
lola: 14574414 markings, 41138078 edges, 92887 markings/sec, 130 secs
lola: 15133538 markings, 42703647 edges, 111825 markings/sec, 135 secs
lola: 15666115 markings, 44201979 edges, 106515 markings/sec, 140 secs
lola: 16177233 markings, 45608183 edges, 102224 markings/sec, 145 secs
lola: 16647119 markings, 46912047 edges, 93977 markings/sec, 150 secs
lola: 17016814 markings, 47962112 edges, 73939 markings/sec, 155 secs
lola: 17470714 markings, 49204674 edges, 90780 markings/sec, 160 secs
lola: 17948721 markings, 50521167 edges, 95601 markings/sec, 165 secs
lola: 18374939 markings, 51693173 edges, 85244 markings/sec, 170 secs
lola: 18661536 markings, 52553910 edges, 57319 markings/sec, 175 secs
lola: 18874028 markings, 53246271 edges, 42498 markings/sec, 180 secs
lola: 19284979 markings, 54370290 edges, 82190 markings/sec, 185 secs
lola: 19880273 markings, 56004807 edges, 119059 markings/sec, 190 secs
lola: 20452674 markings, 57525519 edges, 114480 markings/sec, 195 secs
lola: 20983464 markings, 58978989 edges, 106158 markings/sec, 200 secs
lola: 21546492 markings, 60500285 edges, 112606 markings/sec, 205 secs
lola: 22163089 markings, 62285425 edges, 123319 markings/sec, 210 secs
lola: 22799723 markings, 64232885 edges, 127327 markings/sec, 215 secs
lola: 23463425 markings, 66265476 edges, 132740 markings/sec, 220 secs
lola: 24035985 markings, 67918649 edges, 114512 markings/sec, 225 secs
lola: 24592914 markings, 69455647 edges, 111386 markings/sec, 230 secs
lola: 25103919 markings, 70921708 edges, 102201 markings/sec, 235 secs
lola: 25579902 markings, 72365521 edges, 95197 markings/sec, 240 secs
lola: 26175462 markings, 74173922 edges, 119112 markings/sec, 245 secs
lola: 26772333 markings, 75895303 edges, 119374 markings/sec, 250 secs
lola: 27316841 markings, 77562512 edges, 108902 markings/sec, 255 secs
lola: 27903436 markings, 79260850 edges, 117319 markings/sec, 260 secs
lola: 28392955 markings, 80655584 edges, 97904 markings/sec, 265 secs
lola: 28887961 markings, 82108604 edges, 99001 markings/sec, 270 secs
lola: 29399567 markings, 83727682 edges, 102321 markings/sec, 275 secs
lola: 29991996 markings, 85497457 edges, 118486 markings/sec, 280 secs
lola: 30575904 markings, 87224071 edges, 116782 markings/sec, 285 secs
lola: 31170922 markings, 88995498 edges, 119004 markings/sec, 290 secs
lola: 31756450 markings, 90757166 edges, 117106 markings/sec, 295 secs
lola: 32310720 markings, 92387608 edges, 110854 markings/sec, 300 secs
lola: 32859958 markings, 94008928 edges, 109848 markings/sec, 305 secs
lola: 33380750 markings, 95525543 edges, 104158 markings/sec, 310 secs
lola: 33869656 markings, 96861249 edges, 97781 markings/sec, 315 secs
lola: 34410090 markings, 98313228 edges, 108087 markings/sec, 320 secs
lola: 34932802 markings, 99693089 edges, 104542 markings/sec, 325 secs
lola: 35441958 markings, 101099149 edges, 101831 markings/sec, 330 secs
lola: 35951947 markings, 102477172 edges, 101998 markings/sec, 335 secs
lola: 36415491 markings, 103727525 edges, 92709 markings/sec, 340 secs
lola: 36901287 markings, 105092179 edges, 97159 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= p155)) U X ((p145 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= p155)) U X ((p145 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)))))
lola: processed formula: A (F ((F ((3 <= p155)) U X ((p145 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p199)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p127 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p127 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)))))
lola: processed formula: A (X (X (F ((p127 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135)))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= p199)) U F (F ((2 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= p199)) U F ((2 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99))))
lola: processed formula: A ((X ((3 <= p199)) U F ((2 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99))))
lola: processed formula length: 83
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 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 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))))
lola: processed formula: A (F (G (X ((p45 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 1251609 markings, 3460085 edges, 250322 markings/sec, 0 secs
lola: 2365581 markings, 7131445 edges, 222794 markings/sec, 5 secs
lola: 3646526 markings, 10621116 edges, 256189 markings/sec, 10 secs
lola: 4878538 markings, 14076003 edges, 246402 markings/sec, 15 secs
lola: 6071910 markings, 17336713 edges, 238674 markings/sec, 20 secs
lola: 7282074 markings, 20582599 edges, 242033 markings/sec, 25 secs
lola: 8474386 markings, 23838290 edges, 238462 markings/sec, 30 secs
lola: 9651942 markings, 27146628 edges, 235511 markings/sec, 35 secs
lola: 10680638 markings, 30594946 edges, 205739 markings/sec, 40 secs
lola: 11648137 markings, 33832884 edges, 193500 markings/sec, 45 secs
lola: 12842700 markings, 36965122 edges, 238913 markings/sec, 50 secs
lola: 14017703 markings, 39989013 edges, 235001 markings/sec, 55 secs
lola: 15254883 markings, 43344241 edges, 247436 markings/sec, 60 secs
lola: 16361083 markings, 46745663 edges, 221240 markings/sec, 65 secs
lola: 17359490 markings, 50149819 edges, 199681 markings/sec, 70 secs
lola: 18460231 markings, 53378772 edges, 220148 markings/sec, 75 secs
lola: 19654948 markings, 56487758 edges, 238943 markings/sec, 80 secs
lola: 20819300 markings, 59603619 edges, 232870 markings/sec, 85 secs
lola: 21935334 markings, 62832519 edges, 223207 markings/sec, 90 secs
lola: 23013208 markings, 65861229 edges, 215575 markings/sec, 95 secs
lola: 24123314 markings, 69074458 edges, 222021 markings/sec, 100 secs
lola: 25146290 markings, 72251011 edges, 204595 markings/sec, 105 secs
lola: 26216963 markings, 75569289 edges, 214135 markings/sec, 110 secs
lola: 27251944 markings, 78771008 edges, 206996 markings/sec, 115 secs
lola: 28273727 markings, 81906069 edges, 204357 markings/sec, 120 secs
lola: 29254294 markings, 85053516 edges, 196113 markings/sec, 125 secs
lola: 30260696 markings, 88174245 edges, 201280 markings/sec, 130 secs
lola: 31253228 markings, 91244227 edges, 198506 markings/sec, 135 secs
lola: 32276844 markings, 94356547 edges, 204723 markings/sec, 140 secs
lola: 33237547 markings, 97392933 edges, 192141 markings/sec, 145 secs
lola: 34346237 markings, 100756887 edges, 221738 markings/sec, 150 secs
lola: 35518350 markings, 104015459 edges, 234423 markings/sec, 155 secs
lola: 36621928 markings, 107265121 edges, 220716 markings/sec, 160 secs
lola: 37755623 markings, 110378155 edges, 226739 markings/sec, 165 secs
lola: 38818076 markings, 113613325 edges, 212491 markings/sec, 170 secs
lola: 39934515 markings, 116664064 edges, 223288 markings/sec, 175 secs
lola: 40958400 markings, 119784695 edges, 204777 markings/sec, 180 secs
lola: 41984504 markings, 122947067 edges, 205221 markings/sec, 185 secs
lola: 42966032 markings, 125982675 edges, 196306 markings/sec, 190 secs
lola: 44162647 markings, 129152521 edges, 239323 markings/sec, 195 secs
lola: 45274523 markings, 132339854 edges, 222375 markings/sec, 200 secs
lola: 46385745 markings, 135518567 edges, 222244 markings/sec, 205 secs
lola: 47489018 markings, 138696814 edges, 220655 markings/sec, 210 secs
lola: 48599614 markings, 141598312 edges, 222119 markings/sec, 215 secs
lola: 49722031 markings, 144794692 edges, 224483 markings/sec, 220 secs
lola: 50818322 markings, 147982408 edges, 219258 markings/sec, 225 secs
lola: 51872646 markings, 151117166 edges, 210865 markings/sec, 230 secs
lola: 52951826 markings, 154275190 edges, 215836 markings/sec, 235 secs
lola: 54017406 markings, 157388213 edges, 213116 markings/sec, 240 secs
lola: 55061510 markings, 160471065 edges, 208821 markings/sec, 245 secs
lola: 56094671 markings, 163475324 edges, 206632 markings/sec, 250 secs
lola: 57119398 markings, 166496366 edges, 204945 markings/sec, 255 secs
lola: 58166987 markings, 169366721 edges, 209518 markings/sec, 260 secs
lola: 59279940 markings, 172543146 edges, 222591 markings/sec, 265 secs
lola: 60423040 markings, 175572255 edges, 228620 markings/sec, 270 secs
lola: 61469989 markings, 178626254 edges, 209390 markings/sec, 275 secs
lola: 62524870 markings, 181743473 edges, 210976 markings/sec, 280 secs
lola: 63609816 markings, 184699651 edges, 216989 markings/sec, 285 secs
lola: 64612285 markings, 187777738 edges, 200494 markings/sec, 290 secs
lola: 65586156 markings, 190793099 edges, 194774 markings/sec, 295 secs
lola: 66657273 markings, 193729992 edges, 214223 markings/sec, 300 secs
lola: 67717879 markings, 196844731 edges, 212121 markings/sec, 305 secs
lola: 68738405 markings, 199862415 edges, 204105 markings/sec, 310 secs
lola: 69755017 markings, 202841229 edges, 203322 markings/sec, 315 secs
lola: 70791202 markings, 205778225 edges, 207237 markings/sec, 320 secs
lola: 71850614 markings, 208552412 edges, 211882 markings/sec, 325 secs
lola: 72942510 markings, 211473661 edges, 218379 markings/sec, 330 secs
lola: 74025412 markings, 214462559 edges, 216580 markings/sec, 335 secs
lola: 75050502 markings, 217454664 edges, 205018 markings/sec, 340 secs
lola: 76082763 markings, 220369911 edges, 206452 markings/sec, 345 secs
lola: 77075296 markings, 223272960 edges, 198507 markings/sec, 350 secs
lola: 78262082 markings, 226172104 edges, 237357 markings/sec, 355 secs
lola: 79386301 markings, 229362507 edges, 224844 markings/sec, 360 secs
lola: 80324179 markings, 232764363 edges, 187576 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 937 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= 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 (X (G (X ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: processed formula: A (X (G (X ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: processed formula length: 128
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 14 will run for 1405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p27 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U X ((p174 <= p199)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p27 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U X ((p174 <= p199)))))
lola: processed formula: A (X (((p27 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U X ((p174 <= p199)))))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 15 will run for 2811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36)
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: RESULT
lola:
SUMMARY: no no no no no yes unknown yes no yes yes unknown no no yes yes
FORMULA PermAdmissibility-COL-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496379962516

--------------------
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-02"
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-02.tgz
mv S_PermAdmissibility-COL-02 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-02, 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-149441650200356"
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 ;