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 S_UtahNoC-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464300374
=====================================================================

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


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


checking for too many tokens
===========================================================================================
S_UtahNoC-PT-none: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_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: 465886 markings, 1981646 edges, 93177 markings/sec, 0 secs
lola: 874011 markings, 3915218 edges, 81625 markings/sec, 5 secs
lola: 1309264 markings, 5842100 edges, 87051 markings/sec, 10 secs
lola: 1706767 markings, 7620259 edges, 79501 markings/sec, 15 secs
lola: 2055057 markings, 9453518 edges, 69658 markings/sec, 20 secs
lola: 2496686 markings, 11332819 edges, 88326 markings/sec, 25 secs
lola: 2893585 markings, 13254812 edges, 79380 markings/sec, 30 secs
lola: 3285500 markings, 15180249 edges, 78383 markings/sec, 35 secs
lola: 3643133 markings, 17054086 edges, 71527 markings/sec, 40 secs
lola: 4038576 markings, 18845272 edges, 79089 markings/sec, 45 secs
lola: 4440576 markings, 20584196 edges, 80400 markings/sec, 50 secs
lola: 4816361 markings, 22316048 edges, 75157 markings/sec, 55 secs
lola: 5190360 markings, 24078121 edges, 74800 markings/sec, 60 secs
lola: 5531107 markings, 25775759 edges, 68149 markings/sec, 65 secs
lola: 5871312 markings, 27430628 edges, 68041 markings/sec, 70 secs
lola: 6227856 markings, 29148951 edges, 71309 markings/sec, 75 secs
lola: 6581857 markings, 30927493 edges, 70800 markings/sec, 80 secs
lola: 6904729 markings, 32706817 edges, 64574 markings/sec, 85 secs
lola: 7245151 markings, 34462476 edges, 68084 markings/sec, 90 secs
lola: 7566860 markings, 36330967 edges, 64342 markings/sec, 95 secs
lola: 7901415 markings, 38066058 edges, 66911 markings/sec, 100 secs
lola: 8240472 markings, 39716124 edges, 67811 markings/sec, 105 secs
lola: 8551291 markings, 41410122 edges, 62164 markings/sec, 110 secs
lola: 8875660 markings, 43134992 edges, 64874 markings/sec, 115 secs
lola: 9201597 markings, 44896467 edges, 65187 markings/sec, 120 secs
lola: 9534391 markings, 46617432 edges, 66559 markings/sec, 125 secs
lola: 9860128 markings, 48378547 edges, 65147 markings/sec, 130 secs
lola: 10183045 markings, 50014876 edges, 64583 markings/sec, 135 secs
lola: 10524143 markings, 51709719 edges, 68220 markings/sec, 140 secs
lola: 10837399 markings, 53470198 edges, 62651 markings/sec, 145 secs
lola: 11155844 markings, 55086167 edges, 63689 markings/sec, 150 secs
lola: 11517899 markings, 56793469 edges, 72411 markings/sec, 155 secs
lola: 11866818 markings, 58557205 edges, 69784 markings/sec, 160 secs
lola: 12226547 markings, 60340606 edges, 71946 markings/sec, 165 secs
lola: 12565873 markings, 62034325 edges, 67865 markings/sec, 170 secs
lola: 12902600 markings, 63736282 edges, 67345 markings/sec, 175 secs
lola: 13216998 markings, 65467409 edges, 62880 markings/sec, 180 secs
lola: 13554920 markings, 67190811 edges, 67584 markings/sec, 185 secs
lola: 13897956 markings, 68915314 edges, 68607 markings/sec, 190 secs
lola: 14232254 markings, 70682446 edges, 66860 markings/sec, 195 secs
lola: 14545186 markings, 72374531 edges, 62586 markings/sec, 200 secs
lola: 14883113 markings, 74113827 edges, 67585 markings/sec, 205 secs
lola: 15195298 markings, 75805057 edges, 62437 markings/sec, 210 secs
lola: 15523061 markings, 77448616 edges, 65553 markings/sec, 215 secs
lola: 15841420 markings, 79141373 edges, 63672 markings/sec, 220 secs
lola: 16169214 markings, 80802129 edges, 65559 markings/sec, 225 secs
lola: 16497175 markings, 82362637 edges, 65592 markings/sec, 230 secs
lola: 16809555 markings, 84103210 edges, 62476 markings/sec, 235 secs
lola: 17153056 markings, 85842123 edges, 68700 markings/sec, 240 secs
lola: 17469953 markings, 87569731 edges, 63379 markings/sec, 245 secs
lola: 17779549 markings, 89305451 edges, 61919 markings/sec, 250 secs
lola: 18090094 markings, 91023864 edges, 62109 markings/sec, 255 secs
lola: 18411044 markings, 92753692 edges, 64190 markings/sec, 260 secs
lola: 18716975 markings, 94343939 edges, 61186 markings/sec, 265 secs
lola: 19020602 markings, 96023428 edges, 60725 markings/sec, 270 secs
lola: 19309830 markings, 97682240 edges, 57846 markings/sec, 275 secs
lola: 19600237 markings, 99317927 edges, 58081 markings/sec, 280 secs
lola: 19888559 markings, 100960605 edges, 57664 markings/sec, 285 secs
lola: 20184828 markings, 102598741 edges, 59254 markings/sec, 290 secs
lola: 20500098 markings, 104235830 edges, 63054 markings/sec, 295 secs
lola: 20804256 markings, 105885836 edges, 60832 markings/sec, 300 secs
lola: 21087775 markings, 107565826 edges, 56704 markings/sec, 305 secs
lola: 21397838 markings, 109191075 edges, 62013 markings/sec, 310 secs
lola: 21698287 markings, 110886498 edges, 60090 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 1496577154972

--------------------
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_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/S_UtahNoC-PT-none.tgz
mv S_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 S_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 r158-ebro-149443464300374"
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 ;