About the Execution of LoLA for HypercubeGrid-PT-C5K3P3B15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12460.870 | 370095.00 | 475718.00 | 50.10 | 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 HypercubeGrid-PT-C5K3P3B15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500021
=====================================================================
--------------------
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 1494615205443
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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: 95130 markings, 158013 edges, 2822845471221874688 markings/sec, 0 secs
lola: 132672 markings, 306281 edges, 7508 markings/sec, 5 secs
lola: 169558 markings, 459964 edges, 7377 markings/sec, 10 secs
lola: 207865 markings, 616712 edges, 7661 markings/sec, 15 secs
lola: 245454 markings, 765391 edges, 7518 markings/sec, 20 secs
lola: 282818 markings, 916999 edges, 7473 markings/sec, 25 secs
lola: 318932 markings, 1063529 edges, 7223 markings/sec, 30 secs
lola: 353552 markings, 1201391 edges, 6924 markings/sec, 35 secs
lola: 385568 markings, 1335908 edges, 6403 markings/sec, 40 secs
lola: 417321 markings, 1466960 edges, 6351 markings/sec, 45 secs
lola: 452279 markings, 1609756 edges, 6992 markings/sec, 50 secs
lola: 481896 markings, 1735832 edges, 5923 markings/sec, 55 secs
lola: 513062 markings, 1866577 edges, 6233 markings/sec, 60 secs
lola: 543860 markings, 1995189 edges, 6160 markings/sec, 65 secs
lola: 579463 markings, 2142148 edges, 7121 markings/sec, 70 secs
lola: 613510 markings, 2281843 edges, 6809 markings/sec, 75 secs
lola: 640081 markings, 2402572 edges, 5314 markings/sec, 80 secs
lola: 665680 markings, 2510533 edges, 5120 markings/sec, 85 secs
lola: 696270 markings, 2643746 edges, 6118 markings/sec, 90 secs
lola: 728548 markings, 2778983 edges, 6456 markings/sec, 95 secs
lola: 760848 markings, 2916461 edges, 6460 markings/sec, 100 secs
lola: 789763 markings, 3040847 edges, 5783 markings/sec, 105 secs
lola: 817336 markings, 3159552 edges, 5515 markings/sec, 110 secs
lola: 842176 markings, 3267513 edges, 4968 markings/sec, 115 secs
lola: 867120 markings, 3380814 edges, 4989 markings/sec, 120 secs
lola: 893437 markings, 3498665 edges, 5263 markings/sec, 125 secs
lola: 923156 markings, 3620187 edges, 5944 markings/sec, 130 secs
lola: 948043 markings, 3725855 edges, 4977 markings/sec, 135 secs
lola: 976503 markings, 3834649 edges, 5692 markings/sec, 140 secs
lola: 1004249 markings, 3947191 edges, 5549 markings/sec, 145 secs
lola: 1030656 markings, 4046185 edges, 5281 markings/sec, 150 secs
lola: 1056495 markings, 4145486 edges, 5168 markings/sec, 155 secs
lola: 1085289 markings, 4257180 edges, 5759 markings/sec, 160 secs
lola: 1111638 markings, 4375990 edges, 5270 markings/sec, 165 secs
lola: 1136269 markings, 4475038 edges, 4926 markings/sec, 170 secs
lola: 1170606 markings, 4581173 edges, 6867 markings/sec, 175 secs
lola: 1196639 markings, 4688908 edges, 5207 markings/sec, 180 secs
lola: 1227247 markings, 4788813 edges, 6122 markings/sec, 185 secs
lola: 1255774 markings, 4877639 edges, 5705 markings/sec, 190 secs
lola: 1277096 markings, 4964832 edges, 4264 markings/sec, 195 secs
lola: 1302345 markings, 5044348 edges, 5050 markings/sec, 200 secs
lola: 1333364 markings, 5128907 edges, 6204 markings/sec, 205 secs
lola: 1363547 markings, 5221899 edges, 6037 markings/sec, 210 secs
lola: 1395834 markings, 5308521 edges, 6457 markings/sec, 215 secs
lola: 1424054 markings, 5387902 edges, 5644 markings/sec, 220 secs
lola: 1454165 markings, 5471563 edges, 6022 markings/sec, 225 secs
lola: 1482913 markings, 5553521 edges, 5750 markings/sec, 230 secs
lola: 1512214 markings, 5631978 edges, 5860 markings/sec, 235 secs
lola: 1543839 markings, 5707719 edges, 6325 markings/sec, 240 secs
lola: 1573434 markings, 5786374 edges, 5919 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: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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: 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: ========================================
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: 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: ========================================
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 3274 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 || 71742 markings, 72670 edges, 14348 markings/sec, 0 secs
lola: sara is running 5 secs || 131934 markings, 134151 edges, 12038 markings/sec, 5 secs
lola: sara is running 10 secs || 191015 markings, 194466 edges, 11816 markings/sec, 10 secs
lola: sara is running 15 secs || 249623 markings, 254457 edges, 11722 markings/sec, 15 secs
lola: sara is running 20 secs || 307356 markings, 313321 edges, 11547 markings/sec, 20 secs
lola: sara is running 25 secs || 366699 markings, 373838 edges, 11869 markings/sec, 25 secs
lola: sara is running 30 secs || 425030 markings, 433305 edges, 11666 markings/sec, 30 secs
lola: sara is running 35 secs || 483519 markings, 492936 edges, 11698 markings/sec, 35 secs
lola: sara is running 40 secs || 542812 markings, 553309 edges, 11859 markings/sec, 40 secs
lola: sara is running 45 secs || 600649 markings, 612287 edges, 11567 markings/sec, 45 secs
lola: sara is running 50 secs || 659360 markings, 672142 edges, 11742 markings/sec, 50 secs
lola: sara is running 55 secs || 718155 markings, 732083 edges, 11759 markings/sec, 55 secs
lola: sara is running 60 secs || 775899 markings, 790899 edges, 11549 markings/sec, 60 secs
lola: sara is running 65 secs || 834968 markings, 851112 edges, 11814 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 892916 markings, 910191 edges, 11590 markings/sec, 70 secs
lola: sara is running 75 secs || 951059 markings, 969467 edges, 11629 markings/sec, 75 secs
lola: sara is running 80 secs || 1009757 markings, 1029275 edges, 11740 markings/sec, 80 secs
lola: sara is running 85 secs || 1067185 markings, 1087794 edges, 11486 markings/sec, 85 secs
lola: sara is running 90 secs || 1126116 markings, 1147875 edges, 11786 markings/sec, 90 secs
lola: sara is running 95 secs || 1184060 markings, 1206947 edges, 11589 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 3170 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 3170 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: SUBRESULT
lola: result: unknown
lola: ========================================
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 1494615575538
--------------------
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="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/HypercubeGrid-PT-C5K3P3B15.tgz
mv 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 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 r038-blw7-149440484500021"
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 ;