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_DNAwalker-PT-11ringRR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612000095
=====================================================================

--------------------
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 DNAwalker-PT-11ringRR-LTLCardinality-0
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-1
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-15
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-2
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-3
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-4
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-5
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-6
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-7
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-8
FORMULA_NAME DNAwalker-PT-11ringRR-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496340179359


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


checking for too many tokens
===========================================================================================
S_DNAwalker-PT-11ringRR: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_DNAwalker-PT-11ringRR @ 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: 287/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 163 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-11ringRR-LTLCardinality.task
lola: A (((A1 <= A20) U ((3 <= A10) U (3 <= A21)))) : A (G ((1 <= A11))) : A (X (F (G (F ((1 <= A21)))))) : A ((A3 <= A7)) : A (X ((F ((3 <= B13)) U (2 <= B20)))) : A (F (G (G (X ((B10 <= A7)))))) : A (F (X ((A16 <= A10)))) : A (X (G ((1 <= A18)))) : A ((G (X ((A21 <= B20))) U ((2 <= A17) U (A20 <= A5)))) : A (G ((A5 <= A13))) : A (F ((2 <= A10))) : A ((((B11 <= A8) U (A6 <= A7)) U X (X ((A1 <= A3))))) : A ((A16 <= B12)) : A (G ((3 <= B10))) : A ((F (F ((A15 <= B21))) U X ((3 <= B10)))) : A ((F (G ((3 <= A15))) U ((A21 <= A14) U (2 <= A17))))
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 (((A1 <= A20) U ((3 <= A10) U (3 <= A21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((A1 <= A20) U ((3 <= A10) U (3 <= A21))))
lola: processed formula: A (((A1 <= A20) U ((3 <= A10) U (3 <= A21))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= A11)))
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 108 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (F ((1 <= A21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (F ((1 <= A21)))))
lola: processed formula: A (X (G (F ((1 <= A21)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A3 <= A7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A3 <= A7)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= B13)) U (2 <= B20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= B13)) U (2 <= B20))))
lola: processed formula: A (X ((F ((3 <= B13)) U (2 <= B20))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (X ((B10 <= A7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (X ((B10 <= A7))))))
lola: processed formula: A (F (G (G (X ((B10 <= A7))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 1187738 markings, 5692406 edges, 237548 markings/sec, 0 secs
lola: 2258996 markings, 11055331 edges, 214252 markings/sec, 5 secs
lola: 3094160 markings, 16433236 edges, 167033 markings/sec, 10 secs
lola: 3853953 markings, 21660390 edges, 151959 markings/sec, 15 secs
lola: 4675700 markings, 27110470 edges, 164349 markings/sec, 20 secs
lola: 5383291 markings, 32795183 edges, 141518 markings/sec, 25 secs
lola: 6205875 markings, 38471782 edges, 164517 markings/sec, 30 secs
lola: 6961716 markings, 44088797 edges, 151168 markings/sec, 35 secs
lola: 7640362 markings, 49804006 edges, 135729 markings/sec, 40 secs
lola: 8282447 markings, 55401699 edges, 128417 markings/sec, 45 secs
lola: 9136040 markings, 60811710 edges, 170719 markings/sec, 50 secs
lola: 9825533 markings, 66280088 edges, 137899 markings/sec, 55 secs
lola: 10492181 markings, 71937492 edges, 133330 markings/sec, 60 secs
lola: 11171680 markings, 77670591 edges, 135900 markings/sec, 65 secs
lola: 11730427 markings, 83321993 edges, 111749 markings/sec, 70 secs
lola: 12608848 markings, 89148999 edges, 175684 markings/sec, 75 secs
lola: 13325978 markings, 94855117 edges, 143426 markings/sec, 80 secs
lola: 13988949 markings, 100565209 edges, 132594 markings/sec, 85 secs
lola: 14633403 markings, 106482289 edges, 128891 markings/sec, 90 secs
lola: 15213896 markings, 112041193 edges, 116099 markings/sec, 95 secs
lola: 15793405 markings, 117597995 edges, 115902 markings/sec, 100 secs
lola: 16389077 markings, 123065367 edges, 119134 markings/sec, 105 secs
lola: 16933350 markings, 128682402 edges, 108855 markings/sec, 110 secs
lola: 17636407 markings, 134549762 edges, 140611 markings/sec, 115 secs
lola: 18415914 markings, 140097000 edges, 155901 markings/sec, 120 secs
lola: 19107570 markings, 145980686 edges, 138331 markings/sec, 125 secs
lola: 19732411 markings, 151757215 edges, 124968 markings/sec, 130 secs
lola: 20382313 markings, 157443931 edges, 129980 markings/sec, 135 secs
lola: 20903555 markings, 162831825 edges, 104248 markings/sec, 140 secs
lola: 21550388 markings, 168523417 edges, 129367 markings/sec, 145 secs
lola: 22126045 markings, 174360543 edges, 115131 markings/sec, 150 secs
lola: 22656178 markings, 180101969 edges, 106027 markings/sec, 155 secs
lola: 23314519 markings, 185998509 edges, 131668 markings/sec, 160 secs
lola: 23869906 markings, 191926358 edges, 111077 markings/sec, 165 secs
lola: 24395684 markings, 197775476 edges, 105156 markings/sec, 170 secs
lola: 24920627 markings, 203601305 edges, 104989 markings/sec, 175 secs
lola: 25595742 markings, 209304176 edges, 135023 markings/sec, 180 secs
lola: 26437017 markings, 214599796 edges, 168255 markings/sec, 185 secs
lola: 27117898 markings, 219914202 edges, 136176 markings/sec, 190 secs
lola: 27817124 markings, 225172641 edges, 139845 markings/sec, 195 secs
lola: 28472757 markings, 230384535 edges, 131127 markings/sec, 200 secs
lola: 29037253 markings, 235588062 edges, 112899 markings/sec, 205 secs
lola: 29682589 markings, 240672562 edges, 129067 markings/sec, 210 secs
lola: 30232224 markings, 245706466 edges, 109927 markings/sec, 215 secs
lola: 30742670 markings, 250728554 edges, 102089 markings/sec, 220 secs
lola: 31418264 markings, 255869554 edges, 135119 markings/sec, 225 secs
lola: 32138049 markings, 261217693 edges, 143957 markings/sec, 230 secs
lola: 32769284 markings, 266446268 edges, 126247 markings/sec, 235 secs
lola: 33357206 markings, 271553331 edges, 117584 markings/sec, 240 secs
lola: 33881124 markings, 276583404 edges, 104784 markings/sec, 245 secs
lola: 34524601 markings, 281633676 edges, 128695 markings/sec, 250 secs
lola: 35128361 markings, 286882816 edges, 120752 markings/sec, 255 secs
lola: 35659217 markings, 291899441 edges, 106171 markings/sec, 260 secs
lola: 36285708 markings, 297224046 edges, 125298 markings/sec, 265 secs
lola: 36886705 markings, 302032889 edges, 120199 markings/sec, 270 secs
lola: 37382782 markings, 306569138 edges, 99215 markings/sec, 275 secs
lola: 37880146 markings, 311390035 edges, 99473 markings/sec, 280 secs
lola: 38548264 markings, 316420325 edges, 133624 markings/sec, 285 secs
lola: 39311325 markings, 321601689 edges, 152612 markings/sec, 290 secs
lola: 39959581 markings, 326711197 edges, 129651 markings/sec, 295 secs
lola: 40566454 markings, 331832577 edges, 121375 markings/sec, 300 secs
lola: 41160413 markings, 336926174 edges, 118792 markings/sec, 305 secs
lola: 41762455 markings, 342031781 edges, 120408 markings/sec, 310 secs
lola: 42296907 markings, 347111156 edges, 106890 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((A16 <= A10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((A16 <= A10))))
lola: processed formula: A (F (X ((A16 <= A10))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= A18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= A18))))
lola: processed formula: A (X (G ((1 <= A18))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((A21 <= B20))) U ((2 <= A17) U (A20 <= A5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((A21 <= B20))) U ((2 <= A17) U (A20 <= A5))))
lola: processed formula: A ((G (X ((A21 <= B20))) U ((2 <= A17) U (A20 <= A5))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A5 <= A13)))
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 108 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 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= A10)))
lola: processed formula: A (F ((2 <= A10)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 31 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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((B11 <= A8) U (A6 <= A7)) U X (X ((A1 <= A3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((B11 <= A8) U (A6 <= A7)) U X (X ((A1 <= A3)))))
lola: processed formula: A ((((B11 <= A8) U (A6 <= A7)) U X (X ((A1 <= A3)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A16 <= B12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A16 <= B12)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-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 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= B10)))
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 108 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 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((A15 <= B21))) U X ((3 <= B10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((A15 <= B21)) U X ((3 <= B10))))
lola: processed formula: A ((F ((A15 <= B21)) U X ((3 <= B10))))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 15 will run for 3219 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((3 <= A15))) U ((A21 <= A14) U (2 <= A17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((3 <= A15))) U ((A21 <= A14) U (2 <= A17))))
lola: processed formula: A ((F (G ((3 <= A15))) U ((A21 <= A14) U (2 <= A17))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 29 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: RESULT
lola:
SUMMARY: no no no yes no unknown no no yes no no yes yes no no no
lola: ========================================
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496340500757

--------------------
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_DNAwalker-PT-11ringRR"
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_DNAwalker-PT-11ringRR.tgz
mv S_DNAwalker-PT-11ringRR 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_DNAwalker-PT-11ringRR, 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 r108-blw3-149441612000095"
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 ;