About the Execution of LoLA for S_HypercubeGrid-PT-C5K3P3B15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13037.080 | 366628.00 | 468325.00 | 67.60 | FTFTFFF??FTFTFFT | 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 S_HypercubeGrid-PT-C5K3P3B15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649700021
=====================================================================
--------------------
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 HypercubeGrid-PT-C5K3P3B15-CTLCardinality-0
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-1
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-15
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-2
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-3
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-4
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-5
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-6
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-7
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-8
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496347857139
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_HypercubeGrid-PT-C5K3P3B15: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_HypercubeGrid-PT-C5K3P3B15: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_HypercubeGrid-PT-C5K3P3B15 @ 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: 34263/65536 symbol table entries, 18076 collisions
lola: preprocessing...
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28593 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: A (F ((pil_d5_n1_3_2_1_3_4 <= po_d1_n1_3_1_1_2_2))) : A ((((pi_d4_n1_2_1_2_3_3 <= 0) AND (pb_d5_n1_3_1_3_1_1 <= 1)) U A (X ((1 <= pol_d3_n1_2_3_4_1_1))))) : E (X (E (((pol_d1_n1_4_2_2_1_3 <= pb_d2_n1_3_2_1_3_3) U (2 <= po_d5_n1_3_1_1_2_1))))) : (A (F ((((po_d2_n1_3_4_2_1_1 <= pol_d2_n1_1_2_2_1_1) OR (pil_d2_n1_1_2_3_1_1 <= po_d5_n1_1_1_1_2_1)) AND (pb_d2_n1_1_1_2_1_2 <= 0)))) OR ((((pb_d1_n1_2_2_1_2_1 <= 0) OR ((pb_d1_n1_1_1_2_2_2 <= pi_d3_n1_2_1_4_2_1) AND (pil_d2_n1_1_3_3_1_3 <= pb_d2_n2_2_1_3_3_3))) AND (((pil_d4_n1_3_2_1_3_3 <= pb_d3_n2_1_2_1_2_2) AND (1 <= po_d3_n1_3_3_1_3_2)) OR (pil_d1_n1_4_2_2_2_2 <= 2))) OR (pb_d1_n1_1_1_1_3_2 <= pol_d5_n1_3_1_2_2_2))) : (A (F (E (G ((2 <= pb_d2_n2_1_1_1_1_2))))) OR NOT(E (((pil_d1_n1_3_2_2_2_3 <= pb_d3_n2_1_3_3_2_3) U (1 <= po_d3_n1_3_3_2_3_1))))) : A (G (((po_d2_n1_2_3_2_3_2 <= pbl_2_2_2_2_2) OR ((pb_d5_n2_1_1_3_1_1 <= pi_d3_n1_3_2_1_3_2) AND ((po_d5_n1_1_1_1_2_1 <= pol_d3_n1_3_2_2_2_3) OR (pi_d5_n1_3_3_1_2_3 <= pi_d2_n1_3_2_1_3_2)))))) : E (G (E (F (((po_d3_n1_3_3_2_3_3 <= pil_d3_n1_1_2_3_2_2) OR (2 <= pol_d2_n1_1_2_1_3_1)))))) : ((NOT(A (G ((pi_d5_n1_2_1_3_1_2 <= po_d4_n1_3_3_2_2_2)))) AND ((pb_d3_n1_3_3_3_1_1 <= pi_d1_n1_3_1_1_2_3) OR (1 <= pb_d4_n2_3_1_2_2_3) OR (3 <= pi_d5_n1_2_2_2_1_3) OR (pil_d5_n1_2_1_3_2_4 <= pbl_3_3_1_3_2) OR (pi_d4_n1_1_2_3_3_1 <= 2) OR (pb_d4_n2_2_3_1_3_1 <= pi_d1_n1_2_3_1_1_2))) AND A (((po_d4_n1_1_1_2_1_1 <= 2) U ((pil_d2_n1_2_2_3_3_3 <= pb_d2_n1_3_1_1_3_1) AND (3 <= pi_d4_n1_1_3_2_1_3))))) : E (X ((((3 <= pol_d4_n1_1_2_2_2_3) AND (2 <= pol_d5_n1_1_3_3_3_1)) OR (2 <= pi_d4_n1_1_1_1_1_1) OR ((3 <= pi_d2_n1_1_3_3_1_2) AND (1 <= pil_d1_n1_2_2_1_1_1) AND (pb_d5_n1_3_2_2_1_3 <= pol_d4_n1_2_2_1_1_2) AND (3 <= pb_d2_n1_3_3_3_1_3))))) : A (X (NOT(A (X ((pbl_3_1_3_2_3 <= pb_d2_n1_1_3_1_1_1)))))) : A (G ((1 <= pbl_2_2_3_2_1))) : A (X (E (((1 <= pb_d1_n1_3_2_3_3_3) U (pil_d3_n1_2_2_2_3_2 <= pb_d2_n1_1_2_2_2_2))))) : (((A (F ((2 <= pi_d2_n1_2_3_2_1_1))) OR (((pb_d1_n2_3_3_2_2_1 <= pol_d3_n1_2_3_2_2_2) AND (2 <= pil_d2_n1_1_1_1_3_2)) OR (2 <= pil_d4_n1_2_3_1_1_2))) OR ((pb_d2_n1_3_3_1_2_1 <= 2) AND (pb_d4_n1_3_3_2_2_3 <= 0) AND (pb_d1_n1_3_2_2_2_2 <= pi_d5_n1_3_2_3_1_4))) AND NOT(A (((pol_d3_n1_3_1_1_2_2 <= pi_d5_n1_1_3_1_3_4) U (2 <= pol_d1_n1_3_1_2_2_3))))) : E (G (((pbl_3_3_1_3_3 <= pil_d1_n1_3_3_3_1_2) OR A (X ((3 <= pb_d1_n2_2_3_2_1_3)))))) : ((pol_d3_n1_3_3_1_2_3 <= pb_d4_n1_2_1_1_2_2) AND E (F ((((pi_d3_n1_3_2_1_1_3 <= po_d1_n1_2_1_3_1_3) OR (1 <= pi_d5_n1_3_2_2_3_3)) AND (2 <= pil_d5_n1_3_2_2_1_3))))) : (((3 <= po_d1_n1_4_1_2_3_1) AND (((pb_d2_n1_1_3_2_1_1 + 1 <= pol_d3_n1_2_2_2_1_3) AND (pol_d3_n1_3_3_2_1_3 + 1 <= pb_d3_n1_2_1_3_1_3)) OR (pol_d3_n1_3_3_2_1_2 <= po_d4_n1_2_2_2_1_3))) OR ((pol_d3_n1_1_2_3_3_2 <= pil_d1_n1_1_1_3_2_3) AND E (F ((pb_d4_n2_3_1_2_1_1 <= 0)))))
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 (F ((pil_d5_n1_3_2_1_3_4 <= po_d1_n1_3_1_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pil_d5_n1_3_2_1_3_4 <= po_d1_n1_3_1_1_2_2))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((pi_d4_n1_2_1_2_3_3 <= 0) AND (pb_d5_n1_3_1_3_1_1 <= 1)) U A (X ((1 <= pol_d3_n1_2_3_4_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((pi_d4_n1_2_1_2_3_3 <= 0) AND (pb_d5_n1_3_1_3_1_1 <= 1)) U AX((1 <= pol_d3_n1_2_3_4_1_1)))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((pol_d1_n1_4_2_2_1_3 <= pb_d2_n1_3_2_1_3_3) U (2 <= po_d5_n1_3_1_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((pol_d1_n1_4_2_2_1_3 <= pb_d2_n1_3_2_1_3_3) U (2 <= po_d5_n1_3_1_1_2_1)))
lola: processed formula length: 78
lola: 2 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 95197 markings, 159334 edges, 3111071724204982272 markings/sec, 0 secs
lola: 136279 markings, 319867 edges, 8216 markings/sec, 5 secs
lola: 176676 markings, 485233 edges, 8079 markings/sec, 10 secs
lola: 218610 markings, 656847 edges, 8387 markings/sec, 15 secs
lola: 259762 markings, 823251 edges, 8230 markings/sec, 20 secs
lola: 297126 markings, 976163 edges, 7473 markings/sec, 25 secs
lola: 335847 markings, 1134478 edges, 7744 markings/sec, 30 secs
lola: 375915 markings, 1297504 edges, 8014 markings/sec, 35 secs
lola: 409766 markings, 1443011 edges, 6770 markings/sec, 40 secs
lola: 444211 markings, 1581358 edges, 6889 markings/sec, 45 secs
lola: 476281 markings, 1714057 edges, 6414 markings/sec, 50 secs
lola: 510446 markings, 1853772 edges, 6833 markings/sec, 55 secs
lola: 540891 markings, 1983622 edges, 6089 markings/sec, 60 secs
lola: 577918 markings, 2134908 edges, 7405 markings/sec, 65 secs
lola: 612116 markings, 2279728 edges, 6840 markings/sec, 70 secs
lola: 640081 markings, 2402643 edges, 5593 markings/sec, 75 secs
lola: 669410 markings, 2523449 edges, 5866 markings/sec, 80 secs
lola: 701357 markings, 2666152 edges, 6389 markings/sec, 85 secs
lola: 735859 markings, 2808719 edges, 6900 markings/sec, 90 secs
lola: 769723 markings, 2956128 edges, 6773 markings/sec, 95 secs
lola: 799805 markings, 3083944 edges, 6016 markings/sec, 100 secs
lola: 829529 markings, 3212159 edges, 5945 markings/sec, 105 secs
lola: 854754 markings, 3326602 edges, 5045 markings/sec, 110 secs
lola: 885187 markings, 3456720 edges, 6087 markings/sec, 115 secs
lola: 913268 markings, 3580319 edges, 5616 markings/sec, 120 secs
lola: 942851 markings, 3703653 edges, 5917 markings/sec, 125 secs
lola: 972980 markings, 3819014 edges, 6026 markings/sec, 130 secs
lola: 996605 markings, 3917394 edges, 4725 markings/sec, 135 secs
lola: 1027931 markings, 4033300 edges, 6265 markings/sec, 140 secs
lola: 1056267 markings, 4140639 edges, 5667 markings/sec, 145 secs
lola: 1087250 markings, 4261724 edges, 6197 markings/sec, 150 secs
lola: 1115388 markings, 4391978 edges, 5628 markings/sec, 155 secs
lola: 1141045 markings, 4497792 edges, 5131 markings/sec, 160 secs
lola: 1176873 markings, 4604765 edges, 7166 markings/sec, 165 secs
lola: 1202810 markings, 4721650 edges, 5187 markings/sec, 170 secs
lola: 1236010 markings, 4824600 edges, 6640 markings/sec, 175 secs
lola: 1264933 markings, 4913008 edges, 5785 markings/sec, 180 secs
lola: 1286308 markings, 4997386 edges, 4275 markings/sec, 185 secs
lola: 1321300 markings, 5085942 edges, 6998 markings/sec, 190 secs
lola: 1351380 markings, 5186977 edges, 6016 markings/sec, 195 secs
lola: 1384839 markings, 5276575 edges, 6692 markings/sec, 200 secs
lola: 1416814 markings, 5367111 edges, 6395 markings/sec, 205 secs
lola: 1445320 markings, 5447210 edges, 5701 markings/sec, 210 secs
lola: 1477186 markings, 5533872 edges, 6373 markings/sec, 215 secs
lola: 1507058 markings, 5619296 edges, 5974 markings/sec, 220 secs
lola: 1540218 markings, 5699603 edges, 6632 markings/sec, 225 secs
lola: 1568935 markings, 5773743 edges, 5743 markings/sec, 230 secs
lola: 1598973 markings, 5854222 edges, 6008 markings/sec, 235 secs
lola: 1630598 markings, 5934474 edges, 6325 markings/sec, 240 secs
lola: 1662446 markings, 6014568 edges, 6370 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((((po_d2_n1_3_4_2_1_1 <= pol_d2_n1_1_2_2_1_1) OR (pil_d2_n1_1_2_3_1_1 <= po_d5_n1_1_1_1_2_1)) AND (pb_d2_n1_1_1_2_1_2 <= 0)))) OR ((((pb_d1_n1_2_2_1_2_1 <= 0) OR ((pb_d1_n1_1_1_2_2_2 <= pi_d3_n1_2_1_4_2_1) AND (pil_d2_n1_1_3_3_1_3 <= pb_d2_n2_2_1_3_3_3))) AND (((pil_d4_n1_3_2_1_3_3 <= pb_d3_n2_1_2_1_2_2) AND (1 <= po_d3_n1_3_3_1_3_2)) OR (pil_d1_n1_4_2_2_2_2 <= 2))) OR (pb_d1_n1_1_1_1_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((po_d2_n1_3_4_2_1_1 <= pol_d2_n1_1_2_2_1_1) OR (pil_d2_n1_1_2_3_1_1 <= po_d5_n1_1_1_1_2_1)) AND (pb_d2_n1_1_1_2_1_2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((po_d2_n1_3_4_2_1_1 <= pol_d2_n1_1_2_2_1_1) OR (pil_d2_n1_1_2_3_1_1 <= po_d5_n1_1_1_1_2_1)) AND (pb_d2_n1_1_1_2_1_2 <= 0)))
lola: processed formula length: 135
lola: 1 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((pb_d1_n1_2_2_1_2_1 <= 0) OR ((pb_d1_n1_1_1_2_2_2 <= pi_d3_n1_2_1_4_2_1) AND (pil_d2_n1_1_3_3_1_3 <= pb_d2_n2_2_1_3_3_3))) AND (((pil_d4_n1_3_2_1_3_3 <= pb_d3_n2_1_2_1_2_2) AND (1 <= po_d3_n1_3_3_1_3_2)) OR (pil_d1_n1_4_2_2_2_2 <= 2))) OR (pb_d1_n1_1_1_1_3_2 <= pol_d5_n1_3_1_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((pb_d1_n1_2_2_1_2_1 <= 0) OR ((pb_d1_n1_1_1_2_2_2 <= pi_d3_n1_2_1_4_2_1) AND (pil_d2_n1_1_3_3_1_3 <= pb_d2_n2_2_1_3_3_3))) AND (((pil_d4_n1_3_2_1_3_3 <= pb_d3_n2_1_2_1_2_2) AND (1 <= po_d3_n1_3_3_1_3_2)) OR (pil_d1_n1_4_2_2_2_2 <= 2))) OR (pb_d1_n1_1_1_1_3_2 <= pol_d5_n1_3_1_2_2_2))
lola: processed formula length: 289
lola: 0 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: processed formula with 7 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((2 <= pb_d2_n2_1_1_1_1_2))))) OR NOT(E (((pil_d1_n1_3_2_2_2_3 <= pb_d3_n2_1_3_3_2_3) U (1 <= po_d3_n1_3_3_2_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((2 <= pb_d2_n2_1_1_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pb_d2_n2_1_1_1_1_2 <= 1))))
lola: processed formula length: 50
lola: 7 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d2_n1_2_3_2_3_2 <= pbl_2_2_2_2_2) OR ((pb_d5_n2_1_1_3_1_1 <= pi_d3_n1_3_2_1_3_2) AND ((po_d5_n1_1_1_1_2_1 <= pol_d3_n1_3_2_2_2_3) OR (pi_d5_n1_3_3_1_2_3 <= pi_d2_n1_3_2_1_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: ========================================
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((po_d3_n1_3_3_2_3_3 <= pil_d3_n1_1_2_3_2_2) OR (2 <= pol_d2_n1_1_2_1_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((po_d3_n1_3_3_2_3_3 <= pil_d3_n1_1_2_3_2_2) OR (2 <= pol_d2_n1_1_2_1_3_1))))))
lola: processed formula length: 106
lola: 2 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (G ((pi_d5_n1_2_1_3_1_2 <= po_d4_n1_3_3_2_2_2)))) AND ((pb_d3_n1_3_3_3_1_1 <= pi_d1_n1_3_1_1_2_3) OR (1 <= pb_d4_n2_3_1_2_2_3) OR (3 <= pi_d5_n1_2_2_2_1_3) OR (pil_d5_n1_2_1_3_2_4 <= pbl_3_3_1_3_2) OR (pi_d4_n1_1_2_3_3_1 <= 2) OR (pb_d4_n2_2_3_1_3_1 <= pi_d1_n1_2_3_1_1_2))) AND A (((po_d4_n1_1_1_2_1_1 <= 2) U ((pil_d2_n1_2_2_3_3_3 <= pb_d2_n1_3_1_1_3_1) AND (3 <= pi_d4_n1_1_3_2_1_3)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((po_d4_n1_3_3_2_2_2 + 1 <= pi_d5_n1_2_1_3_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb_d3_n1_3_3_3_1_1 <= pi_d1_n1_3_1_1_2_3) OR (1 <= pb_d4_n2_3_1_2_2_3) OR (3 <= pi_d5_n1_2_2_2_1_3) OR (pil_d5_n1_2_1_3_2_4 <= pbl_3_3_1_3_2) OR (pi_d4_n1_1_2_3_3_1 <= 2) OR (pb_d4_n2_2_3_1_3_1 <= pi_d1_n1_2_3_1_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb_d3_n1_3_3_3_1_1 <= pi_d1_n1_3_1_1_2_3) OR (1 <= pb_d4_n2_3_1_2_2_3) OR (3 <= pi_d5_n1_2_2_2_1_3) OR (pil_d5_n1_2_1_3_2_4 <= pbl_3_3_1_3_2) OR (pi_d4_n1_1_2_3_3_1 <= 2) OR (pb_d4_n2_2_3_1_3_1 <= pi_d1_n1_2_3_1_1_2))
lola: processed formula length: 224
lola: 4 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: processed formula with 6 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 9 will run for 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((po_d4_n1_1_1_2_1_1 <= 2) U ((pil_d2_n1_2_2_3_3_3 <= pb_d2_n1_3_1_1_3_1) AND (3 <= pi_d4_n1_1_3_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((po_d4_n1_1_1_2_1_1 <= 2) U ((pil_d2_n1_2_2_3_3_3 <= pb_d2_n1_3_1_1_3_1) AND (3 <= pi_d4_n1_1_3_2_1_3)))
lola: processed formula length: 106
lola: 5 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((3 <= pol_d4_n1_1_2_2_2_3) AND (2 <= pol_d5_n1_1_3_3_3_1)) OR (2 <= pi_d4_n1_1_1_1_1_1) OR ((3 <= pi_d2_n1_1_3_3_1_2) AND (1 <= pil_d1_n1_2_2_1_1_1) AND (pb_d5_n1_3_2_2_1_3 <= pol_d4_n1_2_2_1_1_2) AND (3 <= pb_d2_n1_3_3_3_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((3 <= pol_d4_n1_1_2_2_2_3) AND (2 <= pol_d5_n1_1_3_3_3_1)) OR (2 <= pi_d4_n1_1_1_1_1_1) OR ((3 <= pi_d2_n1_1_3_3_1_2) AND (1 <= pil_d1_n1_2_2_1_1_1) AND (pb_d5_n1_3_2_2_1_3 <= pol_d4_n1_2_2_1_1_2) AND (3 <= pb_d2_n1_3_3_3_1_3))))
lola: processed formula length: 236
lola: 1 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (X ((pbl_3_1_3_2_3 <= pb_d2_n1_1_3_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((pb_d2_n1_1_3_1_1_1 + 1 <= pbl_3_1_3_2_3)))
lola: processed formula length: 49
lola: 5 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pbl_2_2_3_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (((1 <= pb_d1_n1_3_2_3_3_3) U (pil_d3_n1_2_2_2_3_2 <= pb_d2_n1_1_2_2_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((1 <= pb_d1_n1_3_2_3_3_3) U (pil_d3_n1_2_2_2_3_2 <= pb_d2_n1_1_2_2_2_2)))
lola: processed formula length: 78
lola: 2 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 819 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F ((2 <= pi_d2_n1_2_3_2_1_1))) OR (((pb_d1_n2_3_3_2_2_1 <= pol_d3_n1_2_3_2_2_2) AND (2 <= pil_d2_n1_1_1_1_3_2)) OR (2 <= pil_d4_n1_2_3_1_1_2))) OR ((pb_d2_n1_3_3_1_2_1 <= 2) AND (pb_d4_n1_3_3_2_2_3 <= 0) AND (pb_d1_n1_3_2_2_2_2 <= pi_d5_n1_3_2_3_1_4))) AND NOT(A (((pol_d3_n1_3_1_1_2_2 <= pi_d5_n1_1_3_1_3_4) U (2 <= pol_d1_n1_3_1_2_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 819 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= pi_d2_n1_2_3_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= pi_d2_n1_2_3_2_1_1))
lola: processed formula length: 35
lola: 6 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1091 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((pb_d1_n2_3_3_2_2_1 <= pol_d3_n1_2_3_2_2_2) AND (2 <= pil_d2_n1_1_1_1_3_2)) OR (2 <= pil_d4_n1_2_3_1_1_2)) OR ((pb_d2_n1_3_3_1_2_1 <= 2) AND (pb_d4_n1_3_3_2_2_3 <= 0) AND (pb_d1_n1_3_2_2_2_2 <= pi_d5_n1_3_2_3_1_4)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((pb_d1_n2_3_3_2_2_1 <= pol_d3_n1_2_3_2_2_2) AND (2 <= pil_d2_n1_1_1_1_3_2)) OR (2 <= pil_d4_n1_2_3_1_1_2)) OR ((pb_d2_n1_3_3_1_2_1 <= 2) AND (pb_d4_n1_3_3_2_2_3 <= 0) AND (pb_d1_n1_3_2_2_2_2 <= pi_d5_n1_3_2_3_1_4)))
lola: processed formula length: 219
lola: 6 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: processed formula with 6 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1091 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((pbl_3_3_1_3_3 <= pil_d1_n1_3_3_3_1_2) OR A (X ((3 <= pb_d1_n2_2_3_2_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pil_d1_n1_3_3_3_1_2 + 1 <= pbl_3_3_1_3_3) AND NOT(AX((3 <= pb_d1_n2_2_3_2_1_3))))))
lola: processed formula length: 98
lola: 4 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pol_d3_n1_3_3_1_2_3 <= pb_d4_n1_2_1_1_2_2) AND E (F ((((pi_d3_n1_3_2_1_1_3 <= po_d1_n1_2_1_3_1_3) OR (1 <= pi_d5_n1_3_2_2_3_3)) AND (2 <= pil_d5_n1_3_2_2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pol_d3_n1_3_3_1_2_3 <= pb_d4_n1_2_1_1_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol_d3_n1_3_3_1_2_3 <= pb_d4_n1_2_1_1_2_2)
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.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 15 will run for 3275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pi_d3_n1_3_2_1_1_3 <= po_d1_n1_2_1_3_1_3) OR (1 <= pi_d5_n1_3_2_2_3_3)) AND (2 <= pil_d5_n1_3_2_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-CTLCardinality-15.sara.
lola: sara is running 0 secs || 70703 markings, 71608 edges, 14141 markings/sec, 0 secs
lola: sara is running 5 secs || 129496 markings, 131671 edges, 11759 markings/sec, 5 secs
lola: sara is running 10 secs || 186909 markings, 190267 edges, 11483 markings/sec, 10 secs
lola: sara is running 15 secs || 245135 markings, 249860 edges, 11645 markings/sec, 15 secs
lola: sara is running 20 secs || 302649 markings, 308543 edges, 11503 markings/sec, 20 secs
lola: sara is running 25 secs || 361656 markings, 368690 edges, 11801 markings/sec, 25 secs
lola: sara is running 30 secs || 419370 markings, 427529 edges, 11543 markings/sec, 30 secs
lola: sara is running 35 secs || 477771 markings, 487067 edges, 11680 markings/sec, 35 secs
lola: sara is running 40 secs || 536451 markings, 546862 edges, 11736 markings/sec, 40 secs
lola: sara is running 45 secs || 594056 markings, 605558 edges, 11521 markings/sec, 45 secs
lola: sara is running 50 secs || 652803 markings, 665452 edges, 11749 markings/sec, 50 secs
lola: sara is running 55 secs || 711029 markings, 724811 edges, 11645 markings/sec, 55 secs
lola: sara is running 60 secs || 768823 markings, 783730 edges, 11559 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 827583 markings, 843568 edges, 11752 markings/sec, 65 secs
lola: sara is running 70 secs || 884901 markings, 902012 edges, 11464 markings/sec, 70 secs
lola: sara is running 75 secs || 943187 markings, 961432 edges, 11657 markings/sec, 75 secs
lola: sara is running 80 secs || 1001307 markings, 1020686 edges, 11624 markings/sec, 80 secs
lola: sara is running 85 secs || 1058758 markings, 1079208 edges, 11490 markings/sec, 85 secs
lola: sara is running 90 secs || 1117556 markings, 1139139 edges, 11760 markings/sec, 90 secs
lola: sara is running 95 secs || 1174894 markings, 1197594 edges, 11468 markings/sec, 95 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3174 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= po_d1_n1_4_1_2_3_1) AND (((pb_d2_n1_1_3_2_1_1 + 1 <= pol_d3_n1_2_2_2_1_3) AND (pol_d3_n1_3_3_2_1_3 + 1 <= pb_d3_n1_2_1_3_1_3)) OR (pol_d3_n1_3_3_2_1_2 <= po_d4_n1_2_2_2_1_3))) OR ((pol_d3_n1_1_2_3_3_2 <= pil_d1_n1_1_1_3_2_3) AND E (F ((pb_d4_n2_3_1_2_1_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3174 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= po_d1_n1_4_1_2_3_1) AND (((pb_d2_n1_1_3_2_1_1 + 1 <= pol_d3_n1_2_2_2_1_3) AND (pol_d3_n1_3_3_2_1_3 + 1 <= pb_d3_n1_2_1_3_1_3)) OR (pol_d3_n1_3_3_2_1_2 <= po_d4_n1_2_2_2_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= po_d1_n1_4_1_2_3_1) AND (((pb_d2_n1_1_3_2_1_1 + 1 <= pol_d3_n1_2_2_2_1_3) AND (pol_d3_n1_3_3_2_1_3 + 1 <= pb_d3_n1_2_1_3_1_3)) OR (pol_d3_n1_3_3_2_1_2 <= po_d4_n1_2_2_2_1_3)))
lola: processed formula length: 183
lola: 0 rewrites
lola: formula mentions 0 of 9153 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-CTLCardinality.task
lola: processed formula with 4 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d4_n2_3_1_2_1_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-CTLCardinality-17.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no yes no yes no no yes no yes no no no unknown
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496348223767
--------------------
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_HypercubeGrid-PT-C5K3P3B15"
export BK_EXAMINATION="CTLCardinality"
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_HypercubeGrid-PT-C5K3P3B15.tgz
mv S_HypercubeGrid-PT-C5K3P3B15 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_HypercubeGrid-PT-C5K3P3B15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441649700021"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
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 ;