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-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440485000426
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494658752648


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-PT-10 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-CTLCardinality.task
lola: NOT(E (F (A (G ((c13 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))) : ((((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)) AND NOT(NOT(E (F ((in4_6 + in4_7 <= c12)))))) : (E (G (E (X ((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))) AND A (X (A (F ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= in4_6 + in4_7)))))) : A (F ((c5 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))) : E (((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) U A (F ((3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))) : (NOT(NOT(A (G ((1 <= in3_4 + in3_5))))) OR (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)) : A ((E (X ((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7))) U ((2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (2 <= aux6_0 + aux6_1 + aux6_4 + aux6_5) AND (3 <= c16) AND (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))) : E (G ((E (G ((c15 <= c11))) OR ((c18 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (c11 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))))) : ((2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) OR NOT(A (((3 <= in3_4 + in3_5) U (1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))))) : NOT(A (X (E (F ((c5 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))) : NOT(A (X (E (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= in4_6 + in4_7)))))) : A (((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c7) U ((3 <= c20) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))) : (A (F ((3 <= c14))) OR ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))) : NOT(E (F (((3 <= c14) AND (c16 <= c110) AND (c6 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))) : ((A (X (((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5)))) AND (3 <= c12)) OR E (F (E (F ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))) : NOT((E (G ((c9 <= 0))) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 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: NOT(E (F (A (G ((c13 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 + 1 <= c13)))))
lola: processed formula length: 120
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)) AND NOT(NOT(E (F ((in4_6 + in4_7 <= c12))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (c19 <= 2)) OR (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c15) OR (out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))
lola: processed formula length: 343
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((in4_6 + in4_7 <= c12)))
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 544 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-10-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))) AND A (X (A (F ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= in4_6 + in4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((c12 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))
lola: processed formula length: 102
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 868376 markings, 3058538 edges, 1996945387872583680 markings/sec, 0 secs
lola: 1657994 markings, 6071039 edges, 157924 markings/sec, 5 secs
lola: 2436868 markings, 9127517 edges, 155775 markings/sec, 10 secs
lola: 3142401 markings, 12114697 edges, 141107 markings/sec, 15 secs
lola: 3779903 markings, 15469923 edges, 127500 markings/sec, 20 secs
lola: 4445392 markings, 18626572 edges, 133098 markings/sec, 25 secs
lola: 5079400 markings, 21929392 edges, 126802 markings/sec, 30 secs
lola: 5837800 markings, 25097076 edges, 151680 markings/sec, 35 secs
lola: 6566586 markings, 28167460 edges, 145757 markings/sec, 40 secs
lola: 7262299 markings, 31235246 edges, 139143 markings/sec, 45 secs
lola: 7872596 markings, 34494005 edges, 122059 markings/sec, 50 secs
lola: 8518938 markings, 37899776 edges, 129268 markings/sec, 55 secs
lola: 9231923 markings, 41241992 edges, 142597 markings/sec, 60 secs
lola: 9926375 markings, 44547668 edges, 138890 markings/sec, 65 secs
lola: 10585854 markings, 47758627 edges, 131896 markings/sec, 70 secs
lola: 11281241 markings, 50885236 edges, 139077 markings/sec, 75 secs
lola: 12008186 markings, 53851751 edges, 145389 markings/sec, 80 secs
lola: 12634154 markings, 56867305 edges, 125194 markings/sec, 85 secs
lola: 13302422 markings, 59988239 edges, 133654 markings/sec, 90 secs
lola: 13926126 markings, 63177999 edges, 124741 markings/sec, 95 secs
lola: 14610413 markings, 66499946 edges, 136857 markings/sec, 100 secs
lola: 15279156 markings, 69736909 edges, 133749 markings/sec, 105 secs
lola: 15958714 markings, 72772127 edges, 135912 markings/sec, 110 secs
lola: 16621046 markings, 75749510 edges, 132466 markings/sec, 115 secs
lola: 17293350 markings, 78819443 edges, 134461 markings/sec, 120 secs
lola: 17975813 markings, 82027688 edges, 136493 markings/sec, 125 secs
lola: 18666293 markings, 85036522 edges, 138096 markings/sec, 130 secs
lola: 19327945 markings, 88048821 edges, 132330 markings/sec, 135 secs
lola: 20182176 markings, 91084520 edges, 170846 markings/sec, 140 secs
lola: 20965026 markings, 94010922 edges, 156570 markings/sec, 145 secs
lola: 21717829 markings, 96966726 edges, 150561 markings/sec, 150 secs
lola: 22410461 markings, 99847238 edges, 138526 markings/sec, 155 secs
lola: 23041259 markings, 103015951 edges, 126160 markings/sec, 160 secs
lola: 23685311 markings, 106161741 edges, 128810 markings/sec, 165 secs
lola: 24297196 markings, 109330138 edges, 122377 markings/sec, 170 secs
lola: 24963832 markings, 112424863 edges, 133327 markings/sec, 175 secs
lola: 25624681 markings, 115350064 edges, 132170 markings/sec, 180 secs
lola: 26175052 markings, 118456724 edges, 110074 markings/sec, 185 secs
lola: 26850832 markings, 121779203 edges, 135156 markings/sec, 190 secs
lola: 27497774 markings, 125029808 edges, 129388 markings/sec, 195 secs
lola: 28130696 markings, 128119283 edges, 126584 markings/sec, 200 secs
lola: 28795864 markings, 131088861 edges, 133034 markings/sec, 205 secs
lola: 29381515 markings, 134052080 edges, 117130 markings/sec, 210 secs
lola: 29998347 markings, 137204385 edges, 123366 markings/sec, 215 secs
lola: 30621505 markings, 140370566 edges, 124632 markings/sec, 220 secs
lola: 31251057 markings, 143341070 edges, 125910 markings/sec, 225 secs
lola: 31863778 markings, 146364088 edges, 122544 markings/sec, 230 secs
lola: 32497351 markings, 149459671 edges, 126715 markings/sec, 235 secs
lola: 33138151 markings, 152432288 edges, 128160 markings/sec, 240 secs
lola: 33853321 markings, 155659993 edges, 143034 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((c5 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (c5 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))
lola: processed formula length: 87
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 2644330 markings, 2807377 edges, 2011001681961025536 markings/sec, 0 secs
lola: 5199620 markings, 5558229 edges, 511058 markings/sec, 5 secs
lola: 7726391 markings, 8253972 edges, 505354 markings/sec, 10 secs
lola: 10242854 markings, 10981378 edges, 503293 markings/sec, 15 secs
lola: 12774573 markings, 13742784 edges, 506344 markings/sec, 20 secs
lola: 15025214 markings, 16217076 edges, 450128 markings/sec, 25 secs
lola: 17475918 markings, 18913648 edges, 490141 markings/sec, 30 secs
lola: 19801673 markings, 21464677 edges, 465151 markings/sec, 35 secs
lola: 22310306 markings, 24231760 edges, 501727 markings/sec, 40 secs
lola: 24501112 markings, 26635675 edges, 438161 markings/sec, 45 secs
lola: 26840505 markings, 29219692 edges, 467879 markings/sec, 50 secs
lola: 29202983 markings, 31795334 edges, 472496 markings/sec, 55 secs
lola: 31752902 markings, 34545362 edges, 509984 markings/sec, 60 secs
lola: 34198244 markings, 37214065 edges, 489068 markings/sec, 65 secs
lola: 36700177 markings, 39920237 edges, 500387 markings/sec, 70 secs
lola: 39161845 markings, 42584286 edges, 492334 markings/sec, 75 secs
lola: 41606700 markings, 45248216 edges, 488971 markings/sec, 80 secs
lola: 43922806 markings, 47745513 edges, 463221 markings/sec, 85 secs
lola: 46304961 markings, 50339920 edges, 476431 markings/sec, 90 secs
lola: 48653547 markings, 52877975 edges, 469717 markings/sec, 95 secs
lola: 50625279 markings, 55029460 edges, 394346 markings/sec, 100 secs
lola: 52705668 markings, 57284312 edges, 416078 markings/sec, 105 secs
lola: 54940103 markings, 59726595 edges, 446887 markings/sec, 110 secs
lola: 57248115 markings, 62251387 edges, 461602 markings/sec, 115 secs
lola: 59477800 markings, 64687835 edges, 445937 markings/sec, 120 secs
lola: 61553568 markings, 66944441 edges, 415154 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) U A (F ((3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) U A(TRUE U (3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))
lola: processed formula length: 168
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 2113615 markings, 2324115 edges, 2933393943691264000 markings/sec, 0 secs
lola: 4267014 markings, 4763838 edges, 430680 markings/sec, 5 secs
lola: 6326905 markings, 7329122 edges, 411978 markings/sec, 10 secs
lola: 8239643 markings, 9650440 edges, 382548 markings/sec, 15 secs
lola: 10270611 markings, 11998674 edges, 406194 markings/sec, 20 secs
lola: 12192738 markings, 14129910 edges, 384425 markings/sec, 25 secs
lola: 13927349 markings, 16266920 edges, 346922 markings/sec, 30 secs
lola: 16003976 markings, 18583969 edges, 415325 markings/sec, 35 secs
lola: 17918417 markings, 20796666 edges, 382888 markings/sec, 40 secs
lola: 19891190 markings, 23170185 edges, 394555 markings/sec, 45 secs
lola: 21889764 markings, 25480963 edges, 399715 markings/sec, 50 secs
lola: 23771826 markings, 27590012 edges, 376412 markings/sec, 55 secs
lola: 25559205 markings, 29700604 edges, 357476 markings/sec, 60 secs
lola: 27380034 markings, 31901253 edges, 364166 markings/sec, 65 secs
lola: 29240732 markings, 34159301 edges, 372140 markings/sec, 70 secs
lola: 31163343 markings, 36379786 edges, 384522 markings/sec, 75 secs
lola: 33073700 markings, 38518712 edges, 382071 markings/sec, 80 secs
lola: 34939803 markings, 40813793 edges, 373221 markings/sec, 85 secs
lola: 36869841 markings, 42967243 edges, 386008 markings/sec, 90 secs
lola: 38638316 markings, 45079865 edges, 353695 markings/sec, 95 secs
lola: 40444415 markings, 47204176 edges, 361220 markings/sec, 100 secs
lola: 42288731 markings, 49378610 edges, 368863 markings/sec, 105 secs
lola: 44036989 markings, 51459836 edges, 349652 markings/sec, 110 secs
lola: 45794941 markings, 53520148 edges, 351590 markings/sec, 115 secs
lola: 47644422 markings, 55643448 edges, 369896 markings/sec, 120 secs
lola: 49491086 markings, 57854066 edges, 369333 markings/sec, 125 secs
lola: 51354608 markings, 60079894 edges, 372704 markings/sec, 130 secs
lola: 53225163 markings, 62261098 edges, 374111 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (G ((1 <= in3_4 + in3_5))))) OR (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= in3_4 + in3_5)))
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 544 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: processed formula length: 76
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7))) U ((2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (2 <= aux6_0 + aux6_1 + aux6_4 + aux6_5) AND (3 <= c16) AND (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)) U ((2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (2 <= aux6_0 + aux6_1 + aux6_4 + aux6_5) AND (3 <= c16) AND (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))
lola: processed formula length: 357
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((c15 <= c11))) OR ((c18 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (c11 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U (c11 + 1 <= c15)) AND ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 + 1 <= c18) OR (aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c11)))))
lola: processed formula length: 187
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 1224150 markings, 3279772 edges, 1996945387872583680 markings/sec, 0 secs
lola: 2285001 markings, 6632988 edges, 212170 markings/sec, 5 secs
lola: 3310642 markings, 9863079 edges, 205128 markings/sec, 10 secs
lola: 4479128 markings, 12928840 edges, 233697 markings/sec, 15 secs
lola: 5646513 markings, 16203200 edges, 233477 markings/sec, 20 secs
lola: 6676069 markings, 19570398 edges, 205911 markings/sec, 25 secs
lola: 7607943 markings, 22748551 edges, 186375 markings/sec, 30 secs
lola: 8435584 markings, 26065393 edges, 165528 markings/sec, 35 secs
lola: 9270821 markings, 29613451 edges, 167047 markings/sec, 40 secs
lola: 10236365 markings, 32825119 edges, 193109 markings/sec, 45 secs
lola: 11143677 markings, 35968494 edges, 181462 markings/sec, 50 secs
lola: 12069387 markings, 39080136 edges, 185142 markings/sec, 55 secs
lola: 13062028 markings, 42181717 edges, 198528 markings/sec, 60 secs
lola: 13911365 markings, 45336627 edges, 169867 markings/sec, 65 secs
lola: 14660717 markings, 48549857 edges, 149870 markings/sec, 70 secs
lola: 15419181 markings, 52009095 edges, 151693 markings/sec, 75 secs
lola: 16173343 markings, 55206565 edges, 150832 markings/sec, 80 secs
lola: 16951648 markings, 58351205 edges, 155661 markings/sec, 85 secs
lola: 17649356 markings, 61513721 edges, 139542 markings/sec, 90 secs
lola: 18350050 markings, 64839749 edges, 140139 markings/sec, 95 secs
lola: 19056144 markings, 67933360 edges, 141219 markings/sec, 100 secs
lola: 19756500 markings, 70994924 edges, 140071 markings/sec, 105 secs
lola: 20470733 markings, 74235620 edges, 142847 markings/sec, 110 secs
lola: 21194082 markings, 77474972 edges, 144670 markings/sec, 115 secs
lola: 21796267 markings, 80826000 edges, 120437 markings/sec, 120 secs
lola: 22585688 markings, 83837821 edges, 157884 markings/sec, 125 secs
lola: 23338124 markings, 86882694 edges, 150487 markings/sec, 130 secs
lola: 24112667 markings, 89966109 edges, 154909 markings/sec, 135 secs
lola: 24839107 markings, 92975168 edges, 145288 markings/sec, 140 secs
lola: 25470443 markings, 96066932 edges, 126267 markings/sec, 145 secs
lola: 26096945 markings, 99151594 edges, 125300 markings/sec, 150 secs
lola: 26713023 markings, 102229155 edges, 123216 markings/sec, 155 secs
lola: 27281534 markings, 105306061 edges, 113702 markings/sec, 160 secs
lola: 27804168 markings, 108644090 edges, 104527 markings/sec, 165 secs
lola: 28346442 markings, 111944153 edges, 108455 markings/sec, 170 secs
lola: 29195603 markings, 115043511 edges, 169832 markings/sec, 175 secs
lola: 30183289 markings, 117951336 edges, 197537 markings/sec, 180 secs
lola: 31149795 markings, 120842344 edges, 193301 markings/sec, 185 secs
lola: 32100508 markings, 123758605 edges, 190143 markings/sec, 190 secs
lola: 33120715 markings, 126589677 edges, 204041 markings/sec, 195 secs
lola: 34177734 markings, 129519048 edges, 211404 markings/sec, 200 secs
lola: 35138201 markings, 132533642 edges, 192093 markings/sec, 205 secs
lola: 35984690 markings, 135501587 edges, 169298 markings/sec, 210 secs
lola: 36772538 markings, 138481017 edges, 157570 markings/sec, 215 secs
lola: 37547037 markings, 141658910 edges, 154900 markings/sec, 220 secs
lola: 38304371 markings, 144923994 edges, 151467 markings/sec, 225 secs
lola: 39073285 markings, 147926353 edges, 153783 markings/sec, 230 secs
lola: 39819703 markings, 150836180 edges, 149284 markings/sec, 235 secs
lola: 40621245 markings, 153662648 edges, 160308 markings/sec, 240 secs
lola: 41416420 markings, 156511204 edges, 159035 markings/sec, 245 secs
lola: 42081553 markings, 159472908 edges, 133027 markings/sec, 250 secs
lola: 42717480 markings, 162489848 edges, 127185 markings/sec, 255 secs
lola: 43350666 markings, 165724731 edges, 126637 markings/sec, 260 secs
lola: 44036334 markings, 168986000 edges, 137134 markings/sec, 265 secs
lola: 44776055 markings, 172211958 edges, 147944 markings/sec, 270 secs
lola: 45463987 markings, 175360313 edges, 137586 markings/sec, 275 secs
lola: 46048193 markings, 178490029 edges, 116841 markings/sec, 280 secs
lola: 46686328 markings, 181836563 edges, 127627 markings/sec, 285 secs
lola: 47319852 markings, 185022511 edges, 126705 markings/sec, 290 secs
lola: 47999614 markings, 188075140 edges, 135952 markings/sec, 295 secs
lola: 48530152 markings, 191220680 edges, 106108 markings/sec, 300 secs
lola: 49324854 markings, 194435963 edges, 158940 markings/sec, 305 secs
lola: 50003120 markings, 197718807 edges, 135653 markings/sec, 310 secs
lola: 50592919 markings, 201118656 edges, 117960 markings/sec, 315 secs
lola: 51307124 markings, 204079599 edges, 142841 markings/sec, 320 secs
lola: 51971866 markings, 207103177 edges, 132948 markings/sec, 325 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7) OR NOT(A (((3 <= in3_4 + in3_5) U (1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)
lola: processed formula length: 76
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 9 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((in3_4 + in3_5 <= 2) R (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((3 <= in3_4 + in3_5) U (1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)))
lola: processed formula length: 115
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (F ((c5 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (c5 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))
lola: processed formula length: 104
lola: 8 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= in4_6 + in4_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (in4_6 + in4_7 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula length: 70
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 2067487 markings, 3797046 edges, 3689348869717491712 markings/sec, 0 secs
lola: 4032737 markings, 7370968 edges, 393050 markings/sec, 5 secs
lola: 5949074 markings, 10857712 edges, 383267 markings/sec, 10 secs
lola: 7858630 markings, 14312750 edges, 381911 markings/sec, 15 secs
lola: 9523947 markings, 17751540 edges, 333063 markings/sec, 20 secs
lola: 10909037 markings, 21271822 edges, 277018 markings/sec, 25 secs
lola: 12052916 markings, 24684338 edges, 228776 markings/sec, 30 secs
lola: 13352475 markings, 28050182 edges, 259912 markings/sec, 35 secs
lola: 14683083 markings, 31430889 edges, 266122 markings/sec, 40 secs
lola: 16106025 markings, 34755599 edges, 284588 markings/sec, 45 secs
lola: 17407169 markings, 38324114 edges, 260229 markings/sec, 50 secs
lola: 18594346 markings, 41652026 edges, 237435 markings/sec, 55 secs
lola: 19770939 markings, 44939594 edges, 235319 markings/sec, 60 secs
lola: 21075003 markings, 48441184 edges, 260813 markings/sec, 65 secs
lola: 22364618 markings, 51806089 edges, 257923 markings/sec, 70 secs
lola: 23651990 markings, 54988366 edges, 257474 markings/sec, 75 secs
lola: 24956633 markings, 58500207 edges, 260929 markings/sec, 80 secs
lola: 26141032 markings, 61622575 edges, 236880 markings/sec, 85 secs
lola: 27236699 markings, 64730356 edges, 219133 markings/sec, 90 secs
lola: 28383225 markings, 67854768 edges, 229305 markings/sec, 95 secs
lola: 29617564 markings, 70837263 edges, 246868 markings/sec, 100 secs
lola: 30951819 markings, 74483311 edges, 266851 markings/sec, 105 secs
lola: 32160094 markings, 77690463 edges, 241655 markings/sec, 110 secs
lola: 33310062 markings, 80940125 edges, 229994 markings/sec, 115 secs
lola: 34522812 markings, 84265438 edges, 242550 markings/sec, 120 secs
lola: 35868726 markings, 87688146 edges, 269183 markings/sec, 125 secs
lola: 37123430 markings, 90874498 edges, 250941 markings/sec, 130 secs
lola: 38359353 markings, 94196278 edges, 247185 markings/sec, 135 secs
lola: 39931078 markings, 97461243 edges, 314345 markings/sec, 140 secs
lola: 41561312 markings, 100415805 edges, 326047 markings/sec, 145 secs
lola: 43207673 markings, 103505774 edges, 329272 markings/sec, 150 secs
lola: 44862457 markings, 106529699 edges, 330957 markings/sec, 155 secs
lola: 46399899 markings, 109442466 edges, 307488 markings/sec, 160 secs
lola: 47631355 markings, 112783788 edges, 246291 markings/sec, 165 secs
lola: 48817713 markings, 116024776 edges, 237272 markings/sec, 170 secs
lola: 49892318 markings, 119086180 edges, 214921 markings/sec, 175 secs
lola: 50803166 markings, 122204134 edges, 182170 markings/sec, 180 secs
lola: 51906180 markings, 125209593 edges, 220603 markings/sec, 185 secs
lola: 52994400 markings, 128281977 edges, 217644 markings/sec, 190 secs
lola: 54057137 markings, 131246212 edges, 212547 markings/sec, 195 secs
lola: 55134422 markings, 134077126 edges, 215457 markings/sec, 200 secs
lola: 56310540 markings, 137303459 edges, 235224 markings/sec, 205 secs
lola: 57289516 markings, 140265339 edges, 195795 markings/sec, 210 secs
lola: 58311956 markings, 143076509 edges, 204488 markings/sec, 215 secs
lola: 59417730 markings, 146126600 edges, 221155 markings/sec, 220 secs
lola: 60534750 markings, 149232433 edges, 223404 markings/sec, 225 secs
lola: 61674547 markings, 152230777 edges, 227959 markings/sec, 230 secs
lola: 62562788 markings, 155149755 edges, 177648 markings/sec, 235 secs
lola: 63542760 markings, 157975774 edges, 195994 markings/sec, 240 secs
lola: 64553553 markings, 161031370 edges, 202159 markings/sec, 245 secs
lola: 65537857 markings, 163743735 edges, 196861 markings/sec, 250 secs
lola: 66704631 markings, 166794460 edges, 233355 markings/sec, 255 secs
lola: 67717564 markings, 169878134 edges, 202587 markings/sec, 260 secs
lola: 68816757 markings, 172867567 edges, 219839 markings/sec, 265 secs
lola: 69852647 markings, 175754225 edges, 207178 markings/sec, 270 secs
lola: 70886302 markings, 178750991 edges, 206731 markings/sec, 275 secs
lola: 72186784 markings, 181779131 edges, 260096 markings/sec, 280 secs
lola: 73758069 markings, 184769511 edges, 314257 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c7) U ((3 <= c20) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c7) U ((3 <= c20) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15) AND (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))
lola: processed formula length: 343
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 12 will run for 595 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= c14))) OR ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 595 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= c14)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= c14))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 13 will run for 793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c6 + 1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))
lola: processed formula length: 164
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((3 <= c14) AND (c16 <= c110) AND (c6 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))
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 544 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1190 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X (((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5)))) AND (3 <= c12)) OR E (F (E (F ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1190 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((c9 <= c110) OR (in2_2 + in2_3 <= in3_4 + in3_5)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 0 significant temporal operators and needs 0 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 15 will run for 2381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= c12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= c12)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((c9 <= 0))) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= c9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= c9))
lola: processed formula length: 19
lola: 6 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 2541731 markings, 5238364 edges, 2976429103680323584 markings/sec, 0 secs
lola: 4766607 markings, 10073942 edges, 444975 markings/sec, 5 secs
lola: 7197133 markings, 15482991 edges, 486105 markings/sec, 10 secs
lola: 9406007 markings, 20373671 edges, 441775 markings/sec, 15 secs
lola: 11674802 markings, 25472936 edges, 453759 markings/sec, 20 secs
lola: 13998390 markings, 30783942 edges, 464718 markings/sec, 25 secs
lola: 16230396 markings, 35761003 edges, 446401 markings/sec, 30 secs
lola: 18467404 markings, 40785474 edges, 447402 markings/sec, 35 secs
lola: 20654233 markings, 45803154 edges, 437366 markings/sec, 40 secs
lola: 22949530 markings, 51097553 edges, 459059 markings/sec, 45 secs
lola: 25348775 markings, 56477203 edges, 479849 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown unknown unknown no no unknown yes no unknown no no no unknown yes
lola: ========================================
FORMULA PermAdmissibility-COL-10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494659970174

--------------------
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-PT-10"
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/PermAdmissibility-PT-10.tgz
mv PermAdmissibility-PT-10 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-PT-10, 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 r038-blw7-149440485000426"
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 ;