fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r068-csrt-149440963100095
Last Updated
June 27, 2017

About the Execution of LoLA for ResAllocation-PT-R003C020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15949.960 558084.00 558609.00 507.10 FFFTFF?FFFFFFFFF normal

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


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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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 8 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1424324 markings, 4942638 edges, 284865 markings/sec, 0 secs
lola: 2812247 markings, 9815244 edges, 277585 markings/sec, 5 secs
lola: 4377901 markings, 14900573 edges, 313131 markings/sec, 10 secs
lola: 5902478 markings, 19992618 edges, 304915 markings/sec, 15 secs
lola: 7387787 markings, 24972943 edges, 297062 markings/sec, 20 secs
lola: 8827677 markings, 29986605 edges, 287978 markings/sec, 25 secs
lola: 10255651 markings, 34851416 edges, 285595 markings/sec, 30 secs
lola: 11809513 markings, 39982030 edges, 310772 markings/sec, 35 secs
lola: 13259766 markings, 44921280 edges, 290051 markings/sec, 40 secs
lola: 14731547 markings, 50019075 edges, 294356 markings/sec, 45 secs
lola: 16159478 markings, 54889217 edges, 285586 markings/sec, 50 secs
lola: 17612728 markings, 59686648 edges, 290650 markings/sec, 55 secs
lola: 19033334 markings, 64425471 edges, 284121 markings/sec, 60 secs
lola: 20423301 markings, 69146635 edges, 277993 markings/sec, 65 secs
lola: 21790032 markings, 73740179 edges, 273346 markings/sec, 70 secs
lola: 23081327 markings, 78133610 edges, 258259 markings/sec, 75 secs
lola: 24441299 markings, 82822771 edges, 271994 markings/sec, 80 secs
lola: 25908426 markings, 87198740 edges, 293425 markings/sec, 85 secs
lola: 27345415 markings, 91787334 edges, 287398 markings/sec, 90 secs
lola: 28788335 markings, 96528194 edges, 288584 markings/sec, 95 secs
lola: 30236472 markings, 101244815 edges, 289627 markings/sec, 100 secs
lola: 31599969 markings, 105825753 edges, 272699 markings/sec, 105 secs
lola: 33006862 markings, 110050240 edges, 281379 markings/sec, 110 secs
lola: 34393385 markings, 114544818 edges, 277305 markings/sec, 115 secs
lola: 35796003 markings, 119294112 edges, 280524 markings/sec, 120 secs
lola: 37226363 markings, 124155933 edges, 286072 markings/sec, 125 secs
lola: 38603068 markings, 128890691 edges, 275341 markings/sec, 130 secs
lola: 39955386 markings, 133563138 edges, 270464 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 226 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: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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 242 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 8 bytes per marking, with 1 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 261 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 8 bytes per marking, with 1 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 283 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 8 bytes per marking, with 1 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 309 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 8 bytes per marking, with 2 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 339 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 377 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 8 bytes per marking, with 4 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 424 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 485 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 566 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 8 bytes per marking, with 2 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 679 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 849 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 8 bytes per marking, with 2 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 1133 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 8 bytes per marking, with 1 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 1699 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 8 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1733819 markings, 4759310 edges, 346764 markings/sec, 0 secs
lola: 3471836 markings, 9511346 edges, 347603 markings/sec, 5 secs
lola: 5321854 markings, 14162880 edges, 370004 markings/sec, 10 secs
lola: 6868886 markings, 18481950 edges, 309406 markings/sec, 15 secs
lola: 8302742 markings, 22326986 edges, 286771 markings/sec, 20 secs
lola: 9590354 markings, 25906185 edges, 257522 markings/sec, 25 secs
lola: 10709171 markings, 29424783 edges, 223763 markings/sec, 30 secs
lola: 12164603 markings, 33288486 edges, 291086 markings/sec, 35 secs
lola: 13415763 markings, 36833034 edges, 250232 markings/sec, 40 secs
lola: 14618934 markings, 40280079 edges, 240634 markings/sec, 45 secs
lola: 15674077 markings, 43432688 edges, 211029 markings/sec, 50 secs
lola: 17230952 markings, 47602695 edges, 311375 markings/sec, 55 secs
lola: 18691040 markings, 51455153 edges, 292018 markings/sec, 60 secs
lola: 20069491 markings, 55179813 edges, 275690 markings/sec, 65 secs
lola: 21293487 markings, 58528943 edges, 244799 markings/sec, 70 secs
lola: 22441106 markings, 61715163 edges, 229524 markings/sec, 75 secs
lola: 23432770 markings, 64880537 edges, 198333 markings/sec, 80 secs
lola: 24837998 markings, 68833055 edges, 281046 markings/sec, 85 secs
lola: 26198043 markings, 72743188 edges, 272009 markings/sec, 90 secs
lola: 27546912 markings, 76422489 edges, 269774 markings/sec, 95 secs
lola: 28964581 markings, 80256570 edges, 283534 markings/sec, 100 secs
lola: 30304887 markings, 83838827 edges, 268061 markings/sec, 105 secs
lola: 31619051 markings, 87460472 edges, 262833 markings/sec, 110 secs
lola: 32862272 markings, 90890758 edges, 248644 markings/sec, 115 secs
lola: 34219745 markings, 94521367 edges, 271495 markings/sec, 120 secs
lola: 35391929 markings, 97970470 edges, 234437 markings/sec, 125 secs
lola: 36562036 markings, 101431517 edges, 234021 markings/sec, 130 secs
lola: 37787823 markings, 104788955 edges, 245157 markings/sec, 135 secs
lola: 39107946 markings, 108369017 edges, 264025 markings/sec, 140 secs
lola: 40226487 markings, 111751484 edges, 223708 markings/sec, 145 secs
lola: 41314443 markings, 114848121 edges, 217591 markings/sec, 150 secs
lola: 42451282 markings, 118237124 edges, 227368 markings/sec, 155 secs
lola: 43315666 markings, 121251795 edges, 172877 markings/sec, 160 secs
lola: 44319370 markings, 124651651 edges, 200741 markings/sec, 165 secs
lola: 45890170 markings, 128744116 edges, 314160 markings/sec, 170 secs
lola: 47330416 markings, 132481098 edges, 288049 markings/sec, 175 secs
lola: 48773704 markings, 136273387 edges, 288658 markings/sec, 180 secs
lola: 50163731 markings, 139782463 edges, 278005 markings/sec, 185 secs
lola: 51533497 markings, 143387627 edges, 273953 markings/sec, 190 secs
lola: 52854434 markings, 146981223 edges, 264187 markings/sec, 195 secs
lola: 54322031 markings, 150775355 edges, 293519 markings/sec, 200 secs
lola: 55775577 markings, 154664821 edges, 290709 markings/sec, 205 secs
lola: 57185542 markings, 158667643 edges, 281993 markings/sec, 210 secs
lola: 58531651 markings, 162556742 edges, 269222 markings/sec, 215 secs
lola: 59892601 markings, 166267053 edges, 272190 markings/sec, 220 secs
lola: 61320064 markings, 170012956 edges, 285493 markings/sec, 225 secs
lola: 62605231 markings, 173666178 edges, 257033 markings/sec, 230 secs
lola: 63715363 markings, 176975091 edges, 222026 markings/sec, 235 secs
lola: 64851721 markings, 180392739 edges, 227272 markings/sec, 240 secs
lola: 66078296 markings, 183972199 edges, 245315 markings/sec, 245 secs
lola: 67118256 markings, 187295888 edges, 207992 markings/sec, 250 secs
lola: 68101014 markings, 190572188 edges, 196552 markings/sec, 255 secs
lola: 69822800 markings, 194978224 edges, 344357 markings/sec, 260 secs
lola: 71222848 markings, 199044619 edges, 280010 markings/sec, 265 secs
lola: 72808045 markings, 203127821 edges, 317039 markings/sec, 270 secs
lola: 74196949 markings, 207188724 edges, 277781 markings/sec, 275 secs
lola: 75560237 markings, 211008424 edges, 272658 markings/sec, 280 secs
lola: 76866403 markings, 214785540 edges, 261233 markings/sec, 285 secs
lola: 78022772 markings, 218181270 edges, 231274 markings/sec, 290 secs
lola: 79119970 markings, 221694517 edges, 219440 markings/sec, 295 secs
lola: 80551954 markings, 225513936 edges, 286397 markings/sec, 300 secs
lola: 81919153 markings, 229210567 edges, 273440 markings/sec, 305 secs
lola: 83191094 markings, 232681206 edges, 254388 markings/sec, 310 secs
lola: 84346645 markings, 235997527 edges, 231110 markings/sec, 315 secs
lola: 85414689 markings, 239373779 edges, 213609 markings/sec, 320 secs
lola: 86771880 markings, 243097632 edges, 271438 markings/sec, 325 secs
lola: 87913927 markings, 246509922 edges, 228409 markings/sec, 330 secs
lola: 89248521 markings, 250155197 edges, 266919 markings/sec, 335 secs
lola: 90531525 markings, 253564388 edges, 256601 markings/sec, 340 secs
lola: 91625832 markings, 256725489 edges, 218861 markings/sec, 345 secs
lola: 92736066 markings, 260072564 edges, 222047 markings/sec, 350 secs
lola: 93754392 markings, 263153754 edges, 203665 markings/sec, 355 secs
lola: 94927085 markings, 266604457 edges, 234539 markings/sec, 360 secs
lola: 96096264 markings, 269831525 edges, 233836 markings/sec, 365 secs
lola: 97148055 markings, 273087084 edges, 210358 markings/sec, 370 secs
lola: 98571208 markings, 277087801 edges, 284631 markings/sec, 375 secs
lola: 99915820 markings, 280817397 edges, 268922 markings/sec, 380 secs
lola: 101250815 markings, 284539642 edges, 266999 markings/sec, 385 secs
lola: 102421430 markings, 287978999 edges, 234123 markings/sec, 390 secs
lola: 103542443 markings, 291229753 edges, 224203 markings/sec, 395 secs
lola: 104482935 markings, 294286398 edges, 188098 markings/sec, 400 secs
lola: 105604857 markings, 297725957 edges, 224384 markings/sec, 405 secs
lola: 106193036 markings, 299301781 edges, 117636 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2982 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 8 bytes per marking, with 2 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 1494802714738

--------------------
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="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/ResAllocation-PT-R003C020.tgz
mv 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 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 r068-csrt-149440963100095"
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 ;