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-3253
Executing tool lola
Input is UtahNoC-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008700374
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494948019352


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ UtahNoC-PT-none @ 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: 1193/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 216 places, 977 transitions, 208 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 979 transition conflict sets
lola: TASK
lola: reading formula from UtahNoC-PT-none-LTLCardinality.task
lola: A ((G (X ((1 <= p165))) U (2 <= p54))) : A ((p167 <= p195)) : A (F ((G ((p28 <= p105)) U (p22 <= p173)))) : A (X (F (F ((p95 <= p55))))) : A ((p7 <= p125)) : A (G (G (X (X ((p170 <= p149)))))) : A (G ((X ((p201 <= p132)) U F ((2 <= p170))))) : A (X (X (((p136 <= p171) U (2 <= p115))))) : A (F ((1 <= p103))) : A (G (F (X (F ((2 <= p52)))))) : A (((2 <= p22) U (1 <= p117))) : A ((p104 <= p143)) : A (F (X ((p152 <= p173)))) : A ((X ((2 <= p208)) U (1 <= p2))) : A (((1 <= p199) U X (F ((2 <= p136))))) : A ((G (G ((p190 <= p88))) U X (F ((p72 <= p158)))))
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 (X ((1 <= p165))) U (2 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((1 <= p165))) U (2 <= p54)))
lola: processed formula: A ((G (X ((1 <= p165))) U (2 <= p54)))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 13 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 ((p167 <= p195))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p167 <= p195)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p28 <= p105)) U (p22 <= p173))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((p28 <= p105)) U (p22 <= p173))))
lola: processed formula: A (F ((G ((p28 <= p105)) U (p22 <= p173))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 15 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((p95 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p95 <= p55))))
lola: processed formula: A (X (F ((p95 <= p55))))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p7 <= p125))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p7 <= p125)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (X ((p170 <= p149))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (X (X ((p170 <= p149))))))
lola: processed formula: A (G (G (X (X ((p170 <= p149))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 458708 markings, 1944640 edges, 91742 markings/sec, 0 secs
lola: 860427 markings, 3857931 edges, 80344 markings/sec, 5 secs
lola: 1290543 markings, 5741011 edges, 86023 markings/sec, 10 secs
lola: 1688517 markings, 7524914 edges, 79595 markings/sec, 15 secs
lola: 2037252 markings, 9351504 edges, 69747 markings/sec, 20 secs
lola: 2477616 markings, 11239212 edges, 88073 markings/sec, 25 secs
lola: 2875652 markings, 13172730 edges, 79607 markings/sec, 30 secs
lola: 3271962 markings, 15116830 edges, 79262 markings/sec, 35 secs
lola: 3635559 markings, 17012329 edges, 72719 markings/sec, 40 secs
lola: 4037047 markings, 18835994 edges, 80298 markings/sec, 45 secs
lola: 4442936 markings, 20593502 edges, 81178 markings/sec, 50 secs
lola: 4828138 markings, 22362377 edges, 77040 markings/sec, 55 secs
lola: 5200727 markings, 24143731 edges, 74518 markings/sec, 60 secs
lola: 5543611 markings, 25853299 edges, 68577 markings/sec, 65 secs
lola: 5889961 markings, 27518151 edges, 69270 markings/sec, 70 secs
lola: 6234419 markings, 29188511 edges, 68892 markings/sec, 75 secs
lola: 6592665 markings, 30987729 edges, 71649 markings/sec, 80 secs
lola: 6919175 markings, 32773189 edges, 65302 markings/sec, 85 secs
lola: 7261396 markings, 34546228 edges, 68444 markings/sec, 90 secs
lola: 7588602 markings, 36445236 edges, 65441 markings/sec, 95 secs
lola: 7922437 markings, 38186803 edges, 66767 markings/sec, 100 secs
lola: 8270152 markings, 39876039 edges, 69543 markings/sec, 105 secs
lola: 8586827 markings, 41616116 edges, 63335 markings/sec, 110 secs
lola: 8920081 markings, 43384806 edges, 66651 markings/sec, 115 secs
lola: 9255078 markings, 45199978 edges, 66999 markings/sec, 120 secs
lola: 9590761 markings, 46929071 edges, 67137 markings/sec, 125 secs
lola: 9931090 markings, 48695732 edges, 68066 markings/sec, 130 secs
lola: 10238768 markings, 50378081 edges, 61536 markings/sec, 135 secs
lola: 10601566 markings, 52110276 edges, 72560 markings/sec, 140 secs
lola: 10930218 markings, 53869183 edges, 65730 markings/sec, 145 secs
lola: 11248799 markings, 55546917 edges, 63716 markings/sec, 150 secs
lola: 11613736 markings, 57330626 edges, 72987 markings/sec, 155 secs
lola: 11975616 markings, 59103317 edges, 72376 markings/sec, 160 secs
lola: 12332070 markings, 60855694 edges, 71291 markings/sec, 165 secs
lola: 12680177 markings, 62587253 edges, 69621 markings/sec, 170 secs
lola: 13004976 markings, 64317679 edges, 64960 markings/sec, 175 secs
lola: 13337654 markings, 66039657 edges, 66536 markings/sec, 180 secs
lola: 13671542 markings, 67809747 edges, 66778 markings/sec, 185 secs
lola: 14021200 markings, 69539220 edges, 69932 markings/sec, 190 secs
lola: 14347851 markings, 71317396 edges, 65330 markings/sec, 195 secs
lola: 14667646 markings, 73029312 edges, 63959 markings/sec, 200 secs
lola: 15002655 markings, 74759646 edges, 67002 markings/sec, 205 secs
lola: 15320427 markings, 76478630 edges, 63554 markings/sec, 210 secs
lola: 15643401 markings, 78134334 edges, 64595 markings/sec, 215 secs
lola: 15971047 markings, 79809753 edges, 65529 markings/sec, 220 secs
lola: 16312230 markings, 81411715 edges, 68237 markings/sec, 225 secs
lola: 16623705 markings, 83117109 edges, 62295 markings/sec, 230 secs
lola: 16977087 markings, 84844510 edges, 70676 markings/sec, 235 secs
lola: 17287819 markings, 86579506 edges, 62146 markings/sec, 240 secs
lola: 17612262 markings, 88357007 edges, 64889 markings/sec, 245 secs
lola: 17928161 markings, 90072775 edges, 63180 markings/sec, 250 secs
lola: 18241274 markings, 91842656 edges, 62623 markings/sec, 255 secs
lola: 18556255 markings, 93503621 edges, 62996 markings/sec, 260 secs
lola: 18862775 markings, 95171418 edges, 61304 markings/sec, 265 secs
lola: 19166801 markings, 96826151 edges, 60805 markings/sec, 270 secs
lola: 19458690 markings, 98518400 edges, 58378 markings/sec, 275 secs
lola: 19750150 markings, 100185485 edges, 58292 markings/sec, 280 secs
lola: 20052851 markings, 101856559 edges, 60540 markings/sec, 285 secs
lola: 20358591 markings, 103491524 edges, 61148 markings/sec, 290 secs
lola: 20674141 markings, 105149144 edges, 63110 markings/sec, 295 secs
lola: 20973762 markings, 106896878 edges, 59924 markings/sec, 300 secs
lola: 21278800 markings, 108510914 edges, 61008 markings/sec, 305 secs
lola: 21579973 markings, 110192097 edges, 60235 markings/sec, 310 secs
lola: 21890920 markings, 111969973 edges, 62189 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 (G ((X ((p201 <= p132)) U F ((2 <= p170)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((p201 <= p132)) U F ((2 <= p170)))))
lola: processed formula: A (G ((X ((p201 <= p132)) U F ((2 <= p170)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 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 (X (((p136 <= p171) U (2 <= p115)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((p136 <= p171) U (2 <= p115)))))
lola: processed formula: A (X (X (((p136 <= p171) U (2 <= p115)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 13 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 (F ((1 <= p103)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= p103)))
lola: processed formula: A (F ((1 <= p103)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 15 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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (F ((2 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (F ((2 <= p52))))))
lola: processed formula: A (G (F (X (F ((2 <= p52))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 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 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p22) U (1 <= p117)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= p22) U (1 <= p117)))
lola: processed formula: A (((2 <= p22) U (1 <= p117)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 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 ((p104 <= p143))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p104 <= p143)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-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 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((p152 <= p173))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p152 <= p173))))
lola: processed formula: A (F (X ((p152 <= p173))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= p208)) U (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((2 <= p208)) U (1 <= p2)))
lola: processed formula: A ((X ((2 <= p208)) U (1 <= p2)))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 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 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p199) U X (F ((2 <= p136)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p199) U X (F ((2 <= p136)))))
lola: processed formula: A (((1 <= p199) U X (F ((2 <= p136)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 14 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 ((G (G ((p190 <= p88))) U X (F ((p72 <= p158)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((p190 <= p88))) U X (F ((p72 <= p158)))))
lola: processed formula: A ((G (G ((p190 <= p88))) U X (F ((p72 <= p158)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 13 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: RESULT
lola:
SUMMARY: no yes yes yes yes unknown no no no no no yes yes no no yes
lola: ========================================
FORMULA UtahNoC-PT-none-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA UtahNoC-PT-none-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494948341023

--------------------
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="UtahNoC-PT-none"
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/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is UtahNoC-PT-none, 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 r078-ebro-149441008700374"
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 ;