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 FlexibleBarrier-PT-16a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034300113
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496492215806


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-16a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ FlexibleBarrier-PT-16a @ 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: 919/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 724 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 532 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-16a-LTLCardinality.task
lola: A (((p5 <= p165) U X (F ((3 <= p141))))) : A (X (X (X (F ((p178 <= p93)))))) : A ((2 <= p21)) : A (F (G (F ((p50 <= p139))))) : A (F ((p173 <= p96))) : A ((1 <= p30)) : A ((G (G ((p81 <= p123))) U X (G ((3 <= p135))))) : A (G ((X ((3 <= p121)) U X ((3 <= p101))))) : A (X (G (X (F ((p24 <= p6)))))) : A ((p148 <= p151)) : A ((((p164 <= p100) U (3 <= p110)) U X (F ((1 <= p70))))) : A ((G (G ((1 <= p112))) U ((2 <= p178) U (3 <= p101)))) : A (F ((F ((3 <= p180)) U (p173 <= p17)))) : A (X (((p54 <= p50) U X ((1 <= p46))))) : A (G ((p62 <= p115))) : A ((F (F ((1 <= p119))) U (p66 <= p20)))
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 (((p5 <= p165) U X (F ((3 <= p141)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p5 <= p165) U X (F ((3 <= p141)))))
lola: processed formula: A (((p5 <= p165) U X (F ((3 <= p141)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 (X (X (X (F ((p178 <= p93))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((p178 <= p93))))))
lola: processed formula: A (X (X (X (F ((p178 <= p93))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p21)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F ((p50 <= p139)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p50 <= p139))))
lola: processed formula: A (G (F ((p50 <= p139))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 10879 markings, 95645 edges, 2176 markings/sec, 0 secs
lola: 30969 markings, 279670 edges, 4018 markings/sec, 5 secs
lola: 51251 markings, 442073 edges, 4056 markings/sec, 10 secs
lola: 68064 markings, 575213 edges, 3363 markings/sec, 15 secs
lola: 98738 markings, 811958 edges, 6135 markings/sec, 20 secs
lola: 109608 markings, 893139 edges, 2174 markings/sec, 25 secs
lola: 115351 markings, 933818 edges, 1149 markings/sec, 30 secs
lola: 124702 markings, 1005316 edges, 1870 markings/sec, 35 secs
lola: 136727 markings, 1098284 edges, 2405 markings/sec, 40 secs
lola: 144768 markings, 1154790 edges, 1608 markings/sec, 45 secs
lola: 153015 markings, 1216666 edges, 1649 markings/sec, 50 secs
lola: 161990 markings, 1279581 edges, 1795 markings/sec, 55 secs
lola: 172510 markings, 1358201 edges, 2104 markings/sec, 60 secs
lola: 181183 markings, 1416768 edges, 1735 markings/sec, 65 secs
lola: 188971 markings, 1465959 edges, 1558 markings/sec, 70 secs
lola: 219499 markings, 1692970 edges, 6106 markings/sec, 75 secs
lola: 231470 markings, 1776912 edges, 2394 markings/sec, 80 secs
lola: 247140 markings, 1893352 edges, 3134 markings/sec, 85 secs
lola: 265217 markings, 2021079 edges, 3615 markings/sec, 90 secs
lola: 280127 markings, 2130828 edges, 2982 markings/sec, 95 secs
lola: 295448 markings, 2239889 edges, 3064 markings/sec, 100 secs
lola: 335890 markings, 2546744 edges, 8088 markings/sec, 105 secs
lola: 362753 markings, 2734662 edges, 5373 markings/sec, 110 secs
lola: 373939 markings, 2818741 edges, 2237 markings/sec, 115 secs
lola: 382750 markings, 2879636 edges, 1762 markings/sec, 120 secs
lola: 399068 markings, 3000332 edges, 3264 markings/sec, 125 secs
lola: 409213 markings, 3067029 edges, 2029 markings/sec, 130 secs
lola: 420847 markings, 3146396 edges, 2327 markings/sec, 135 secs
lola: 432048 markings, 3221935 edges, 2240 markings/sec, 140 secs
lola: 440766 markings, 3288210 edges, 1744 markings/sec, 145 secs
lola: 451121 markings, 3369748 edges, 2071 markings/sec, 150 secs
lola: 461622 markings, 3448329 edges, 2100 markings/sec, 155 secs
lola: 474126 markings, 3535288 edges, 2501 markings/sec, 160 secs
lola: 498106 markings, 3710647 edges, 4796 markings/sec, 165 secs
lola: 508827 markings, 3791138 edges, 2144 markings/sec, 170 secs
lola: 524480 markings, 3902225 edges, 3131 markings/sec, 175 secs
lola: 544652 markings, 4047560 edges, 4034 markings/sec, 180 secs
lola: 554441 markings, 4110599 edges, 1958 markings/sec, 185 secs
lola: 577579 markings, 4274885 edges, 4628 markings/sec, 190 secs
lola: 615242 markings, 4539444 edges, 7533 markings/sec, 195 secs
lola: 641661 markings, 4729362 edges, 5284 markings/sec, 200 secs
lola: 650921 markings, 4790209 edges, 1852 markings/sec, 205 secs
lola: 666914 markings, 4909455 edges, 3199 markings/sec, 210 secs
lola: 678472 markings, 4988907 edges, 2312 markings/sec, 215 secs
lola: 696278 markings, 5113538 edges, 3561 markings/sec, 220 secs
lola: 743789 markings, 5463836 edges, 9502 markings/sec, 225 secs
lola: 769326 markings, 5648203 edges, 5107 markings/sec, 230 secs
lola: 791340 markings, 5796750 edges, 4403 markings/sec, 235 secs
lola: 807241 markings, 5906149 edges, 3180 markings/sec, 240 secs
lola: 837230 markings, 6114211 edges, 5998 markings/sec, 245 secs
lola: 868514 markings, 6339515 edges, 6257 markings/sec, 250 secs
lola: 875764 markings, 6395517 edges, 1450 markings/sec, 255 secs
lola: 883554 markings, 6451032 edges, 1558 markings/sec, 260 secs
lola: 892434 markings, 6512039 edges, 1776 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p173 <= p96)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p173 <= p96)))
lola: processed formula: A (F ((p173 <= p96)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p30))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p30)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-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 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p81 <= p123))) U X (G ((3 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((p81 <= p123))) U X (G ((3 <= p135)))))
lola: processed formula: A ((G (G ((p81 <= p123))) U X (G ((3 <= p135)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((3 <= p121)) U X ((3 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((3 <= p121) U (3 <= p101)))))
lola: processed formula: A (G (X (((3 <= p121) U (3 <= p101)))))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((p24 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X (F ((p24 <= p6))))))
lola: processed formula: A (X (G (X (F ((p24 <= p6))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p148 <= p151))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p148 <= p151)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-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 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p164 <= p100) U (3 <= p110)) U X (F ((1 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p164 <= p100) U (3 <= p110)) U X (F ((1 <= p70)))))
lola: processed formula: A ((((p164 <= p100) U (3 <= p110)) U X (F ((1 <= p70)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((1 <= p112))) U ((2 <= p178) U (3 <= p101))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((1 <= p112))) U ((2 <= p178) U (3 <= p101))))
lola: processed formula: A ((G (G ((1 <= p112))) U ((2 <= p178) U (3 <= p101))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= p180)) U (p173 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= p180)) U (p173 <= p17))))
lola: processed formula: A (F ((F ((3 <= p180)) U (p173 <= p17))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 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 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p54 <= p50) U X ((1 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p54 <= p50) U X ((1 <= p46)))))
lola: processed formula: A (X (((p54 <= p50) U X ((1 <= p46)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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 1634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p62 <= p115)))
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 24 bytes per marking, with 15 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 15 will run for 3268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= p119))) U (p66 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((1 <= p119)) U (p66 <= p20)))
lola: processed formula: A ((F ((1 <= p119)) U (p66 <= p20)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: RESULT
lola:
SUMMARY: no no no unknown yes no no no no yes no no yes no no yes
lola: ========================================
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496492488018

--------------------
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="FlexibleBarrier-PT-16a"
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/FlexibleBarrier-PT-16a.tgz
mv FlexibleBarrier-PT-16a 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 FlexibleBarrier-PT-16a, 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 r188-blw3-149581034300113"
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 ;