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 HouseConstruction-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264600615
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494728013258


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ HouseConstruction-PT-100 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-100-CTLCardinality.task
lola: (NOT(A (F ((3 <= p8)))) OR NOT(E (X (((p27 <= p3) OR (2 <= p2)))))) : NOT(A (F (A (G ((p14 <= p15)))))) : E (G (E (((2 <= p25) U (p17 <= p15))))) : (NOT(E (F (((p2 <= p16) AND (p25 <= p11))))) OR E (F (A (F ((2 <= p20)))))) : ((((p3 <= p6) OR (3 <= p9)) OR E (G (((2 <= p2) AND (p2 <= p5))))) AND NOT(E (F (((2 <= p21) AND (p21 <= p23)))))) : (NOT(E (G (((p7 <= p3) OR (p1 <= p16))))) OR (((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1))) AND A (F (((p17 <= p6) OR (p21 <= p3)))))) : E (G (((p17 <= 1) OR ((p18 <= 1) AND (p10 <= 2))))) : (A ((((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15)))) AND (E (F ((3 <= p11))) AND A (F (((1 <= p16) AND (p19 <= p20)))))) : NOT((A (F (((2 <= p22) AND (1 <= p25)))) AND (p8 <= p10))) : A (G ((E (F ((p1 <= p15))) AND E (F ((p1 <= p15)))))) : E (X ((((p18 <= 2) AND (1 <= p5)) OR A (F ((3 <= p5)))))) : A (F ((A (G ((3 <= p20))) AND E (X ((3 <= p11)))))) : ((((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26)) AND NOT(E (G ((p8 <= p20))))) OR ((p7 <= 2) AND (p8 <= p4) AND ((p16 + 1 <= p9) OR (p8 <= p12)) AND (p25 + 1 <= p23) AND ((p13 <= 0) OR (p18 <= 2)))) : E ((A (X ((p8 <= p2))) U ((p13 <= 2) AND (3 <= p26)))) : E (F (((p7 + 1 <= p8) AND (3 <= p27)))) : (NOT(E (((p26 <= p7) U (2 <= p19)))) OR NOT((E (G ((p8 <= p16))) AND ((1 <= p25) OR (p15 <= p9) OR (p4 + 1 <= p25)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F ((3 <= p8)))) OR NOT(E (X (((p27 <= p3) OR (2 <= p2))))))
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 (G ((p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p8)))
lola: processed formula length: 24
lola: 8 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p14 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p15 + 1 <= p14)))))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 1429583 markings, 4563662 edges, 285917 markings/sec, 0 secs
lola: 2551246 markings, 8581799 edges, 224333 markings/sec, 5 secs
lola: 3502412 markings, 12463054 edges, 190233 markings/sec, 10 secs
lola: 4564623 markings, 16363592 edges, 212442 markings/sec, 15 secs
lola: 5543990 markings, 20306711 edges, 195873 markings/sec, 20 secs
lola: 6473992 markings, 23956604 edges, 186000 markings/sec, 25 secs
lola: 7447416 markings, 27708124 edges, 194685 markings/sec, 30 secs
lola: 8335491 markings, 31283636 edges, 177615 markings/sec, 35 secs
lola: 9130266 markings, 34840620 edges, 158955 markings/sec, 40 secs
lola: 10036035 markings, 38696988 edges, 181154 markings/sec, 45 secs
lola: 10790063 markings, 42105309 edges, 150806 markings/sec, 50 secs
lola: 11755720 markings, 45903112 edges, 193131 markings/sec, 55 secs
lola: 12703253 markings, 49854408 edges, 189507 markings/sec, 60 secs
lola: 13534481 markings, 53390144 edges, 166246 markings/sec, 65 secs
lola: 14271435 markings, 56748842 edges, 147391 markings/sec, 70 secs
lola: 15108490 markings, 60519483 edges, 167411 markings/sec, 75 secs
lola: 15958299 markings, 64235205 edges, 169962 markings/sec, 80 secs
lola: 16753328 markings, 67502021 edges, 159006 markings/sec, 85 secs
lola: 17597837 markings, 71101279 edges, 168902 markings/sec, 90 secs
lola: 18459249 markings, 74601109 edges, 172282 markings/sec, 95 secs
lola: 19207771 markings, 78026864 edges, 149704 markings/sec, 100 secs
lola: 20189083 markings, 81880225 edges, 196262 markings/sec, 105 secs
lola: 21043028 markings, 85338251 edges, 170789 markings/sec, 110 secs
lola: 21831886 markings, 88904579 edges, 157772 markings/sec, 115 secs
lola: 22629292 markings, 92465417 edges, 159481 markings/sec, 120 secs
lola: 23384426 markings, 96021999 edges, 151027 markings/sec, 125 secs
lola: 24053579 markings, 99157404 edges, 133831 markings/sec, 130 secs
lola: 24638030 markings, 102091620 edges, 116890 markings/sec, 135 secs
lola: 25310561 markings, 105375367 edges, 134506 markings/sec, 140 secs
lola: 26097305 markings, 108615812 edges, 157349 markings/sec, 145 secs
lola: 26737072 markings, 111658446 edges, 127953 markings/sec, 150 secs
lola: 27406673 markings, 114807621 edges, 133920 markings/sec, 155 secs
lola: 28100236 markings, 118189843 edges, 138713 markings/sec, 160 secs
lola: 28744530 markings, 121147917 edges, 128859 markings/sec, 165 secs
lola: 29335697 markings, 124156126 edges, 118233 markings/sec, 170 secs
lola: 30196419 markings, 127764405 edges, 172144 markings/sec, 175 secs
lola: 31097893 markings, 131406923 edges, 180295 markings/sec, 180 secs
lola: 31820869 markings, 134861595 edges, 144595 markings/sec, 185 secs
lola: 32723668 markings, 138892708 edges, 180560 markings/sec, 190 secs
lola: 33463555 markings, 142296162 edges, 147977 markings/sec, 195 secs
lola: 34083758 markings, 145552466 edges, 124041 markings/sec, 200 secs
lola: 34780964 markings, 148857180 edges, 139441 markings/sec, 205 secs
lola: 35406654 markings, 151593526 edges, 125138 markings/sec, 210 secs
lola: 35975017 markings, 154046209 edges, 113673 markings/sec, 215 secs
lola: 36451233 markings, 156932662 edges, 95243 markings/sec, 220 secs
lola: 37092740 markings, 160131932 edges, 128301 markings/sec, 225 secs
lola: 37804523 markings, 163433191 edges, 142357 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((2 <= p25) U (p17 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((2 <= p25) U (p17 <= p15)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((p2 <= p16) AND (p25 <= p11))))) OR E (F (A (F ((2 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p16 + 1 <= p2) OR (p11 + 1 <= p25))))
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 72 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((2 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (2 <= p20)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p3 <= p6) OR (3 <= p9)) OR E (G (((2 <= p2) AND (p2 <= p5))))) AND NOT(E (F (((2 <= p21) AND (p21 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p3 <= p6) OR (3 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 <= p6) OR (3 <= p9))
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 2 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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p21 <= 1) OR (p23 + 1 <= p21))))
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 72 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-100-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((p7 <= p3) OR (p1 <= p16))))) OR (((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1))) AND A (F (((p17 <= p6) OR (p21 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p3 + 1 <= p7) AND (p16 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p3 + 1 <= p7) AND (p16 + 1 <= p1)))
lola: processed formula length: 46
lola: 4 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1)))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p17 <= 1) OR ((p18 <= 1) AND (p10 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p17) AND ((2 <= p18) OR (3 <= p10)))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15)))) AND (E (F ((3 <= p11))) AND A (F (((1 <= p16) AND (p19 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15)))
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p11)))
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 72 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HouseConstruction-PT-100-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p16) AND (p19 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= p16) AND (p19 <= p20)))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 1677926 markings, 3629009 edges, 3541966482839699456 markings/sec, 0 secs
lola: 3216988 markings, 7018439 edges, 307812 markings/sec, 5 secs
lola: 4815533 markings, 10521169 edges, 319709 markings/sec, 10 secs
lola: 6461676 markings, 14150004 edges, 329229 markings/sec, 15 secs
lola: 8065168 markings, 17710943 edges, 320698 markings/sec, 20 secs
lola: 9568338 markings, 21020164 edges, 300634 markings/sec, 25 secs
lola: 11009178 markings, 24224806 edges, 288168 markings/sec, 30 secs
lola: 12274919 markings, 27023488 edges, 253148 markings/sec, 35 secs
lola: 13661636 markings, 30087218 edges, 277343 markings/sec, 40 secs
lola: 15049872 markings, 33142492 edges, 277647 markings/sec, 45 secs
lola: 16456298 markings, 36236466 edges, 281285 markings/sec, 50 secs
lola: 17653190 markings, 38910482 edges, 239378 markings/sec, 55 secs
lola: 19061657 markings, 42045099 edges, 281693 markings/sec, 60 secs
lola: 20467942 markings, 45138766 edges, 281257 markings/sec, 65 secs
lola: 21831088 markings, 48194147 edges, 272629 markings/sec, 70 secs
lola: 23194337 markings, 51224948 edges, 272650 markings/sec, 75 secs
lola: 24623928 markings, 54328563 edges, 285918 markings/sec, 80 secs
lola: 26027548 markings, 57461910 edges, 280724 markings/sec, 85 secs
lola: 27416620 markings, 60558895 edges, 277814 markings/sec, 90 secs
lola: 28613076 markings, 63203934 edges, 239291 markings/sec, 95 secs
lola: 29977920 markings, 66236130 edges, 272969 markings/sec, 100 secs
lola: 31350406 markings, 69281444 edges, 274497 markings/sec, 105 secs
lola: 32695896 markings, 72259142 edges, 269098 markings/sec, 110 secs
lola: 33853722 markings, 74828552 edges, 231565 markings/sec, 115 secs
lola: 35150005 markings, 77760137 edges, 259257 markings/sec, 120 secs
lola: 36459875 markings, 80694493 edges, 261974 markings/sec, 125 secs
lola: 37758495 markings, 83553114 edges, 259724 markings/sec, 130 secs
lola: 39066381 markings, 86423258 edges, 261577 markings/sec, 135 secs
lola: 40381084 markings, 89304656 edges, 262941 markings/sec, 140 secs
lola: 41587522 markings, 92100580 edges, 241288 markings/sec, 145 secs
lola: 42888824 markings, 94958538 edges, 260260 markings/sec, 150 secs
lola: 44211438 markings, 97848296 edges, 264523 markings/sec, 155 secs
lola: 45519182 markings, 100757443 edges, 261549 markings/sec, 160 secs
lola: 46759499 markings, 103581771 edges, 248063 markings/sec, 165 secs
lola: 48093613 markings, 106489823 edges, 266823 markings/sec, 170 secs
lola: 49412593 markings, 109400883 edges, 263796 markings/sec, 175 secs
lola: 50634305 markings, 112195888 edges, 244342 markings/sec, 180 secs
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 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((2 <= p22) AND (1 <= p25)))) AND (p8 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p22 <= 1) OR (p25 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p22) AND (1 <= p25))))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p1 <= p15))) AND E (F ((p1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p1 <= p15)))))
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 (p1 <= p15)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: ========================================
lola: 1792502 markings, 7072154 edges, 3224960787877462016 markings/sec, 0 secs
lola: 2973405 markings, 12675995 edges, 236181 markings/sec, 5 secs
lola: 3895580 markings, 18055652 edges, 184435 markings/sec, 10 secs
lola: 4827400 markings, 23704907 edges, 186364 markings/sec, 15 secs
lola: 5621192 markings, 28798737 edges, 158758 markings/sec, 20 secs
lola: 6433995 markings, 34088751 edges, 162561 markings/sec, 25 secs
lola: 7377534 markings, 39490194 edges, 188708 markings/sec, 30 secs
lola: 8106473 markings, 44509846 edges, 145788 markings/sec, 35 secs
lola: 9002302 markings, 49877426 edges, 179166 markings/sec, 40 secs
lola: 9872789 markings, 55269689 edges, 174097 markings/sec, 45 secs
lola: 10599873 markings, 60410082 edges, 145417 markings/sec, 50 secs
lola: 11351464 markings, 65452708 edges, 150318 markings/sec, 55 secs
lola: 12037797 markings, 70160758 edges, 137267 markings/sec, 60 secs
lola: 12597333 markings, 74670983 edges, 111907 markings/sec, 65 secs
lola: 13422008 markings, 79833882 edges, 164935 markings/sec, 70 secs
lola: 14250761 markings, 84896914 edges, 165751 markings/sec, 75 secs
lola: 14978156 markings, 89710644 edges, 145479 markings/sec, 80 secs
lola: 15723586 markings, 94549658 edges, 149086 markings/sec, 85 secs
lola: 16453509 markings, 99466998 edges, 145985 markings/sec, 90 secs
lola: 17064821 markings, 103977598 edges, 122262 markings/sec, 95 secs
lola: 17814840 markings, 108726326 edges, 150004 markings/sec, 100 secs
lola: 18568102 markings, 113249955 edges, 150652 markings/sec, 105 secs
lola: 19280736 markings, 117577183 edges, 142527 markings/sec, 110 secs
lola: 19876467 markings, 121665056 edges, 119146 markings/sec, 115 secs
lola: 20642439 markings, 125999035 edges, 153194 markings/sec, 120 secs
lola: 21358532 markings, 130469035 edges, 143219 markings/sec, 125 secs
lola: 22025292 markings, 134536562 edges, 133352 markings/sec, 130 secs
lola: 22594956 markings, 138578265 edges, 113933 markings/sec, 135 secs
lola: 23198228 markings, 142597376 edges, 120654 markings/sec, 140 secs
lola: 23784104 markings, 146498277 edges, 117175 markings/sec, 145 secs
lola: 24337083 markings, 150590613 edges, 110596 markings/sec, 150 secs
lola: 25109418 markings, 154949225 edges, 154467 markings/sec, 155 secs
lola: 25706050 markings, 159152009 edges, 119326 markings/sec, 160 secs
lola: 26317015 markings, 163317738 edges, 122193 markings/sec, 165 secs
lola: 26786928 markings, 166913144 edges, 93983 markings/sec, 170 secs
lola: 27249450 markings, 170786005 edges, 92504 markings/sec, 175 secs
lola: 27902553 markings, 174912832 edges, 130621 markings/sec, 180 secs
lola: 28629055 markings, 178805195 edges, 145300 markings/sec, 185 secs
lola: 29389463 markings, 183447678 edges, 152082 markings/sec, 190 secs
lola: 30467597 markings, 188865600 edges, 215627 markings/sec, 195 secs
lola: 31455430 markings, 194124274 edges, 197567 markings/sec, 200 secs
lola: 32155626 markings, 198900235 edges, 140039 markings/sec, 205 secs
lola: 33284863 markings, 204492517 edges, 225847 markings/sec, 210 secs
lola: 33904099 markings, 208938900 edges, 123847 markings/sec, 215 secs
lola: 34877136 markings, 214219169 edges, 194607 markings/sec, 220 secs
lola: 35836230 markings, 219704433 edges, 191819 markings/sec, 225 secs
lola: 36650677 markings, 224931920 edges, 162889 markings/sec, 230 secs
lola: 37465670 markings, 230175849 edges, 162999 markings/sec, 235 secs
lola: 38527104 markings, 235618862 edges, 212287 markings/sec, 240 secs
lola: 39805003 markings, 241557549 edges, 255580 markings/sec, 245 secs
lola: 40654549 markings, 246931355 edges, 169909 markings/sec, 250 secs
lola: 41475642 markings, 252090775 edges, 164219 markings/sec, 255 secs
lola: 42356187 markings, 257399223 edges, 176109 markings/sec, 260 secs
lola: 43093001 markings, 262281294 edges, 147363 markings/sec, 265 secs
lola: 43832150 markings, 267119374 edges, 147830 markings/sec, 270 secs
lola: 45325117 markings, 273846323 edges, 298593 markings/sec, 275 secs
lola: 45962241 markings, 278422037 edges, 127425 markings/sec, 280 secs
lola: 46993966 markings, 283892234 edges, 206345 markings/sec, 285 secs
lola: 47688480 markings, 288494902 edges, 138903 markings/sec, 290 secs
lola: 48209317 markings, 292748390 edges, 104167 markings/sec, 295 secs
lola: 49199177 markings, 298074267 edges, 197972 markings/sec, 300 secs
lola: 49959331 markings, 303183134 edges, 152031 markings/sec, 305 secs
lola: 50786102 markings, 308450682 edges, 165354 markings/sec, 310 secs
lola: 51963167 markings, 314360487 edges, 235413 markings/sec, 315 secs
lola: 52736867 markings, 319624603 edges, 154740 markings/sec, 320 secs
lola: 53503974 markings, 324610293 edges, 153421 markings/sec, 325 secs
lola: 54117767 markings, 329282904 edges, 122759 markings/sec, 330 secs
lola: 54746414 markings, 334059958 edges, 125729 markings/sec, 335 secs
lola: 55549734 markings, 339119057 edges, 160664 markings/sec, 340 secs
lola: 57008340 markings, 345831315 edges, 291721 markings/sec, 345 secs
lola: 57816998 markings, 350970426 edges, 161732 markings/sec, 350 secs
lola: 58590674 markings, 356103144 edges, 154735 markings/sec, 355 secs
lola: 59291215 markings, 360805569 edges, 140108 markings/sec, 360 secs
lola: 59937871 markings, 364896460 edges, 129331 markings/sec, 365 secs
lola: 60516778 markings, 369052018 edges, 115781 markings/sec, 370 secs
lola: 61132225 markings, 373252249 edges, 123089 markings/sec, 375 secs
lola: 62012629 markings, 378311357 edges, 176081 markings/sec, 380 secs
lola: 62829897 markings, 383306345 edges, 163454 markings/sec, 385 secs
lola: 63930559 markings, 388862905 edges, 220132 markings/sec, 390 secs
lola: 65215102 markings, 395153885 edges, 256909 markings/sec, 395 secs
lola: 66446698 markings, 400991728 edges, 246319 markings/sec, 400 secs
lola: 67370841 markings, 406170553 edges, 184829 markings/sec, 405 secs
lola: 68071037 markings, 410893953 edges, 140039 markings/sec, 410 secs
lola: 68795239 markings, 415762456 edges, 144840 markings/sec, 415 secs
lola: 69493343 markings, 420391526 edges, 139621 markings/sec, 420 secs
lola: 70049392 markings, 424709865 edges, 111210 markings/sec, 425 secs
lola: 70614215 markings, 429181801 edges, 112965 markings/sec, 430 secs
lola: 71357575 markings, 433937889 edges, 148672 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((p18 <= 2) AND (1 <= p5)) OR A (F ((3 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p18 <= 2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p18 <= 2) AND (1 <= p5)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 11 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= p5)))
lola: processed formula length: 23
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 11 will run for 534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((3 <= p20))) AND E (X ((3 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (p20 <= 2))) AND EX((3 <= p11))))
lola: processed formula length: 56
lola: 4 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 12 will run for 668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26)) AND NOT(E (G ((p8 <= p20))))) OR ((p7 <= 2) AND (p8 <= p4) AND ((p16 + 1 <= p9) OR (p8 <= p12)) AND (p25 + 1 <= p23) AND ((p13 <= 0) OR (p18 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 3 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 13 will run for 890 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p20 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p20 + 1 <= p8))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 13 will run for 890 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((p8 <= p2))) U ((p13 <= 2) AND (3 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX((p8 <= p2)) U ((p13 <= 2) AND (3 <= p26)))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 1336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p7 + 1 <= p8) AND (3 <= p27))))
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 72 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 2 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 HouseConstruction-PT-100-CTLCardinality-14.sara
lola: lola: subprocess 15 will run for 2672 seconds at most (--localtimelimit=-1)
========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: (NOT(E (((p26 <= p7) U (2 <= p19)))) OR NOT((E (G ((p8 <= p16))) AND ((1 <= p25) OR (p15 <= p9) OR (p4 + 1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2672 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p7 + 1 <= p26) R (p19 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((p26 <= p7) U (2 <= p19)))
lola: processed formula length: 32
lola: 12 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 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: ((p25 <= 0) AND (p9 + 1 <= p15) AND (p25 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: sara: try reading problem file HouseConstruction-PT-100-CTLCardinality-14.sara.processed formula: ((p25 <= 0) AND (p9 + 1 <= p15) AND (p25 <= p4))

lola: processed formula length: 48
lola: 9 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 3 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes yes no no yes yes yes unknown no no yes yes yes unknown
lola: ========================================
sara: place or transition ordering is non-deterministic

FORMULA HouseConstruction-PT-100-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494728881432

--------------------
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="HouseConstruction-PT-100"
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/HouseConstruction-PT-100.tgz
mv HouseConstruction-PT-100 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 HouseConstruction-PT-100, 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 r028-blw3-149440264600615"
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 '' CTLCardinality.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 ;