About the Execution of LoLA for NeighborGrid-PT-d3n3m1t11
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15134.200 | 1151150.00 | 1142598.00 | 2430.30 | TTTTTTTFTTTF?T?? | 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 NeighborGrid-PT-d3n3m1t11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172200021
=====================================================================
--------------------
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 NeighborGrid-PT-d3n3m1t11-CTLCardinality-0
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-1
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-15
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-2
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-3
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-4
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-5
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-6
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-7
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-8
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496294530967
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
NeighborGrid-PT-d3n3m1t11: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
NeighborGrid-PT-d3n3m1t11: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ NeighborGrid-PT-d3n3m1t11 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 189/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 27 places, 162 transitions, 26 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 27 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: (E (F (A (X ((p_1_2_2 <= p_2_1_2))))) OR (3 <= p_0_2_0)) : E (F (A (X (((3 <= p_1_0_1) OR (p_2_0_0 <= p_0_1_1)))))) : (A (X (E (F ((p_0_0_1 <= p_0_0_2))))) AND NOT(A (F (((2 <= p_2_2_0) OR (2 <= p_1_2_0)))))) : E (F (A (((p_2_1_2 <= p_0_2_0) U (3 <= p_0_0_1))))) : E (F (E (G ((2 <= p_1_2_1))))) : A (X (A (F ((p_1_0_0 <= 1))))) : E ((E (F ((2 <= p_1_1_0))) U A (G ((1 <= p_0_0_1))))) : E (F (A (X ((p_2_2_0 <= 0))))) : A (G (E (F (((2 <= p_2_0_2) OR (p_2_2_1 <= p_2_0_0)))))) : E (F (A (G ((p_0_1_2 <= 0))))) : A (X (E (F (((1 <= p_1_2_0) AND (p_2_1_0 <= p_0_0_0)))))) : E (F (((p_0_2_2 <= p_0_0_1) AND (3 <= p_1_2_0) AND (p_0_0_2 + 1 <= p_2_1_0) AND (p_0_2_1 <= p_0_0_1)))) : (A (X (E (F ((1 <= p_2_2_1))))) OR NOT(E (X ((p_2_2_2 + 1 <= p_0_2_1))))) : A (X (E (F (((p_0_1_0 <= p_0_0_2) AND (1 <= p_2_2_0)))))) : (((p_1_1_1 + 1 <= p_1_1_0) OR (((p_1_0_2 + 1 <= p_1_0_1) OR (p_0_0_0 <= 0)) AND ((p_0_2_1 + 1 <= p_1_2_2) OR (p_1_2_0 <= 2)))) OR A (G (E (F (TRUE))))) : A (G ((1 <= p_1_1_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p_1_2_2 <= p_2_1_2))))) OR (3 <= p_0_2_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p_1_2_2 <= p_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_1_2_2 <= p_2_1_2)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((3 <= p_1_0_1) OR (p_2_0_0 <= p_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((3 <= p_1_0_1) OR (p_2_0_0 <= p_0_1_1))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: (A (X (E (F ((p_0_0_1 <= p_0_0_2))))) AND NOT(A (F (((2 <= p_2_2_0) OR (2 <= p_1_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p_0_0_1 <= p_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p_0_0_1 <= p_0_0_2)))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_2_0 <= 1) AND (p_1_2_0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p_2_2_0) OR (2 <= p_1_2_0))))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((p_2_1_2 <= p_0_2_0) U (3 <= p_0_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((p_2_1_2 <= p_0_2_0) U (3 <= p_0_0_1)))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p_1_2_1 <= 1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((p_1_0_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (p_1_0_0 <= 1)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= p_1_1_0))) U A (G ((1 <= p_0_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (2 <= p_1_1_0)) U NOT(E(TRUE U (p_0_0_1 <= 0))))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 550401 markings, 3350343 edges, 3109001618687787008 markings/sec, 0 secs
lola: 1114694 markings, 6828944 edges, 112859 markings/sec, 5 secs
lola: 1636187 markings, 10100138 edges, 104299 markings/sec, 10 secs
lola: 2139274 markings, 13290576 edges, 100617 markings/sec, 15 secs
lola: 2613883 markings, 16364272 edges, 94922 markings/sec, 20 secs
lola: 3093869 markings, 19443333 edges, 95997 markings/sec, 25 secs
lola: 3562802 markings, 22485307 edges, 93787 markings/sec, 30 secs
lola: 4071745 markings, 25668569 edges, 101789 markings/sec, 35 secs
lola: 4594549 markings, 28918423 edges, 104561 markings/sec, 40 secs
lola: 5047373 markings, 31884980 edges, 90565 markings/sec, 45 secs
lola: 5504197 markings, 34873812 edges, 91365 markings/sec, 50 secs
lola: 5991022 markings, 37977071 edges, 97365 markings/sec, 55 secs
lola: 6442624 markings, 40928203 edges, 90320 markings/sec, 60 secs
lola: 6893424 markings, 43879901 edges, 90160 markings/sec, 65 secs
lola: 7340350 markings, 46813801 edges, 89385 markings/sec, 70 secs
lola: 7805202 markings, 49826372 edges, 92970 markings/sec, 75 secs
lola: 8233639 markings, 52666188 edges, 85687 markings/sec, 80 secs
lola: 8666628 markings, 55531327 edges, 86598 markings/sec, 85 secs
lola: 9118845 markings, 58484809 edges, 90443 markings/sec, 90 secs
lola: 9539061 markings, 61287400 edges, 84043 markings/sec, 95 secs
lola: 9977673 markings, 64187748 edges, 87722 markings/sec, 100 secs
lola: 10418302 markings, 67081472 edges, 88126 markings/sec, 105 secs
lola: 10859339 markings, 69977154 edges, 88207 markings/sec, 110 secs
lola: 11295363 markings, 72854738 edges, 87205 markings/sec, 115 secs
lola: 11738604 markings, 75759417 edges, 88648 markings/sec, 120 secs
lola: 12157597 markings, 78567165 edges, 83799 markings/sec, 125 secs
lola: 12567895 markings, 81326421 edges, 82060 markings/sec, 130 secs
lola: 13015668 markings, 84252480 edges, 89555 markings/sec, 135 secs
lola: 13423638 markings, 87003079 edges, 81594 markings/sec, 140 secs
lola: 13839743 markings, 89791722 edges, 83221 markings/sec, 145 secs
lola: 14254234 markings, 92568148 edges, 82898 markings/sec, 150 secs
lola: 14664112 markings, 95331621 edges, 81976 markings/sec, 155 secs
lola: 15079011 markings, 98119499 edges, 82980 markings/sec, 160 secs
lola: 15514211 markings, 100993963 edges, 87040 markings/sec, 165 secs
lola: 15941113 markings, 103820057 edges, 85380 markings/sec, 170 secs
lola: 16344738 markings, 106527483 edges, 80725 markings/sec, 175 secs
lola: 16768990 markings, 109328307 edges, 84850 markings/sec, 180 secs
lola: 17206353 markings, 112221277 edges, 87473 markings/sec, 185 secs
lola: 17605552 markings, 114904438 edges, 79840 markings/sec, 190 secs
lola: 18044535 markings, 117786744 edges, 87797 markings/sec, 195 secs
lola: 18439266 markings, 120468424 edges, 78946 markings/sec, 200 secs
lola: 18848653 markings, 123213008 edges, 81877 markings/sec, 205 secs
lola: 19238297 markings, 125861497 edges, 77929 markings/sec, 210 secs
lola: 19654766 markings, 128651781 edges, 83294 markings/sec, 215 secs
lola: 20075805 markings, 131461533 edges, 84208 markings/sec, 220 secs
lola: 20492660 markings, 134257117 edges, 83371 markings/sec, 225 secs
lola: 20908961 markings, 137055460 edges, 83260 markings/sec, 230 secs
lola: 21327256 markings, 139862817 edges, 83659 markings/sec, 235 secs
lola: 21742383 markings, 142656241 edges, 83025 markings/sec, 240 secs
lola: 22164413 markings, 145465639 edges, 84406 markings/sec, 245 secs
lola: 22601527 markings, 148322028 edges, 87423 markings/sec, 250 secs
lola: 23013732 markings, 151061844 edges, 82441 markings/sec, 255 secs
lola: 23402089 markings, 153701562 edges, 77671 markings/sec, 260 secs
lola: 23786653 markings, 156315533 edges, 76913 markings/sec, 265 secs
lola: 24170924 markings, 158937932 edges, 76854 markings/sec, 270 secs
lola: 24562068 markings, 161597751 edges, 78229 markings/sec, 275 secs
lola: 24951637 markings, 164253687 edges, 77914 markings/sec, 280 secs
lola: 25302186 markings, 166651972 edges, 70110 markings/sec, 285 secs
lola: 25657955 markings, 169027278 edges, 71154 markings/sec, 290 secs
lola: 25980275 markings, 171251307 edges, 64464 markings/sec, 295 secs
lola: 26371885 markings, 173761371 edges, 78322 markings/sec, 300 secs
lola: 26703585 markings, 176040303 edges, 66340 markings/sec, 305 secs
lola: 27048134 markings, 178370889 edges, 68910 markings/sec, 310 secs
lola: 27407720 markings, 180756173 edges, 71917 markings/sec, 315 secs
lola: 27754498 markings, 183092995 edges, 69356 markings/sec, 320 secs
lola: 28093620 markings, 185392557 edges, 67824 markings/sec, 325 secs
lola: 28419764 markings, 187633931 edges, 65229 markings/sec, 330 secs
lola: 28750729 markings, 189890104 edges, 66193 markings/sec, 335 secs
lola: 29100879 markings, 192240348 edges, 70030 markings/sec, 340 secs
lola: 29430967 markings, 194483528 edges, 66018 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p_2_2_0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_2_2_0 <= 0)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= p_2_0_2) OR (p_2_2_1 <= p_2_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((2 <= p_2_0_2) OR (p_2_2_1 <= p_2_0_0))))))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 1008517 markings, 3952149 edges, 2992223313335418880 markings/sec, 0 secs
lola: 1829206 markings, 7379650 edges, 164138 markings/sec, 5 secs
lola: 2574068 markings, 10565070 edges, 148972 markings/sec, 10 secs
lola: 3290857 markings, 13652727 edges, 143358 markings/sec, 15 secs
lola: 4036652 markings, 16806987 edges, 149159 markings/sec, 20 secs
lola: 4799884 markings, 20010795 edges, 152646 markings/sec, 25 secs
lola: 5469757 markings, 22954377 edges, 133975 markings/sec, 30 secs
lola: 6167797 markings, 25979375 edges, 139608 markings/sec, 35 secs
lola: 6812287 markings, 28829577 edges, 128898 markings/sec, 40 secs
lola: 7499385 markings, 31821238 edges, 137420 markings/sec, 45 secs
lola: 8118322 markings, 34601344 edges, 123787 markings/sec, 50 secs
lola: 8744115 markings, 37392718 edges, 125159 markings/sec, 55 secs
lola: 9378680 markings, 40218548 edges, 126913 markings/sec, 60 secs
lola: 10000497 markings, 43025724 edges, 124363 markings/sec, 65 secs
lola: 10666549 markings, 45945401 edges, 133210 markings/sec, 70 secs
lola: 11296555 markings, 48747690 edges, 126001 markings/sec, 75 secs
lola: 11935351 markings, 51589453 edges, 127759 markings/sec, 80 secs
lola: 12525572 markings, 54283619 edges, 118044 markings/sec, 85 secs
lola: 13159508 markings, 57117219 edges, 126787 markings/sec, 90 secs
lola: 13754550 markings, 59836611 edges, 119008 markings/sec, 95 secs
lola: 14340303 markings, 62522164 edges, 117151 markings/sec, 100 secs
lola: 14937647 markings, 65235252 edges, 119469 markings/sec, 105 secs
lola: 15570613 markings, 68076234 edges, 126593 markings/sec, 110 secs
lola: 16182380 markings, 70845600 edges, 122353 markings/sec, 115 secs
lola: 16785611 markings, 73576714 edges, 120646 markings/sec, 120 secs
lola: 17390704 markings, 76307222 edges, 121019 markings/sec, 125 secs
lola: 18009693 markings, 79084290 edges, 123798 markings/sec, 130 secs
lola: 18595149 markings, 81754032 edges, 117091 markings/sec, 135 secs
lola: 19133092 markings, 84267476 edges, 107589 markings/sec, 140 secs
lola: 19717811 markings, 86944882 edges, 116944 markings/sec, 145 secs
lola: 20315445 markings, 89652623 edges, 119527 markings/sec, 150 secs
lola: 20891623 markings, 92307257 edges, 115236 markings/sec, 155 secs
lola: 21475365 markings, 94974709 edges, 116748 markings/sec, 160 secs
lola: 22053190 markings, 97625186 edges, 115565 markings/sec, 165 secs
lola: 22678857 markings, 100408072 edges, 125133 markings/sec, 170 secs
lola: 23254328 markings, 103055397 edges, 115094 markings/sec, 175 secs
lola: 23792911 markings, 105572617 edges, 107717 markings/sec, 180 secs
lola: 24352268 markings, 108162431 edges, 111871 markings/sec, 185 secs
lola: 24881125 markings, 110664561 edges, 105771 markings/sec, 190 secs
lola: 25443725 markings, 113269058 edges, 112520 markings/sec, 195 secs
lola: 25981787 markings, 115782967 edges, 107612 markings/sec, 200 secs
lola: 26607029 markings, 118554310 edges, 125048 markings/sec, 205 secs
lola: 27164517 markings, 121137437 edges, 111498 markings/sec, 210 secs
lola: 27759866 markings, 123837481 edges, 119070 markings/sec, 215 secs
lola: 28289449 markings, 126328363 edges, 105917 markings/sec, 220 secs
lola: 28817394 markings, 128807819 edges, 105589 markings/sec, 225 secs
lola: 29373004 markings, 131364006 edges, 111122 markings/sec, 230 secs
lola: 29934474 markings, 133895792 edges, 112294 markings/sec, 235 secs
lola: 30420823 markings, 136135291 edges, 97270 markings/sec, 240 secs
lola: 30934287 markings, 138511007 edges, 102693 markings/sec, 245 secs
lola: 31472263 markings, 140934788 edges, 107595 markings/sec, 250 secs
lola: 31964279 markings, 143223351 edges, 98403 markings/sec, 255 secs
lola: 32479301 markings, 145568316 edges, 103004 markings/sec, 260 secs
lola: 32999738 markings, 147964642 edges, 104087 markings/sec, 265 secs
lola: 33480657 markings, 150220003 edges, 96184 markings/sec, 270 secs
lola: 34005902 markings, 152601734 edges, 105049 markings/sec, 275 secs
lola: 34516810 markings, 154962894 edges, 102182 markings/sec, 280 secs
lola: 35057665 markings, 157429206 edges, 108171 markings/sec, 285 secs
lola: 35564140 markings, 159766990 edges, 101295 markings/sec, 290 secs
lola: 36056744 markings, 162071587 edges, 98521 markings/sec, 295 secs
lola: 36620530 markings, 164586485 edges, 112757 markings/sec, 300 secs
lola: 37113127 markings, 166891802 edges, 98519 markings/sec, 305 secs
lola: 37596900 markings, 169165827 edges, 96755 markings/sec, 310 secs
lola: 38101978 markings, 171475760 edges, 101016 markings/sec, 315 secs
lola: 38600205 markings, 173774748 edges, 99645 markings/sec, 320 secs
lola: 39083826 markings, 176046790 edges, 96724 markings/sec, 325 secs
lola: 39558923 markings, 178279512 edges, 95019 markings/sec, 330 secs
lola: 40023849 markings, 180471379 edges, 92985 markings/sec, 335 secs
lola: 40476654 markings, 182629771 edges, 90561 markings/sec, 340 secs
lola: 40970324 markings, 184906093 edges, 98734 markings/sec, 345 secs
lola: 41455921 markings, 187161671 edges, 97119 markings/sec, 350 secs
lola: 41874340 markings, 189161318 edges, 83684 markings/sec, 355 secs
lola: 42301597 markings, 191173896 edges, 85451 markings/sec, 360 secs
lola: 42737097 markings, 193193837 edges, 87100 markings/sec, 365 secs
lola: 43139602 markings, 195120947 edges, 80501 markings/sec, 370 secs
lola: 43612973 markings, 197257602 edges, 94674 markings/sec, 375 secs
lola: 44062826 markings, 199338735 edges, 89971 markings/sec, 380 secs
lola: 44510907 markings, 201405171 edges, 89616 markings/sec, 385 secs
lola: 44936129 markings, 203420643 edges, 85044 markings/sec, 390 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p_0_1_2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (1 <= p_0_1_2))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 761145 markings, 3484028 edges, 2992223313335418880 markings/sec, 0 secs
lola: 1423422 markings, 6637912 edges, 132455 markings/sec, 5 secs
lola: 2043635 markings, 9650461 edges, 124043 markings/sec, 10 secs
lola: 2629960 markings, 12539097 edges, 117265 markings/sec, 15 secs
lola: 3211377 markings, 15395361 edges, 116283 markings/sec, 20 secs
lola: 3807209 markings, 18282040 edges, 119166 markings/sec, 25 secs
lola: 4449400 markings, 21298640 edges, 128438 markings/sec, 30 secs
lola: 5006098 markings, 24066008 edges, 111340 markings/sec, 35 secs
lola: 5548236 markings, 26792099 edges, 108428 markings/sec, 40 secs
lola: 6120093 markings, 29590682 edges, 114371 markings/sec, 45 secs
lola: 6662259 markings, 32294894 edges, 108433 markings/sec, 50 secs
lola: 7184897 markings, 34940550 edges, 104528 markings/sec, 55 secs
lola: 7736792 markings, 37684149 edges, 110379 markings/sec, 60 secs
lola: 8238559 markings, 40253336 edges, 100353 markings/sec, 65 secs
lola: 8751375 markings, 42855832 edges, 102563 markings/sec, 70 secs
lola: 9277344 markings, 45500723 edges, 105194 markings/sec, 75 secs
lola: 9778291 markings, 48060526 edges, 100189 markings/sec, 80 secs
lola: 10302505 markings, 50710885 edges, 104843 markings/sec, 85 secs
lola: 10833615 markings, 53350162 edges, 106222 markings/sec, 90 secs
lola: 11366637 markings, 56012814 edges, 106604 markings/sec, 95 secs
lola: 11872673 markings, 58589586 edges, 101207 markings/sec, 100 secs
lola: 12364442 markings, 61123517 edges, 98354 markings/sec, 105 secs
lola: 12842687 markings, 63604732 edges, 95649 markings/sec, 110 secs
lola: 13355429 markings, 66202640 edges, 102548 markings/sec, 115 secs
lola: 13850718 markings, 68731981 edges, 99058 markings/sec, 120 secs
lola: 14329335 markings, 71209734 edges, 95723 markings/sec, 125 secs
lola: 14814860 markings, 73727728 edges, 97105 markings/sec, 130 secs
lola: 15330504 markings, 76344316 edges, 103129 markings/sec, 135 secs
lola: 15844272 markings, 78952162 edges, 102754 markings/sec, 140 secs
lola: 16338940 markings, 81490809 edges, 98934 markings/sec, 145 secs
lola: 16841799 markings, 84053852 edges, 100572 markings/sec, 150 secs
lola: 17368030 markings, 86694947 edges, 105246 markings/sec, 155 secs
lola: 17879182 markings, 89283717 edges, 102230 markings/sec, 160 secs
lola: 18383084 markings, 91855479 edges, 100780 markings/sec, 165 secs
lola: 18863513 markings, 94348575 edges, 96086 markings/sec, 170 secs
lola: 19345198 markings, 96846781 edges, 96337 markings/sec, 175 secs
lola: 19830437 markings, 99361033 edges, 97048 markings/sec, 180 secs
lola: 20336137 markings, 101933277 edges, 101140 markings/sec, 185 secs
lola: 20829557 markings, 104486865 edges, 98684 markings/sec, 190 secs
lola: 21327563 markings, 107043132 edges, 99601 markings/sec, 195 secs
lola: 21826402 markings, 109609735 edges, 99768 markings/sec, 200 secs
lola: 22315756 markings, 112134859 edges, 97871 markings/sec, 205 secs
lola: 22848548 markings, 114803963 edges, 106558 markings/sec, 210 secs
lola: 23327550 markings, 117286875 edges, 95800 markings/sec, 215 secs
lola: 23785308 markings, 119700469 edges, 91552 markings/sec, 220 secs
lola: 24250343 markings, 122136688 edges, 93007 markings/sec, 225 secs
lola: 24694590 markings, 124488912 edges, 88849 markings/sec, 230 secs
lola: 25154161 markings, 126885176 edges, 91914 markings/sec, 235 secs
lola: 25611600 markings, 129235566 edges, 91488 markings/sec, 240 secs
lola: 26063238 markings, 131630506 edges, 90328 markings/sec, 245 secs
lola: 26604298 markings, 134324417 edges, 108212 markings/sec, 250 secs
lola: 27084465 markings, 136823972 edges, 96033 markings/sec, 255 secs
lola: 27605785 markings, 139447487 edges, 104264 markings/sec, 260 secs
lola: 28076573 markings, 141917630 edges, 94158 markings/sec, 265 secs
lola: 28520178 markings, 144276086 edges, 88721 markings/sec, 270 secs
lola: 28961207 markings, 146616176 edges, 88206 markings/sec, 275 secs
lola: 29423885 markings, 149022123 edges, 92536 markings/sec, 280 secs
lola: 29940472 markings, 151618280 edges, 103317 markings/sec, 285 secs
lola: 30396799 markings, 153989669 edges, 91265 markings/sec, 290 secs
lola: 30890570 markings, 156529593 edges, 98754 markings/sec, 295 secs
lola: 31405496 markings, 159134933 edges, 102985 markings/sec, 300 secs
lola: 31865776 markings, 161527875 edges, 92056 markings/sec, 305 secs
lola: 32338266 markings, 163985868 edges, 94498 markings/sec, 310 secs
lola: 32862894 markings, 166636844 edges, 104926 markings/sec, 315 secs
lola: 33315011 markings, 169014317 edges, 90423 markings/sec, 320 secs
lola: 33810483 markings, 171532159 edges, 99094 markings/sec, 325 secs
lola: 34315661 markings, 174110322 edges, 101036 markings/sec, 330 secs
lola: 34782717 markings, 176549628 edges, 93411 markings/sec, 335 secs
lola: 35283185 markings, 179087999 edges, 100094 markings/sec, 340 secs
lola: 35744614 markings, 181513855 edges, 92286 markings/sec, 345 secs
lola: 36259891 markings, 184128007 edges, 103055 markings/sec, 350 secs
lola: 36793391 markings, 186805939 edges, 106700 markings/sec, 355 secs
lola: 37249738 markings, 189216154 edges, 91269 markings/sec, 360 secs
lola: 37745883 markings, 191768281 edges, 99229 markings/sec, 365 secs
lola: 38237808 markings, 194295432 edges, 98385 markings/sec, 370 secs
lola: 38712552 markings, 196761496 edges, 94949 markings/sec, 375 secs
lola: 39157564 markings, 199127342 edges, 89002 markings/sec, 380 secs
lola: 39621041 markings, 201554316 edges, 92695 markings/sec, 385 secs
lola: 40074002 markings, 203951026 edges, 90592 markings/sec, 390 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p_1_2_0) AND (p_2_1_0 <= p_0_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((1 <= p_1_2_0) AND (p_2_1_0 <= p_0_0_0))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 11 will run for 477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p_0_2_2 <= p_0_0_1) AND (3 <= p_1_2_0) AND (p_0_0_2 + 1 <= p_2_1_0) AND (p_0_2_1 <= p_0_0_1))))
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 104 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to NeighborGrid-PT-d3n3m1t11-CTLCardinality-11.sara
lola: subprocess 12 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((1 <= p_2_2_1))))) OR NOT(E (X ((p_2_2_2 + 1 <= p_0_2_1)))))
lola: lola: lola: state equation: calling and running sara========================================
========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p_2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (1 <= p_2_2_1)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((p_0_1_0 <= p_0_0_2) AND (1 <= p_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file NeighborGrid-PT-d3n3m1t11-CTLCardinality-11.sara.
lola: processed formula: AX(E(TRUE U ((p_0_1_0 <= p_0_0_2) AND (1 <= p_2_2_0))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 14 will run for 1194 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p_1_1_1 + 1 <= p_1_1_0) OR (((p_1_0_2 + 1 <= p_1_0_1) OR (p_0_0_0 <= 0)) AND ((p_0_2_1 + 1 <= p_1_2_2) OR (p_1_2_0 <= 2)))) OR A (G (E (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: processed formula with 0 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 2388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_1_1_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 104 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no unknown yes unknown unknown yes yes yes yes yes no
sara: place or transition ordering is non-deterministic
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496295682117
--------------------
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="NeighborGrid-PT-d3n3m1t11"
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/NeighborGrid-PT-d3n3m1t11.tgz
mv NeighborGrid-PT-d3n3m1t11 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 NeighborGrid-PT-d3n3m1t11, 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 r208-smll-149581172200021"
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 ;