About the Execution of LoLA for GPPP-PT-C0100N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12338.790 | 1001160.00 | 1338288.00 | 497.50 | FTFTTFFFTF??TF?F | 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 GPPP-PT-C0100N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264400534
=====================================================================
--------------------
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 GPPP-PT-C0100N0000000100-CTLCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000000100-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494720491238
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ GPPP-PT-C0100N0000000100 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: A (F (((1 <= DHAP) AND ((NADH <= FBP) OR (3 <= _3PG) OR (c2 <= DHAP))))) : ((((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2)) AND A (X (((R5P <= NADPplus) OR (FBP <= Xu5P))))) AND E (F (A (X ((Pi <= G6P)))))) : ((1 <= PEP) OR (A (X ((a1 <= NADplus))) AND (A (G (TRUE)) AND (GAP <= b1)))) : ((((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG)) OR A (G ((Xu5P <= 2)))) OR (A (X ((S7P <= Pyr))) AND ((Ru5P + 1 <= ADP) AND (3 <= a1)))) : A ((A (G ((Pi <= GAP))) U A (G ((_2PG <= NADplus))))) : NOT(NOT((E (X ((2 <= FBP))) OR A (G ((Lac <= c1)))))) : (NOT((((NADPplus <= DHAP) AND (1 <= F6P) AND ((_3PG <= FBP) OR (3 <= a1))) AND E (G ((2 <= PEP))))) AND E (X (E (F ((3 <= FBP)))))) : NOT(E (((Lac <= b2) U ((3 <= _3PG) AND (Lac <= NADplus))))) : E (F (A (G (((3 <= a2) OR (GAP <= ATP)))))) : NOT(A (G (((E4P <= 1) OR (Pi <= 2))))) : A (G (NOT(A (X ((GSSG <= Ru5P)))))) : E (G (E (F ((c1 + 1 <= Xu5P))))) : E (F ((NADPplus <= Lac))) : ((A (G (((1 <= Gluc) OR (_2PG <= ATP)))) AND ()) OR ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2))))) : (A (G (E (G ((3 <= ATP))))) AND (A (X (((b2 <= GSSG)))) OR (E (F ((2 <= Pyr))) AND E (F ((3 <= FBP)))))) : E (F ((3 <= start)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= DHAP) AND ((NADH <= FBP) OR (3 <= _3PG) OR (c2 <= DHAP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= DHAP) AND ((NADH <= FBP) OR (3 <= _3PG) OR (c2 <= DHAP))))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2)) AND A (X (((R5P <= NADPplus) OR (FBP <= Xu5P))))) AND E (F (A (X ((Pi <= G6P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((_3PG <= 2) OR (_3PG + 1 <= Pyr) OR (3 <= c2))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((R5P <= NADPplus) OR (FBP <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((R5P <= NADPplus) OR (FBP <= Xu5P)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((Pi <= G6P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((Pi <= G6P)))
lola: processed formula length: 25
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: lola: ========================================result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= PEP) OR (A (X ((a1 <= NADplus))) AND (A (G (TRUE)) AND (GAP <= b1))))
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: (1 <= PEP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= PEP)
lola: processed formula length: 10
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 1 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((a1 <= NADplus)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((a1 <= NADplus))
lola: processed formula length: 19
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (GAP <= b1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (GAP <= b1)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: 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: ((((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG)) OR A (G ((Xu5P <= 2)))) OR (A (X ((S7P <= Pyr))) AND ((Ru5P + 1 <= ADP) AND (3 <= a1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= FBP) AND (3 <= S7P) AND (GSSG + 1 <= NADplus) AND (Pyr <= _2PG) AND (2 <= NADH) AND (Xu5P + 1 <= GSSG))
lola: processed formula length: 110
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Xu5P <= 2)))
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 84 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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((S7P <= Pyr)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((S7P <= Pyr))
lola: processed formula length: 16
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Ru5P + 1 <= ADP) AND (3 <= a1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Ru5P + 1 <= ADP) AND (3 <= a1))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 2 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((Pi <= GAP))) U A (G ((_2PG <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (GAP + 1 <= Pi))) U NOT(E(TRUE U (NADplus + 1 <= _2PG))))
lola: processed formula length: 72
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 1241277 markings, 8102762 edges, 2750339551317721088 markings/sec, 0 secs
lola: 2426704 markings, 16106581 edges, 237085 markings/sec, 5 secs
lola: 3616514 markings, 24105659 edges, 237962 markings/sec, 10 secs
lola: 4818127 markings, 32166168 edges, 240323 markings/sec, 15 secs
lola: 5995604 markings, 40108150 edges, 235495 markings/sec, 20 secs
lola: 7168844 markings, 48013067 edges, 234648 markings/sec, 25 secs
lola: 8340905 markings, 55922577 edges, 234412 markings/sec, 30 secs
lola: 9517585 markings, 63870419 edges, 235336 markings/sec, 35 secs
lola: 10690916 markings, 71772889 edges, 234666 markings/sec, 40 secs
lola: 11877334 markings, 79736693 edges, 237284 markings/sec, 45 secs
lola: 13053325 markings, 87641035 edges, 235198 markings/sec, 50 secs
lola: 14230289 markings, 95575705 edges, 235393 markings/sec, 55 secs
lola: 15401145 markings, 103471388 edges, 234171 markings/sec, 60 secs
lola: 16564105 markings, 111306137 edges, 232592 markings/sec, 65 secs
lola: 17727060 markings, 119151769 edges, 232591 markings/sec, 70 secs
lola: 18885640 markings, 126969181 edges, 231716 markings/sec, 75 secs
lola: 20064377 markings, 134919192 edges, 235747 markings/sec, 80 secs
lola: 21235785 markings, 142800761 edges, 234282 markings/sec, 85 secs
lola: 22400417 markings, 150623375 edges, 232926 markings/sec, 90 secs
lola: 23574508 markings, 158515315 edges, 234818 markings/sec, 95 secs
lola: 24747270 markings, 166420685 edges, 234552 markings/sec, 100 secs
lola: 25912001 markings, 174270804 edges, 232946 markings/sec, 105 secs
lola: 27058804 markings, 182000791 edges, 229361 markings/sec, 110 secs
lola: 28225757 markings, 189863136 edges, 233391 markings/sec, 115 secs
lola: 29384628 markings, 197681274 edges, 231774 markings/sec, 120 secs
lola: 30544233 markings, 205504399 edges, 231921 markings/sec, 125 secs
lola: 31698996 markings, 213291342 edges, 230953 markings/sec, 130 secs
lola: 32854896 markings, 221080373 edges, 231180 markings/sec, 135 secs
lola: 34009475 markings, 228854492 edges, 230916 markings/sec, 140 secs
lola: 35177755 markings, 236714395 edges, 233656 markings/sec, 145 secs
lola: 36334146 markings, 244490737 edges, 231278 markings/sec, 150 secs
lola: 37463552 markings, 252107770 edges, 225881 markings/sec, 155 secs
lola: 38597271 markings, 259749256 edges, 226744 markings/sec, 160 secs
lola: 39784703 markings, 267713705 edges, 237486 markings/sec, 165 secs
lola: 40930443 markings, 275427428 edges, 229148 markings/sec, 170 secs
lola: 42132451 markings, 283542611 edges, 240402 markings/sec, 175 secs
lola: 43307543 markings, 291465667 edges, 235018 markings/sec, 180 secs
lola: 44477382 markings, 299359732 edges, 233968 markings/sec, 185 secs
lola: 45657604 markings, 307324307 edges, 236044 markings/sec, 190 secs
lola: 46811713 markings, 315095230 edges, 230822 markings/sec, 195 secs
lola: 47944195 markings, 322724258 edges, 226496 markings/sec, 200 secs
lola: 49126718 markings, 330671404 edges, 236505 markings/sec, 205 secs
lola: 50343925 markings, 338848732 edges, 243441 markings/sec, 210 secs
lola: 51586284 markings, 347246086 edges, 248472 markings/sec, 215 secs
lola: 52738685 markings, 355020187 edges, 230480 markings/sec, 220 secs
lola: 53973188 markings, 363303335 edges, 246901 markings/sec, 225 secs
lola: 55239991 markings, 371840755 edges, 253361 markings/sec, 230 secs
lola: 56449304 markings, 380183895 edges, 241863 markings/sec, 235 secs
lola: 57525808 markings, 388118930 edges, 215301 markings/sec, 240 secs
lola: 58610059 markings, 396087854 edges, 216850 markings/sec, 245 secs
lola: 59686549 markings, 403991388 edges, 215298 markings/sec, 250 secs
lola: 60737301 markings, 411724336 edges, 210150 markings/sec, 255 secs
lola: 61818918 markings, 419689662 edges, 216323 markings/sec, 260 secs
lola: 62894686 markings, 427615808 edges, 215154 markings/sec, 265 secs
lola: 63930109 markings, 435229597 edges, 207085 markings/sec, 270 secs
lola: 64963778 markings, 442832324 edges, 206734 markings/sec, 275 secs
lola: 65995798 markings, 450420945 edges, 206404 markings/sec, 280 secs
lola: 67039746 markings, 458108251 edges, 208790 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (X ((2 <= FBP))) OR A (G ((Lac <= c1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= FBP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= FBP))
lola: processed formula length: 14
lola: 15 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Lac <= c1)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2905534 markings, 8896596 edges, 581107 markings/sec, 0 secs
lola: sara is running 5 secs || 5623305 markings, 17279728 edges, 543554 markings/sec, 5 secs
lola: sara is running 10 secs || 8330462 markings, 25622640 edges, 541431 markings/sec, 10 secs
lola: sara is running 15 secs || 11001454 markings, 33884886 edges, 534198 markings/sec, 15 secs
lola: sara is running 20 secs || 13696596 markings, 42209647 edges, 539028 markings/sec, 20 secs
lola: sara is running 25 secs || 16379449 markings, 50493291 edges, 536571 markings/sec, 25 secs
lola: sara is running 30 secs || 19092165 markings, 58870632 edges, 542543 markings/sec, 30 secs
lola: sara is running 35 secs || 21824286 markings, 67343640 edges, 546424 markings/sec, 35 secs
lola: sara is running 40 secs || 24550862 markings, 75842546 edges, 545315 markings/sec, 40 secs
lola: sara is running 45 secs || 27252720 markings, 84246319 edges, 540372 markings/sec, 45 secs
lola: sara is running 50 secs || 29942395 markings, 92614903 edges, 537935 markings/sec, 50 secs
lola: sara is running 55 secs || 32601458 markings, 100885932 edges, 531813 markings/sec, 55 secs
lola: sara is running 60 secs || 35245230 markings, 109109846 edges, 528754 markings/sec, 60 secs
lola: sara is running 65 secs || 37898587 markings, 117363494 edges, 530671 markings/sec, 65 secs
lola: sara is running 70 secs || 40548699 markings, 125606875 edges, 530022 markings/sec, 70 secs
lola: sara is running 75 secs || 43153205 markings, 133708707 edges, 520901 markings/sec, 75 secs
lola: sara is running 80 secs || 45788403 markings, 141905893 edges, 527040 markings/sec, 80 secs
lola: sara is running 85 secs || 48486906 markings, 150299537 edges, 539701 markings/sec, 85 secs
lola: sara is running 90 secs || 51154551 markings, 158596725 edges, 533529 markings/sec, 90 secs
lola: sara is running 95 secs || 53772204 markings, 166738834 edges, 523531 markings/sec, 95 secs
lola: sara is running 100 secs || 56406664 markings, 174933116 edges, 526892 markings/sec, 100 secs
lola: sara is running 105 secs || 59093550 markings, 183290360 edges, 537377 markings/sec, 105 secs
lola: sara is running 110 secs || 61769654 markings, 191613578 edges, 535221 markings/sec, 110 secs
lola: sara is running 115 secs || 64436796 markings, 199908710 edges, 533428 markings/sec, 115 secs
lola: sara is running 120 secs || 67099362 markings, 208190999 edges, 532513 markings/sec, 120 secs
lola: sara is running 125 secs || 69752157 markings, 216440908 edges, 530559 markings/sec, 125 secs
lola: sara is running 130 secs || 72377791 markings, 224606893 edges, 525127 markings/sec, 130 secs
lola: sara is running 135 secs || 74977104 markings, 232690960 edges, 519863 markings/sec, 135 secs
lola: sara is running 140 secs || 77596912 markings, 240838876 edges, 523962 markings/sec, 140 secs
lola: sara is running 145 secs || 80196141 markings, 248922585 edges, 519846 markings/sec, 145 secs
lola: sara is running 150 secs || 82773913 markings, 256939375 edges, 515554 markings/sec, 150 secs
lola: sara is running 155 secs || 85338776 markings, 264916313 edges, 512973 markings/sec, 155 secs
lola: sara is running 160 secs || 87911233 markings, 273274075 edges, 514491 markings/sec, 160 secs
lola: sara is running 165 secs || 90557562 markings, 282223800 edges, 529266 markings/sec, 165 secs
lola: sara is running 170 secs || 92956455 markings, 290402802 edges, 479779 markings/sec, 170 secs
lola: sara is running 175 secs || 95349047 markings, 298536492 edges, 478518 markings/sec, 175 secs
lola: sara is running 180 secs || 97752391 markings, 306705965 edges, 480669 markings/sec, 180 secs
lola: sara is running 185 secs || 100151351 markings, 314859542 edges, 479792 markings/sec, 185 secs
lola: sara is running 190 secs || 102567577 markings, 323070825 edges, 483245 markings/sec, 190 secs
lola: sara is running 195 secs || 104799640 markings, 330847155 edges, 446413 markings/sec, 195 secs
lola: sara is running 200 secs || 107010353 markings, 338614349 edges, 442143 markings/sec, 200 secs
lola: sara is running 205 secs || 109187967 markings, 346233819 edges, 435523 markings/sec, 205 secs
lola: sara is running 210 secs || 111350280 markings, 353853028 edges, 432463 markings/sec, 210 secs
lola: sara is running 215 secs || 113539228 markings, 361531367 edges, 437790 markings/sec, 215 secs
lola: sara is running 220 secs || 115663907 markings, 369058633 edges, 424936 markings/sec, 220 secs
lola: sara is running 225 secs || 117642814 markings, 376049990 edges, 395781 markings/sec, 225 secs
lola: sara is running 230 secs || 119618853 markings, 383031906 edges, 395208 markings/sec, 230 secs
lola: sara is running 235 secs || 121606126 markings, 390053645 edges, 397455 markings/sec, 235 secs
lola: sara is running 240 secs || 123563051 markings, 396967090 edges, 391385 markings/sec, 240 secs
lola: sara is running 245 secs || 125538281 markings, 403945975 edges, 395046 markings/sec, 245 secs
lola: sara is running 250 secs || 127525157 markings, 410965285 edges, 397375 markings/sec, 250 secs
lola: sara is running 255 secs || 129510256 markings, 417978346 edges, 397020 markings/sec, 255 secs
lola: sara is running 260 secs || 131506698 markings, 425032292 edges, 399288 markings/sec, 260 secs
lola: sara is running 265 secs || 133470435 markings, 431969143 edges, 392747 markings/sec, 265 secs
lola: sara is running 270 secs || 135509789 markings, 439173917 edges, 407871 markings/sec, 270 secs
lola: sara is running 275 secs || 137519184 markings, 446273056 edges, 401879 markings/sec, 275 secs
lola: sara is running 280 secs || 139553300 markings, 453458801 edges, 406823 markings/sec, 280 secs
lola: sara is running 285 secs || 141606956 markings, 460713552 edges, 410731 markings/sec, 285 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 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((NADPplus <= DHAP) AND (1 <= F6P) AND ((_3PG <= FBP) OR (3 <= a1))) AND E (G ((2 <= PEP))))) AND E (X (E (F ((3 <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((DHAP + 1 <= NADPplus) OR (F6P <= 0) OR ((FBP + 1 <= _3PG) AND (a1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((DHAP + 1 <= NADPplus) OR (F6P <= 0) OR ((FBP + 1 <= _3PG) AND (a1 <= 2)))
lola: processed formula length: 77
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 4 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 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= FBP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (3 <= FBP)))
lola: processed formula length: 24
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((Lac <= b2) U ((3 <= _3PG) AND (Lac <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((Lac <= b2) U ((3 <= _3PG) AND (Lac <= NADplus))))
lola: processed formula length: 56
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= a2) OR (GAP <= ATP))))))
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 ((a2 <= 2) AND (ATP + 1 <= GAP)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 1242768 markings, 8031660 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2395193 markings, 15789812 edges, 230485 markings/sec, 5 secs
lola: 3550550 markings, 23573235 edges, 231071 markings/sec, 10 secs
lola: 4715805 markings, 31437636 edges, 233051 markings/sec, 15 secs
lola: 5861230 markings, 39138659 edges, 229085 markings/sec, 20 secs
lola: 7006537 markings, 46839852 edges, 229061 markings/sec, 25 secs
lola: 8169950 markings, 54658740 edges, 232683 markings/sec, 30 secs
lola: 9324995 markings, 62410581 edges, 231009 markings/sec, 35 secs
lola: 10490554 markings, 70235711 edges, 233112 markings/sec, 40 secs
lola: 11648475 markings, 78013932 edges, 231584 markings/sec, 45 secs
lola: 12810968 markings, 85836077 edges, 232499 markings/sec, 50 secs
lola: 13962473 markings, 93575662 edges, 230301 markings/sec, 55 secs
lola: 15105184 markings, 101259155 edges, 228542 markings/sec, 60 secs
lola: 16226019 markings, 108801598 edges, 224167 markings/sec, 65 secs
lola: 17354276 markings, 116390745 edges, 225651 markings/sec, 70 secs
lola: 18487155 markings, 124007104 edges, 226576 markings/sec, 75 secs
lola: 19628640 markings, 131684187 edges, 228297 markings/sec, 80 secs
lola: 20787346 markings, 139469920 edges, 231741 markings/sec, 85 secs
lola: 21933472 markings, 147178963 edges, 229225 markings/sec, 90 secs
lola: 23095899 markings, 154996331 edges, 232485 markings/sec, 95 secs
lola: 24264102 markings, 162841374 edges, 233641 markings/sec, 100 secs
lola: 25424841 markings, 170650196 edges, 232148 markings/sec, 105 secs
lola: 26576779 markings, 178407747 edges, 230388 markings/sec, 110 secs
lola: 27731033 markings, 186184420 edges, 230851 markings/sec, 115 secs
lola: 28878424 markings, 193909803 edges, 229478 markings/sec, 120 secs
lola: 30037538 markings, 201712705 edges, 231823 markings/sec, 125 secs
lola: 31185222 markings, 209431432 edges, 229537 markings/sec, 130 secs
lola: 32314832 markings, 217025970 edges, 225922 markings/sec, 135 secs
lola: 33461929 markings, 224740619 edges, 229419 markings/sec, 140 secs
lola: 34604626 markings, 232428287 edges, 228539 markings/sec, 145 secs
lola: 35735194 markings, 240028291 edges, 226114 markings/sec, 150 secs
lola: 36873786 markings, 247684770 edges, 227718 markings/sec, 155 secs
lola: 38036188 markings, 255496079 edges, 232480 markings/sec, 160 secs
lola: 39228938 markings, 263482072 edges, 238550 markings/sec, 165 secs
lola: 40391864 markings, 271307829 edges, 232585 markings/sec, 170 secs
lola: 41579830 markings, 279289661 edges, 237593 markings/sec, 175 secs
lola: 42774688 markings, 287320063 edges, 238972 markings/sec, 180 secs
lola: 43962205 markings, 295350997 edges, 237503 markings/sec, 185 secs
lola: 45142631 markings, 303283359 edges, 236085 markings/sec, 190 secs
lola: 46343976 markings, 311324399 edges, 240269 markings/sec, 195 secs
lola: 47545117 markings, 319403552 edges, 240228 markings/sec, 200 secs
lola: 48750313 markings, 327504521 edges, 241039 markings/sec, 205 secs
lola: 49951173 markings, 335622950 edges, 240172 markings/sec, 210 secs
lola: 51168771 markings, 343774960 edges, 243520 markings/sec, 215 secs
lola: 52377343 markings, 351897372 edges, 241714 markings/sec, 220 secs
lola: 53581878 markings, 359993405 edges, 240907 markings/sec, 225 secs
lola: 54774606 markings, 368060867 edges, 238546 markings/sec, 230 secs
lola: 55988033 markings, 376185383 edges, 242685 markings/sec, 235 secs
lola: 57063207 markings, 383992190 edges, 215035 markings/sec, 240 secs
lola: 58108625 markings, 391693884 edges, 209084 markings/sec, 245 secs
lola: 59161901 markings, 399458616 edges, 210655 markings/sec, 250 secs
lola: 60210475 markings, 407186470 edges, 209715 markings/sec, 255 secs
lola: 61258038 markings, 414910727 edges, 209513 markings/sec, 260 secs
lola: 62303938 markings, 422624954 edges, 209180 markings/sec, 265 secs
lola: 63354999 markings, 430372170 edges, 210212 markings/sec, 270 secs
lola: 64393437 markings, 438027110 edges, 207688 markings/sec, 275 secs
lola: 65427438 markings, 445653482 edges, 206800 markings/sec, 280 secs
lola: 66481715 markings, 453422683 edges, 210855 markings/sec, 285 secs
lola: 67525903 markings, 461121788 edges, 208838 markings/sec, 290 secs
lola: 68568443 markings, 468806161 edges, 208508 markings/sec, 295 secs
lola: 69583516 markings, 476302223 edges, 203015 markings/sec, 300 secs
lola: 70614592 markings, 483905749 edges, 206215 markings/sec, 305 secs
lola: 71659091 markings, 491607060 edges, 208900 markings/sec, 310 secs
lola: 72684778 markings, 499141195 edges, 205137 markings/sec, 315 secs
lola: 73706507 markings, 506675001 edges, 204346 markings/sec, 320 secs
lola: 74724220 markings, 514180166 edges, 203543 markings/sec, 325 secs
lola: 75754786 markings, 521775455 edges, 206113 markings/sec, 330 secs
lola: 76584372 markings, 527882538 edges, 165917 markings/sec, 335 secs
lola: 77635149 markings, 535627625 edges, 210155 markings/sec, 340 secs
lola: 78677590 markings, 543306862 edges, 208488 markings/sec, 345 secs
lola: 79718567 markings, 550989799 edges, 208195 markings/sec, 350 secs
lola: 80770741 markings, 558744943 edges, 210435 markings/sec, 355 secs
lola: 81813978 markings, 566435134 edges, 208647 markings/sec, 360 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 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((E4P <= 1) OR (Pi <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 GPPP-PT-C0100N0000000100-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((GSSG <= Ru5P))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((Ru5P + 1 <= GSSG)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 11 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((c1 + 1 <= Xu5P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (c1 + 1 <= Xu5P)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 12 will run for 644 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NADPplus <= Lac)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-CTLCardinality-12.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= Gluc) OR (_2PG <= ATP)))) AND ()) OR ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Gluc) OR (_2PG <= ATP))))
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 84 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
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-12.sara.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= DHAP) AND (_1_3_BPG <= GSSG) AND (GAP + 1 <= _2PG) AND (ATP <= c2) AND ((2 <= c1) OR (2 <= start) OR (a1 <= 2) OR (((3 <= b1) OR (3 <= start)) AND (_3PG <= 2))))
lola: processed formula length: 172
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: processed formula with 10 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
sara: lola: place or transition ordering is non-deterministic
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((3 <= ATP))))) AND (A (X (((b2 <= GSSG)))) OR (E (F ((2 <= Pyr))) AND E (F ((3 <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((3 <= ATP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (ATP <= 2))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 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: subprocess 15 will run for 2578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= start)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-CTLCardinality-15.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4300456 markings, 7719650 edges, 860091 markings/sec, 0 secs
lola: sara is running 5 secs || 8398807 markings, 15108262 edges, 819670 markings/sec, 5 secs
lola: sara is running 10 secs || 12504597 markings, 22523024 edges, 821158 markings/sec, 10 secs
lola: sara is running 15 secs || 16664932 markings, 30020644 edges, 832067 markings/sec, 15 secs
lola: sara is running 20 secs || 20985067 markings, 37863746 edges, 864027 markings/sec, 20 secs
lola: sara is running 25 secs || 24291304 markings, 43847625 edges, 661247 markings/sec, 25 secs
lola: sara is running 30 secs || 28526323 markings, 51512097 edges, 847004 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no unknown unknown yes no unknown no no yes yes no no no
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494721492398
--------------------
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="GPPP-PT-C0100N0000000100"
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/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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 GPPP-PT-C0100N0000000100, 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-149440264400534"
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 ;