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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-0
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-1
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-15
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-2
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-3
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-4
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-5
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-6
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-7
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-8
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494657038379


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-PT-02 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-02-LTLCardinality.task
lola: A (G (F (X (G ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))) : A ((2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)) : A (G (X (X ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= c18))))) : A (F (G (X (G ((1 <= c5)))))) : A (G (G ((c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) : A (X (F (F (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c11)))))) : A (F (F (G ((c8 <= c20))))) : A (F ((F ((3 <= c12)) U X ((c8 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) : A (G ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c17))) : A (X (X (F ((c9 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))) : A ((X ((3 <= c17)) U F (F ((2 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))) : A (F (F (G (X ((c15 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))) : A (G ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))) : A (X (G (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux6_0 + aux6_1 + aux6_4 + aux6_5))))) : A (X (((c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) U X ((c18 <= c17))))) : A ((1 <= in1_0 + in1_1))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (G ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (G ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))))
lola: processed formula: A (G (F (X (G ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))))
lola: processed formula length: 172
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= c18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= c18)))))
lola: processed formula: A (G (X (X ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= c18)))))
lola: processed formula length: 94
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((1 <= c5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((1 <= c5))))))
lola: processed formula: A (F (G (X (G ((1 <= c5))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
lola: processed formula: A (G (G ((c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c11))))
lola: processed formula: A (X (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c11))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G ((c8 <= c20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((c8 <= c20))))
lola: processed formula: A (F (G ((c8 <= c20))))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 972843 markings, 2708422 edges, 194569 markings/sec, 0 secs
lola: 1854352 markings, 5281477 edges, 176302 markings/sec, 5 secs
lola: 2766436 markings, 7978263 edges, 182417 markings/sec, 10 secs
lola: 3631490 markings, 10462272 edges, 173011 markings/sec, 15 secs
lola: 4565797 markings, 13267233 edges, 186861 markings/sec, 20 secs
lola: 5476604 markings, 15945524 edges, 182161 markings/sec, 25 secs
lola: 6297711 markings, 18375386 edges, 164221 markings/sec, 30 secs
lola: 7106168 markings, 20679261 edges, 161691 markings/sec, 35 secs
lola: 8034853 markings, 23557014 edges, 185737 markings/sec, 40 secs
lola: 8851619 markings, 25913108 edges, 163353 markings/sec, 45 secs
lola: 9664723 markings, 28227326 edges, 162621 markings/sec, 50 secs
lola: 10495083 markings, 30576847 edges, 166072 markings/sec, 55 secs
lola: 11317038 markings, 33053237 edges, 164391 markings/sec, 60 secs
lola: 12018375 markings, 34971707 edges, 140267 markings/sec, 65 secs
lola: 12773206 markings, 37050310 edges, 150966 markings/sec, 70 secs
lola: 13495112 markings, 39041890 edges, 144381 markings/sec, 75 secs
lola: 14304373 markings, 41444263 edges, 161852 markings/sec, 80 secs
lola: 15104257 markings, 43829604 edges, 159977 markings/sec, 85 secs
lola: 15893159 markings, 46199242 edges, 157780 markings/sec, 90 secs
lola: 16738316 markings, 48781377 edges, 169031 markings/sec, 95 secs
lola: 17516613 markings, 50991175 edges, 155659 markings/sec, 100 secs
lola: 18360686 markings, 53531929 edges, 168815 markings/sec, 105 secs
lola: 19204852 markings, 56033709 edges, 168833 markings/sec, 110 secs
lola: 19973643 markings, 58310795 edges, 153758 markings/sec, 115 secs
lola: 20770895 markings, 60652442 edges, 159450 markings/sec, 120 secs
lola: 21563719 markings, 63097692 edges, 158565 markings/sec, 125 secs
lola: 22361285 markings, 65388693 edges, 159513 markings/sec, 130 secs
lola: 23110918 markings, 67591730 edges, 149927 markings/sec, 135 secs
lola: 23881794 markings, 69842988 edges, 154175 markings/sec, 140 secs
lola: 24592977 markings, 71884990 edges, 142237 markings/sec, 145 secs
lola: 25301951 markings, 74019125 edges, 141795 markings/sec, 150 secs
lola: 25965788 markings, 75902588 edges, 132767 markings/sec, 155 secs
lola: 26620808 markings, 77775425 edges, 131004 markings/sec, 160 secs
lola: 27503157 markings, 80488878 edges, 176470 markings/sec, 165 secs
lola: 28417572 markings, 83326660 edges, 182883 markings/sec, 170 secs
lola: 29273574 markings, 85853196 edges, 171200 markings/sec, 175 secs
lola: 30073250 markings, 88261979 edges, 159935 markings/sec, 180 secs
lola: 30910814 markings, 90769186 edges, 167513 markings/sec, 185 secs
lola: 31708391 markings, 93074685 edges, 159515 markings/sec, 190 secs
lola: 32593702 markings, 95669474 edges, 177062 markings/sec, 195 secs
lola: 33409620 markings, 98048758 edges, 163184 markings/sec, 200 secs
lola: 34237443 markings, 100466596 edges, 165565 markings/sec, 205 secs
lola: 35065327 markings, 103028328 edges, 165577 markings/sec, 210 secs
lola: 35778331 markings, 105090955 edges, 142601 markings/sec, 215 secs
lola: 36502548 markings, 107041106 edges, 144843 markings/sec, 220 secs
lola: 37223063 markings, 108957369 edges, 144103 markings/sec, 225 secs
lola: 37777275 markings, 110317551 edges, 110842 markings/sec, 230 secs
lola: 38603086 markings, 112621266 edges, 165162 markings/sec, 235 secs
lola: 39350534 markings, 114633131 edges, 149490 markings/sec, 240 secs
lola: 40107806 markings, 116691891 edges, 151454 markings/sec, 245 secs
lola: 40865478 markings, 118673188 edges, 151534 markings/sec, 250 secs
lola: 41589226 markings, 120610674 edges, 144750 markings/sec, 255 secs
lola: 42324506 markings, 122637242 edges, 147056 markings/sec, 260 secs
lola: 43020345 markings, 124512121 edges, 139168 markings/sec, 265 secs
lola: 43786322 markings, 126518409 edges, 153195 markings/sec, 270 secs
lola: 44474046 markings, 128330360 edges, 137545 markings/sec, 275 secs
lola: 45159707 markings, 130170261 edges, 137132 markings/sec, 280 secs
lola: 45945559 markings, 132388045 edges, 157170 markings/sec, 285 secs
lola: 46799245 markings, 135003571 edges, 170737 markings/sec, 290 secs
lola: 47627238 markings, 137472926 edges, 165599 markings/sec, 295 secs
lola: 48438155 markings, 139835090 edges, 162183 markings/sec, 300 secs
lola: 49194455 markings, 141897147 edges, 151260 markings/sec, 305 secs
lola: 49974741 markings, 144130995 edges, 156057 markings/sec, 310 secs
lola: 50735391 markings, 146289431 edges, 152130 markings/sec, 315 secs
lola: 51554165 markings, 148628773 edges, 163755 markings/sec, 320 secs
lola: 52303034 markings, 150744722 edges, 149774 markings/sec, 325 secs
lola: 53042670 markings, 152825615 edges, 147927 markings/sec, 330 secs
lola: 53743421 markings, 154839207 edges, 140150 markings/sec, 335 secs
lola: 54447227 markings, 156799957 edges, 140761 markings/sec, 340 secs
lola: 55111098 markings, 158571593 edges, 132774 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= c12)) U X ((c8 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= c12)) U X ((c8 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))))
lola: processed formula: A (F ((F ((3 <= c12)) U X ((c8 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c17)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((c9 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((c9 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: processed formula: A (X (X (F ((c9 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= c17)) U F (F ((2 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= c17)) U F ((2 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))
lola: processed formula: A ((X ((3 <= c17)) U F ((2 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))
lola: processed formula length: 103
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((c15 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((c15 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))
lola: processed formula: A (F (G (X ((c15 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1377570 markings, 3595480 edges, 275514 markings/sec, 0 secs
lola: 2782278 markings, 7652300 edges, 280942 markings/sec, 5 secs
lola: 4065715 markings, 11348087 edges, 256687 markings/sec, 10 secs
lola: 5483700 markings, 15050689 edges, 283597 markings/sec, 15 secs
lola: 6858302 markings, 18629381 edges, 274920 markings/sec, 20 secs
lola: 8182119 markings, 21898103 edges, 264763 markings/sec, 25 secs
lola: 9425609 markings, 25234299 edges, 248698 markings/sec, 30 secs
lola: 10666818 markings, 28502831 edges, 248242 markings/sec, 35 secs
lola: 11924439 markings, 31639737 edges, 251524 markings/sec, 40 secs
lola: 13103291 markings, 34823551 edges, 235770 markings/sec, 45 secs
lola: 14365275 markings, 38179755 edges, 252397 markings/sec, 50 secs
lola: 15577894 markings, 41576869 edges, 242524 markings/sec, 55 secs
lola: 16715161 markings, 45170051 edges, 227453 markings/sec, 60 secs
lola: 17839548 markings, 48752227 edges, 224877 markings/sec, 65 secs
lola: 18989161 markings, 52219334 edges, 229923 markings/sec, 70 secs
lola: 20179886 markings, 55826574 edges, 238145 markings/sec, 75 secs
lola: 21305935 markings, 59578240 edges, 225210 markings/sec, 80 secs
lola: 22418367 markings, 63234027 edges, 222486 markings/sec, 85 secs
lola: 23717989 markings, 66680421 edges, 259924 markings/sec, 90 secs
lola: 24998752 markings, 69988023 edges, 256153 markings/sec, 95 secs
lola: 26205246 markings, 73020351 edges, 241299 markings/sec, 100 secs
lola: 27459511 markings, 76313558 edges, 250853 markings/sec, 105 secs
lola: 28698516 markings, 79456502 edges, 247801 markings/sec, 110 secs
lola: 29938845 markings, 82675223 edges, 248066 markings/sec, 115 secs
lola: 31241504 markings, 85819991 edges, 260532 markings/sec, 120 secs
lola: 32483263 markings, 88992978 edges, 248352 markings/sec, 125 secs
lola: 33755023 markings, 92063743 edges, 254352 markings/sec, 130 secs
lola: 35018872 markings, 95312238 edges, 252770 markings/sec, 135 secs
lola: 36273328 markings, 98781283 edges, 250891 markings/sec, 140 secs
lola: 37514047 markings, 102214883 edges, 248144 markings/sec, 145 secs
lola: 38728426 markings, 105418864 edges, 242876 markings/sec, 150 secs
lola: 39980262 markings, 108495539 edges, 250367 markings/sec, 155 secs
lola: 41171408 markings, 112186691 edges, 238229 markings/sec, 160 secs
lola: 42313574 markings, 115680398 edges, 228433 markings/sec, 165 secs
lola: 43465632 markings, 119262686 edges, 230412 markings/sec, 170 secs
lola: 44593915 markings, 122787989 edges, 225657 markings/sec, 175 secs
lola: 45687235 markings, 126225513 edges, 218664 markings/sec, 180 secs
lola: 46783260 markings, 129685656 edges, 219205 markings/sec, 185 secs
lola: 47903629 markings, 133081281 edges, 224074 markings/sec, 190 secs
lola: 48938615 markings, 136449185 edges, 206997 markings/sec, 195 secs
lola: 49985961 markings, 139832301 edges, 209469 markings/sec, 200 secs
lola: 51161485 markings, 143335431 edges, 235105 markings/sec, 205 secs
lola: 52277658 markings, 146822900 edges, 223235 markings/sec, 210 secs
lola: 53434111 markings, 150327508 edges, 231291 markings/sec, 215 secs
lola: 54462311 markings, 153549023 edges, 205640 markings/sec, 220 secs
lola: 55508926 markings, 156672338 edges, 209323 markings/sec, 225 secs
lola: 56578592 markings, 159900570 edges, 213933 markings/sec, 230 secs
lola: 57496270 markings, 163101382 edges, 183536 markings/sec, 235 secs
lola: 58511686 markings, 166176897 edges, 203083 markings/sec, 240 secs
lola: 59531713 markings, 169345846 edges, 204005 markings/sec, 245 secs
lola: 60587704 markings, 172655032 edges, 211198 markings/sec, 250 secs
lola: 61663458 markings, 175824236 edges, 215151 markings/sec, 255 secs
lola: 62816708 markings, 179064926 edges, 230650 markings/sec, 260 secs
lola: 64029001 markings, 182256414 edges, 242459 markings/sec, 265 secs
lola: 65116547 markings, 185352788 edges, 217509 markings/sec, 270 secs
lola: 66093817 markings, 188210233 edges, 195454 markings/sec, 275 secs
lola: 67198344 markings, 191096735 edges, 220905 markings/sec, 280 secs
lola: 68423738 markings, 194451718 edges, 245079 markings/sec, 285 secs
lola: 69653727 markings, 197609311 edges, 245998 markings/sec, 290 secs
lola: 70721834 markings, 200728143 edges, 213621 markings/sec, 295 secs
lola: 71809808 markings, 203796963 edges, 217595 markings/sec, 300 secs
lola: 72950413 markings, 207041651 edges, 228121 markings/sec, 305 secs
lola: 74205139 markings, 209901546 edges, 250945 markings/sec, 310 secs
lola: 75273486 markings, 212648656 edges, 213669 markings/sec, 315 secs
lola: 76479620 markings, 215764265 edges, 241227 markings/sec, 320 secs
lola: 77561628 markings, 218718816 edges, 216402 markings/sec, 325 secs
lola: 78643463 markings, 221866280 edges, 216367 markings/sec, 330 secs
lola: 79782626 markings, 224930266 edges, 227833 markings/sec, 335 secs
lola: 80915512 markings, 228067859 edges, 226577 markings/sec, 340 secs
lola: 82113673 markings, 231033368 edges, 239632 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 13 will run for 943 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: ========================================
lola: processed formula: A (X (G (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) U X ((c18 <= c17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) U X ((c18 <= c17)))))
lola: processed formula: A (X (((c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) U X ((c18 <= c17)))))
lola: processed formula length: 107
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 2829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= in1_0 + in1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= in1_0 + in1_1)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola:
SUMMARY: no no no no no yes unknown yes no yes yes unknown no no yes yes
lola: ========================================
FORMULA PermAdmissibility-COL-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494657749489

--------------------
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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-02.tgz
mv PermAdmissibility-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is PermAdmissibility-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038-blw7-149440485000410"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;