Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PermAdmissibility-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200410
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-PT-02: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-02: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_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: 984964 markings, 2746075 edges, 196993 markings/sec, 0 secs
lola: 1867789 markings, 5319197 edges, 176565 markings/sec, 5 secs
lola: 2765161 markings, 7974095 edges, 179474 markings/sec, 10 secs
lola: 3623492 markings, 10442088 edges, 171666 markings/sec, 15 secs
lola: 4558801 markings, 13245073 edges, 187062 markings/sec, 20 secs
lola: 5471912 markings, 15932142 edges, 182622 markings/sec, 25 secs
lola: 6350238 markings, 18525255 edges, 175665 markings/sec, 30 secs
lola: 7165416 markings, 20859543 edges, 163036 markings/sec, 35 secs
lola: 8095926 markings, 23745347 edges, 186102 markings/sec, 40 secs
lola: 8910321 markings, 26080163 edges, 162879 markings/sec, 45 secs
lola: 9728751 markings, 28416943 edges, 163686 markings/sec, 50 secs
lola: 10544299 markings, 30706176 edges, 163110 markings/sec, 55 secs
lola: 11363815 markings, 33171059 edges, 163903 markings/sec, 60 secs
lola: 12073424 markings, 35105962 edges, 141922 markings/sec, 65 secs
lola: 12965922 markings, 37587967 edges, 178500 markings/sec, 70 secs
lola: 13856378 markings, 40134049 edges, 178091 markings/sec, 75 secs
lola: 14680701 markings, 42548450 edges, 164865 markings/sec, 80 secs
lola: 15510517 markings, 45016789 edges, 165963 markings/sec, 85 secs
lola: 16349819 markings, 47585086 edges, 167860 markings/sec, 90 secs
lola: 17170475 markings, 49983794 edges, 164131 markings/sec, 95 secs
lola: 17975601 markings, 52351738 edges, 161025 markings/sec, 100 secs
lola: 18864013 markings, 55054680 edges, 177682 markings/sec, 105 secs
lola: 19704280 markings, 57513446 edges, 168053 markings/sec, 110 secs
lola: 20568542 markings, 60034625 edges, 172852 markings/sec, 115 secs
lola: 21432739 markings, 62692124 edges, 172839 markings/sec, 120 secs
lola: 22247032 markings, 65059176 edges, 162859 markings/sec, 125 secs
lola: 22996510 markings, 67231941 edges, 149896 markings/sec, 130 secs
lola: 23782472 markings, 69552938 edges, 157192 markings/sec, 135 secs
lola: 24567727 markings, 71830996 edges, 157051 markings/sec, 140 secs
lola: 25310421 markings, 74044284 edges, 148539 markings/sec, 145 secs
lola: 26016756 markings, 76048543 edges, 141267 markings/sec, 150 secs
lola: 26722359 markings, 78095744 edges, 141121 markings/sec, 155 secs
lola: 27614584 markings, 80840135 edges, 178445 markings/sec, 160 secs
lola: 28535254 markings, 83687569 edges, 184134 markings/sec, 165 secs
lola: 29369903 markings, 86131986 edges, 166930 markings/sec, 170 secs
lola: 30245144 markings, 88778930 edges, 175048 markings/sec, 175 secs
lola: 31088965 markings, 91248617 edges, 168764 markings/sec, 180 secs
lola: 31905410 markings, 93657921 edges, 163289 markings/sec, 185 secs
lola: 32758670 markings, 96114790 edges, 170652 markings/sec, 190 secs
lola: 33601953 markings, 98586862 edges, 168657 markings/sec, 195 secs
lola: 34444648 markings, 101117192 edges, 168539 markings/sec, 200 secs
lola: 35240049 markings, 103542888 edges, 159080 markings/sec, 205 secs
lola: 36031162 markings, 105767347 edges, 158223 markings/sec, 210 secs
lola: 36785565 markings, 107791477 edges, 150881 markings/sec, 215 secs
lola: 37518152 markings, 109770880 edges, 146517 markings/sec, 220 secs
lola: 38143257 markings, 111333502 edges, 125021 markings/sec, 225 secs
lola: 38968441 markings, 113607266 edges, 165037 markings/sec, 230 secs
lola: 39758902 markings, 115744328 edges, 158092 markings/sec, 235 secs
lola: 40520398 markings, 117774186 edges, 152299 markings/sec, 240 secs
lola: 41303426 markings, 119861708 edges, 156606 markings/sec, 245 secs
lola: 42064901 markings, 121912623 edges, 152295 markings/sec, 250 secs
lola: 42862323 markings, 124103750 edges, 159484 markings/sec, 255 secs
lola: 43599916 markings, 126037914 edges, 147519 markings/sec, 260 secs
lola: 44369836 markings, 128051041 edges, 153984 markings/sec, 265 secs
lola: 45060682 markings, 129895077 edges, 138169 markings/sec, 270 secs
lola: 45816867 markings, 132033917 edges, 151237 markings/sec, 275 secs
lola: 46669305 markings, 134599396 edges, 170488 markings/sec, 280 secs
lola: 47490928 markings, 137049766 edges, 164325 markings/sec, 285 secs
lola: 48235078 markings, 139271914 edges, 148830 markings/sec, 290 secs
lola: 49005691 markings, 141381223 edges, 154123 markings/sec, 295 secs
lola: 49760532 markings, 143519405 edges, 150968 markings/sec, 300 secs
lola: 50510628 markings, 145676923 edges, 150019 markings/sec, 305 secs
lola: 51236483 markings, 147721208 edges, 145171 markings/sec, 310 secs
lola: 51972922 markings, 149851823 edges, 147288 markings/sec, 315 secs
lola: 52679357 markings, 151804966 edges, 141287 markings/sec, 320 secs
lola: 53344800 markings, 153680327 edges, 133089 markings/sec, 325 secs
lola: 53958407 markings, 155463570 edges, 122721 markings/sec, 330 secs
lola: 54632566 markings, 157289920 edges, 134832 markings/sec, 335 secs
lola: 55292495 markings, 159098461 edges, 131986 markings/sec, 340 secs
lola: 56173030 markings, 161771544 edges, 176107 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: subprocess 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 1509949 markings, 3940501 edges, 301990 markings/sec, 0 secs
lola: 2913995 markings, 8042682 edges, 280809 markings/sec, 5 secs
lola: 4297530 markings, 11934758 edges, 276707 markings/sec, 10 secs
lola: 5677231 markings, 15584934 edges, 275940 markings/sec, 15 secs
lola: 6955835 markings, 18878645 edges, 255721 markings/sec, 20 secs
lola: 8323521 markings, 22286994 edges, 273537 markings/sec, 25 secs
lola: 9662128 markings, 25809106 edges, 267721 markings/sec, 30 secs
lola: 10976038 markings, 29207272 edges, 262782 markings/sec, 35 secs
lola: 12260116 markings, 32550402 edges, 256816 markings/sec, 40 secs
lola: 13559502 markings, 36033924 edges, 259877 markings/sec, 45 secs
lola: 14833058 markings, 39434556 edges, 254711 markings/sec, 50 secs
lola: 16071329 markings, 43129958 edges, 247654 markings/sec, 55 secs
lola: 17263701 markings, 46888135 edges, 238474 markings/sec, 60 secs
lola: 18426777 markings, 50582179 edges, 232615 markings/sec, 65 secs
lola: 19650509 markings, 54090451 edges, 244746 markings/sec, 70 secs
lola: 20802520 markings, 57876305 edges, 230402 markings/sec, 75 secs
lola: 21910841 markings, 61548549 edges, 221664 markings/sec, 80 secs
lola: 23108839 markings, 65096515 edges, 239600 markings/sec, 85 secs
lola: 24397747 markings, 68408390 edges, 257782 markings/sec, 90 secs
lola: 25654579 markings, 71645904 edges, 251366 markings/sec, 95 secs
lola: 26940265 markings, 74931714 edges, 257137 markings/sec, 100 secs
lola: 28195445 markings, 78167125 edges, 251036 markings/sec, 105 secs
lola: 29412740 markings, 81302326 edges, 243459 markings/sec, 110 secs
lola: 30720631 markings, 84536587 edges, 261578 markings/sec, 115 secs
lola: 31987167 markings, 87678324 edges, 253307 markings/sec, 120 secs
lola: 33261328 markings, 90785528 edges, 254832 markings/sec, 125 secs
lola: 34506827 markings, 93842645 edges, 249100 markings/sec, 130 secs
lola: 35765000 markings, 97391627 edges, 251635 markings/sec, 135 secs
lola: 37036903 markings, 100783562 edges, 254381 markings/sec, 140 secs
lola: 38219256 markings, 104221225 edges, 236471 markings/sec, 145 secs
lola: 39480809 markings, 107179902 edges, 252311 markings/sec, 150 secs
lola: 40692505 markings, 110715553 edges, 242339 markings/sec, 155 secs
lola: 41878923 markings, 114327954 edges, 237284 markings/sec, 160 secs
lola: 43047555 markings, 117903368 edges, 233726 markings/sec, 165 secs
lola: 44166120 markings, 121529639 edges, 223713 markings/sec, 170 secs
lola: 45297933 markings, 124932022 edges, 226363 markings/sec, 175 secs
lola: 46427653 markings, 128469430 edges, 225944 markings/sec, 180 secs
lola: 47544424 markings, 131998683 edges, 223354 markings/sec, 185 secs
lola: 48633310 markings, 135426396 edges, 217777 markings/sec, 190 secs
lola: 49666094 markings, 138802246 edges, 206557 markings/sec, 195 secs
lola: 50826193 markings, 142363966 edges, 232020 markings/sec, 200 secs
lola: 51975502 markings, 145866139 edges, 229862 markings/sec, 205 secs
lola: 53092594 markings, 149318384 edges, 223418 markings/sec, 210 secs
lola: 54160103 markings, 152627395 edges, 213502 markings/sec, 215 secs
lola: 55297270 markings, 156045770 edges, 227433 markings/sec, 220 secs
lola: 56427220 markings, 159448681 edges, 225990 markings/sec, 225 secs
lola: 57367759 markings, 162724559 edges, 188108 markings/sec, 230 secs
lola: 58474565 markings, 166065325 edges, 221361 markings/sec, 235 secs
lola: 59553471 markings, 169415229 edges, 215781 markings/sec, 240 secs
lola: 60618014 markings, 172749708 edges, 212909 markings/sec, 245 secs
lola: 61803865 markings, 176216075 edges, 237170 markings/sec, 250 secs
lola: 63078132 markings, 179752946 edges, 254853 markings/sec, 255 secs
lola: 64323007 markings, 183154320 edges, 248975 markings/sec, 260 secs
lola: 65510879 markings, 186555599 edges, 237574 markings/sec, 265 secs
lola: 66732262 markings, 189905446 edges, 244277 markings/sec, 270 secs
lola: 68031889 markings, 193381028 edges, 259925 markings/sec, 275 secs
lola: 69338422 markings, 196789744 edges, 261307 markings/sec, 280 secs
lola: 70539902 markings, 200203904 edges, 240296 markings/sec, 285 secs
lola: 71724557 markings, 203501489 edges, 236931 markings/sec, 290 secs
lola: 72857082 markings, 206842982 edges, 226505 markings/sec, 295 secs
lola: 74178820 markings, 209836767 edges, 264348 markings/sec, 300 secs
lola: 75352353 markings, 212812991 edges, 234707 markings/sec, 305 secs
lola: 76589990 markings, 216113888 edges, 247527 markings/sec, 310 secs
lola: 77765145 markings, 219294680 edges, 235031 markings/sec, 315 secs
lola: 78854391 markings, 222558564 edges, 217849 markings/sec, 320 secs
lola: 80094662 markings, 225672666 edges, 248054 markings/sec, 325 secs
lola: 81229827 markings, 228855234 edges, 227033 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 711 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: ========================================
lola: subprocess 13 will run for 948 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: 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 1422 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 2845 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: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes unknown yes no yes yes unknown no no yes yes
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 1496388304544

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_PermAdmissibility-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/S_PermAdmissibility-PT-02.tgz
mv S_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 S_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 r118-blw7-149441650200410"
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 ;