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-04track28LL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440263800032
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494653962363


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ DNAwalker-PT-04track28LL @ 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: 284/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 34 places, 250 transitions, 34 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 164 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-04track28LL-LTLCardinality.task
lola: A ((X (F ((A4 <= A27))) U ((A27 <= A9) U (1 <= A27)))) : A (G ((G ((1 <= A22)) U F ((2 <= A20))))) : A (X ((1 <= A24))) : A (F (G (((2 <= A15) U (3 <= A17))))) : A ((3 <= A13)) : A (X (X ((1 <= B19)))) : A ((G (X ((A4 <= A20))) U ((B10 <= A20) U (3 <= A17)))) : A ((X (X ((B18 <= A14))) U ((A17 <= B26) U (1 <= A26)))) : A ((3 <= A24)) : A ((1 <= B18)) : A (((3 <= A14) U F (G ((A19 <= A16))))) : A (G (F (((3 <= A5) U (3 <= A25))))) : A ((A6 <= A8)) : A ((G (G ((B27 <= A13))) U G ((1 <= B26)))) : A ((G (F ((A26 <= B18))) U (A2 <= A3))) : A (F (X (F (F ((2 <= A22))))))
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 ((X (F ((A4 <= A27))) U ((A27 <= A9) U (1 <= A27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((A4 <= A27))) U ((A27 <= A9) U (1 <= A27))))
lola: processed formula: A ((X (F ((A4 <= A27))) U ((A27 <= A9) U (1 <= A27))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((1 <= A22)) U F ((2 <= A20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((1 <= A22)) U F ((2 <= A20)))))
lola: processed formula: A (G ((G ((1 <= A22)) U F ((2 <= A20)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= A24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= A24)))
lola: processed formula: A (X ((1 <= A24)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((2 <= A15) U (3 <= A17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((2 <= A15) U (3 <= A17)))))
lola: processed formula: A (F (G (((2 <= A15) U (3 <= A17)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= A13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= A13)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((1 <= B19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((1 <= B19))))
lola: processed formula: A (X (X ((1 <= B19))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((A4 <= A20))) U ((B10 <= A20) U (3 <= A17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((A4 <= A20))) U ((B10 <= A20) U (3 <= A17))))
lola: processed formula: A ((G (X ((A4 <= A20))) U ((B10 <= A20) U (3 <= A17))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((B18 <= A14))) U ((A17 <= B26) U (1 <= A26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((B18 <= A14))) U ((A17 <= B26) U (1 <= A26))))
lola: processed formula: A ((X (X ((B18 <= A14))) U ((A17 <= B26) U (1 <= A26))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= A24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= A24)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= B18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= B18)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= A14) U F (G ((A19 <= A16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= A14) U F (G ((A19 <= A16)))))
lola: processed formula: A (((3 <= A14) U F (G ((A19 <= A16)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 406845 markings, 1321165 edges, 81369 markings/sec, 0 secs
lola: 839886 markings, 2618393 edges, 86608 markings/sec, 5 secs
lola: 1256411 markings, 3851804 edges, 83305 markings/sec, 10 secs
lola: 1608380 markings, 5122461 edges, 70394 markings/sec, 15 secs
lola: 1952259 markings, 6277508 edges, 68776 markings/sec, 20 secs
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 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((3 <= A5) U (3 <= A25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((3 <= A5) U (3 <= A25)))))
lola: processed formula: A (G (F (((3 <= A5) U (3 <= A25)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 12 will run for 877 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A6 <= A8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A6 <= A8)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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 1170 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((B27 <= A13))) U G ((1 <= B26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((B27 <= A13))) U G ((1 <= B26))))
lola: processed formula: A ((G (G ((B27 <= A13))) U G ((1 <= B26))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 401265 markings, 1303528 edges, 80253 markings/sec, 0 secs
lola: 807162 markings, 2527095 edges, 81179 markings/sec, 5 secs
lola: 1195706 markings, 3632210 edges, 77709 markings/sec, 10 secs
lola: 1534653 markings, 4858919 edges, 67789 markings/sec, 15 secs
lola: 1879470 markings, 6036259 edges, 68963 markings/sec, 20 secs
lola: 2211839 markings, 7234981 edges, 66474 markings/sec, 25 secs
lola: 2544217 markings, 9393908 edges, 66476 markings/sec, 30 secs
lola: 2877315 markings, 11475867 edges, 66620 markings/sec, 35 secs
lola: 3212223 markings, 13349233 edges, 66982 markings/sec, 40 secs
lola: 3522699 markings, 15348007 edges, 62095 markings/sec, 45 secs
lola: 3814598 markings, 17443829 edges, 58380 markings/sec, 50 secs
lola: 4102959 markings, 19387045 edges, 57672 markings/sec, 55 secs
lola: 4384401 markings, 21318163 edges, 56288 markings/sec, 60 secs
lola: 4732194 markings, 22459844 edges, 69559 markings/sec, 65 secs
lola: 5070800 markings, 23610403 edges, 67721 markings/sec, 70 secs
lola: 5398469 markings, 24717557 edges, 65534 markings/sec, 75 secs
lola: 5710188 markings, 26268883 edges, 62344 markings/sec, 80 secs
lola: 5999697 markings, 28183069 edges, 57902 markings/sec, 85 secs
lola: 6291504 markings, 30157359 edges, 58361 markings/sec, 90 secs
lola: 6565475 markings, 32012979 edges, 54794 markings/sec, 95 secs
lola: 6856289 markings, 33667614 edges, 58163 markings/sec, 100 secs
lola: 7186180 markings, 34812061 edges, 65978 markings/sec, 105 secs
lola: 7504846 markings, 35958322 edges, 63733 markings/sec, 110 secs
lola: 7784261 markings, 37940546 edges, 55883 markings/sec, 115 secs
lola: 8057698 markings, 39832115 edges, 54687 markings/sec, 120 secs
lola: 8345692 markings, 41518464 edges, 57599 markings/sec, 125 secs
lola: 8658029 markings, 42810101 edges, 62467 markings/sec, 130 secs
lola: 8927196 markings, 44726293 edges, 53833 markings/sec, 135 secs
lola: 9222401 markings, 46232035 edges, 59041 markings/sec, 140 secs
lola: 9510349 markings, 47813068 edges, 57590 markings/sec, 145 secs
lola: 9889233 markings, 49779923 edges, 75777 markings/sec, 150 secs
lola: 10274320 markings, 51472942 edges, 77017 markings/sec, 155 secs
lola: 10674125 markings, 53466589 edges, 79961 markings/sec, 160 secs
lola: 11052689 markings, 55323188 edges, 75713 markings/sec, 165 secs
lola: 11415276 markings, 57163723 edges, 72517 markings/sec, 170 secs
lola: 11756087 markings, 58904166 edges, 68162 markings/sec, 175 secs
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 1664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((A26 <= B18))) U (A2 <= A3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((A26 <= B18))) U (A2 <= A3)))
lola: processed formula: A ((G (F ((A26 <= B18))) U (A2 <= A3)))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 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 3328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((2 <= A22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= A22)))))
lola: processed formula: A (F (X (F ((2 <= A22)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: RESULT
lola:
SUMMARY: no no yes no no no no no no yes no no yes no yes no
lola: ========================================
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494654174365

--------------------
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-04track28LL"
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-04track28LL.tgz
mv DNAwalker-PT-04track28LL 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-04track28LL, 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-149440263800032"
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 ;