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

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

=== Now, execution of the tool begins

BK_START 1496380491569


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PermAdmissibility-COL-05: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_PermAdmissibility-COL-05 @ 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-05-CTLCardinality.task
lola: A (F (A (F (((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) AND (p207 <= p129)))))) : NOT(E (X (A (F ((p207 <= p187)))))) : NOT(E ((((p197 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92) OR (1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)) U (1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))) : A (F (A (G (((p68 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76) AND (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p206)))))) : (A ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)) U (p154 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137))) OR (((3 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84) AND (2 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p41) OR (1 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) AND (2 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)) OR E (F (((p188 <= p68) AND (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))) : A ((((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137) OR (p187 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58)) U A (G ((1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))))) : (NOT(A (G (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (2 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92))))) AND (A (G ((p187 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))) OR ((((p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) AND (p42 <= p207)) OR A (X ((2 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186)))))) : (A (F (A (X ((3 <= p101))))) OR NOT((E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))) OR E (G ((3 <= p187)))))) : A (F ((E (F ((2 <= p41))) OR E (F ((3 <= p40)))))) : ((p42 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) OR A (G (((p41 <= 0) OR (p207 + 1 <= p101))))) : A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p206))) : E (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= 0))) : A (F ((p119 + 1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))) : E (G (A (F ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))))) : (NOT(E (((p67 <= p101) U (3 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)))) OR (p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= p110)) : A (X (E (G ((p129 <= 2)))))
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 (F (A (F (((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) AND (p207 <= p129))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) AND (p207 <= p129)))
lola: processed formula length: 135
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1953500 markings, 2105625 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3836355 markings, 4137244 edges, 376571 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (F ((p207 <= p187))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
checking CTL
lola: processed formula: AX(NOT(A(TRUE U (p207 <= p187))))
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1868019 markings, 2395067 edges, 3225242262854172672 markings/sec, 0 secs
lola: 3664216 markings, 4749192 edges, 359239 markings/sec, 5 secs
lola: 5417784 markings, 7058332 edges, 350714 markings/sec, 10 secs
lola: 7157553 markings, 9416642 edges, 347954 markings/sec, 15 secs
lola: 8748050 markings, 11580353 edges, 318099 markings/sec, 20 secs
lola: 10393046 markings, 13735999 edges, 328999 markings/sec, 25 secs
lola: 11945480 markings, 15842398 edges, 310487 markings/sec, 30 secs
lola: 13662705 markings, 18170375 edges, 343445 markings/sec, 35 secs
lola: 15280479 markings, 20306254 edges, 323555 markings/sec, 40 secs
lola: 17187846 markings, 22859393 edges, 381473 markings/sec, 45 secs
lola: 19230104 markings, 25569357 edges, 408452 markings/sec, 50 secs
lola: 21114051 markings, 28176402 edges, 376789 markings/sec, 55 secs
lola: 22909735 markings, 30700031 edges, 359137 markings/sec, 60 secs
lola: 24748827 markings, 33236646 edges, 367818 markings/sec, 65 secs
lola: 26551648 markings, 35731797 edges, 360564 markings/sec, 70 secs
lola: 28317759 markings, 38270501 edges, 353222 markings/sec, 75 secs
lola: 30086925 markings, 40711745 edges, 353833 markings/sec, 80 secs
lola: 31893122 markings, 43373006 edges, 361239 markings/sec, 85 secs
lola: 33909070 markings, 46107606 edges, 403190 markings/sec, 90 secs
lola: 35669658 markings, 48509077 edges, 352118 markings/sec, 95 secs
lola: 37460485 markings, 51005275 edges, 358165 markings/sec, 100 secs
lola: 39231071 markings, 53455550 edges, 354117 markings/sec, 105 secs
lola: 40999736 markings, 55942647 edges, 353733 markings/sec, 110 secs
lola: 42636737 markings, 58256493 edges, 327400 markings/sec, 115 secs
lola: 44253387 markings, 60520017 edges, 323330 markings/sec, 120 secs
lola: 45856508 markings, 62807393 edges, 320624 markings/sec, 125 secs
lola: 47466685 markings, 65147768 edges, 322035 markings/sec, 130 secs
lola: 49008856 markings, 67266356 edges, 308434 markings/sec, 135 secs
lola: 50703075 markings, 69685533 edges, 338844 markings/sec, 140 secs
lola: 52440279 markings, 72169744 edges, 347441 markings/sec, 145 secs
lola: 54082268 markings, 74547284 edges, 328398 markings/sec, 150 secs
lola: 55545174 markings, 76590379 edges, 292581 markings/sec, 155 secs
lola: 56983929 markings, 78732275 edges, 287751 markings/sec, 160 secs
lola: 58522660 markings, 80885280 edges, 307746 markings/sec, 165 secs
lola: 60115397 markings, 83491854 edges, 318547 markings/sec, 170 secs
lola: 61813725 markings, 86019605 edges, 339666 markings/sec, 175 secs
lola: 63363981 markings, 88077455 edges, 310051 markings/sec, 180 secs
lola: 65061974 markings, 90353556 edges, 339599 markings/sec, 185 secs
lola: 66463267 markings, 92248711 edges, 280259 markings/sec, 190 secs
lola: 68106724 markings, 94529637 edges, 328691 markings/sec, 195 secs
lola: 69657308 markings, 96579810 edges, 310117 markings/sec, 200 secs
lola: 71232514 markings, 98760059 edges, 315041 markings/sec, 205 secs
lola: 72729780 markings, 100753786 edges, 299453 markings/sec, 210 secs
lola: 74283200 markings, 102976990 edges, 310684 markings/sec, 215 secs
lola: 75940498 markings, 105277745 edges, 331460 markings/sec, 220 secs
lola: 77543525 markings, 107504553 edges, 320605 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((p197 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92) OR (1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)) U (1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((p197 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92) OR (1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)) U (1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))
lola: processed formula length: 177
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1461173 markings, 2594889 edges, 3067841126024085504 markings/sec, 0 secs
lola: 3055822 markings, 5489439 edges, 318930 markings/sec, 5 secs
lola: 4577753 markings, 8289080 edges, 304386 markings/sec, 10 secs
lola: 6029020 markings, 10792367 edges, 290253 markings/sec, 15 secs
lola: 7461595 markings, 13270292 edges, 286515 markings/sec, 20 secs
lola: 8613740 markings, 15362465 edges, 230429 markings/sec, 25 secs
lola: 9910338 markings, 17710578 edges, 259320 markings/sec, 30 secs
lola: 11269242 markings, 20147298 edges, 271781 markings/sec, 35 secs
lola: 12770464 markings, 22783660 edges, 300244 markings/sec, 40 secs
lola: 14156897 markings, 25358897 edges, 277287 markings/sec, 45 secs
lola: 15441997 markings, 27871067 edges, 257020 markings/sec, 50 secs
lola: 16717124 markings, 30297932 edges, 255025 markings/sec, 55 secs
lola: 17957342 markings, 32797304 edges, 248044 markings/sec, 60 secs
lola: 19317155 markings, 35512738 edges, 271963 markings/sec, 65 secs
lola: 20482216 markings, 37655214 edges, 233012 markings/sec, 70 secs
lola: 21750354 markings, 39984648 edges, 253628 markings/sec, 75 secs
lola: 23044814 markings, 42362412 edges, 258892 markings/sec, 80 secs
lola: 24389550 markings, 44712182 edges, 268947 markings/sec, 85 secs
lola: 25892563 markings, 47176559 edges, 300603 markings/sec, 90 secs
lola: 27366637 markings, 49695984 edges, 294815 markings/sec, 95 secs
lola: 28718620 markings, 52163556 edges, 270397 markings/sec, 100 secs
lola: 30067093 markings, 54481409 edges, 269695 markings/sec, 105 secs
lola: 31346094 markings, 56804451 edges, 255800 markings/sec, 110 secs
lola: 32663797 markings, 59192296 edges, 263541 markings/sec, 115 secs
lola: 33882216 markings, 61400473 edges, 243684 markings/sec, 120 secs
lola: 35102197 markings, 63675921 edges, 243996 markings/sec, 125 secs
lola: 36392706 markings, 65936604 edges, 258102 markings/sec, 130 secs
lola: 37658075 markings, 68200076 edges, 253074 markings/sec, 135 secs
lola: 39002322 markings, 70553794 edges, 268849 markings/sec, 140 secs
lola: 40116938 markings, 72580888 edges, 222923 markings/sec, 145 secs
lola: 41370839 markings, 74892554 edges, 250780 markings/sec, 150 secs
lola: 42636631 markings, 77176034 edges, 253158 markings/sec, 155 secs
lola: 43941087 markings, 79587189 edges, 260891 markings/sec, 160 secs
lola: 45171436 markings, 81910715 edges, 246070 markings/sec, 165 secs
lola: 46228755 markings, 84015070 edges, 211464 markings/sec, 170 secs
lola: 47403403 markings, 86394768 edges, 234930 markings/sec, 175 secs
lola: 48576096 markings, 88729153 edges, 234539 markings/sec, 180 secs
lola: 49715342 markings, 91087363 edges, 227849 markings/sec, 185 secs
lola: 50876126 markings, 93281583 edges, 232157 markings/sec, 190 secs
lola: 52205079 markings, 95679698 edges, 265791 markings/sec, 195 secs
lola: 53332012 markings, 97960336 edges, 225387 markings/sec, 200 secs
lola: 54448785 markings, 100405751 edges, 223355 markings/sec, 205 secs
lola: 55740063 markings, 102721253 edges, 258256 markings/sec, 210 secs
lola: 56883760 markings, 104905289 edges, 228739 markings/sec, 215 secs
lola: 58122783 markings, 107204342 edges, 247805 markings/sec, 220 secs
lola: 59303608 markings, 109321074 edges, 236165 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p68 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76) AND (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p206))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 + 1 <= p68) OR (p206 + 1 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)))))
lola: processed formula length: 149
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 999126 markings, 2947826 edges, 198178 markings/sec, 0 secs
lola: 1863373 markings, 6067483 edges, 172849 markings/sec, 5 secs
lola: 2576614 markings, 9651176 edges, 142648 markings/sec, 10 secs
lola: 3226876 markings, 13403119 edges, 130052 markings/sec, 15 secs
lola: 3828663 markings, 17235005 edges, 120357 markings/sec, 20 secs
lola: 4632038 markings, 19926052 edges, 160675 markings/sec, 25 secs
lola: 5338029 markings, 23151350 edges, 141198 markings/sec, 30 secs
lola: 5948027 markings, 26651518 edges, 122000 markings/sec, 35 secs
lola: 6699712 markings, 29744783 edges, 150337 markings/sec, 40 secs
lola: 7344037 markings, 33136755 edges, 128865 markings/sec, 45 secs
lola: 8198444 markings, 36013415 edges, 170881 markings/sec, 50 secs
lola: 8820112 markings, 39213777 edges, 124334 markings/sec, 55 secs
lola: 9295580 markings, 42694084 edges, 95094 markings/sec, 60 secs
lola: 10040382 markings, 45551116 edges, 148960 markings/sec, 65 secs
lola: 10542750 markings, 48747176 edges, 100474 markings/sec, 70 secs
lola: 11176836 markings, 51712285 edges, 126817 markings/sec, 75 secs
lola: 11671841 markings, 55184822 edges, 99001 markings/sec, 80 secs
lola: 12135748 markings, 58691607 edges, 92781 markings/sec, 85 secs
lola: 12566270 markings, 62079456 edges, 86104 markings/sec, 90 secs
lola: 13056708 markings, 65421918 edges, 98088 markings/sec, 95 secs
lola: 13867342 markings, 68444566 edges, 162127 markings/sec, 100 secs
lola: 14565264 markings, 72130171 edges, 139584 markings/sec, 105 secs
lola: 15306284 markings, 75173540 edges, 148204 markings/sec, 110 secs
lola: 16028008 markings, 78153253 edges, 144345 markings/sec, 115 secs
lola: 16597586 markings, 81213974 edges, 113916 markings/sec, 120 secs
lola: 17104651 markings, 84166284 edges, 101413 markings/sec, 125 secs
lola: 17542860 markings, 87239707 edges, 87642 markings/sec, 130 secs
lola: 18333411 markings, 89869940 edges, 158110 markings/sec, 135 secs
lola: 18949459 markings, 93396195 edges, 123210 markings/sec, 140 secs
lola: 19612701 markings, 96247818 edges, 132648 markings/sec, 145 secs
lola: 20324675 markings, 99111814 edges, 142395 markings/sec, 150 secs
lola: 20877689 markings, 101998906 edges, 110603 markings/sec, 155 secs
lola: 21434572 markings, 104436071 edges, 111377 markings/sec, 160 secs
lola: 21881433 markings, 107488213 edges, 89372 markings/sec, 165 secs
lola: 22346890 markings, 110517360 edges, 93091 markings/sec, 170 secs
lola: 23087468 markings, 113570440 edges, 148116 markings/sec, 175 secs
lola: 23688293 markings, 116400590 edges, 120165 markings/sec, 180 secs
lola: 24230838 markings, 119490925 edges, 108509 markings/sec, 185 secs
lola: 24870403 markings, 122488623 edges, 127913 markings/sec, 190 secs
lola: 25528494 markings, 125712570 edges, 131618 markings/sec, 195 secs
lola: 26088482 markings, 128765289 edges, 111998 markings/sec, 200 secs
lola: 26570367 markings, 131814985 edges, 96377 markings/sec, 205 secs
lola: 27098081 markings, 134750193 edges, 105543 markings/sec, 210 secs
lola: 27650099 markings, 137870747 edges, 110404 markings/sec, 215 secs
lola: 28118699 markings, 140710931 edges, 93720 markings/sec, 220 secs
lola: 28630020 markings, 143649649 edges, 102264 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)) U (p154 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137))) OR (((3 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84) AND (2 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p51 + p52 + p53 + p54 + p55 + p56 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)) U (p154 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)) U (p154 + 1 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137))
lola: processed formula length: 236
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84) AND (2 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p41) OR (1 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) AND (2 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84) AND (2 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p41) OR (1 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) AND (2 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162))
lola: processed formula length: 295
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 5 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 6 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p188 <= p68) AND (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137) OR (p187 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58)) U A (G ((1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)))))
lola: ========================================
lola: lola: SUBTASK
========================================
lola: checking CTL
lola: processed formula: A(((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137) OR (p187 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58)) U NOT(E(TRUE U (p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= 0))))
lola: processed formula length: 195
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1024172 markings, 3036063 edges, 204825 markings/sec, 0 secs
lola: 1897566 markings, 6201662 edges, 174679 markings/sec, 5 secs
lola: 2628920 markings, 9864915 edges, 146271 markings/sec, 10 secs
lola: 3280439 markings, 13806649 edges, 130304 markings/sec, 15 secs
lola: 3936268 markings, 17699191 edges, 131166 markings/sec, 20 secs
lola: 4806217 markings, 20592548 edges, 173990 markings/sec, 25 secs
lola: 5449549 markings, 23908980 edges, 128666 markings/sec, 30 secs
lola: 6038921 markings, 26942050 edges, 117874 markings/sec, 35 secs
lola: 6697085 markings, 29730500 edges, 131633 markings/sec, 40 secs
lola: 7314402 markings, 33033329 edges, 123463 markings/sec, 45 secs
lola: 8158291 markings, 35841864 edges, 168778 markings/sec, 50 secs
lola: 8770576 markings, 38952138 edges, 122457 markings/sec, 55 secs
lola: 9228290 markings, 42337174 edges, 91543 markings/sec, 60 secs
lola: 9948438 markings, 45166568 edges, 144030 markings/sec, 65 secs
lola: 10418180 markings, 47986859 edges, 93948 markings/sec, 70 secs
lola: 11047303 markings, 50842371 edges, 125825 markings/sec, 75 secs
lola: 11490210 markings, 53951202 edges, 88581 markings/sec, 80 secs
lola: 11978184 markings, 57389153 edges, 97595 markings/sec, 85 secs
lola: 12400942 markings, 60818219 edges, 84552 markings/sec, 90 secs
lola: 12845810 markings, 64026534 edges, 88974 markings/sec, 95 secs
lola: 13453245 markings, 67141648 edges, 121487 markings/sec, 100 secs
lola: 14251081 markings, 70533975 edges, 159567 markings/sec, 105 secs
lola: 14974457 markings, 73804090 edges, 144675 markings/sec, 110 secs
lola: 15661048 markings, 76850215 edges, 137318 markings/sec, 115 secs
lola: 16287816 markings, 79874153 edges, 125354 markings/sec, 120 secs
lola: 16889637 markings, 82672029 edges, 120364 markings/sec, 125 secs
lola: 17343585 markings, 85863092 edges, 90790 markings/sec, 130 secs
lola: 18026702 markings, 88824409 edges, 136623 markings/sec, 135 secs
lola: 18726933 markings, 92218531 edges, 140046 markings/sec, 140 secs
lola: 19454453 markings, 95301392 edges, 145504 markings/sec, 145 secs
lola: 20071650 markings, 98361427 edges, 123439 markings/sec, 150 secs
lola: 20751045 markings, 101226640 edges, 135879 markings/sec, 155 secs
lola: 21328257 markings, 104063161 edges, 115442 markings/sec, 160 secs
lola: 21836069 markings, 107134955 edges, 101562 markings/sec, 165 secs
lola: 22280925 markings, 110268906 edges, 88971 markings/sec, 170 secs
lola: 23009410 markings, 113294361 edges, 145697 markings/sec, 175 secs
lola: 23635534 markings, 116026115 edges, 125225 markings/sec, 180 secs
lola: 24143910 markings, 119034474 edges, 101675 markings/sec, 185 secs
lola: 24753964 markings, 121909544 edges, 122011 markings/sec, 190 secs
lola: 25396540 markings, 124959472 edges, 128515 markings/sec, 195 secs
lola: 25964052 markings, 128132846 edges, 113502 markings/sec, 200 secs
lola: 26458491 markings, 131173105 edges, 98888 markings/sec, 205 secs
lola: 27018878 markings, 134242978 edges, 112077 markings/sec, 210 secs
lola: 27550789 markings, 137353120 edges, 106382 markings/sec, 215 secs
lola: 28017560 markings, 140069234 edges, 93354 markings/sec, 220 secs
lola: 28481241 markings, 142888858 edges, 92736 markings/sec, 225 secs
lola: 28987307 markings, 145677366 edges, 101213 markings/sec, 230 secs
lola: 29507168 markings, 148395519 edges, 103972 markings/sec, 235 secs
lola: 30176978 markings, 151214201 edges, 133962 markings/sec, 240 secs
lola: 30831057 markings, 154617565 edges, 130816 markings/sec, 245 secs
lola: 31523422 markings, 157670178 edges, 138473 markings/sec, 250 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR (2 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92))))) AND (A (G ((p187 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))) OR ((((p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (3 <= p198 + p199 + p200 + p201 + p202 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128) AND (p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p187 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) AND (p42 <= p207))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) OR (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) AND (p42 <= p207))
lola: processed formula length: 192
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p101))))) OR NOT((E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))) OR E (G ((3 <= p187))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p101)))
lola: processed formula length: 25
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 844070 markings, 2474503 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1606827 markings, 5000934 edges, 152551 markings/sec, 5 secs
lola: 2298068 markings, 8146744 edges, 138248 markings/sec, 10 secs
lola: 2977092 markings, 11515174 edges, 135805 markings/sec, 15 secs
lola: 3498912 markings, 15357714 edges, 104364 markings/sec, 20 secs
lola: 4112775 markings, 18299194 edges, 122773 markings/sec, 25 secs
lola: 4869646 markings, 20795130 edges, 151374 markings/sec, 30 secs
lola: 5449604 markings, 23909471 edges, 115992 markings/sec, 35 secs
lola: 6026455 markings, 26899905 edges, 115370 markings/sec, 40 secs
lola: 6679097 markings, 29646843 edges, 130528 markings/sec, 45 secs
lola: 7213666 markings, 32716930 edges, 106914 markings/sec, 50 secs
lola: 7967411 markings, 35224384 edges, 150749 markings/sec, 55 secs
lola: 8594040 markings, 37914147 edges, 125326 markings/sec, 60 secs
lola: 9057076 markings, 40975410 edges, 92607 markings/sec, 65 secs
lola: 9575431 markings, 43865116 edges, 103671 markings/sec, 70 secs
lola: 10181730 markings, 46393353 edges, 121260 markings/sec, 75 secs
lola: 10651728 markings, 49177461 edges, 94000 markings/sec, 80 secs
lola: 11188821 markings, 51818114 edges, 107419 markings/sec, 85 secs
lola: 11629529 markings, 54898862 edges, 88142 markings/sec, 90 secs
lola: 12054460 markings, 58037920 edges, 84986 markings/sec, 95 secs
lola: 12460251 markings, 61164434 edges, 81158 markings/sec, 100 secs
lola: 12853828 markings, 64077282 edges, 78715 markings/sec, 105 secs
lola: 13335393 markings, 66820968 edges, 96313 markings/sec, 110 secs
lola: 14121924 markings, 69620717 edges, 157306 markings/sec, 115 secs
lola: 14757867 markings, 72709786 edges, 127189 markings/sec, 120 secs
lola: 15376178 markings, 75479072 edges, 123662 markings/sec, 125 secs
lola: 16020331 markings, 78112471 edges, 128831 markings/sec, 130 secs
lola: 16542479 markings, 80832259 edges, 104430 markings/sec, 135 secs
lola: 17021062 markings, 83558906 edges, 95717 markings/sec, 140 secs
lola: 17432722 markings, 86518367 edges, 82332 markings/sec, 145 secs
lola: 18112138 markings, 89069094 edges, 135883 markings/sec, 150 secs
lola: 18728850 markings, 92232746 edges, 123342 markings/sec, 155 secs
lola: 19391367 markings, 94976450 edges, 132503 markings/sec, 160 secs
lola: 19969648 markings, 97755994 edges, 115656 markings/sec, 165 secs
lola: 20606461 markings, 100325577 edges, 127363 markings/sec, 170 secs
lola: 21143229 markings, 102987464 edges, 107354 markings/sec, 175 secs
lola: 21623641 markings, 105666514 edges, 96082 markings/sec, 180 secs
lola: 22034247 markings, 108632909 edges, 82121 markings/sec, 185 secs
lola: 22591179 markings, 111278813 edges, 111386 markings/sec, 190 secs
lola: 23193864 markings, 114050094 edges, 120537 markings/sec, 195 secs
lola: 23722205 markings, 116600192 edges, 105668 markings/sec, 200 secs
lola: 24212199 markings, 119396979 edges, 97999 markings/sec, 205 secs
lola: 24809153 markings, 122201719 edges, 119391 markings/sec, 210 secs
lola: 25422855 markings, 125089081 edges, 122740 markings/sec, 215 secs
lola: 25952672 markings, 128040514 edges, 105963 markings/sec, 220 secs
lola: 26403792 markings, 130825114 edges, 90224 markings/sec, 225 secs
lola: 26932371 markings, 133759304 edges, 105716 markings/sec, 230 secs
lola: 27377768 markings, 136479739 edges, 89079 markings/sec, 235 secs
lola: 27880380 markings, 139142838 edges, 100522 markings/sec, 240 secs
lola: 28290734 markings, 141800339 edges, 82071 markings/sec, 245 secs
lola: 28702809 markings, 144066182 edges, 82415 markings/sec, 250 secs
lola: 29141209 markings, 146440589 edges, 87680 markings/sec, 255 secs
lola: 29570314 markings, 148805466 edges, 85821 markings/sec, 260 secs
lola: 30220837 markings, 151396745 edges, 130105 markings/sec, 265 secs
lola: 30837080 markings, 154636749 edges, 123249 markings/sec, 270 secs
lola: 31450568 markings, 157303806 edges, 122698 markings/sec, 275 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((2 <= p41))) OR E (F ((3 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U (2 <= p41)) OR E(TRUE U (3 <= p40))))
lola: processed formula length: 56
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p42 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) OR A (G (((p41 <= 0) OR (p207 + 1 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p42 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p42 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.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 10 will run for 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p41 <= 0) OR (p207 + 1 <= p101))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p206)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-CTLCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 456 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196)))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2450162 markings, 2713576 edges, 3067840301390364672 markings/sec, 0 secs
lola: 4930038 markings, 5584693 edges, 495975 markings/sec, 5 secs
lola: 7401206 markings, 8369172 edges, 494234 markings/sec, 10 secs
lola: 9815558 markings, 11108614 edges, 482870 markings/sec, 15 secs
lola: 12211432 markings, 13845611 edges, 479175 markings/sec, 20 secs
lola: 14699617 markings, 16666874 edges, 497637 markings/sec, 25 secs
lola: 17005849 markings, 19271373 edges, 461246 markings/sec, 30 secs
lola: 19387215 markings, 22025887 edges, 476273 markings/sec, 35 secs
lola: 21701187 markings, 24638522 edges, 462794 markings/sec, 40 secs
lola: 23791955 markings, 26984489 edges, 418154 markings/sec, 45 secs
lola: 26042591 markings, 29604183 edges, 450127 markings/sec, 50 secs
lola: 28295690 markings, 32132259 edges, 450620 markings/sec, 55 secs
lola: 30590305 markings, 34736793 edges, 458923 markings/sec, 60 secs
lola: 32848978 markings, 37351847 edges, 451735 markings/sec, 65 secs
lola: 35190459 markings, 40069657 edges, 468296 markings/sec, 70 secs
lola: 37542594 markings, 42788428 edges, 470427 markings/sec, 75 secs
lola: 39894729 markings, 45477205 edges, 470427 markings/sec, 80 secs
lola: 42122066 markings, 48014191 edges, 445467 markings/sec, 85 secs
lola: 44282014 markings, 50496149 edges, 431990 markings/sec, 90 secs
lola: 46490160 markings, 53033232 edges, 441629 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p119 + 1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p119 + 1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))
lola: processed formula length: 69
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2540528 markings, 2823070 edges, 508106 markings/sec, 0 secs
lola: 4841318 markings, 5490989 edges, 460158 markings/sec, 5 secs
lola: 7300804 markings, 8249039 edges, 491897 markings/sec, 10 secs
lola: 9629534 markings, 10898218 edges, 465746 markings/sec, 15 secs
lola: 11897084 markings, 13476372 edges, 453510 markings/sec, 20 secs
lola: 14215464 markings, 16150257 edges, 463676 markings/sec, 25 secs
lola: 16548141 markings, 18757194 edges, 466535 markings/sec, 30 secs
lola: 18760863 markings, 21280602 edges, 442544 markings/sec, 35 secs
lola: 20923217 markings, 23798211 edges, 432471 markings/sec, 40 secs
lola: 22888245 markings, 25984714 edges, 393006 markings/sec, 45 secs
lola: 24911718 markings, 28260212 edges, 404695 markings/sec, 50 secs
lola: 26735874 markings, 30407076 edges, 364831 markings/sec, 55 secs
lola: 28803907 markings, 32715123 edges, 413607 markings/sec, 60 secs
lola: 30715341 markings, 34881384 edges, 382287 markings/sec, 65 secs
lola: 32792194 markings, 37282655 edges, 415371 markings/sec, 70 secs
lola: 34890571 markings, 39727124 edges, 419675 markings/sec, 75 secs
lola: 36925146 markings, 42074673 edges, 406915 markings/sec, 80 secs
lola: 39289463 markings, 44787980 edges, 472863 markings/sec, 85 secs
lola: 41648294 markings, 47476562 edges, 471766 markings/sec, 90 secs
lola: 43936678 markings, 50098248 edges, 457677 markings/sec, 95 secs
lola: 46114060 markings, 52595585 edges, 435476 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula length: 138
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2178209 markings, 2467687 edges, 2965989790530404352 markings/sec, 0 secs
lola: 4335679 markings, 4932511 edges, 431494 markings/sec, 5 secs
lola: 6095936 markings, 7006989 edges, 352051 markings/sec, 10 secs
lola: 8076606 markings, 9252128 edges, 396134 markings/sec, 15 secs
lola: 10060019 markings, 11481549 edges, 396683 markings/sec, 20 secs
lola: 12001275 markings, 13664670 edges, 388251 markings/sec, 25 secs
lola: 14028683 markings, 15961941 edges, 405482 markings/sec, 30 secs
lola: 15990347 markings, 18221259 edges, 392333 markings/sec, 35 secs
lola: 17982211 markings, 20438218 edges, 398373 markings/sec, 40 secs
lola: 19831639 markings, 22519347 edges, 369886 markings/sec, 45 secs
lola: 21896101 markings, 24872488 edges, 412892 markings/sec, 50 secs
lola: 23817865 markings, 27085483 edges, 384353 markings/sec, 55 secs
lola: 25690810 markings, 29315808 edges, 374589 markings/sec, 60 secs
lola: 27633146 markings, 31512669 edges, 388467 markings/sec, 65 secs
lola: 29602156 markings, 33829311 edges, 393802 markings/sec, 70 secs
lola: 31443532 markings, 36066851 edges, 368275 markings/sec, 75 secs
lola: 33513646 markings, 38460710 edges, 414023 markings/sec, 80 secs
lola: 35523511 markings, 40845481 edges, 401973 markings/sec, 85 secs
lola: 37477547 markings, 43128769 edges, 390807 markings/sec, 90 secs
lola: 39358999 markings, 45306642 edges, 376290 markings/sec, 95 secs
lola: 41205664 markings, 47477933 edges, 369333 markings/sec, 100 secs
lola: 43097750 markings, 49732336 edges, 378417 markings/sec, 105 secs
lola: 44885452 markings, 51763631 edges, 357540 markings/sec, 110 secs
lola: 46696655 markings, 53813866 edges, 362241 markings/sec, 115 secs
lola: 48559406 markings, 55902165 edges, 372550 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 970 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((p67 <= p101) U (3 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)))) OR (p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= p110))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 970 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p101 + 1 <= p67) R (p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((p67 <= p101) U (3 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)))
lola: processed formula length: 84
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1958390 markings, 2767086 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3848214 markings, 5430863 edges, 377965 markings/sec, 5 secs
lola: 5829291 markings, 8312035 edges, 396215 markings/sec, 10 secs
lola: 7850653 markings, 10969383 edges, 404272 markings/sec, 15 secs
lola: 9979611 markings, 13717156 edges, 425792 markings/sec, 20 secs
lola: 11973680 markings, 16347585 edges, 398814 markings/sec, 25 secs
lola: 13915296 markings, 18933197 edges, 388323 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 1903 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= p110)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= p110)
lola: processed formula length: 63
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 1903 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p129 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (3 <= p129))))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: no unknown unknown unknown yes unknown yes unknown yes no no unknown unknown unknown no yes
lola: ========================================
FORMULA PermAdmissibility-COL-05-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496382128868

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