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-d4n3m2c23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172200031
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496296072703


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ NeighborGrid-PT-d4n3m2c23 @ 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: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: A (G (FIREABLE(to_2_1_1_1v_2_2_0_1))) : A (((FIREABLE(ti_1_2_1_0v_2_1_1_0) OR FIREABLE(ti_1_0_1_0v_2_1_2_0) OR NOT FIREABLE(ti_0_2_1_1v_0_2_2_2) OR ((FIREABLE(to_1_2_2_1v_2_2_1_1) OR FIREABLE(ti_1_1_1_0v_2_2_2_0)) AND FIREABLE(ti_0_2_1_1v_1_1_1_1))) U (NOT FIREABLE(to_1_0_0_1v_2_1_1_1) AND NOT FIREABLE(ti_1_0_0_1v_2_0_1_2)))) : (E (G ((FIREABLE(ti_0_0_2_1v_1_0_1_0) AND FIREABLE(ti_0_1_0_1v_0_2_1_2)))) AND A (F ((NOT FIREABLE(to_1_1_0_2v_2_1_1_2) OR E (F (FIREABLE(to_1_1_1_2v_2_1_1_1))))))) : NOT(A (F (NOT(A (X (FIREABLE(to_2_1_1_2v_2_2_2_2))))))) : E (G (E (G (A (G (FIREABLE(ti_0_2_2_2v_1_2_2_1))))))) : A (X (A (F (A (G (FIREABLE(to_2_0_2_1v_2_1_1_1))))))) : (A (G ((E (F (FIREABLE(ti_0_0_2_2v_1_1_2_1))) AND FIREABLE(to_0_1_0_2v_0_2_0_1)))) AND (NOT(E (F (NOT FIREABLE(to_2_0_1_0v_2_0_2_1)))) AND (E (F ((FIREABLE(ti_1_2_1_1v_1_2_2_0) AND FIREABLE(to_0_0_0_2v_1_1_0_2)))) OR FIREABLE(to_1_2_1_0v_2_2_1_1)))) : ((NOT FIREABLE(ti_1_0_0_1v_2_1_0_1) OR NOT FIREABLE(ti_0_1_2_2v_1_2_1_2)) OR A (F (E (G (FIREABLE(to_0_0_0_1v_1_0_1_1)))))) : A (G (A (X (((FIREABLE(to_1_2_0_1v_1_2_1_2) AND FIREABLE(ti_2_0_1_2v_2_1_1_1)) OR (FIREABLE(ti_1_1_1_2v_2_1_0_1) AND FIREABLE(to_1_0_2_1v_1_1_1_2))))))) : (NOT FIREABLE(ti_1_1_2_1v_1_2_1_2) OR (A (G (FIREABLE(ti_0_2_0_1v_0_2_1_2))) OR NOT(A (G (FIREABLE(ti_2_1_0_0v_2_2_0_1)))))) : NOT(A ((E (F (FIREABLE(ti_1_0_1_1v_2_0_0_2))) U E (G (FIREABLE(ti_1_0_1_2v_1_1_2_1)))))) : (E (F (NOT FIREABLE(to_2_1_2_1v_2_2_1_0))) OR (A (G (E (F (FIREABLE(ti_0_1_2_2v_1_0_2_2))))) OR A (X ((NOT FIREABLE(to_0_2_0_1v_1_1_1_1) OR (FIREABLE(to_2_1_2_0v_2_2_2_1) AND FIREABLE(ti_0_0_1_1v_0_1_2_0))))))) : E (G (E (G (E (G (FIREABLE(ti_1_0_0_2v_2_1_0_2))))))) : (FIREABLE(to_1_1_1_1v_2_1_1_0) AND E (X (A (G ((FIREABLE(ti_0_0_0_0v_1_1_0_1) AND FIREABLE(ti_1_0_1_0v_2_0_0_0))))))) : A (G (E (X (NOT FIREABLE(ti_2_1_0_1v_2_2_0_2))))) : A ((NOT FIREABLE(to_0_1_1_2v_1_0_2_2) U E (X (NOT FIREABLE(ti_1_1_1_1v_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 (G (FIREABLE(to_2_1_1_1v_2_2_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(ti_1_2_1_0v_2_1_1_0) OR FIREABLE(ti_1_0_1_0v_2_1_2_0) OR NOT FIREABLE(ti_0_2_1_1v_0_2_2_2) OR ((FIREABLE(to_1_2_2_1v_2_2_1_1) OR FIREABLE(ti_1_1_1_0v_2_2_2_0)) AND FIREABLE(ti_0_2_1_1v_1_1_1_1))) U (NOT FIREABLE(to_1_0_0_1v_2_1_1_1) AND NOT FIREABLE(ti_1_0_0_1v_2_0_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(ti_1_2_1_0v_2_1_1_0) OR FIREABLE(ti_1_0_1_0v_2_1_2_0) OR NOT FIREABLE(ti_0_2_1_1v_0_2_2_2) OR ((FIREABLE(to_1_2_2_1v_2_2_1_1) OR FIREABLE(ti_1_1_1_0v_2_2_2_0)) AND FIREABLE(ti_0_2_1_1v_1_1_1_1))) U (NOT FIREABLE(to_1_0_0_1v_2_1_1_1) AND NOT FIREABLE(ti_1_0_0_1v_2_0_1_2)))
lola: processed formula length: 288
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(ti_0_0_2_1v_1_0_1_0) AND FIREABLE(ti_0_1_0_1v_0_2_1_2)))) AND A (F ((NOT FIREABLE(to_1_1_0_2v_2_1_1_2) OR E (F (FIREABLE(to_1_1_1_2v_2_1_1_1)))))))
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: E (G ((FIREABLE(ti_0_0_2_1v_1_0_1_0) AND FIREABLE(ti_0_1_0_1v_0_2_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(ti_0_0_2_1v_1_0_1_0) OR NOT FIREABLE(ti_0_1_0_1v_0_2_1_2))))
lola: processed formula length: 88
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(to_1_1_0_2v_2_1_1_2) OR E (F (FIREABLE(to_1_1_1_2v_2_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT FIREABLE(to_1_1_0_2v_2_1_1_2) OR E(TRUE U FIREABLE(to_1_1_1_2v_2_1_1_1))))
lola: processed formula length: 88
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 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: NOT(A (F (NOT(A (X (FIREABLE(to_2_1_1_2v_2_2_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(FIREABLE(to_2_1_1_2v_2_2_2_2)))))
lola: processed formula length: 53
lola: 10 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (A (G (FIREABLE(ti_0_2_2_2v_1_2_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U E(TRUE U NOT FIREABLE(ti_0_2_2_2v_1_2_2_1)))))
lola: processed formula length: 68
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (A (G (FIREABLE(to_2_0_2_1v_2_1_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U NOT(E(TRUE U NOT FIREABLE(to_2_0_2_1v_2_1_1_1)))))
lola: processed formula length: 62
lola: 4 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 2 significant temporal operators and needs 9 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: (A (G ((E (F (FIREABLE(ti_0_0_2_2v_1_1_2_1))) AND FIREABLE(to_0_1_0_2v_0_2_0_1)))) AND (NOT(E (F (NOT FIREABLE(to_2_0_1_0v_2_0_2_1)))) AND (E (F ((FIREABLE(ti_1_2_1_1v_1_2_2_0) AND FIREABLE(to_0_0_0_2v_1_1_0_2)))) OR FIREABLE(to_1_2_1_0v_2_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(ti_0_0_2_2v_1_1_2_1)))))
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 FIREABLE(ti_0_0_2_2v_1_1_2_1)))))
lola: processed formula length: 59
lola: 7 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 472732 markings, 1472329 edges, 3689348869717491712 markings/sec, 0 secs
lola: 769645 markings, 3200716 edges, 59383 markings/sec, 5 secs
lola: 1195732 markings, 4502592 edges, 85217 markings/sec, 10 secs
lola: 1508634 markings, 6007814 edges, 62580 markings/sec, 15 secs
lola: 1817836 markings, 7272977 edges, 61840 markings/sec, 20 secs
lola: 2198567 markings, 8562391 edges, 76146 markings/sec, 25 secs
lola: 2557808 markings, 10108130 edges, 71848 markings/sec, 30 secs
lola: 2899594 markings, 11692814 edges, 68357 markings/sec, 35 secs
lola: 3283931 markings, 12921653 edges, 76867 markings/sec, 40 secs
lola: 3617747 markings, 14406798 edges, 66763 markings/sec, 45 secs
lola: 3981727 markings, 15905431 edges, 72796 markings/sec, 50 secs
lola: 4330693 markings, 17225593 edges, 69793 markings/sec, 55 secs
lola: 4665550 markings, 18738621 edges, 66971 markings/sec, 60 secs
lola: 5022805 markings, 20202637 edges, 71451 markings/sec, 65 secs
lola: 5361325 markings, 21660184 edges, 67704 markings/sec, 70 secs
lola: 5707693 markings, 22955234 edges, 69274 markings/sec, 75 secs
lola: 6020786 markings, 24443382 edges, 62619 markings/sec, 80 secs
lola: 6355018 markings, 25897564 edges, 66846 markings/sec, 85 secs
lola: 6708590 markings, 27188581 edges, 70714 markings/sec, 90 secs
lola: 7078846 markings, 28604334 edges, 74051 markings/sec, 95 secs
lola: 7373416 markings, 30111080 edges, 58914 markings/sec, 100 secs
lola: 7699965 markings, 31368768 edges, 65310 markings/sec, 105 secs
lola: 8065117 markings, 32796318 edges, 73030 markings/sec, 110 secs
lola: 8387843 markings, 34203446 edges, 64545 markings/sec, 115 secs
lola: 8720265 markings, 35565315 edges, 66484 markings/sec, 120 secs
lola: 9084750 markings, 36920588 edges, 72897 markings/sec, 125 secs
lola: 9394268 markings, 38342576 edges, 61904 markings/sec, 130 secs
lola: 9726592 markings, 39656220 edges, 66465 markings/sec, 135 secs
lola: 10067024 markings, 41055532 edges, 68086 markings/sec, 140 secs
lola: 10392127 markings, 42368634 edges, 65021 markings/sec, 145 secs
lola: 10727083 markings, 43737022 edges, 66991 markings/sec, 150 secs
lola: 11052162 markings, 45035771 edges, 65016 markings/sec, 155 secs
lola: 11396930 markings, 46431314 edges, 68954 markings/sec, 160 secs
lola: 11721455 markings, 47687382 edges, 64905 markings/sec, 165 secs
lola: 12040007 markings, 49046285 edges, 63710 markings/sec, 170 secs
lola: 12368894 markings, 50354536 edges, 65777 markings/sec, 175 secs
lola: 12699282 markings, 51690349 edges, 66078 markings/sec, 180 secs
lola: 13020711 markings, 52977214 edges, 64286 markings/sec, 185 secs
lola: 13344434 markings, 54291979 edges, 64745 markings/sec, 190 secs
lola: 13675041 markings, 55556519 edges, 66121 markings/sec, 195 secs
lola: 13986044 markings, 56822371 edges, 62201 markings/sec, 200 secs
lola: 14252867 markings, 57900314 edges, 53365 markings/sec, 205 secs
lola: 14503039 markings, 58881556 edges, 50034 markings/sec, 210 secs
lola: 14756667 markings, 59879268 edges, 50726 markings/sec, 215 secs
lola: 15012171 markings, 60886326 edges, 51101 markings/sec, 220 secs
lola: 15260823 markings, 61878628 edges, 49730 markings/sec, 225 secs
lola: 15512546 markings, 62867883 edges, 50345 markings/sec, 230 secs
lola: 15761686 markings, 63861185 edges, 49828 markings/sec, 235 secs
lola: 16014279 markings, 64834178 edges, 50519 markings/sec, 240 secs
lola: 16257651 markings, 65802471 edges, 48674 markings/sec, 245 secs
lola: 16506537 markings, 66758168 edges, 49777 markings/sec, 250 secs
lola: 16746574 markings, 67707775 edges, 48007 markings/sec, 255 secs
lola: 16986296 markings, 68647974 edges, 47944 markings/sec, 260 secs
lola: 17216073 markings, 69578166 edges, 45955 markings/sec, 265 secs
lola: 17438450 markings, 70495406 edges, 44475 markings/sec, 270 secs
lola: 17656225 markings, 71399579 edges, 43555 markings/sec, 275 secs
lola: 17866855 markings, 72286799 edges, 42126 markings/sec, 280 secs
lola: 18068601 markings, 73157115 edges, 40349 markings/sec, 285 secs
lola: 18265474 markings, 74017698 edges, 39375 markings/sec, 290 secs
lola: 18461708 markings, 74868341 edges, 39247 markings/sec, 295 secs
lola: 18658882 markings, 75701691 edges, 39435 markings/sec, 300 secs
lola: 18858132 markings, 76535167 edges, 39850 markings/sec, 305 secs
lola: 19052591 markings, 77360234 edges, 38892 markings/sec, 310 secs
lola: 19256006 markings, 78196086 edges, 40683 markings/sec, 315 secs
lola: 19454333 markings, 79029117 edges, 39665 markings/sec, 320 secs
lola: 19643687 markings, 79852771 edges, 37871 markings/sec, 325 secs
lola: 19831461 markings, 80676308 edges, 37555 markings/sec, 330 secs
lola: 20022601 markings, 81500967 edges, 38228 markings/sec, 335 secs
lola: 20281415 markings, 82513805 edges, 51763 markings/sec, 340 secs
lola: 20611119 markings, 83723711 edges, 65941 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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: ((NOT FIREABLE(ti_1_0_0_1v_2_1_0_1) OR NOT FIREABLE(ti_0_1_2_2v_1_2_1_2)) OR A (F (E (G (FIREABLE(to_0_0_0_1v_1_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti_1_0_0_1v_2_1_0_1) OR NOT FIREABLE(ti_0_1_2_2v_1_2_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(ti_1_0_0_1v_2_1_0_1) OR NOT FIREABLE(ti_0_1_2_2v_1_2_1_2))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (FIREABLE(to_0_0_0_1v_1_0_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(to_0_0_0_1v_1_0_1_1))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (((FIREABLE(to_1_2_0_1v_1_2_1_2) AND FIREABLE(ti_2_0_1_2v_2_1_1_1)) OR (FIREABLE(ti_1_1_1_2v_2_1_0_1) AND FIREABLE(to_1_0_2_1v_1_1_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(((FIREABLE(to_1_2_0_1v_1_2_1_2) AND FIREABLE(ti_2_0_1_2v_2_1_1_1)) OR (FIREABLE(ti_1_1_1_2v_2_1_0_1) AND FIREABLE(to_1_0_2_1v_1_1_1_2)))))))
lola: processed formula length: 161
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti_1_1_2_1v_1_2_1_2) OR (A (G (FIREABLE(ti_0_2_0_1v_0_2_1_2))) OR NOT(A (G (FIREABLE(ti_2_1_0_0v_2_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(ti_1_1_2_1v_1_2_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(ti_1_1_2_1v_1_2_1_2)
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ti_0_2_0_1v_0_2_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(ti_2_1_0_0v_2_2_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((E (F (FIREABLE(ti_1_0_1_1v_2_0_0_2))) U E (G (FIREABLE(ti_1_0_1_2v_1_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
checking CTL
lola: processed formula: NOT(A(E(TRUE U FIREABLE(ti_1_0_1_1v_2_0_0_2)) U NOT(A(TRUE U NOT FIREABLE(ti_1_0_1_2v_1_1_2_1)))))
lola: processed formula length: 98
lola: 13 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(to_2_1_2_1v_2_2_1_0))) OR (A (G (E (F (FIREABLE(ti_0_1_2_2v_1_0_2_2))))) OR A (X ((NOT FIREABLE(to_0_2_0_1v_1_1_1_1) OR (FIREABLE(to_2_1_2_0v_2_2_2_1) AND FIREABLE(ti_0_0_1_1v_0_1_2_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(to_2_1_2_1v_2_2_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (E (G (FIREABLE(ti_1_0_0_2v_2_1_0_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: NOT(A(TRUE U A(TRUE U A(TRUE U NOT FIREABLE(ti_1_0_0_2v_2_1_0_2)))))
lola: processed formula length: 68
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_1_1_1_1v_2_1_1_0) AND E (X (A (G ((FIREABLE(ti_0_0_0_0v_1_1_0_1) AND FIREABLE(ti_1_0_1_0v_2_0_0_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_1_1_1_1v_2_1_1_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_1_1_1_1v_2_1_1_0)
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.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 14 will run for 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((FIREABLE(ti_0_0_0_0v_1_1_0_1) AND FIREABLE(ti_1_0_1_0v_2_0_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (NOT FIREABLE(ti_0_0_0_0v_1_1_0_1) OR NOT FIREABLE(ti_1_0_1_0v_2_0_0_0)))))
lola: processed formula length: 92
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(ti_2_1_0_1v_2_2_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(ti_2_1_0_1v_2_2_0_2)))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 15 will run for 3184 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(to_0_1_1_2v_1_0_2_2) U E (X (NOT FIREABLE(ti_1_1_1_1v_2_1_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT FIREABLE(to_0_1_1_2v_1_0_2_2) U EX(NOT FIREABLE(ti_1_1_1_1v_2_1_1_0)))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: RESULT
lola:
SUMMARY: no no yes yes no no unknown yes no yes no yes yes no no no
lola: ========================================
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496296428421

--------------------
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-d4n3m2c23"
export BK_EXAMINATION="CTLFireability"
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-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 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-d4n3m2c23, examination is CTLFireability"
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-149581172200031"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;