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 S_ResAllocation-PT-R003C020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800095
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496440272345


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


checking for too many tokens
===========================================================================================
S_ResAllocation-PT-R003C020: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_ResAllocation-PT-R003C020 @ 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: 200/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 80 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 140 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C020-LTLCardinality.task
lola: A (G (F ((p_19_0 <= p_7_2)))) : A (G ((1 <= p_18_0))) : A (X (X (G (G ((p_17_1 <= r_10_1)))))) : A (F (X (X (G ((1 <= p_6_0)))))) : A ((G ((r_15_2 <= r_2_0)) U ((1 <= p_2_0) U (1 <= p_16_0)))) : A (F (X (F (X ((1 <= r_13_0)))))) : A ((2 <= p_2_0)) : A (G ((3 <= r_0_2))) : A ((2 <= p_17_1)) : A ((3 <= r_3_1)) : A (G (X (((r_19_0 <= r_2_1) U (p_0_0 <= r_0_0))))) : A ((p_6_2 <= p_18_1)) : A (X (((r_7_1 <= p_16_1) U F ((p_6_0 <= p_2_1))))) : A (X (X (X (X ((r_2_2 <= r_9_1)))))) : A ((G ((r_7_2 <= p_3_0)) U G (F ((p_8_2 <= r_11_1))))) : A ((((p_11_1 <= r_12_2) U (p_0_0 <= p_1_0)) U (2 <= p_19_1)))
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 (F ((p_19_0 <= p_7_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p_19_0 <= p_7_2))))
lola: processed formula: A (G (F ((p_19_0 <= p_7_2))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1023818 markings, 3527927 edges, 204764 markings/sec, 0 secs
lola: 1942739 markings, 6792541 edges, 183784 markings/sec, 5 secs
lola: 2951917 markings, 10266271 edges, 201836 markings/sec, 10 secs
lola: 4080527 markings, 13938910 edges, 225722 markings/sec, 15 secs
lola: 5285212 markings, 17934190 edges, 240937 markings/sec, 20 secs
lola: 6475326 markings, 21798519 edges, 238023 markings/sec, 25 secs
lola: 7552855 markings, 25566280 edges, 215506 markings/sec, 30 secs
lola: 8630968 markings, 29274819 edges, 215623 markings/sec, 35 secs
lola: 9590926 markings, 32697430 edges, 191992 markings/sec, 40 secs
lola: 10718423 markings, 36352207 edges, 225499 markings/sec, 45 secs
lola: 11777424 markings, 39882166 edges, 211800 markings/sec, 50 secs
lola: 12780907 markings, 43314388 edges, 200697 markings/sec, 55 secs
lola: 13815907 markings, 46929815 edges, 207000 markings/sec, 60 secs
lola: 14829873 markings, 50383142 edges, 202793 markings/sec, 65 secs
lola: 15840076 markings, 53814191 edges, 202041 markings/sec, 70 secs
lola: 16804157 markings, 57135743 edges, 192816 markings/sec, 75 secs
lola: 17932705 markings, 60685238 edges, 225710 markings/sec, 80 secs
lola: 18981796 markings, 64246116 edges, 209818 markings/sec, 85 secs
lola: 19970763 markings, 67687140 edges, 197793 markings/sec, 90 secs
lola: 21010714 markings, 71132228 edges, 207990 markings/sec, 95 secs
lola: 21999381 markings, 74480141 edges, 197733 markings/sec, 100 secs
lola: 22957484 markings, 77678942 edges, 191621 markings/sec, 105 secs
lola: 23874545 markings, 81067428 edges, 183412 markings/sec, 110 secs
lola: 24987047 markings, 84450549 edges, 222500 markings/sec, 115 secs
lola: 26073788 markings, 87678205 edges, 217348 markings/sec, 120 secs
lola: 27149597 markings, 91173674 edges, 215162 markings/sec, 125 secs
lola: 28293869 markings, 94883045 edges, 228854 markings/sec, 130 secs
lola: 29411183 markings, 98577963 edges, 223463 markings/sec, 135 secs
lola: 30512675 markings, 102246314 edges, 220298 markings/sec, 140 secs
lola: 31610591 markings, 105856459 edges, 219583 markings/sec, 145 secs
lola: 32721573 markings, 109213843 edges, 222196 markings/sec, 150 secs
lola: 33815057 markings, 112658437 edges, 218697 markings/sec, 155 secs
lola: 34796723 markings, 115929247 edges, 196333 markings/sec, 160 secs
lola: 35800428 markings, 119307828 edges, 200741 markings/sec, 165 secs
lola: 36785419 markings, 122612015 edges, 196998 markings/sec, 170 secs
lola: 37761896 markings, 126003827 edges, 195295 markings/sec, 175 secs
lola: 38762541 markings, 129407242 edges, 200129 markings/sec, 180 secs
lola: 39679049 markings, 132553630 edges, 183302 markings/sec, 185 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: subprocess 1 will run for 223 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_18_0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: lola: STORE========================================

lola: using a bit-perfect encoder (--encoder=bit)
lola: using 240 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (G ((p_17_1 <= r_10_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (G ((p_17_1 <= r_10_1))))))
lola: processed formula: A (X (X (G (G ((p_17_1 <= r_10_1))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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 3 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (G ((1 <= p_6_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (G ((1 <= p_6_0))))))
lola: processed formula: A (F (X (X (G ((1 <= p_6_0))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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 4 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((r_15_2 <= r_2_0)) U ((1 <= p_2_0) U (1 <= p_16_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((r_15_2 <= r_2_0)) U ((1 <= p_2_0) U (1 <= p_16_0))))
lola: processed formula: A ((G ((r_15_2 <= r_2_0)) U ((1 <= p_2_0) U (1 <= p_16_0))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (X ((1 <= r_13_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F (X ((1 <= r_13_0))))))
lola: processed formula: A (F (X (F (X ((1 <= r_13_0))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p_2_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_2_0)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-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 7 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= r_0_2)))
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 240 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p_17_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_17_1)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-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 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= r_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= r_3_1)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-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 10 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((r_19_0 <= r_2_1) U (p_0_0 <= r_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((r_19_0 <= r_2_1) U (p_0_0 <= r_0_0)))))
lola: processed formula: A (G (X (((r_19_0 <= r_2_1) U (p_0_0 <= r_0_0)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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 11 will run for 669 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_6_2 <= p_18_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_6_2 <= p_18_1)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-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 836 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((r_7_1 <= p_16_1) U F ((p_6_0 <= p_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((r_7_1 <= p_16_1) U F ((p_6_0 <= p_2_1)))))
lola: processed formula: A (X (((r_7_1 <= p_16_1) U F ((p_6_0 <= p_2_1)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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 13 will run for 1115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((r_2_2 <= r_9_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((r_2_2 <= r_9_1))))))
lola: processed formula: A (X (X (X (X ((r_2_2 <= r_9_1))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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 14 will run for 1673 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((r_7_2 <= p_3_0)) U G (F ((p_8_2 <= r_11_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((r_7_2 <= p_3_0)) U G (F ((p_8_2 <= r_11_1)))))
lola: processed formula: A ((G ((r_7_2 <= p_3_0)) U G (F ((p_8_2 <= r_11_1)))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1251276 markings, 3449567 edges, 250255 markings/sec, 0 secs
lola: 2468581 markings, 6796424 edges, 243461 markings/sec, 5 secs
lola: 3701553 markings, 10060791 edges, 246594 markings/sec, 10 secs
lola: 5021065 markings, 13391221 edges, 263902 markings/sec, 15 secs
lola: 6081868 markings, 16369609 edges, 212161 markings/sec, 20 secs
lola: 7205874 markings, 19358171 edges, 224801 markings/sec, 25 secs
lola: 8285714 markings, 22284360 edges, 215968 markings/sec, 30 secs
lola: 9299775 markings, 25135459 edges, 202812 markings/sec, 35 secs
lola: 10186573 markings, 27704580 edges, 177360 markings/sec, 40 secs
lola: 10953317 markings, 30141004 edges, 153349 markings/sec, 45 secs
lola: 11999231 markings, 32853096 edges, 209183 markings/sec, 50 secs
lola: 12904072 markings, 35307457 edges, 180968 markings/sec, 55 secs
lola: 13644524 markings, 37590667 edges, 148090 markings/sec, 60 secs
lola: 14541039 markings, 40053611 edges, 179303 markings/sec, 65 secs
lola: 15285903 markings, 42180605 edges, 148973 markings/sec, 70 secs
lola: 16068237 markings, 44556165 edges, 156467 markings/sec, 75 secs
lola: 17152170 markings, 47394452 edges, 216787 markings/sec, 80 secs
lola: 18163130 markings, 50036797 edges, 202192 markings/sec, 85 secs
lola: 19135903 markings, 52605958 edges, 194555 markings/sec, 90 secs
lola: 20031182 markings, 55066343 edges, 179056 markings/sec, 95 secs
lola: 20845332 markings, 57333181 edges, 162830 markings/sec, 100 secs
lola: 21667446 markings, 59539807 edges, 164423 markings/sec, 105 secs
lola: 22408088 markings, 61621897 edges, 148128 markings/sec, 110 secs
lola: 23122244 markings, 63725713 edges, 142831 markings/sec, 115 secs
lola: 23619697 markings, 65634078 edges, 99491 markings/sec, 120 secs
lola: 24797472 markings, 68732847 edges, 235555 markings/sec, 125 secs
lola: 25762910 markings, 71542994 edges, 193088 markings/sec, 130 secs
lola: 26809170 markings, 74396684 edges, 209252 markings/sec, 135 secs
lola: 27799810 markings, 77071142 edges, 198128 markings/sec, 140 secs
lola: 28891827 markings, 80049065 edges, 218403 markings/sec, 145 secs
lola: 29915406 markings, 82766956 edges, 204716 markings/sec, 150 secs
lola: 30881463 markings, 85385843 edges, 193211 markings/sec, 155 secs
lola: 31830715 markings, 88047765 edges, 189850 markings/sec, 160 secs
lola: 32667787 markings, 90506979 edges, 167414 markings/sec, 165 secs
lola: 33743432 markings, 93194068 edges, 215129 markings/sec, 170 secs
lola: 34644956 markings, 95750814 edges, 180305 markings/sec, 175 secs
lola: 35480083 markings, 98215345 edges, 167025 markings/sec, 180 secs
lola: 36318377 markings, 100694300 edges, 167659 markings/sec, 185 secs
lola: 37154126 markings, 103048281 edges, 167150 markings/sec, 190 secs
lola: 37948244 markings, 105207101 edges, 158824 markings/sec, 195 secs
lola: 38789677 markings, 107487099 edges, 168287 markings/sec, 200 secs
lola: 39537631 markings, 109661974 edges, 149591 markings/sec, 205 secs
lola: 40257835 markings, 111840978 edges, 144041 markings/sec, 210 secs
lola: 40938692 markings, 113865276 edges, 136171 markings/sec, 215 secs
lola: 41677437 markings, 115938561 edges, 147749 markings/sec, 220 secs
lola: 42418621 markings, 118136047 edges, 148237 markings/sec, 225 secs
lola: 43010260 markings, 120081152 edges, 118328 markings/sec, 230 secs
lola: 43484180 markings, 121930830 edges, 94784 markings/sec, 235 secs
lola: 44099124 markings, 124080918 edges, 122989 markings/sec, 240 secs
lola: 45226011 markings, 126993431 edges, 225377 markings/sec, 245 secs
lola: 46223715 markings, 129750166 edges, 199541 markings/sec, 250 secs
lola: 47374527 markings, 132586445 edges, 230162 markings/sec, 255 secs
lola: 48463686 markings, 135459411 edges, 217832 markings/sec, 260 secs
lola: 49546332 markings, 138161685 edges, 216529 markings/sec, 265 secs
lola: 50564784 markings, 140863419 edges, 203690 markings/sec, 270 secs
lola: 51585539 markings, 143524384 edges, 204151 markings/sec, 275 secs
lola: 52554661 markings, 146112346 edges, 193824 markings/sec, 280 secs
lola: 53419308 markings, 148522523 edges, 172929 markings/sec, 285 secs
lola: 54487854 markings, 151224523 edges, 213709 markings/sec, 290 secs
lola: 55497113 markings, 153880633 edges, 201852 markings/sec, 295 secs
lola: 56426438 markings, 156426839 edges, 185865 markings/sec, 300 secs
lola: 57283836 markings, 158944758 edges, 171480 markings/sec, 305 secs
lola: 58159303 markings, 161461520 edges, 175093 markings/sec, 310 secs
lola: 59058887 markings, 163965002 edges, 179917 markings/sec, 315 secs
lola: 59935088 markings, 166375915 edges, 175240 markings/sec, 320 secs
lola: 60928136 markings, 168999133 edges, 198610 markings/sec, 325 secs
lola: 61877974 markings, 171541177 edges, 189968 markings/sec, 330 secs
lola: 62730003 markings, 174077224 edges, 170406 markings/sec, 335 secs
lola: 63524235 markings, 176397963 edges, 158846 markings/sec, 340 secs
lola: 64290750 markings, 178672629 edges, 153303 markings/sec, 345 secs
lola: 65110375 markings, 181154138 edges, 163925 markings/sec, 350 secs
lola: 65970891 markings, 183646130 edges, 172103 markings/sec, 355 secs
lola: 66707475 markings, 185903412 edges, 147317 markings/sec, 360 secs
lola: 67348035 markings, 188126283 edges, 128112 markings/sec, 365 secs
lola: 68055668 markings, 190456476 edges, 141527 markings/sec, 370 secs
lola: 69439724 markings, 193941772 edges, 276811 markings/sec, 375 secs
lola: 70646599 markings, 197238195 edges, 241375 markings/sec, 380 secs
lola: 71730241 markings, 200360751 edges, 216728 markings/sec, 385 secs
lola: 72924397 markings, 203430889 edges, 238831 markings/sec, 390 secs
lola: 73959926 markings, 206490460 edges, 207106 markings/sec, 395 secs
lola: 75064003 markings, 209595275 edges, 220815 markings/sec, 400 secs
lola: 76139728 markings, 212616764 edges, 215145 markings/sec, 405 secs
lola: 77090536 markings, 215428847 edges, 190162 markings/sec, 410 secs
lola: 78003909 markings, 218119459 edges, 182675 markings/sec, 415 secs
lola: 78746260 markings, 220693995 edges, 148470 markings/sec, 420 secs
lola: 79896710 markings, 223772080 edges, 230090 markings/sec, 425 secs
lola: 81015197 markings, 226759366 edges, 223697 markings/sec, 430 secs
lola: 82022026 markings, 229491009 edges, 201366 markings/sec, 435 secs
lola: 82955806 markings, 232044684 edges, 186756 markings/sec, 440 secs
lola: 83880145 markings, 234604489 edges, 184868 markings/sec, 445 secs
lola: 84719258 markings, 237188927 edges, 167823 markings/sec, 450 secs
lola: 85676769 markings, 240099413 edges, 191502 markings/sec, 455 secs
lola: 86733267 markings, 242982252 edges, 211300 markings/sec, 460 secs
lola: 87645326 markings, 245624181 edges, 182412 markings/sec, 465 secs
lola: 88522460 markings, 248269484 edges, 175427 markings/sec, 470 secs
lola: 89671828 markings, 251269520 edges, 229874 markings/sec, 475 secs
lola: 90698813 markings, 254006173 edges, 205397 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2861 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p_11_1 <= r_12_2) U (p_0_0 <= p_1_0)) U (2 <= p_19_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p_11_1 <= r_12_2) U (p_0_0 <= p_1_0)) U (2 <= p_19_1)))
lola: processed formula: A ((((p_11_1 <= r_12_2) U (p_0_0 <= p_1_0)) U (2 <= p_19_1)))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: RESULT
lola:
SUMMARY: no no no no no no no no no no no yes no no unknown no
lola: ========================================
FORMULA ResAllocation-PT-R003C020-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496440951723

--------------------
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_ResAllocation-PT-R003C020"
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_ResAllocation-PT-R003C020.tgz
mv S_ResAllocation-PT-R003C020 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 S_ResAllocation-PT-R003C020, 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 r148-csrt-149443432800095"
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 ;