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 S_GPPP-PT-C0001N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612500525
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496393668162


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C0001N0000000100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_GPPP-PT-C0001N0000000100 @ 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, 20 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-C0001N0000000100-CTLCardinality.task
lola: E (F (A (X (((3 <= Lac) AND (1 <= b2)))))) : A (G (((R5P + 1 <= _1_3_BPG) OR (PEP + 1 <= Pi) OR (b2 + 1 <= ATP) OR (ATP <= 0)))) : A (G (E (F (((c1 <= FBP) AND (3 <= _1_3_BPG)))))) : NOT((E (F ((3 <= _1_3_BPG))) OR E (X ((NADPH + 1 <= Lac))))) : (((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2)) AND E (F (A (F ((3 <= R5P)))))) : (E (F ((3 <= PEP))) OR (Xu5P + 1 <= Lac)) : (((3 <= _2PG) AND (3 <= Pyr)) OR E (F (((1 <= start) AND (1 <= a2) AND (2 <= Lac))))) : E (G ((A (G ((3 <= GSSG))) OR A (X ((3 <= GSH)))))) : A (X (((b2 <= GSH) AND A (G (TRUE))))) : A (G (E (((b1 <= GSSG) U (NADplus <= FBP))))) : A (G (E (G ((Lac <= 2))))) : (E (G ((((DHAP <= start) OR (GSSG <= start)) AND (R5P <= S7P)))) OR (A (G ((Gluc <= ATP))) AND A (F ((NADPH <= c2))))) : E (G (NOT(E (F ((2 <= _2PG)))))) : A (F (E (((S7P <= Ru5P) U (3 <= start))))) : E (((((2 <= S7P) OR (2 <= a1)) AND ((_2PG <= b2) OR (2 <= GSSG))) U ((3 <= c2) AND (1 <= b1) AND (ATP <= 2)))) : A (G ((((1 <= S7P) OR (c2 <= GSH) OR (a1 + 1 <= NADplus)) OR E (F ((2 <= Gluc))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((3 <= Lac) AND (1 <= b2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((3 <= Lac) AND (1 <= b2))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 1669046 markings, 9359492 edges, 2419320305781571584 markings/sec, 0 secs
lola: 3025908 markings, 17448473 edges, 271372 markings/sec, 5 secs
lola: 4350345 markings, 25252386 edges, 264887 markings/sec, 10 secs
lola: 5605538 markings, 32739436 edges, 251039 markings/sec, 15 secs
lola: 6987799 markings, 40876544 edges, 276452 markings/sec, 20 secs
lola: 8320513 markings, 48745222 edges, 266543 markings/sec, 25 secs
lola: 9581149 markings, 56135456 edges, 252127 markings/sec, 30 secs
lola: 10906597 markings, 63949944 edges, 265090 markings/sec, 35 secs
lola: 12206525 markings, 71600857 edges, 259986 markings/sec, 40 secs
lola: 13594595 markings, 79696513 edges, 277614 markings/sec, 45 secs
lola: 14953740 markings, 87700030 edges, 271829 markings/sec, 50 secs
lola: 16198279 markings, 95030548 edges, 248908 markings/sec, 55 secs
lola: 17509889 markings, 102757208 edges, 262322 markings/sec, 60 secs
lola: 18473918 markings, 108664656 edges, 192806 markings/sec, 65 secs
lola: 19422817 markings, 114494061 edges, 189780 markings/sec, 70 secs
lola: 20424152 markings, 120649458 edges, 200267 markings/sec, 75 secs
lola: 21382795 markings, 126549581 edges, 191729 markings/sec, 80 secs
lola: 22341178 markings, 132445020 edges, 191677 markings/sec, 85 secs
lola: 23359426 markings, 138706406 edges, 203650 markings/sec, 90 secs
lola: 24284729 markings, 144164997 edges, 185061 markings/sec, 95 secs
lola: 25311546 markings, 149994184 edges, 205363 markings/sec, 100 secs
lola: 26363494 markings, 156331167 edges, 210390 markings/sec, 105 secs
lola: 27507028 markings, 163163176 edges, 228707 markings/sec, 110 secs
lola: 28776810 markings, 170623703 edges, 253956 markings/sec, 115 secs
lola: 30024418 markings, 177956861 edges, 249522 markings/sec, 120 secs
lola: 31263338 markings, 185218045 edges, 247784 markings/sec, 125 secs
lola: 32458529 markings, 192238809 edges, 239038 markings/sec, 130 secs
lola: 33733232 markings, 199630335 edges, 254941 markings/sec, 135 secs
lola: 34982843 markings, 206856600 edges, 249922 markings/sec, 140 secs
lola: 36263849 markings, 213874804 edges, 256201 markings/sec, 145 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((R5P + 1 <= _1_3_BPG) OR (PEP + 1 <= Pi) OR (b2 + 1 <= ATP) OR (ATP <= 0))))
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 80 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: ========================================
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000100-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((c1 <= FBP) AND (3 <= _1_3_BPG))))))
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 ((c1 <= FBP) AND (3 <= _1_3_BPG))))))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((3 <= _1_3_BPG))) OR E (X ((NADPH + 1 <= Lac)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_1_3_BPG <= 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 80 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: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality-3.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2)) AND E (F (A (F ((3 <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= Ru5P) OR (1 <= a1) OR (_2PG <= 2))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-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 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((3 <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (3 <= R5P)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: lola: ========================================
using 80 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: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= PEP))) OR (Xu5P + 1 <= Lac))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= PEP)))
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 80 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= _2PG) AND (3 <= Pyr)) OR E (F (((1 <= start) AND (1 <= a2) AND (2 <= Lac)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= _2PG) AND (3 <= Pyr))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= _2PG) AND (3 <= Pyr))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-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: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= start) AND (1 <= a2) AND (2 <= 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 80 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0001N0000000100-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000100-CTLCardinality-7.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: SUBRESULTlola:
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((3 <= GSSG))) OR A (X ((3 <= GSH))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (GSSG <= 2)) AND NOT(AX((3 <= GSH))))))
lola: processed formula length: 62
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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 8 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((b2 <= GSH) AND A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((b2 <= GSH))
lola: processed formula length: 15
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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 9 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((b1 <= GSSG) U (NADplus <= FBP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((b1 <= GSSG) U (NADplus <= FBP)))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 3004834 markings, 7894902 edges, 3096159597753270272 markings/sec, 0 secs
lola: 5647176 markings, 15028423 edges, 528468 markings/sec, 5 secs
lola: 8370487 markings, 22188683 edges, 544662 markings/sec, 10 secs
lola: 10784051 markings, 28928297 edges, 482713 markings/sec, 15 secs
lola: 13466789 markings, 36067064 edges, 536548 markings/sec, 20 secs
lola: 16106358 markings, 43199380 edges, 527914 markings/sec, 25 secs
lola: 18444801 markings, 49805177 edges, 467689 markings/sec, 30 secs
lola: 21122311 markings, 56988384 edges, 535502 markings/sec, 35 secs
lola: 23662796 markings, 63935406 edges, 508097 markings/sec, 40 secs
lola: 26117131 markings, 70503563 edges, 490867 markings/sec, 45 secs
lola: 28628870 markings, 77396875 edges, 502348 markings/sec, 50 secs
lola: 31150311 markings, 84141212 edges, 504288 markings/sec, 55 secs
lola: 33554306 markings, 90752172 edges, 480799 markings/sec, 60 secs
lola: 35958903 markings, 97200454 edges, 480919 markings/sec, 65 secs
lola: 38446874 markings, 103990080 edges, 497594 markings/sec, 70 secs
lola: 41067700 markings, 110953856 edges, 524165 markings/sec, 75 secs
lola: 43473812 markings, 117582593 edges, 481222 markings/sec, 80 secs
lola: 46034110 markings, 124424825 edges, 512060 markings/sec, 85 secs
lola: 47750517 markings, 129833046 edges, 343281 markings/sec, 90 secs
lola: 49533265 markings, 135230318 edges, 356550 markings/sec, 95 secs
lola: 51818905 markings, 141644312 edges, 457128 markings/sec, 100 secs
lola: 54088816 markings, 147849870 edges, 453982 markings/sec, 105 secs
lola: 56393948 markings, 154243612 edges, 461026 markings/sec, 110 secs
lola: 58268577 markings, 160043165 edges, 374926 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((Lac <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (3 <= Lac))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((DHAP <= start) OR (GSSG <= start)) AND (R5P <= S7P)))) OR (A (G ((Gluc <= ATP))) AND A (F ((NADPH <= c2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((DHAP <= start) OR (GSSG <= start)) AND (R5P <= S7P))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((start + 1 <= DHAP) AND (start + 1 <= GSSG)) OR (S7P + 1 <= R5P))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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 12 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Gluc <= 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 80 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-C0001N0000000100-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0001N0000000100-CTLCardinality-12.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1087 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NADPH <= c2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NADPH <= c2))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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 12 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (F ((2 <= _2PG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (2 <= _2PG))))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: subprocess 13 will run for 1087 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((S7P <= Ru5P) U (3 <= start)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((S7P <= Ru5P) U (3 <= start)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: subprocess 14 will run for 1631 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((2 <= S7P) OR (2 <= a1)) AND ((_2PG <= b2) OR (2 <= GSSG))) U ((3 <= c2) AND (1 <= b1) AND (ATP <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((2 <= S7P) OR (2 <= a1)) AND ((_2PG <= b2) OR (2 <= GSSG))) U ((3 <= c2) AND (1 <= b1) AND (ATP <= 2)))
lola: processed formula length: 109
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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 15 will run for 3263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= S7P) OR (c2 <= GSH) OR (a1 + 1 <= NADplus)) OR E (F ((2 <= Gluc))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((S7P <= 0) AND (GSH + 1 <= c2) AND (NADplus <= a1)) AND NOT(E(TRUE U (2 <= Gluc))))))
lola: processed formula length: 100
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0001N0000000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 2962875 markings, 7160608 edges, 2806861595810988032 markings/sec, 0 secs
lola: 5799023 markings, 14222013 edges, 567230 markings/sec, 5 secs
lola: 8447615 markings, 20869158 edges, 529718 markings/sec, 10 secs
lola: 10985580 markings, 27284614 edges, 507593 markings/sec, 15 secs
lola: 13505286 markings, 33658025 edges, 503941 markings/sec, 20 secs
lola: 16203447 markings, 40390807 edges, 539632 markings/sec, 25 secs
lola: 18803079 markings, 46834054 edges, 519926 markings/sec, 30 secs
lola: 21277448 markings, 53048294 edges, 494874 markings/sec, 35 secs
lola: 23742529 markings, 59224850 edges, 493016 markings/sec, 40 secs
lola: 26236177 markings, 65484039 edges, 498730 markings/sec, 45 secs
lola: 28684823 markings, 71563421 edges, 489729 markings/sec, 50 secs
lola: 31108812 markings, 77678892 edges, 484798 markings/sec, 55 secs
lola: 33440635 markings, 83558277 edges, 466365 markings/sec, 60 secs
lola: 35834812 markings, 89565645 edges, 478835 markings/sec, 65 secs
lola: 38342246 markings, 95838144 edges, 501487 markings/sec, 70 secs
lola: 40899205 markings, 102234722 edges, 511392 markings/sec, 75 secs
lola: 43294046 markings, 108192812 edges, 478968 markings/sec, 80 secs
lola: 45630037 markings, 114111655 edges, 467198 markings/sec, 85 secs
lola: 47983560 markings, 120034050 edges, 470705 markings/sec, 90 secs
lola: 50379223 markings, 126058830 edges, 479133 markings/sec, 95 secs
lola: 51645744 markings, 130186632 edges, 253304 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no no yes no no yes no no no yes
lola: ========================================
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496394051830

--------------------
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="S_GPPP-PT-C0001N0000000100"
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/S_GPPP-PT-C0001N0000000100.tgz
mv S_GPPP-PT-C0001N0000000100 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 S_GPPP-PT-C0001N0000000100, 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 r108-blw3-149441612500525"
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 ;