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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-COL-02 @ 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-02-LTLCardinality.task
lola: A (G (F (X (G ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93)))))) : A ((2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198)) : A (G (X (X ((p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77 <= p189))))) : A (F (G (X (G ((1 <= p186)))))) : A (G (G ((p53 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43)))) : A (X (F (F (F ((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p52)))))) : A (F (F (G ((p94 <= p26))))) : A (F ((F ((3 <= p199)) U X ((p94 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))))) : A (G ((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p27))) : A (X (X (F ((p169 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : A ((X ((3 <= p27)) U F (F ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))))) : A (F (F (G (X ((p144 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))) : A (G ((p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))) : A (X (G (X ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))) : A (X (((p52 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) U X ((p189 <= p27))))) : A ((1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))
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 ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (G ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93))))))
lola: processed formula: A (G (F (X (G ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p88 + p87 + p86 + p89 + p90 + p91 + p92 + p93))))))
lola: processed formula length: 116
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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198)
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 ((p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77 <= p189)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X ((p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77 <= p189)))))
lola: processed formula: A (G (X (X ((p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77 <= p189)))))
lola: processed formula length: 71
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 <= p186))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((1 <= p186))))))
lola: processed formula: A (F (G (X (G ((1 <= p186))))))
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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((p53 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((p53 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))))
lola: processed formula: A (G (G ((p53 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))))
lola: processed formula length: 66
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 ((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p52))))
lola: processed formula: A (X (F ((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p52))))
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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G ((p94 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p94 <= p26))))
lola: processed formula: A (F (G ((p94 <= p26))))
lola: processed formula length: 24
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: 617028 markings, 1791378 edges, 123406 markings/sec, 0 secs
lola: 1262461 markings, 3753458 edges, 129087 markings/sec, 5 secs
lola: 1892849 markings, 5642617 edges, 126078 markings/sec, 10 secs
lola: 2546139 markings, 7696431 edges, 130658 markings/sec, 15 secs
lola: 3207176 markings, 9807435 edges, 132207 markings/sec, 20 secs
lola: 3864372 markings, 11908165 edges, 131439 markings/sec, 25 secs
lola: 4235601 markings, 13041363 edges, 74246 markings/sec, 30 secs
lola: 4642658 markings, 14222843 edges, 81411 markings/sec, 35 secs
lola: 5223397 markings, 16066917 edges, 116148 markings/sec, 40 secs
lola: 5819237 markings, 17963370 edges, 119168 markings/sec, 45 secs
lola: 6428622 markings, 19906458 edges, 121877 markings/sec, 50 secs
lola: 7034827 markings, 21838796 edges, 121241 markings/sec, 55 secs
lola: 7545711 markings, 23391028 edges, 102177 markings/sec, 60 secs
lola: 8123881 markings, 25135298 edges, 115634 markings/sec, 65 secs
lola: 8784021 markings, 27199264 edges, 132028 markings/sec, 70 secs
lola: 9387016 markings, 29035483 edges, 120599 markings/sec, 75 secs
lola: 9979450 markings, 30852588 edges, 118487 markings/sec, 80 secs
lola: 10631837 markings, 32938115 edges, 130477 markings/sec, 85 secs
lola: 11250584 markings, 34913933 edges, 123749 markings/sec, 90 secs
lola: 11845829 markings, 36813988 edges, 119049 markings/sec, 95 secs
lola: 12010947 markings, 37246269 edges, 33024 markings/sec, 100 secs
lola: 12539427 markings, 38897541 edges, 105696 markings/sec, 105 secs
lola: 13121055 markings, 40751786 edges, 116326 markings/sec, 110 secs
lola: 13605721 markings, 42258980 edges, 96933 markings/sec, 115 secs
lola: 14232495 markings, 44137452 edges, 125355 markings/sec, 120 secs
lola: 14814113 markings, 45903465 edges, 116324 markings/sec, 125 secs
lola: 15464883 markings, 47929536 edges, 130154 markings/sec, 130 secs
lola: 16092019 markings, 49928654 edges, 125427 markings/sec, 135 secs
lola: 16718258 markings, 51928931 edges, 125248 markings/sec, 140 secs
lola: 17334991 markings, 53899733 edges, 123347 markings/sec, 145 secs
lola: 17766319 markings, 55244078 edges, 86266 markings/sec, 150 secs
lola: 18063102 markings, 56125058 edges, 59357 markings/sec, 155 secs
lola: 18629083 markings, 57926275 edges, 113196 markings/sec, 160 secs
lola: 19115738 markings, 59453965 edges, 97331 markings/sec, 165 secs
lola: 19698930 markings, 61251170 edges, 116638 markings/sec, 170 secs
lola: 20313220 markings, 63170223 edges, 122858 markings/sec, 175 secs
lola: 20901638 markings, 65005355 edges, 117684 markings/sec, 180 secs
lola: 21499483 markings, 66887455 edges, 119569 markings/sec, 185 secs
lola: 22104440 markings, 68819013 edges, 120991 markings/sec, 190 secs
lola: 22696248 markings, 70708589 edges, 118362 markings/sec, 195 secs
lola: 23267363 markings, 72532139 edges, 114223 markings/sec, 200 secs
lola: 23616751 markings, 73598834 edges, 69878 markings/sec, 205 secs
lola: 23839753 markings, 74243725 edges, 44600 markings/sec, 210 secs
lola: 24412092 markings, 76035906 edges, 114468 markings/sec, 215 secs
lola: 24895060 markings, 77533263 edges, 96594 markings/sec, 220 secs
lola: 25466455 markings, 79354668 edges, 114279 markings/sec, 225 secs
lola: 26028414 markings, 81146218 edges, 112392 markings/sec, 230 secs
lola: 26583820 markings, 82921907 edges, 111081 markings/sec, 235 secs
lola: 27133524 markings, 84671013 edges, 109941 markings/sec, 240 secs
lola: 27715387 markings, 86531780 edges, 116373 markings/sec, 245 secs
lola: 28284793 markings, 88349178 edges, 113881 markings/sec, 250 secs
lola: 28846284 markings, 90142844 edges, 112298 markings/sec, 255 secs
lola: 29411828 markings, 91945667 edges, 113109 markings/sec, 260 secs
lola: 29933146 markings, 93618113 edges, 104264 markings/sec, 265 secs
lola: 30333330 markings, 94889532 edges, 80037 markings/sec, 270 secs
lola: 30883472 markings, 96596037 edges, 110028 markings/sec, 275 secs
lola: 31395388 markings, 98135351 edges, 102383 markings/sec, 280 secs
lola: 31967347 markings, 99851185 edges, 114392 markings/sec, 285 secs
lola: 32542236 markings, 101621994 edges, 114978 markings/sec, 290 secs
lola: 33083065 markings, 103294899 edges, 108166 markings/sec, 295 secs
lola: 33157674 markings, 103416483 edges, 14922 markings/sec, 300 secs
lola: 33449386 markings, 104231574 edges, 58342 markings/sec, 305 secs
lola: 33980000 markings, 105857551 edges, 106123 markings/sec, 310 secs
lola: 34513770 markings, 107528469 edges, 106754 markings/sec, 315 secs
lola: 35023414 markings, 109106436 edges, 101929 markings/sec, 320 secs
lola: 35590188 markings, 110820206 edges, 113355 markings/sec, 325 secs
lola: 36135828 markings, 112462021 edges, 109128 markings/sec, 330 secs
lola: 36701243 markings, 114266445 edges, 113083 markings/sec, 335 secs
lola: 36983126 markings, 115052228 edges, 56377 markings/sec, 340 secs
lola: 37069987 markings, 115214925 edges, 17372 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 <= p199)) U X ((p94 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= p199)) U X ((p94 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))))
lola: processed formula: A (F ((F ((3 <= p199)) U X ((p94 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))))
lola: processed formula length: 94
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 ((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p27)))
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 ((p169 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p169 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: processed formula: A (X (X (F ((p169 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: processed formula length: 63
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 <= p27)) U F (F ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= p27)) U F ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))))
lola: processed formula: A ((X ((3 <= p27)) U F ((2 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))))
lola: processed formula length: 87
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 ((p144 <= 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 (F (G (X ((p144 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))
lola: processed formula: A (F (G (X ((p144 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))
lola: processed formula length: 75
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: 1287028 markings, 3517700 edges, 257406 markings/sec, 0 secs
lola: 2499889 markings, 6888102 edges, 242572 markings/sec, 5 secs
lola: 3607814 markings, 10264691 edges, 221585 markings/sec, 10 secs
lola: 4645224 markings, 13756050 edges, 207482 markings/sec, 15 secs
lola: 5651598 markings, 17141366 edges, 201275 markings/sec, 20 secs
lola: 6732681 markings, 20397823 edges, 216217 markings/sec, 25 secs
lola: 7893805 markings, 23517450 edges, 232225 markings/sec, 30 secs
lola: 9020829 markings, 26592491 edges, 225405 markings/sec, 35 secs
lola: 10137597 markings, 29638346 edges, 223354 markings/sec, 40 secs
lola: 11225121 markings, 32561257 edges, 217505 markings/sec, 45 secs
lola: 12340542 markings, 35505745 edges, 223084 markings/sec, 50 secs
lola: 13465714 markings, 38521281 edges, 225034 markings/sec, 55 secs
lola: 14582611 markings, 41572508 edges, 223379 markings/sec, 60 secs
lola: 15643184 markings, 44651447 edges, 212115 markings/sec, 65 secs
lola: 16625855 markings, 47697934 edges, 196534 markings/sec, 70 secs
lola: 17709622 markings, 50634846 edges, 216753 markings/sec, 75 secs
lola: 18801284 markings, 53443303 edges, 218332 markings/sec, 80 secs
lola: 19904573 markings, 56327631 edges, 220658 markings/sec, 85 secs
lola: 20981681 markings, 59234975 edges, 215422 markings/sec, 90 secs
lola: 21941360 markings, 62253314 edges, 191936 markings/sec, 95 secs
lola: 22852033 markings, 65267702 edges, 182135 markings/sec, 100 secs
lola: 23915811 markings, 68111280 edges, 212756 markings/sec, 105 secs
lola: 24962045 markings, 70900736 edges, 209247 markings/sec, 110 secs
lola: 25966531 markings, 73705568 edges, 200897 markings/sec, 115 secs
lola: 27053614 markings, 76378047 edges, 217417 markings/sec, 120 secs
lola: 28109599 markings, 79203607 edges, 211197 markings/sec, 125 secs
lola: 29176148 markings, 82011113 edges, 213310 markings/sec, 130 secs
lola: 30176411 markings, 84964886 edges, 200053 markings/sec, 135 secs
lola: 31129839 markings, 87976696 edges, 190686 markings/sec, 140 secs
lola: 32014358 markings, 90959848 edges, 176904 markings/sec, 145 secs
lola: 32895977 markings, 93920577 edges, 176324 markings/sec, 150 secs
lola: 33845507 markings, 96763115 edges, 189906 markings/sec, 155 secs
lola: 34909946 markings, 99305984 edges, 212888 markings/sec, 160 secs
lola: 35917644 markings, 102165434 edges, 201540 markings/sec, 165 secs
lola: 36865952 markings, 105070808 edges, 189662 markings/sec, 170 secs
lola: 37807593 markings, 108021569 edges, 188328 markings/sec, 175 secs
lola: 38765191 markings, 110939584 edges, 191520 markings/sec, 180 secs
lola: 39690740 markings, 113808029 edges, 185110 markings/sec, 185 secs
lola: 40611658 markings, 116684050 edges, 184184 markings/sec, 190 secs
lola: 41543924 markings, 119583990 edges, 186453 markings/sec, 195 secs
lola: 42443811 markings, 122399369 edges, 179977 markings/sec, 200 secs
lola: 43351284 markings, 125282373 edges, 181495 markings/sec, 205 secs
lola: 44267885 markings, 128089121 edges, 183320 markings/sec, 210 secs
lola: 45201990 markings, 130964951 edges, 186821 markings/sec, 215 secs
lola: 46093032 markings, 133840238 edges, 178208 markings/sec, 220 secs
lola: 47027009 markings, 136623165 edges, 186795 markings/sec, 225 secs
lola: 47928508 markings, 139415165 edges, 180300 markings/sec, 230 secs
lola: 48983581 markings, 142486680 edges, 211015 markings/sec, 235 secs
lola: 50075918 markings, 145534001 edges, 218467 markings/sec, 240 secs
lola: 51090116 markings, 148460470 edges, 202840 markings/sec, 245 secs
lola: 52111185 markings, 151415030 edges, 204214 markings/sec, 250 secs
lola: 53129394 markings, 154353289 edges, 203642 markings/sec, 255 secs
lola: 54166615 markings, 157369693 edges, 207444 markings/sec, 260 secs
lola: 55197616 markings, 160346577 edges, 206200 markings/sec, 265 secs
lola: 56215080 markings, 163324947 edges, 203493 markings/sec, 270 secs
lola: 57191169 markings, 166144311 edges, 195218 markings/sec, 275 secs
lola: 58137715 markings, 168948039 edges, 189309 markings/sec, 280 secs
lola: 59094358 markings, 171846186 edges, 191329 markings/sec, 285 secs
lola: 60068670 markings, 174674188 edges, 194862 markings/sec, 290 secs
lola: 61023594 markings, 177480144 edges, 190985 markings/sec, 295 secs
lola: 62036169 markings, 180249018 edges, 202515 markings/sec, 300 secs
lola: 63114603 markings, 183151013 edges, 215687 markings/sec, 305 secs
lola: 64132818 markings, 186064538 edges, 203643 markings/sec, 310 secs
lola: 65133510 markings, 188980476 edges, 200138 markings/sec, 315 secs
lola: 66131712 markings, 191824643 edges, 199640 markings/sec, 320 secs
lola: 67090023 markings, 194614474 edges, 191662 markings/sec, 325 secs
lola: 68249502 markings, 197457143 edges, 231896 markings/sec, 330 secs
lola: 69227957 markings, 200274626 edges, 195691 markings/sec, 335 secs
lola: 70178385 markings, 203090046 edges, 190086 markings/sec, 340 secs
lola: 71106682 markings, 205978487 edges, 185659 markings/sec, 345 secs
lola: 72068884 markings, 208739194 edges, 192440 markings/sec, 350 secs
lola: 73001801 markings, 211470843 edges, 186583 markings/sec, 355 secs
lola: 73936181 markings, 214275853 edges, 186876 markings/sec, 360 secs
lola: 74902147 markings, 217139588 edges, 193193 markings/sec, 365 secs
lola: 75866443 markings, 219926472 edges, 192859 markings/sec, 370 secs
lola: 76790182 markings, 222708733 edges, 184748 markings/sec, 375 secs
lola: 77929187 markings, 225481844 edges, 227801 markings/sec, 380 secs
lola: 78902175 markings, 228221425 edges, 194598 markings/sec, 385 secs
lola: 79878126 markings, 231031761 edges, 195190 markings/sec, 390 secs
lola: 80801847 markings, 233790098 edges, 184744 markings/sec, 395 secs
lola: 81728780 markings, 236512154 edges, 185387 markings/sec, 400 secs
lola: 82645156 markings, 239144587 edges, 183275 markings/sec, 405 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 693 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168)))
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 924 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
lola: processed formula: A (X (G (X ((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
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 1387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p52 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) U X ((p189 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p52 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) U X ((p189 <= p27)))))
lola: processed formula: A (X (((p52 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) U X ((p189 <= p27)))))
lola: processed formula length: 84
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 2774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)
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: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola:
SUMMARY: no no no no no yes unknown yes no yes yes unknown no no yes yes
lola: ========================================
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 1494649769535

--------------------
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-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/PermAdmissibility-COL-02.tgz
mv 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 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 r038-blw7-149440484900356"
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 ;