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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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: 1199323 markings, 5742150 edges, 239865 markings/sec, 0 secs
lola: 2290780 markings, 11250992 edges, 218291 markings/sec, 5 secs
lola: 3172535 markings, 16916190 edges, 176351 markings/sec, 10 secs
lola: 3986946 markings, 22505720 edges, 162882 markings/sec, 15 secs
lola: 4776061 markings, 27824449 edges, 157823 markings/sec, 20 secs
lola: 5454494 markings, 33430501 edges, 135687 markings/sec, 25 secs
lola: 6284258 markings, 38987634 edges, 165953 markings/sec, 30 secs
lola: 7015761 markings, 44531175 edges, 146301 markings/sec, 35 secs
lola: 7686625 markings, 50202241 edges, 134173 markings/sec, 40 secs
lola: 8322745 markings, 55637527 edges, 127224 markings/sec, 45 secs
lola: 9139794 markings, 60838005 edges, 163410 markings/sec, 50 secs
lola: 9799586 markings, 66098845 edges, 131958 markings/sec, 55 secs
lola: 10463384 markings, 71658880 edges, 132760 markings/sec, 60 secs
lola: 11095071 markings, 76965766 edges, 126337 markings/sec, 65 secs
lola: 11647418 markings, 82395695 edges, 110469 markings/sec, 70 secs
lola: 12464450 markings, 88150274 edges, 163406 markings/sec, 75 secs
lola: 13201508 markings, 93799551 edges, 147412 markings/sec, 80 secs
lola: 13869461 markings, 99515172 edges, 133591 markings/sec, 85 secs
lola: 14500220 markings, 105364555 edges, 126152 markings/sec, 90 secs
lola: 15112254 markings, 111022617 edges, 122407 markings/sec, 95 secs
lola: 15690385 markings, 116762858 edges, 115626 markings/sec, 100 secs
lola: 16291860 markings, 122137747 edges, 120295 markings/sec, 105 secs
lola: 16845047 markings, 127730075 edges, 110637 markings/sec, 110 secs
lola: 17474373 markings, 133427239 edges, 125865 markings/sec, 115 secs
lola: 18287905 markings, 139080412 edges, 162706 markings/sec, 120 secs
lola: 18947088 markings, 144688623 edges, 131837 markings/sec, 125 secs
lola: 19593957 markings, 150343801 edges, 129374 markings/sec, 130 secs
lola: 20242459 markings, 156118709 edges, 129700 markings/sec, 135 secs
lola: 20814726 markings, 161837895 edges, 114453 markings/sec, 140 secs
lola: 21432483 markings, 167459571 edges, 123551 markings/sec, 145 secs
lola: 22003888 markings, 172987916 edges, 114281 markings/sec, 150 secs
lola: 22542693 markings, 178735114 edges, 107761 markings/sec, 155 secs
lola: 23169201 markings, 184590464 edges, 125302 markings/sec, 160 secs
lola: 23741205 markings, 190425374 edges, 114401 markings/sec, 165 secs
lola: 24273626 markings, 196314936 edges, 106484 markings/sec, 170 secs
lola: 24795923 markings, 202148737 edges, 104459 markings/sec, 175 secs
lola: 25284693 markings, 207942373 edges, 97754 markings/sec, 180 secs
lola: 26240441 markings, 213183175 edges, 191150 markings/sec, 185 secs
lola: 26954909 markings, 218444249 edges, 142894 markings/sec, 190 secs
lola: 27623350 markings, 223506512 edges, 133688 markings/sec, 195 secs
lola: 28249983 markings, 228398715 edges, 125327 markings/sec, 200 secs
lola: 28789519 markings, 233269239 edges, 107907 markings/sec, 205 secs
lola: 29373426 markings, 238052078 edges, 116781 markings/sec, 210 secs
lola: 29933528 markings, 242953342 edges, 112020 markings/sec, 215 secs
lola: 30456800 markings, 247841502 edges, 104654 markings/sec, 220 secs
lola: 30932203 markings, 252815292 edges, 95081 markings/sec, 225 secs
lola: 31728325 markings, 258073884 edges, 159224 markings/sec, 230 secs
lola: 32366428 markings, 263227194 edges, 127621 markings/sec, 235 secs
lola: 32937045 markings, 268010394 edges, 114123 markings/sec, 240 secs
lola: 33516992 markings, 273061825 edges, 115989 markings/sec, 245 secs
lola: 34003385 markings, 277902521 edges, 97279 markings/sec, 250 secs
lola: 34693567 markings, 282972855 edges, 138036 markings/sec, 255 secs
lola: 35277440 markings, 288072351 edges, 116775 markings/sec, 260 secs
lola: 35797831 markings, 293082309 edges, 104078 markings/sec, 265 secs
lola: 36404619 markings, 298264826 edges, 121358 markings/sec, 270 secs
lola: 36941309 markings, 302474592 edges, 107338 markings/sec, 275 secs
lola: 37416984 markings, 306891968 edges, 95135 markings/sec, 280 secs
lola: 37905457 markings, 311625037 edges, 97695 markings/sec, 285 secs
lola: 38589736 markings, 316659826 edges, 136856 markings/sec, 290 secs
lola: 39342199 markings, 321830257 edges, 150493 markings/sec, 295 secs
lola: 39951137 markings, 326644096 edges, 121788 markings/sec, 300 secs
lola: 40551215 markings, 331718441 edges, 120016 markings/sec, 305 secs
lola: 41119514 markings, 336552280 edges, 113660 markings/sec, 310 secs
lola: 41705891 markings, 341556304 edges, 117275 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 1494663372701

--------------------
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="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/DNAwalker-PT-11ringRR.tgz
mv 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 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 r028-blw3-149440263900095"
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 ;