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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1494657896189


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-PT-05 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-05-LTLCardinality.task
lola: A ((c18 <= c11)) : A ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c19)) : A (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))) : A ((2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)) : A (F (F (F (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))))) : A (X (F (X ((2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))) : A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17))))) : A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17)))))) : A ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= c8)) : A (F (F (X ((c15 <= c5))))) : A (F (X (F (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))) : A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c7))) : A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13))))) : A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6))))) : A (F (F (G (X ((3 <= c8)))))) : A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
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 ((c18 <= c11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c18 <= c11)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= c19)
lola: processed formula length: 78
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= 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 (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: processed formula: A (G (F ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: processed formula length: 156
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 349670 markings, 2236734 edges, 69934 markings/sec, 0 secs
lola: 689602 markings, 4422515 edges, 67986 markings/sec, 5 secs
lola: 1045575 markings, 6180894 edges, 71195 markings/sec, 10 secs
lola: 1382367 markings, 7612138 edges, 67358 markings/sec, 15 secs
lola: 1691524 markings, 9074579 edges, 61831 markings/sec, 20 secs
lola: 1984449 markings, 9997762 edges, 58585 markings/sec, 25 secs
lola: 2291227 markings, 11045437 edges, 61356 markings/sec, 30 secs
lola: 2540216 markings, 12181581 edges, 49798 markings/sec, 35 secs
lola: 2878239 markings, 14298147 edges, 67605 markings/sec, 40 secs
lola: 3238269 markings, 16414233 edges, 72006 markings/sec, 45 secs
lola: 3562556 markings, 17710715 edges, 64857 markings/sec, 50 secs
lola: 3862281 markings, 19181368 edges, 59945 markings/sec, 55 secs
lola: 4179177 markings, 20261079 edges, 63379 markings/sec, 60 secs
lola: 4484165 markings, 21722254 edges, 60998 markings/sec, 65 secs
lola: 4795664 markings, 23294385 edges, 62300 markings/sec, 70 secs
lola: 5060170 markings, 24812481 edges, 52901 markings/sec, 75 secs
lola: 5391016 markings, 26272986 edges, 66169 markings/sec, 80 secs
lola: 5679154 markings, 27548358 edges, 57628 markings/sec, 85 secs
lola: 6009089 markings, 29104718 edges, 65987 markings/sec, 90 secs
lola: 6328699 markings, 30104529 edges, 63922 markings/sec, 95 secs
lola: 6620327 markings, 31068054 edges, 58326 markings/sec, 100 secs
lola: 6911138 markings, 32284943 edges, 58162 markings/sec, 105 secs
lola: 7211885 markings, 33711497 edges, 60149 markings/sec, 110 secs
lola: 7524357 markings, 35152166 edges, 62494 markings/sec, 115 secs
lola: 7826365 markings, 36479349 edges, 60402 markings/sec, 120 secs
lola: 8126349 markings, 37877118 edges, 59997 markings/sec, 125 secs
lola: 8425476 markings, 39297718 edges, 59825 markings/sec, 130 secs
lola: 8714074 markings, 40658699 edges, 57720 markings/sec, 135 secs
lola: 9062095 markings, 42830924 edges, 69604 markings/sec, 140 secs
lola: 9389514 markings, 44500092 edges, 65484 markings/sec, 145 secs
lola: 9715207 markings, 46064448 edges, 65139 markings/sec, 150 secs
lola: 10021316 markings, 47283267 edges, 61222 markings/sec, 155 secs
lola: 10347056 markings, 49019537 edges, 65148 markings/sec, 160 secs
lola: 10641659 markings, 50411948 edges, 58921 markings/sec, 165 secs
lola: 10967170 markings, 52026038 edges, 65102 markings/sec, 170 secs
lola: 11294431 markings, 53626348 edges, 65452 markings/sec, 175 secs
lola: 11600074 markings, 54826879 edges, 61129 markings/sec, 180 secs
lola: 11904965 markings, 56302923 edges, 60978 markings/sec, 185 secs
lola: 12195038 markings, 57711615 edges, 58015 markings/sec, 190 secs
lola: 12490916 markings, 59297574 edges, 59176 markings/sec, 195 secs
lola: 12841670 markings, 60922091 edges, 70151 markings/sec, 200 secs
lola: 13184288 markings, 62621984 edges, 68524 markings/sec, 205 secs
lola: 13486428 markings, 63733379 edges, 60428 markings/sec, 210 secs
lola: 13779160 markings, 64686452 edges, 58546 markings/sec, 215 secs
lola: 14076583 markings, 66023744 edges, 59485 markings/sec, 220 secs
lola: 14375997 markings, 67267066 edges, 59883 markings/sec, 225 secs
lola: 14666893 markings, 68251292 edges, 58179 markings/sec, 230 secs
lola: 14997809 markings, 69742781 edges, 66183 markings/sec, 235 secs
lola: 15313938 markings, 71112621 edges, 63226 markings/sec, 240 secs
lola: 15623186 markings, 72407153 edges, 61850 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_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-05-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 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= 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 (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))
lola: processed formula: A (F (X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))
lola: processed formula length: 120
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((2 <= 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 (X (F (X ((2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))
lola: processed formula: A (X (F (X ((2 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 1470874 markings, 1820392 edges, 294175 markings/sec, 0 secs
lola: 2805274 markings, 3559414 edges, 266880 markings/sec, 5 secs
lola: 4102012 markings, 5157031 edges, 259348 markings/sec, 10 secs
lola: 5322431 markings, 6756151 edges, 244084 markings/sec, 15 secs
lola: 6526746 markings, 8286241 edges, 240863 markings/sec, 20 secs
lola: 7753190 markings, 9862533 edges, 245289 markings/sec, 25 secs
lola: 8972021 markings, 11499521 edges, 243766 markings/sec, 30 secs
lola: 10176922 markings, 12970406 edges, 240980 markings/sec, 35 secs
lola: 11324506 markings, 14490966 edges, 229517 markings/sec, 40 secs
lola: 12489952 markings, 15971232 edges, 233089 markings/sec, 45 secs
lola: 13649665 markings, 17447743 edges, 231943 markings/sec, 50 secs
lola: 14775382 markings, 18926976 edges, 225143 markings/sec, 55 secs
lola: 15927998 markings, 20455126 edges, 230523 markings/sec, 60 secs
lola: 17089674 markings, 21967302 edges, 232335 markings/sec, 65 secs
lola: 18234657 markings, 23453818 edges, 228997 markings/sec, 70 secs
lola: 19376117 markings, 24946221 edges, 228292 markings/sec, 75 secs
lola: 20530725 markings, 26477908 edges, 230922 markings/sec, 80 secs
lola: 21672687 markings, 27964978 edges, 228392 markings/sec, 85 secs
lola: 22895120 markings, 29583256 edges, 244487 markings/sec, 90 secs
lola: 24108200 markings, 31137600 edges, 242616 markings/sec, 95 secs
lola: 25194300 markings, 32539458 edges, 217220 markings/sec, 100 secs
lola: 26299781 markings, 33972300 edges, 221096 markings/sec, 105 secs
lola: 27475261 markings, 35481420 edges, 235096 markings/sec, 110 secs
lola: 28649955 markings, 37017420 edges, 234939 markings/sec, 115 secs
lola: 29893859 markings, 38625390 edges, 248781 markings/sec, 120 secs
lola: 31030178 markings, 40118611 edges, 227264 markings/sec, 125 secs
lola: 32167162 markings, 41625905 edges, 227397 markings/sec, 130 secs
lola: 33291829 markings, 43110271 edges, 224933 markings/sec, 135 secs
lola: 34283381 markings, 44468997 edges, 198310 markings/sec, 140 secs
lola: 35284327 markings, 45799780 edges, 200189 markings/sec, 145 secs
lola: 36354765 markings, 47262435 edges, 214088 markings/sec, 150 secs
lola: 37590402 markings, 48760825 edges, 247127 markings/sec, 155 secs
lola: 38677712 markings, 50212423 edges, 217462 markings/sec, 160 secs
lola: 39767975 markings, 51625608 edges, 218053 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17)))))
lola: processed formula: A (G ((X ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)) U G ((2 <= c17)))))
lola: processed formula length: 175
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 28 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: subprocess 7 will run for 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: ========================================
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17))))))
lola: processed formula: A (F (G (X (G ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c17))))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 1168989 markings, 4372308 edges, 233798 markings/sec, 0 secs
lola: 2179941 markings, 8175420 edges, 202190 markings/sec, 5 secs
lola: 3282713 markings, 12338663 edges, 220554 markings/sec, 10 secs
lola: 4377183 markings, 16300194 edges, 218894 markings/sec, 15 secs
lola: 5492679 markings, 20446549 edges, 223099 markings/sec, 20 secs
lola: 6573960 markings, 24387545 edges, 216256 markings/sec, 25 secs
lola: 7662253 markings, 28373450 edges, 217659 markings/sec, 30 secs
lola: 8770494 markings, 32413634 edges, 221648 markings/sec, 35 secs
lola: 9823833 markings, 36307723 edges, 210668 markings/sec, 40 secs
lola: 10854802 markings, 40193520 edges, 206194 markings/sec, 45 secs
lola: 11869942 markings, 44059186 edges, 203028 markings/sec, 50 secs
lola: 12954788 markings, 48055000 edges, 216969 markings/sec, 55 secs
lola: 14008328 markings, 51909376 edges, 210708 markings/sec, 60 secs
lola: 15036019 markings, 55838886 edges, 205538 markings/sec, 65 secs
lola: 16088082 markings, 59752856 edges, 210413 markings/sec, 70 secs
lola: 16980570 markings, 63137465 edges, 178498 markings/sec, 75 secs
lola: 17947865 markings, 66754182 edges, 193459 markings/sec, 80 secs
lola: 18947151 markings, 70479540 edges, 199857 markings/sec, 85 secs
lola: 20005794 markings, 74341917 edges, 211729 markings/sec, 90 secs
lola: 20763977 markings, 78537138 edges, 151637 markings/sec, 95 secs
lola: 21479112 markings, 82786384 edges, 143027 markings/sec, 100 secs
lola: 22069142 markings, 87145624 edges, 118006 markings/sec, 105 secs
lola: 22889757 markings, 91114346 edges, 164123 markings/sec, 110 secs
lola: 23616531 markings, 94889890 edges, 145355 markings/sec, 115 secs
lola: 24209706 markings, 99112798 edges, 118635 markings/sec, 120 secs
lola: 24716436 markings, 103421647 edges, 101346 markings/sec, 125 secs
lola: 25347391 markings, 107358171 edges, 126191 markings/sec, 130 secs
lola: 26105968 markings, 111373870 edges, 151715 markings/sec, 135 secs
lola: 26795448 markings, 115454671 edges, 137896 markings/sec, 140 secs
lola: 27488138 markings, 119624368 edges, 138538 markings/sec, 145 secs
lola: 28143149 markings, 123882362 edges, 131002 markings/sec, 150 secs
lola: 28864794 markings, 128079740 edges, 144329 markings/sec, 155 secs
lola: 29487225 markings, 131973649 edges, 124486 markings/sec, 160 secs
lola: 30202262 markings, 135743570 edges, 143007 markings/sec, 165 secs
lola: 30726493 markings, 139623157 edges, 104846 markings/sec, 170 secs
lola: 31493577 markings, 143342763 edges, 153417 markings/sec, 175 secs
lola: 32093539 markings, 147230628 edges, 119992 markings/sec, 180 secs
lola: 32830713 markings, 151350554 edges, 147435 markings/sec, 185 secs
lola: 33512708 markings, 155247689 edges, 136399 markings/sec, 190 secs
lola: 34163825 markings, 159142535 edges, 130223 markings/sec, 195 secs
lola: 34844865 markings, 163033627 edges, 136208 markings/sec, 200 secs
lola: 35469096 markings, 166951265 edges, 124846 markings/sec, 205 secs
lola: 36044303 markings, 170470554 edges, 115041 markings/sec, 210 secs
lola: 36687602 markings, 174443460 edges, 128660 markings/sec, 215 secs
lola: 37523139 markings, 178336406 edges, 167107 markings/sec, 220 secs
lola: 38262938 markings, 182380853 edges, 147960 markings/sec, 225 secs
lola: 39012397 markings, 186357834 edges, 149892 markings/sec, 230 secs
lola: 39681282 markings, 190286937 edges, 133777 markings/sec, 235 secs
lola: 40270362 markings, 194362259 edges, 117816 markings/sec, 240 secs
lola: 40729468 markings, 198716386 edges, 91821 markings/sec, 245 secs
lola: 41474367 markings, 202619394 edges, 148980 markings/sec, 250 secs
lola: 42298046 markings, 206369572 edges, 164736 markings/sec, 255 secs
lola: 43061374 markings, 210069006 edges, 152666 markings/sec, 260 secs
lola: 43761745 markings, 213855966 edges, 140074 markings/sec, 265 secs
lola: 44290710 markings, 218069757 edges, 105793 markings/sec, 270 secs
lola: 44849192 markings, 222184725 edges, 111696 markings/sec, 275 secs
lola: 45359662 markings, 226421272 edges, 102094 markings/sec, 280 secs
lola: 45752675 markings, 230564200 edges, 78603 markings/sec, 285 secs
lola: 46397928 markings, 234333946 edges, 129051 markings/sec, 290 secs
lola: 47079899 markings, 238126136 edges, 136394 markings/sec, 295 secs
lola: 47903605 markings, 241805530 edges, 164741 markings/sec, 300 secs
lola: 48518648 markings, 245903292 edges, 123009 markings/sec, 305 secs
lola: 49163670 markings, 249951747 edges, 129004 markings/sec, 310 secs
lola: 49678072 markings, 253821331 edges, 102880 markings/sec, 315 secs
lola: 50369453 markings, 257905803 edges, 138276 markings/sec, 320 secs
lola: 51098265 markings, 261998223 edges, 145762 markings/sec, 325 secs
lola: 51732262 markings, 266029764 edges, 126799 markings/sec, 330 secs
lola: 52457013 markings, 269960003 edges, 144950 markings/sec, 335 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 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= c8))
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 <= c8)
lola: processed formula length: 85
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((c15 <= c5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((c15 <= c5))))
lola: processed formula: A (F (X ((c15 <= c5))))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 10 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((c19 <= 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 (F (X (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))))
lola: processed formula: A (F (X (F ((c19 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_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-05-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 11 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c7)))
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 12 will run for 691 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F (F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13))))
lola: processed formula: A ((X ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) U F ((aux8_2 + aux8_3 + aux8_6 + aux8_7 <= c13))))
lola: processed formula length: 137
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 13 will run for 922 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6)))))
lola: processed formula: A (X (X (((2 <= c110) U (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6)))))
lola: processed formula length: 113
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 14 will run for 1383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= c8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= c8)))))
lola: processed formula: A (F (G (X ((3 <= c8)))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 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 15 will run for 2766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: processed formula: A (((in1_0 + in1_1 <= c8) U X (X ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: processed formula length: 114
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: RESULT
lola:
SUMMARY: yes yes unknown no yes unknown no unknown yes yes yes no yes yes no no
FORMULA PermAdmissibility-COL-05-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494658670830

--------------------
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-05"
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-05.tgz
mv PermAdmissibility-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is PermAdmissibility-PT-05, 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-149440485000419"
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 ;