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

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

=== Now, execution of the tool begins

BK_START 1494724675285


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-CTLCardinality.task
lola: A (X (E (F ((1 <= Pyr))))) : NOT(A (G ((S7P <= c1)))) : (E (G ((GAP <= _1_3_BPG))) AND (E (((1 <= E4P) U (c2 <= _2PG))) OR (((GAP <= GSSG) AND (c1 <= start) AND (c1 + 1 <= Lac)) AND E (X ((Gluc <= FBP)))))) : A (G (((2 <= DHAP) OR (((G6P <= ADP) OR (R5P <= Gluc)) AND ((2 <= NADplus) OR (GSH <= NADH)))))) : E ((((c1 <= 0) OR (_2PG <= 2)) U ((F6P + 1 <= Pyr) AND (a2 + 1 <= DHAP)))) : E (((1 <= DHAP) U E (G ((3 <= b1))))) : (((((3 <= Pyr)) OR (c1 <= DHAP)) OR A (G ((3 <= NADPplus)))) OR (A (((c1 <= DHAP) U (3 <= PEP))) AND (Ru5P <= GSH))) : ((((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2))) OR A (G ((Pyr <= 1)))) OR (1 <= NADH)) : E (F ((((2 <= a2) OR (Ru5P <= GSSG)) AND (2 <= a2) AND (NADPplus <= b1) AND (PEP <= 1)))) : E ((((_3PG <= ATP) OR (3 <= a2)) U A (G ((3 <= GSSG))))) : E (F (((3 <= F6P) AND ((GSSG <= NADH) OR (3 <= _2PG) OR (1 <= G6P) OR (GSH <= b1))))) : E (F ((A (X ((2 <= Lac))) AND E (X ((1 <= b1)))))) : E (G (A (((3 <= a1) U (b2 <= _1_3_BPG))))) : A (F ((A (G ((GAP <= NADPplus))) AND A (G ((2 <= NADPplus)))))) : A (X (NOT(E (G ((DHAP <= E4P)))))) : A (G (A (F (((a2 <= ADP) AND (1 <= ADP))))))
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 (X (E (F ((1 <= Pyr)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (1 <= Pyr)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((S7P <= c1))))
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-C1000N0000000010-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3206282 markings, 8971686 edges, 641256 markings/sec, 0 secs
lola: sara is running 5 secs || 5958608 markings, 16600288 edges, 550465 markings/sec, 5 secs
lola: sara is running 10 secs || 8598239 markings, 23904783 edges, 527926 markings/sec, 10 secs
lola: sara is running 15 secs || 11298492 markings, 31378983 edges, 540051 markings/sec, 15 secs
lola: sara is running 20 secs || 13965274 markings, 38830744 edges, 533356 markings/sec, 20 secs
lola: sara is running 25 secs || 16609460 markings, 46598359 edges, 528837 markings/sec, 25 secs
lola: sara is running 30 secs || 19171671 markings, 54403798 edges, 512442 markings/sec, 30 secs
lola: sara is running 35 secs || 21425917 markings, 61653457 edges, 450849 markings/sec, 35 secs
lola: sara is running 40 secs || 23683288 markings, 69030921 edges, 451474 markings/sec, 40 secs
lola: sara is running 45 secs || 25890706 markings, 76272351 edges, 441484 markings/sec, 45 secs
lola: sara is running 50 secs || 28138229 markings, 83660221 edges, 449505 markings/sec, 50 secs
lola: sara is running 55 secs || 30281965 markings, 90707817 edges, 428747 markings/sec, 55 secs
lola: sara is running 60 secs || 32600043 markings, 98200054 edges, 463616 markings/sec, 60 secs
lola: sara is running 65 secs || 35046766 markings, 105984935 edges, 489345 markings/sec, 65 secs
lola: sara is running 70 secs || 37273667 markings, 113763345 edges, 445380 markings/sec, 70 secs
lola: sara is running 75 secs || 39196467 markings, 120071219 edges, 384560 markings/sec, 75 secs
lola: sara is running 80 secs || 41526326 markings, 128007798 edges, 465972 markings/sec, 80 secs
lola: sara is running 85 secs || 43492011 markings, 134663135 edges, 393137 markings/sec, 85 secs
lola: sara is running 90 secs || 45759406 markings, 142215590 edges, 453479 markings/sec, 90 secs
lola: sara is running 95 secs || 47870039 markings, 149381683 edges, 422127 markings/sec, 95 secs
lola: sara is running 100 secs || 49941269 markings, 156523844 edges, 414246 markings/sec, 100 secs
lola: sara is running 105 secs || 52069116 markings, 163874420 edges, 425569 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((GAP <= _1_3_BPG))) AND (E (((1 <= E4P) U (c2 <= _2PG))) OR (((GAP <= GSSG) AND (c1 <= start) AND (c1 + 1 <= Lac)) AND E (X ((Gluc <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((GAP <= _1_3_BPG)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (_1_3_BPG + 1 <= GAP)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 3573475 markings, 7626762 edges, 714695 markings/sec, 0 secs
lola: 6396589 markings, 14544084 edges, 564623 markings/sec, 5 secs
lola: 8237776 markings, 20511268 edges, 368237 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= DHAP) OR (((G6P <= ADP) OR (R5P <= Gluc)) AND ((2 <= NADplus) OR (GSH <= NADH))))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2746544 markings, 8551895 edges, 549309 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((c1 <= 0) OR (_2PG <= 2)) U ((F6P + 1 <= Pyr) AND (a2 + 1 <= DHAP))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((c1 <= 0) OR (_2PG <= 2)) U ((F6P + 1 <= Pyr) AND (a2 + 1 <= DHAP)))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1577651 markings, 9206651 edges, 315530 markings/sec, 0 secs
lola: 2968915 markings, 17935868 edges, 278253 markings/sec, 5 secs
lola: 4263226 markings, 26288127 edges, 258862 markings/sec, 10 secs
lola: 5596406 markings, 35031653 edges, 266636 markings/sec, 15 secs
lola: 6864890 markings, 43329850 edges, 253697 markings/sec, 20 secs
lola: 8076960 markings, 51631211 edges, 242414 markings/sec, 25 secs
lola: 9250144 markings, 59148990 edges, 234637 markings/sec, 30 secs
lola: 10532490 markings, 67038383 edges, 256469 markings/sec, 35 secs
lola: 11652546 markings, 74783933 edges, 224011 markings/sec, 40 secs
lola: 12928426 markings, 83101225 edges, 255176 markings/sec, 45 secs
lola: 14143601 markings, 91081502 edges, 243035 markings/sec, 50 secs
lola: 15262515 markings, 98803811 edges, 223783 markings/sec, 55 secs
lola: 16531663 markings, 107091079 edges, 253830 markings/sec, 60 secs
lola: 17738063 markings, 115019239 edges, 241280 markings/sec, 65 secs
lola: 18857865 markings, 122736123 edges, 223960 markings/sec, 70 secs
lola: 20120247 markings, 130986351 edges, 252476 markings/sec, 75 secs
lola: 21348128 markings, 139061641 edges, 245576 markings/sec, 80 secs
lola: 22488352 markings, 146906155 edges, 228045 markings/sec, 85 secs
lola: 23752504 markings, 155166627 edges, 252830 markings/sec, 90 secs
lola: 24949679 markings, 163048579 edges, 239435 markings/sec, 95 secs
lola: 26068705 markings, 170737643 edges, 223805 markings/sec, 100 secs
lola: 27330697 markings, 179002276 edges, 252398 markings/sec, 105 secs
lola: 28533210 markings, 186915994 edges, 240503 markings/sec, 110 secs
lola: 29662614 markings, 194668421 edges, 225881 markings/sec, 115 secs
lola: 30906437 markings, 202801454 edges, 248765 markings/sec, 120 secs
lola: 32109627 markings, 210710398 edges, 240638 markings/sec, 125 secs
lola: 33244911 markings, 218537794 edges, 227057 markings/sec, 130 secs
lola: 34495360 markings, 226659253 edges, 250090 markings/sec, 135 secs
lola: 35696998 markings, 234570086 edges, 240328 markings/sec, 140 secs
lola: 36818787 markings, 242327840 edges, 224358 markings/sec, 145 secs
lola: 38033029 markings, 250209607 edges, 242848 markings/sec, 150 secs
lola: 39177580 markings, 257799692 edges, 228910 markings/sec, 155 secs
lola: 40320060 markings, 265616570 edges, 228496 markings/sec, 160 secs
lola: 41494310 markings, 273220033 edges, 234850 markings/sec, 165 secs
lola: 42649034 markings, 280954464 edges, 230945 markings/sec, 170 secs
lola: 43834665 markings, 288916536 edges, 237126 markings/sec, 175 secs
lola: 45034831 markings, 296762099 edges, 240033 markings/sec, 180 secs
lola: 46196470 markings, 304637653 edges, 232328 markings/sec, 185 secs
lola: 47340341 markings, 312199880 edges, 228774 markings/sec, 190 secs
lola: 48524769 markings, 319984385 edges, 236886 markings/sec, 195 secs
lola: 49630892 markings, 327610859 edges, 221225 markings/sec, 200 secs
lola: 50810493 markings, 335292876 edges, 235920 markings/sec, 205 secs
lola: 51953813 markings, 342817362 edges, 228664 markings/sec, 210 secs
lola: 53100669 markings, 350721626 edges, 229371 markings/sec, 215 secs
lola: 54276493 markings, 358348802 edges, 235165 markings/sec, 220 secs
lola: 55402130 markings, 365810195 edges, 225127 markings/sec, 225 secs
lola: 56583671 markings, 373848004 edges, 236308 markings/sec, 230 secs
lola: 57766256 markings, 381573324 edges, 236517 markings/sec, 235 secs
lola: 58883373 markings, 389092958 edges, 223423 markings/sec, 240 secs
lola: 60115886 markings, 397284944 edges, 246503 markings/sec, 245 secs
lola: 61312726 markings, 405114213 edges, 239368 markings/sec, 250 secs
lola: 62404919 markings, 412631214 edges, 218439 markings/sec, 255 secs
lola: 63671521 markings, 420914920 edges, 253320 markings/sec, 260 secs
lola: 64871693 markings, 428804090 edges, 240034 markings/sec, 265 secs
lola: 65976309 markings, 436438604 edges, 220923 markings/sec, 270 secs
lola: 67217991 markings, 444540705 edges, 248336 markings/sec, 275 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 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= DHAP) U E (G ((3 <= b1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= DHAP) U NOT(A(TRUE U (b1 <= 2))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((3 <= Pyr)) OR (c1 <= DHAP)) OR A (G ((3 <= NADPplus)))) OR (A (((c1 <= DHAP) U (3 <= PEP))) AND (Ru5P <= GSH)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= Pyr)) OR (c1 <= DHAP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= Pyr)) OR (c1 <= DHAP))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= NADPplus)))
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: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-7.sara
lola: lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: A (((c1 <= DHAP) U (3 <= PEP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((c1 <= DHAP) U (3 <= PEP))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2))) OR A (G ((Pyr <= 1)))) OR (1 <= NADH))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= a1) AND ((a1 <= _1_3_BPG) OR (2 <= DHAP) OR (3 <= G6P) OR (1 <= b2)))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pyr <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= NADH)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= NADH)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-CTLCardinality.task
lola: 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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= a2) OR (Ru5P <= GSSG)) AND (2 <= a2) AND (NADPplus <= b1) AND (PEP <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((_3PG <= ATP) OR (3 <= a2)) U A (G ((3 <= GSSG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((_3PG <= ATP) OR (3 <= a2)) U NOT(E(TRUE U (GSSG <= 2))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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).
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= F6P) AND ((GSSG <= NADH) OR (3 <= _2PG) OR (1 <= G6P) OR (GSH <= b1)))))
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 8 literals and 4 conjunctive subformulas
lola:
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-CTLCardinality-10.sara
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((2 <= Lac))) AND E (X ((1 <= b1))))))
lola: lola: ========================================
========================================lola:
SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((2 <= Lac)) AND EX((1 <= b1))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: state equation: calling and running sara
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 780 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= a1) U (b2 <= _1_3_BPG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file GPPP-PT-C1000N0000000010-CTLCardinality-10.sara.
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= a1) U (b2 <= _1_3_BPG)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: subprocess 13 will run for 1040 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((GAP <= NADPplus))) AND A (G ((2 <= NADPplus))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: sara: place or transition ordering is non-deterministic
processed formula: A(TRUE U (NOT(E(TRUE U (NADPplus + 1 <= GAP))) AND NOT(E(TRUE U (NADPplus <= 1)))))
lola: processed formula length: 83
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1491553 markings, 8478542 edges, 2503150095940190208 markings/sec, 0 secs
lola: 2788234 markings, 16449776 edges, 259336 markings/sec, 5 secs
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 1553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((DHAP <= E4P))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (E4P + 1 <= DHAP)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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 15 will run for 3107 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((a2 <= ADP) AND (1 <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((a2 <= ADP) AND (1 <= ADP))))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1386791 markings, 8707328 edges, 277358 markings/sec, 0 secs
lola: 2591553 markings, 16749711 edges, 240952 markings/sec, 5 secs
lola: 3685621 markings, 24788735 edges, 218814 markings/sec, 10 secs
lola: 4762904 markings, 33029896 edges, 215457 markings/sec, 15 secs
lola: 5759694 markings, 41275237 edges, 199358 markings/sec, 20 secs
lola: 6864024 markings, 49556321 edges, 220866 markings/sec, 25 secs
lola: 7893669 markings, 57008908 edges, 205929 markings/sec, 30 secs
lola: 8854459 markings, 64834511 edges, 192158 markings/sec, 35 secs
lola: 9777288 markings, 72425475 edges, 184566 markings/sec, 40 secs
lola: 10837048 markings, 80007588 edges, 211952 markings/sec, 45 secs
lola: 11580213 markings, 85933319 edges, 148633 markings/sec, 50 secs
lola: 12615594 markings, 93685922 edges, 207076 markings/sec, 55 secs
lola: 13586184 markings, 101578138 edges, 194118 markings/sec, 60 secs
lola: 14619750 markings, 109272869 edges, 206713 markings/sec, 65 secs
lola: 15559430 markings, 116751648 edges, 187936 markings/sec, 70 secs
lola: 16644732 markings, 124940062 edges, 217060 markings/sec, 75 secs
lola: 17646138 markings, 132539641 edges, 200281 markings/sec, 80 secs
lola: 18643438 markings, 140250151 edges, 199460 markings/sec, 85 secs
lola: 19530079 markings, 146968766 edges, 177328 markings/sec, 90 secs
lola: 20559046 markings, 154979245 edges, 205793 markings/sec, 95 secs
lola: 21583849 markings, 162751394 edges, 204961 markings/sec, 100 secs
lola: 22563663 markings, 170546195 edges, 195963 markings/sec, 105 secs
lola: 23552511 markings, 177908742 edges, 197770 markings/sec, 110 secs
lola: 24502667 markings, 185601687 edges, 190031 markings/sec, 115 secs
lola: 25521755 markings, 193144068 edges, 203818 markings/sec, 120 secs
lola: 26435270 markings, 200557005 edges, 182703 markings/sec, 125 secs
lola: 27272752 markings, 206570374 edges, 167496 markings/sec, 130 secs
lola: 28224072 markings, 214318934 edges, 190264 markings/sec, 135 secs
lola: 29244135 markings, 221907251 edges, 204013 markings/sec, 140 secs
lola: 30161087 markings, 229234087 edges, 183390 markings/sec, 145 secs
lola: 31215118 markings, 237152863 edges, 210806 markings/sec, 150 secs
lola: 32199607 markings, 244671171 edges, 196898 markings/sec, 155 secs
lola: 33182089 markings, 252231345 edges, 196496 markings/sec, 160 secs
lola: 34165597 markings, 259677176 edges, 196702 markings/sec, 165 secs
lola: 35166847 markings, 267480493 edges, 200250 markings/sec, 170 secs
lola: 36172172 markings, 275095547 edges, 201065 markings/sec, 175 secs
lola: 37123731 markings, 282625472 edges, 190312 markings/sec, 180 secs
lola: 38137979 markings, 290226651 edges, 202850 markings/sec, 185 secs
lola: 39097273 markings, 297964804 edges, 191859 markings/sec, 190 secs
lola: 40112031 markings, 305479942 edges, 202952 markings/sec, 195 secs
lola: 41027048 markings, 312925943 edges, 183003 markings/sec, 200 secs
lola: 42015569 markings, 320233028 edges, 197704 markings/sec, 205 secs
lola: 42955954 markings, 327768509 edges, 188077 markings/sec, 210 secs
lola: 43987275 markings, 335484295 edges, 206264 markings/sec, 215 secs
lola: 44965653 markings, 343029277 edges, 195676 markings/sec, 220 secs
lola: 46005157 markings, 350984093 edges, 207901 markings/sec, 225 secs
lola: 46842505 markings, 357415003 edges, 167470 markings/sec, 230 secs
lola: 47847357 markings, 365172065 edges, 200970 markings/sec, 235 secs
lola: 48866973 markings, 372857647 edges, 203923 markings/sec, 240 secs
lola: 49873982 markings, 380783986 edges, 201402 markings/sec, 245 secs
lola: 50899367 markings, 388495817 edges, 205077 markings/sec, 250 secs
lola: 51842902 markings, 396075730 edges, 188707 markings/sec, 255 secs
lola: 52883579 markings, 403835260 edges, 208135 markings/sec, 260 secs
lola: 53835908 markings, 411572021 edges, 190466 markings/sec, 265 secs
lola: 54873016 markings, 419274416 edges, 207422 markings/sec, 270 secs
lola: 55828507 markings, 426778336 edges, 191098 markings/sec, 275 secs
lola: 56891283 markings, 434846388 edges, 212555 markings/sec, 280 secs
lola: 57906784 markings, 442520092 edges, 203100 markings/sec, 285 secs
lola: 58887377 markings, 450175379 edges, 196119 markings/sec, 290 secs
lola: 59910400 markings, 457903607 edges, 204605 markings/sec, 295 secs
lola: 60912124 markings, 465851432 edges, 200345 markings/sec, 300 secs
lola: 61938640 markings, 473542547 edges, 205303 markings/sec, 305 secs
lola: 62886112 markings, 481217903 edges, 189494 markings/sec, 310 secs
lola: 63953031 markings, 489194393 edges, 213384 markings/sec, 315 secs
lola: 64954441 markings, 497074830 edges, 200282 markings/sec, 320 secs
lola: 65996390 markings, 505005510 edges, 208390 markings/sec, 325 secs
lola: 66996116 markings, 512587759 edges, 199945 markings/sec, 330 secs
lola: 68018166 markings, 520492920 edges, 204410 markings/sec, 335 secs
lola: 69043572 markings, 528242892 edges, 205081 markings/sec, 340 secs
lola: 70016459 markings, 535943701 edges, 194577 markings/sec, 345 secs
lola: 71057678 markings, 543755163 edges, 208244 markings/sec, 350 secs
lola: 72035017 markings, 551691082 edges, 195468 markings/sec, 355 secs
lola: 73079247 markings, 559463960 edges, 208846 markings/sec, 360 secs
lola: 74015260 markings, 566970582 edges, 187203 markings/sec, 365 secs
lola: 75081786 markings, 574317585 edges, 213305 markings/sec, 370 secs
lola: 76123923 markings, 581776061 edges, 208427 markings/sec, 375 secs
lola: 77016497 markings, 589037664 edges, 178515 markings/sec, 380 secs
lola: 77936444 markings, 596238230 edges, 183989 markings/sec, 385 secs
lola: 78816675 markings, 602898297 edges, 176046 markings/sec, 390 secs
lola: 79675751 markings, 609961395 edges, 171815 markings/sec, 395 secs
lola: 80558280 markings, 617034096 edges, 176506 markings/sec, 400 secs
lola: 81491387 markings, 624408943 edges, 186621 markings/sec, 405 secs
lola: 82256454 markings, 630729600 edges, 153013 markings/sec, 410 secs
lola: 83149487 markings, 637908914 edges, 178607 markings/sec, 415 secs
lola: 84029372 markings, 645097820 edges, 175977 markings/sec, 420 secs
lola: 84896623 markings, 652185807 edges, 173450 markings/sec, 425 secs
lola: 85698484 markings, 658613666 edges, 160372 markings/sec, 430 secs
lola: 86573907 markings, 665841684 edges, 175085 markings/sec, 435 secs
lola: 87463465 markings, 672984374 edges, 177912 markings/sec, 440 secs
lola: 88321254 markings, 680073052 edges, 171558 markings/sec, 445 secs
lola: 89205467 markings, 687195701 edges, 176843 markings/sec, 450 secs
lola: 90097244 markings, 694403130 edges, 178355 markings/sec, 455 secs
lola: 90962314 markings, 701580291 edges, 173014 markings/sec, 460 secs
lola: 91855810 markings, 708748844 edges, 178699 markings/sec, 465 secs
lola: 92736011 markings, 715980784 edges, 176040 markings/sec, 470 secs
lola: 93613706 markings, 723123909 edges, 175539 markings/sec, 475 secs
lola: 94518586 markings, 730390772 edges, 180976 markings/sec, 480 secs
lola: 95390874 markings, 737560249 edges, 174458 markings/sec, 485 secs
lola: 96275939 markings, 744749412 edges, 177013 markings/sec, 490 secs
lola: 97167690 markings, 751979925 edges, 178350 markings/sec, 495 secs
lola: 98018778 markings, 758981470 edges, 170218 markings/sec, 500 secs
lola: 98919407 markings, 766246634 edges, 180126 markings/sec, 505 secs
lola: 99788961 markings, 773322293 edges, 173911 markings/sec, 510 secs
lola: 100662718 markings, 780437458 edges, 174751 markings/sec, 515 secs
lola: 101554787 markings, 787682589 edges, 178414 markings/sec, 520 secs
lola: 102406741 markings, 794690771 edges, 170391 markings/sec, 525 secs
lola: 103308747 markings, 801965088 edges, 180401 markings/sec, 530 secs
lola: 104178426 markings, 809041076 edges, 173936 markings/sec, 535 secs
lola: 105046337 markings, 816114645 edges, 173582 markings/sec, 540 secs
lola: 105930949 markings, 823294022 edges, 176922 markings/sec, 545 secs
lola: 106773813 markings, 830234949 edges, 168573 markings/sec, 550 secs
lola: 107657657 markings, 837360082 edges, 176769 markings/sec, 555 secs
lola: 108443320 markings, 843829115 edges, 157133 markings/sec, 560 secs
lola: 109296953 markings, 850687462 edges, 170727 markings/sec, 565 secs
lola: 110151006 markings, 857710205 edges, 170811 markings/sec, 570 secs
lola: 111021963 markings, 864759000 edges, 174191 markings/sec, 575 secs
lola: 111921420 markings, 872014697 edges, 179891 markings/sec, 580 secs
lola: 112787606 markings, 879201580 edges, 173237 markings/sec, 585 secs
lola: 113685120 markings, 886429591 edges, 179503 markings/sec, 590 secs
lola: 114572687 markings, 893659907 edges, 177513 markings/sec, 595 secs
lola: 115434935 markings, 900726279 edges, 172450 markings/sec, 600 secs
lola: 116342321 markings, 908017209 edges, 181477 markings/sec, 605 secs
lola: 117224800 markings, 915227560 edges, 176496 markings/sec, 610 secs
lola: 118122847 markings, 922282080 edges, 179609 markings/sec, 615 secs
lola: 119030484 markings, 928901476 edges, 181527 markings/sec, 620 secs
lola: 120003637 markings, 936283514 edges, 194631 markings/sec, 625 secs
lola: 120861335 markings, 943252947 edges, 171540 markings/sec, 630 secs
lola: 121698915 markings, 950218711 edges, 167516 markings/sec, 635 secs
lola: 122609114 markings, 957558421 edges, 182040 markings/sec, 640 secs
lola: 123592245 markings, 965093062 edges, 196626 markings/sec, 645 secs
lola: 124454021 markings, 972090631 edges, 172355 markings/sec, 650 secs
lola: 125306474 markings, 979174928 edges, 170491 markings/sec, 655 secs
lola: 126158302 markings, 986297977 edges, 170366 markings/sec, 660 secs
lola: 127118588 markings, 993733779 edges, 192057 markings/sec, 665 secs
lola: 127957167 markings, 1000745650 edges, 167716 markings/sec, 670 secs
lola: 128817168 markings, 1007914956 edges, 172000 markings/sec, 675 secs
lola: 129687803 markings, 1015134094 edges, 174127 markings/sec, 680 secs
lola: 130566184 markings, 1022294937 edges, 175676 markings/sec, 685 secs
lola: 131414181 markings, 1029372591 edges, 169599 markings/sec, 690 secs
lola: 132291618 markings, 1036684023 edges, 175487 markings/sec, 695 secs
lola: 133157249 markings, 1043915776 edges, 173126 markings/sec, 700 secs
lola: 134013315 markings, 1051084284 edges, 171213 markings/sec, 705 secs
lola: 134909824 markings, 1058373975 edges, 179302 markings/sec, 710 secs
lola: 135786011 markings, 1065624591 edges, 175237 markings/sec, 715 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no yes unknown no no no yes yes yes yes no no no unknown
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494725831562

--------------------
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-C1000N0000000010"
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-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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-C1000N0000000010, 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-149440264500570"
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 ;