fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r038-blw7-149440484500050
Last Updated
June 27, 2017

About the Execution of LoLA for HypertorusGrid-PT-d4k3p2b08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
577.390 425162.00 426195.00 50.10 TFFFFFFTTTFFTFFT 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 HypertorusGrid-PT-d4k3p2b08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500050
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494617513434


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ HypertorusGrid-PT-d4k3p2b08 @ 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: 7209/65536 symbol table entries, 1791 collisions
lola: preprocessing...
lola: finding significant places
lola: 2025 places, 5184 transitions, 1295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5913 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: A ((po_d4_n1_3_2_1_1 <= pb_d1_n1_2_1_1_1)) : A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2))) : A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3))) : A ((F (F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1))) U X ((1 <= pb_d1_n1_3_1_2_2)))) : A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1))))) : A ((pb_d2_n1_3_1_2_2 <= po_d3_n1_2_1_1_3)) : A ((1 <= pb_d4_n1_2_2_3_3)) : A ((pb_d1_n2_1_2_1_1 <= po_d4_n1_1_1_2_3)) : A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1)))) : A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1))) : A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1))))) : A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2))))) : A (X (F (F (G ((1 <= pb_d4_n2_1_3_1_3)))))) : A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3)))) : A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3))) : A ((pol_d3_n1_1_3_2_2 <= pb_d1_n1_2_3_1_2))
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 ((po_d4_n1_3_2_1_1 <= pb_d1_n1_2_1_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d4_n1_3_2_1_1 <= pb_d1_n1_2_1_1_1)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2)))
lola: processed formula: A (F ((pb_d3_n2_1_3_3_2 <= pil_d3_n1_3_3_1_2)))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1151 markings, 1150 edges, 230 markings/sec, 0 secs
lola: 1192 markings, 1191 edges, 8 markings/sec, 5 secs
lola: 1262 markings, 1261 edges, 14 markings/sec, 10 secs
lola: 1373 markings, 1372 edges, 22 markings/sec, 15 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 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3)))
lola: processed formula: A ((G (X ((3 <= pb_d1_n1_2_2_2_1))) U (pi_d4_n1_3_1_1_2 <= pi_d4_n1_3_3_1_3)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1))) U X ((1 <= pb_d1_n1_3_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1)) U X ((1 <= pb_d1_n1_3_1_2_2))))
lola: processed formula: A ((F ((pi_d3_n1_3_3_2_3 <= pil_d2_n1_3_3_1_1)) U X ((1 <= pb_d1_n1_3_1_2_2))))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1)))))
lola: processed formula: A (X ((G ((pb_d4_n1_3_1_1_1 <= pb_d3_n2_3_1_2_3)) U F ((1 <= pil_d4_n1_3_2_1_1)))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d2_n1_3_1_2_2 <= po_d3_n1_2_1_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d2_n1_3_1_2_2 <= po_d3_n1_2_1_1_3)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= pb_d4_n1_2_2_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pb_d4_n1_2_2_3_3)
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d1_n2_1_2_1_1 <= po_d4_n1_1_1_2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d1_n2_1_2_1_1 <= po_d4_n1_1_1_2_3)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 8 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1))))
lola: processed formula: A (X (G ((po_d4_n1_1_3_2_3 <= po_d3_n1_1_3_1_1))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1)))
lola: processed formula: A (F ((pb_d3_n1_1_1_1_3 <= pb_d4_n2_2_1_3_1)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 bytes per marking, with 31 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 10 will run for 585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1)))))
lola: processed formula: A (X (G (((1 <= pi_d4_n1_2_2_3_2) U (pb_d2_n1_2_3_2_3 <= po_d3_n1_2_2_2_1)))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 11 will run for 703 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2)))))
lola: processed formula: A ((((2 <= pbl_1_1_3_3) U (po_d2_n1_3_3_1_3 <= pil_d4_n1_2_1_3_3)) U G (F ((1 <= pb_d4_n1_2_1_3_2)))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1287 markings, 1286 edges, 257 markings/sec, 0 secs
lola: 2962 markings, 3393 edges, 335 markings/sec, 5 secs
lola: 3446 markings, 4012 edges, 97 markings/sec, 10 secs
lola: 3871 markings, 4556 edges, 85 markings/sec, 15 secs
lola: 4177 markings, 4945 edges, 61 markings/sec, 20 secs
lola: 4400 markings, 5236 edges, 45 markings/sec, 25 secs
lola: 4639 markings, 5536 edges, 48 markings/sec, 30 secs
lola: 5040 markings, 6050 edges, 80 markings/sec, 35 secs
lola: 5533 markings, 6679 edges, 99 markings/sec, 40 secs
lola: 6050 markings, 7345 edges, 103 markings/sec, 45 secs
lola: 6774 markings, 8270 edges, 145 markings/sec, 50 secs
lola: 7521 markings, 9223 edges, 149 markings/sec, 55 secs
lola: 8246 markings, 10147 edges, 145 markings/sec, 60 secs
lola: 8979 markings, 11075 edges, 147 markings/sec, 65 secs
lola: 9796 markings, 12121 edges, 163 markings/sec, 70 secs
lola: 10498 markings, 13020 edges, 140 markings/sec, 75 secs
lola: 10986 markings, 13643 edges, 98 markings/sec, 80 secs
lola: 11495 markings, 14296 edges, 102 markings/sec, 85 secs
lola: 12385 markings, 15436 edges, 178 markings/sec, 90 secs
lola: 13325 markings, 16636 edges, 188 markings/sec, 95 secs
lola: 14294 markings, 17878 edges, 194 markings/sec, 100 secs
lola: 15330 markings, 19202 edges, 207 markings/sec, 105 secs
lola: 15834 markings, 19853 edges, 101 markings/sec, 110 secs
lola: 16563 markings, 20786 edges, 146 markings/sec, 115 secs
lola: 17320 markings, 21771 edges, 151 markings/sec, 120 secs
lola: 18097 markings, 22776 edges, 155 markings/sec, 125 secs
lola: 18864 markings, 23777 edges, 153 markings/sec, 130 secs
lola: 19637 markings, 24786 edges, 155 markings/sec, 135 secs
lola: 20466 markings, 25827 edges, 166 markings/sec, 140 secs
lola: 20825 markings, 26282 edges, 72 markings/sec, 145 secs
lola: 21584 markings, 27244 edges, 152 markings/sec, 150 secs
lola: 22348 markings, 28216 edges, 153 markings/sec, 155 secs
lola: 23100 markings, 29172 edges, 150 markings/sec, 160 secs
lola: 23849 markings, 30127 edges, 150 markings/sec, 165 secs
lola: 24598 markings, 31082 edges, 150 markings/sec, 170 secs
lola: 25281 markings, 31946 edges, 137 markings/sec, 175 secs
lola: 25960 markings, 32815 edges, 136 markings/sec, 180 secs
lola: 26642 markings, 33687 edges, 136 markings/sec, 185 secs
lola: 27316 markings, 34534 edges, 135 markings/sec, 190 secs
lola: 28088 markings, 35515 edges, 154 markings/sec, 195 secs
lola: 28851 markings, 36482 edges, 153 markings/sec, 200 secs
lola: 29664 markings, 37521 edges, 163 markings/sec, 205 secs
lola: 30515 markings, 38598 edges, 170 markings/sec, 210 secs
lola: 31375 markings, 39687 edges, 172 markings/sec, 215 secs
lola: 32254 markings, 40802 edges, 176 markings/sec, 220 secs
lola: 33164 markings, 41965 edges, 182 markings/sec, 225 secs
lola: 34085 markings, 43136 edges, 184 markings/sec, 230 secs
lola: 35029 markings, 44340 edges, 189 markings/sec, 235 secs
lola: 35933 markings, 45480 edges, 181 markings/sec, 240 secs
lola: 36846 markings, 46642 edges, 183 markings/sec, 245 secs
lola: 37776 markings, 47827 edges, 186 markings/sec, 250 secs
lola: 38632 markings, 48909 edges, 171 markings/sec, 255 secs
lola: 39484 markings, 49987 edges, 170 markings/sec, 260 secs
lola: 40361 markings, 51114 edges, 175 markings/sec, 265 secs
lola: 41216 markings, 52195 edges, 171 markings/sec, 270 secs
lola: 42048 markings, 53252 edges, 166 markings/sec, 275 secs
lola: 42868 markings, 54286 edges, 164 markings/sec, 280 secs
lola: 43694 markings, 55335 edges, 165 markings/sec, 285 secs
lola: 44532 markings, 56403 edges, 168 markings/sec, 290 secs
lola: 45446 markings, 57537 edges, 183 markings/sec, 295 secs
lola: 46409 markings, 58757 edges, 193 markings/sec, 300 secs
lola: 47387 markings, 59993 edges, 196 markings/sec, 305 secs
lola: 48326 markings, 61176 edges, 188 markings/sec, 310 secs
lola: 49288 markings, 62382 edges, 192 markings/sec, 315 secs
lola: 50279 markings, 63634 edges, 198 markings/sec, 320 secs
lola: 51259 markings, 64873 edges, 196 markings/sec, 325 secs
lola: 52211 markings, 66078 edges, 190 markings/sec, 330 secs
lola: 53113 markings, 67225 edges, 180 markings/sec, 335 secs
lola: 54006 markings, 68322 edges, 179 markings/sec, 340 secs
lola: 55245 markings, 69832 edges, 248 markings/sec, 345 secs
lola: 57269 markings, 72298 edges, 405 markings/sec, 350 secs
lola: 60379 markings, 76079 edges, 622 markings/sec, 355 secs
lola: 63749 markings, 80187 edges, 674 markings/sec, 360 secs
lola: 66906 markings, 83946 edges, 631 markings/sec, 365 secs
lola: 70456 markings, 87496 edges, 710 markings/sec, 370 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 12 will run for 784 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((1 <= pb_d4_n2_1_3_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= pb_d4_n2_1_3_1_3)))))
lola: processed formula: A (X (F (G ((1 <= pb_d4_n2_1_3_1_3)))))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 1045 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3))))
lola: processed formula: A (G (((2 <= pi_d4_n1_2_1_1_3) U (pb_d3_n1_2_3_1_3 <= pol_d4_n1_1_2_1_3))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1239 markings, 1238 edges, 248 markings/sec, 0 secs
lola: 1304 markings, 1303 edges, 13 markings/sec, 5 secs
lola: 1375 markings, 1374 edges, 14 markings/sec, 10 secs
lola: 1450 markings, 1449 edges, 15 markings/sec, 15 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 14 will run for 1557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3)))
lola: processed formula: A ((X (X ((3 <= pb_d3_n2_2_2_1_1))) U (3 <= pb_d3_n1_1_2_2_3)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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 15 will run for 3115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pol_d3_n1_1_3_2_2 <= pb_d1_n1_2_3_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol_d3_n1_1_3_2_2 <= pb_d1_n1_2_3_1_2)
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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: RESULT
lola:
SUMMARY: yes no yes yes no no yes no no yes no no no no no yes
lola: ========================================
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494617938596

--------------------
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="HypertorusGrid-PT-d4k3p2b08"
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/HypertorusGrid-PT-d4k3p2b08.tgz
mv HypertorusGrid-PT-d4k3p2b08 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 HypertorusGrid-PT-d4k3p2b08, 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 r038-blw7-149440484500050"
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 ;