About the Execution of LoLA for GPPP-PT-C1000N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13423.010 | 1212677.00 | 2427202.00 | 540.10 | FFFTFFTFTFFTTFTT | 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-C1000N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500574
=====================================================================
--------------------
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-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494724854390
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ 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-ReachabilityCardinality.task
lola: A (G (((Lac <= 2) OR (Xu5P <= 1) OR ((NADplus <= 2) AND (b1 + 1 <= _2PG))))) : E (F (((Pi <= a1) AND (3 <= F6P)))) : A (G ((Lac <= b2))) : E (F ((((NADPH <= 2) AND (NADplus <= 2)) OR (b1 + 1 <= R5P)))) : E (F (((ATP + 1 <= PEP) AND (a2 <= 1) AND (1 <= b2)))) : A (G (((ADP <= c1) OR (1 <= c1) OR (_3PG <= 1) OR (NADplus + 1 <= a1)))) : E (F ((3 <= Lac))) : E (F ((((a2 <= b1) OR (1 <= E4P) OR ((Pi <= a2) AND (b2 <= c2))) AND (2 <= S7P)))) : A (G ((start <= 1))) : E (F ((1 <= _3PG))) : A (G ((_3PG <= ATP))) : A (G (())) : E (F (((3 <= c1) AND (Pi <= GSSG) AND (3 <= start) AND (GSH <= 0)))) : E (F (((b1 + 1 <= G6P) AND (ADP + 1 <= _2PG) AND (1 <= c1)))) : A (G (((Gluc <= 2) OR (Gluc + 1 <= GSSG) OR (start <= ADP)))) : A (G (((3 <= F6P) OR (1 <= ATP) OR (Pi <= PEP) OR (3 <= NADH) OR ((NADPH + 1 <= NADPplus) AND (NADPplus + 1 <= _3PG)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Lac <= 2) OR (Xu5P <= 1) OR ((NADplus <= 2) AND (b1 + 1 <= _2PG)))))
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: 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-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Pi <= a1) AND (3 <= F6P))))
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-C1000N0000000010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3208393 markings, 8972915 edges, 641679 markings/sec, 0 secs
lola: sara is running 5 secs || 5861148 markings, 16299191 edges, 530551 markings/sec, 5 secs
lola: sara is running 10 secs || 8590647 markings, 23835836 edges, 545900 markings/sec, 10 secs
lola: sara is running 15 secs || 11353469 markings, 31533015 edges, 552564 markings/sec, 15 secs
lola: sara is running 20 secs || 14060927 markings, 39098699 edges, 541492 markings/sec, 20 secs
lola: sara is running 25 secs || 16766373 markings, 47101546 edges, 541089 markings/sec, 25 secs
lola: sara is running 30 secs || 19447943 markings, 55252859 edges, 536314 markings/sec, 30 secs
lola: sara is running 35 secs || 21751044 markings, 62714225 edges, 460620 markings/sec, 35 secs
lola: sara is running 40 secs || 23988461 markings, 70038206 edges, 447483 markings/sec, 40 secs
lola: sara is running 45 secs || 26194707 markings, 77276290 edges, 441249 markings/sec, 45 secs
lola: sara is running 50 secs || 28441605 markings, 84658409 edges, 449380 markings/sec, 50 secs
lola: sara is running 55 secs || 30721631 markings, 92147846 edges, 456005 markings/sec, 55 secs
lola: sara is running 60 secs || 33145377 markings, 99880816 edges, 484749 markings/sec, 60 secs
lola: sara is running 65 secs || 35579389 markings, 107841646 edges, 486802 markings/sec, 65 secs
lola: sara is running 70 secs || 37808530 markings, 115632888 edges, 445828 markings/sec, 70 secs
lola: sara is running 75 secs || 40279593 markings, 123764419 edges, 494213 markings/sec, 75 secs
lola: sara is running 80 secs || 42511480 markings, 131337224 edges, 446377 markings/sec, 80 secs
lola: sara is running 85 secs || 44677890 markings, 138460518 edges, 433282 markings/sec, 85 secs
lola: sara is running 90 secs || 46931276 markings, 146157173 edges, 450677 markings/sec, 90 secs
lola: sara is running 95 secs || 49085996 markings, 153573730 edges, 430944 markings/sec, 95 secs
lola: sara is running 100 secs || 51244844 markings, 161026928 edges, 431770 markings/sec, 100 secs
lola: sara is running 105 secs || 53315555 markings, 168067669 edges, 414142 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: A (G ((Lac <= b2)))
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-C1000N0000000010-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3151606 markings, 8338075 edges, 630321 markings/sec, 0 secs
lola: sara is running 5 secs || 6033741 markings, 16094288 edges, 576427 markings/sec, 5 secs
lola: sara is running 10 secs || 8875082 markings, 23746306 edges, 568268 markings/sec, 10 secs
lola: sara is running 15 secs || 11662223 markings, 31253030 edges, 557428 markings/sec, 15 secs
lola: sara is running 20 secs || 14350130 markings, 38462012 edges, 537581 markings/sec, 20 secs
lola: sara is running 25 secs || 17020845 markings, 45648181 edges, 534143 markings/sec, 25 secs
lola: sara is running 30 secs || 19773583 markings, 53049030 edges, 550548 markings/sec, 30 secs
lola: sara is running 35 secs || 22496055 markings, 60367219 edges, 544494 markings/sec, 35 secs
lola: sara is running 40 secs || 25188881 markings, 67600146 edges, 538565 markings/sec, 40 secs
lola: sara is running 45 secs || 27959433 markings, 75044523 edges, 554110 markings/sec, 45 secs
lola: sara is running 50 secs || 30683884 markings, 82350859 edges, 544890 markings/sec, 50 secs
lola: sara is running 55 secs || 33332402 markings, 89456743 edges, 529704 markings/sec, 55 secs
lola: sara is running 60 secs || 36240120 markings, 97264717 edges, 581544 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NADPH <= 2) AND (NADplus <= 2)) OR (b1 + 1 <= R5P))))
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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-3.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 4 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATP + 1 <= PEP) AND (a2 <= 1) AND (1 <= b2))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ADP <= c1) OR (1 <= c1) OR (_3PG <= 1) OR (NADplus + 1 <= a1))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3830981 markings, 8346787 edges, 766196 markings/sec, 0 secs
lola: sara is running 5 secs || 7061957 markings, 15155762 edges, 646195 markings/sec, 5 secs
lola: sara is running 10 secs || 10335575 markings, 22263141 edges, 654724 markings/sec, 10 secs
lola: sara is running 15 secs || 13388298 markings, 29022290 edges, 610545 markings/sec, 15 secs
lola: sara is running 20 secs || 16507556 markings, 36099833 edges, 623852 markings/sec, 20 secs
lola: sara is running 25 secs || 19660563 markings, 43243956 edges, 630601 markings/sec, 25 secs
lola: sara is running 30 secs || 22984203 markings, 50767194 edges, 664728 markings/sec, 30 secs
lola: sara is running 35 secs || 26153563 markings, 58074540 edges, 633872 markings/sec, 35 secs
lola: sara is running 40 secs || 28841222 markings, 64646564 edges, 537532 markings/sec, 40 secs
lola: sara is running 45 secs || 31574569 markings, 71227076 edges, 546669 markings/sec, 45 secs
lola: sara is running 50 secs || 34245493 markings, 78349709 edges, 534185 markings/sec, 50 secs
lola: sara is running 55 secs || 36945784 markings, 85553592 edges, 540058 markings/sec, 55 secs
lola: sara is running 60 secs || 39706334 markings, 92918296 edges, 552110 markings/sec, 60 secs
lola: sara is running 65 secs || 42800647 markings, 100276310 edges, 618863 markings/sec, 65 secs
lola: sara is running 70 secs || 45616680 markings, 107495111 edges, 563207 markings/sec, 70 secs
lola: sara is running 75 secs || 48682848 markings, 115001710 edges, 613234 markings/sec, 75 secs
lola: sara is running 80 secs || 51357904 markings, 121788506 edges, 535011 markings/sec, 80 secs
lola: sara is running 85 secs || 53569268 markings, 127585599 edges, 442273 markings/sec, 85 secs
lola: sara is running 90 secs || 56334989 markings, 134300522 edges, 553144 markings/sec, 90 secs
lola: sara is running 95 secs || 58985036 markings, 140545049 edges, 530009 markings/sec, 95 secs
lola: sara is running 100 secs || 61390391 markings, 146846023 edges, 481071 markings/sec, 100 secs
lola: sara is running 105 secs || 63672444 markings, 153639187 edges, 456411 markings/sec, 105 secs
lola: sara is running 110 secs || 66172261 markings, 160427778 edges, 499963 markings/sec, 110 secs
lola: sara is running 115 secs || 68680952 markings, 167430593 edges, 501738 markings/sec, 115 secs
lola: sara is running 120 secs || 71228544 markings, 174552401 edges, 509518 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-6.sara
lola: The predicate is reachable.
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: E (F ((((a2 <= b1) OR (1 <= E4P) OR ((Pi <= a2) AND (b2 <= c2))) AND (2 <= S7P))))
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: calling and running sara
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-7.sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-6.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministicsara:
try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2407753 markings, 8835013 edges, 481551 markings/sec, 0 secs
lola: sara is running 5 secs || 4699062 markings, 17364727 edges, 458262 markings/sec, 5 secs
lola: sara is running 10 secs || 6923216 markings, 25916596 edges, 444831 markings/sec, 10 secs
lola: sara is running 15 secs || 9147928 markings, 34373849 edges, 444942 markings/sec, 15 secs
lola: sara is running 20 secs || 11372015 markings, 42725886 edges, 444817 markings/sec, 20 secs
lola: sara is running 25 secs || 13513044 markings, 51087732 edges, 428206 markings/sec, 25 secs
lola: sara is running 30 secs || 15747313 markings, 59430902 edges, 446854 markings/sec, 30 secs
lola: sara is running 35 secs || 17920446 markings, 67642094 edges, 434627 markings/sec, 35 secs
lola: sara is running 40 secs || 20100942 markings, 76044933 edges, 436099 markings/sec, 40 secs
lola: sara is running 45 secs || 22327016 markings, 84343524 edges, 445215 markings/sec, 45 secs
lola: sara is running 50 secs || 24472251 markings, 92585833 edges, 429047 markings/sec, 50 secs
lola: sara is running 55 secs || 26597512 markings, 100850460 edges, 425052 markings/sec, 55 secs
lola: sara is running 60 secs || 28766710 markings, 109306398 edges, 433840 markings/sec, 60 secs
lola: sara is running 65 secs || 30890643 markings, 117640012 edges, 424787 markings/sec, 65 secs
lola: sara is running 70 secs || 33065731 markings, 126009183 edges, 435018 markings/sec, 70 secs
lola: sara is running 75 secs || 35232717 markings, 134233842 edges, 433397 markings/sec, 75 secs
lola: sara is running 80 secs || 37431164 markings, 142607983 edges, 439689 markings/sec, 80 secs
lola: sara is running 85 secs || 39601618 markings, 151073013 edges, 434091 markings/sec, 85 secs
lola: sara is running 90 secs || 41721390 markings, 159555209 edges, 423954 markings/sec, 90 secs
lola: sara is running 95 secs || 43913681 markings, 168062923 edges, 438458 markings/sec, 95 secs
lola: sara is running 100 secs || 46092387 markings, 176367655 edges, 435741 markings/sec, 100 secs
lola: sara is running 105 secs || 48288383 markings, 184696455 edges, 439199 markings/sec, 105 secs
lola: sara is running 110 secs || 50406374 markings, 193167994 edges, 423598 markings/sec, 110 secs
lola: sara is running 115 secs || 52523604 markings, 201536188 edges, 423446 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((start <= 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: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4684569 markings, 8131351 edges, 936914 markings/sec, 0 secs
lola: sara is running 5 secs || 9158669 markings, 15717365 edges, 894820 markings/sec, 5 secs
lola: sara is running 10 secs || 12981900 markings, 22735080 edges, 764646 markings/sec, 10 secs
lola: sara is running 15 secs || 17495068 markings, 29735945 edges, 902634 markings/sec, 15 secs
lola: sara is running 20 secs || 21663475 markings, 36838469 edges, 833681 markings/sec, 20 secs
lola: sara is running 25 secs || 25888670 markings, 43487258 edges, 845039 markings/sec, 25 secs
lola: sara is running 30 secs || 29359172 markings, 50042176 edges, 694100 markings/sec, 30 secs
lola: sara is running 35 secs || 32557828 markings, 56330706 edges, 639731 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= _3PG)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_3PG <= 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 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 11 will run for 613 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= c1) AND (Pi <= GSSG) AND (3 <= start) AND (GSH <= 0))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3481684 markings, 8431910 edges, 696337 markings/sec, 0 secs
lola: sara is running 5 secs || 6808337 markings, 16609256 edges, 665331 markings/sec, 5 secs
lola: sara is running 10 secs || 9994880 markings, 24396811 edges, 637309 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((b1 + 1 <= G6P) AND (ADP + 1 <= _2PG) AND (1 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2605204 markings, 10231738 edges, 521041 markings/sec, 0 secs
lola: sara is running 5 secs || 4747253 markings, 19387621 edges, 428410 markings/sec, 5 secs
lola: sara is running 10 secs || 6841144 markings, 28413579 edges, 418778 markings/sec, 10 secs
lola: sara is running 15 secs || 8969024 markings, 37745206 edges, 425576 markings/sec, 15 secs
lola: sara is running 20 secs || 11254366 markings, 46693785 edges, 457068 markings/sec, 20 secs
lola: sara is running 25 secs || 13366885 markings, 54722293 edges, 422504 markings/sec, 25 secs
lola: sara is running 30 secs || 15172634 markings, 62895707 edges, 361150 markings/sec, 30 secs
lola: sara is running 35 secs || 17028851 markings, 70804127 edges, 371243 markings/sec, 35 secs
lola: sara is running 40 secs || 19059458 markings, 79482240 edges, 406121 markings/sec, 40 secs
lola: sara is running 45 secs || 20837335 markings, 87724295 edges, 355575 markings/sec, 45 secs
lola: sara is running 50 secs || 22981613 markings, 96548723 edges, 428856 markings/sec, 50 secs
lola: sara is running 55 secs || 24890352 markings, 104935417 edges, 381748 markings/sec, 55 secs
lola: sara is running 60 secs || 26767466 markings, 113374222 edges, 375423 markings/sec, 60 secs
lola: sara is running 65 secs || 28837313 markings, 121775975 edges, 413969 markings/sec, 65 secs
lola: sara is running 70 secs || 30550546 markings, 129389496 edges, 342647 markings/sec, 70 secs
lola: sara is running 75 secs || 32145530 markings, 136459527 edges, 318997 markings/sec, 75 secs
lola: sara is running 80 secs || 33735902 markings, 143688707 edges, 318074 markings/sec, 80 secs
lola: sara is running 85 secs || 35320468 markings, 151044441 edges, 316913 markings/sec, 85 secs
lola: sara is running 90 secs || 36851237 markings, 158342267 edges, 306154 markings/sec, 90 secs
lola: sara is running 95 secs || 38776088 markings, 166503238 edges, 384970 markings/sec, 95 secs
lola: sara is running 100 secs || 40572686 markings, 174616811 edges, 359320 markings/sec, 100 secs
lola: sara is running 105 secs || 42431799 markings, 182648594 edges, 371823 markings/sec, 105 secs
lola: sara is running 110 secs || 44139509 markings, 190413549 edges, 341542 markings/sec, 110 secs
lola: sara is running 115 secs || 45888566 markings, 198286328 edges, 349811 markings/sec, 115 secs
lola: sara is running 120 secs || 47804567 markings, 206970612 edges, 383200 markings/sec, 120 secs
lola: sara is running 125 secs || 49626880 markings, 215037395 edges, 364463 markings/sec, 125 secs
lola: sara is running 130 secs || 51435472 markings, 222992817 edges, 361718 markings/sec, 130 secs
lola: sara is running 135 secs || 53090783 markings, 230934216 edges, 331062 markings/sec, 135 secs
lola: sara is running 140 secs || 55037520 markings, 239282558 edges, 389347 markings/sec, 140 secs
lola: sara is running 145 secs || 56633401 markings, 246537740 edges, 319176 markings/sec, 145 secs
lola: sara is running 150 secs || 58244102 markings, 253603502 edges, 322140 markings/sec, 150 secs
lola: sara is running 155 secs || 59672736 markings, 260329597 edges, 285727 markings/sec, 155 secs
lola: sara is running 160 secs || 61065806 markings, 266836755 edges, 278614 markings/sec, 160 secs
lola: sara is running 165 secs || 62737523 markings, 274500908 edges, 334343 markings/sec, 165 secs
lola: sara is running 170 secs || 64164887 markings, 281531819 edges, 285473 markings/sec, 170 secs
lola: sara is running 175 secs || 65665794 markings, 288663553 edges, 300181 markings/sec, 175 secs
lola: sara is running 180 secs || 67064776 markings, 295535452 edges, 279796 markings/sec, 180 secs
lola: sara is running 185 secs || 68845759 markings, 303598624 edges, 356197 markings/sec, 185 secs
lola: sara is running 190 secs || 70635465 markings, 311359643 edges, 357941 markings/sec, 190 secs
lola: sara is running 195 secs || 72290431 markings, 318920453 edges, 330993 markings/sec, 195 secs
lola: sara is running 200 secs || 74027391 markings, 326659150 edges, 347392 markings/sec, 200 secs
lola: sara is running 205 secs || 75694138 markings, 334273056 edges, 333349 markings/sec, 205 secs
lola: sara is running 210 secs || 77274964 markings, 341616958 edges, 316165 markings/sec, 210 secs
lola: sara is running 215 secs || 78844947 markings, 348982314 edges, 313997 markings/sec, 215 secs
lola: sara is running 220 secs || 80615127 markings, 357215597 edges, 354036 markings/sec, 220 secs
lola: sara is running 225 secs || 82381830 markings, 365229282 edges, 353341 markings/sec, 225 secs
lola: sara is running 230 secs || 84123655 markings, 373075955 edges, 348365 markings/sec, 230 secs
lola: sara is running 235 secs || 85731091 markings, 380727916 edges, 321487 markings/sec, 235 secs
lola: sara is running 240 secs || 87361308 markings, 388323209 edges, 326043 markings/sec, 240 secs
lola: sara is running 245 secs || 89056483 markings, 396046487 edges, 339035 markings/sec, 245 secs
lola: sara is running 250 secs || 90526361 markings, 402781936 edges, 293976 markings/sec, 250 secs
lola: sara is running 255 secs || 92247162 markings, 409630794 edges, 344160 markings/sec, 255 secs
lola: sara is running 260 secs || 93823266 markings, 416539676 edges, 315221 markings/sec, 260 secs
lola: sara is running 265 secs || 95322148 markings, 423259464 edges, 299776 markings/sec, 265 secs
lola: sara is running 270 secs || 96714939 markings, 429813527 edges, 278558 markings/sec, 270 secs
lola: sara is running 275 secs || 98080970 markings, 436405282 edges, 273206 markings/sec, 275 secs
lola: sara is running 280 secs || 99358128 markings, 442635985 edges, 255432 markings/sec, 280 secs
lola: sara is running 285 secs || 100594129 markings, 448844316 edges, 247200 markings/sec, 285 secs
lola: sara is running 290 secs || 102133498 markings, 456136856 edges, 307874 markings/sec, 290 secs
lola: sara is running 295 secs || 103513622 markings, 462907086 edges, 276025 markings/sec, 295 secs
lola: sara is running 300 secs || 104801319 markings, 469467766 edges, 257539 markings/sec, 300 secs
lola: sara is running 305 secs || 106073226 markings, 476037868 edges, 254381 markings/sec, 305 secs
lola: sara is running 310 secs || 107402433 markings, 482770541 edges, 265841 markings/sec, 310 secs
lola: sara is running 315 secs || 108798269 markings, 489070720 edges, 279167 markings/sec, 315 secs
lola: sara is running 320 secs || 110507858 markings, 496538915 edges, 341918 markings/sec, 320 secs
lola: sara is running 325 secs || 111993606 markings, 503374291 edges, 297150 markings/sec, 325 secs
lola: sara is running 330 secs || 113643324 markings, 510750637 edges, 329944 markings/sec, 330 secs
lola: sara is running 335 secs || 115143317 markings, 517835692 edges, 299999 markings/sec, 335 secs
lola: sara is running 340 secs || 116639951 markings, 524715573 edges, 299327 markings/sec, 340 secs
lola: sara is running 345 secs || 118249470 markings, 532109282 edges, 321904 markings/sec, 345 secs
lola: sara is running 350 secs || 119719028 markings, 539196150 edges, 293912 markings/sec, 350 secs
lola: sara is running 355 secs || 121213390 markings, 546276354 edges, 298872 markings/sec, 355 secs
lola: sara is running 360 secs || 122697524 markings, 553364453 edges, 296827 markings/sec, 360 secs
lola: sara is running 365 secs || 124498323 markings, 561128124 edges, 360160 markings/sec, 365 secs
lola: sara is running 370 secs || 126106312 markings, 568669472 edges, 321598 markings/sec, 370 secs
lola: sara is running 375 secs || 127711096 markings, 576192595 edges, 320957 markings/sec, 375 secs
lola: sara is running 380 secs || 129233236 markings, 583502208 edges, 304428 markings/sec, 380 secs
lola: sara is running 385 secs || 130824006 markings, 590582316 edges, 318154 markings/sec, 385 secs
lola: sara is running 390 secs || 132423228 markings, 598055816 edges, 319844 markings/sec, 390 secs
lola: sara is running 395 secs || 133992354 markings, 605051554 edges, 313825 markings/sec, 395 secs
lola: sara is running 400 secs || 135338635 markings, 611515807 edges, 269256 markings/sec, 400 secs
lola: sara is running 405 secs || 136610938 markings, 617781032 edges, 254461 markings/sec, 405 secs
lola: sara is running 410 secs || 137819834 markings, 623949775 edges, 241779 markings/sec, 410 secs
lola: sara is running 415 secs || 139097086 markings, 630271563 edges, 255450 markings/sec, 415 secs
lola: sara is running 420 secs || 140230688 markings, 636330656 edges, 226720 markings/sec, 420 secs
lola: sara is running 425 secs || 141340858 markings, 642213262 edges, 222034 markings/sec, 425 secs
lola: sara is running 430 secs || 142649015 markings, 648369797 edges, 261631 markings/sec, 430 secs
lola: sara is running 435 secs || 143918269 markings, 654899303 edges, 253851 markings/sec, 435 secs
lola: sara is running 440 secs || 145100055 markings, 661322763 edges, 236357 markings/sec, 440 secs
lola: sara is running 445 secs || 146294117 markings, 667370807 edges, 238812 markings/sec, 445 secs
lola: sara is running 450 secs || 147460408 markings, 673843616 edges, 233258 markings/sec, 450 secs
lola: sara is running 455 secs || 148884224 markings, 680615443 edges, 284763 markings/sec, 455 secs
lola: sara is running 460 secs || 150325088 markings, 687073048 edges, 288173 markings/sec, 460 secs
lola: sara is running 465 secs || 151799574 markings, 693910693 edges, 294897 markings/sec, 465 secs
lola: sara is running 470 secs || 153274156 markings, 700806759 edges, 294916 markings/sec, 470 secs
lola: sara is running 475 secs || 154682936 markings, 707543296 edges, 281756 markings/sec, 475 secs
lola: sara is running 480 secs || 156225575 markings, 714500774 edges, 308528 markings/sec, 480 secs
lola: sara is running 485 secs || 157651669 markings, 721389118 edges, 285219 markings/sec, 485 secs
lola: sara is running 490 secs || 159036613 markings, 727956267 edges, 276989 markings/sec, 490 secs
lola: sara is running 495 secs || 160554705 markings, 734920509 edges, 303618 markings/sec, 495 secs
lola: sara is running 500 secs || 161873981 markings, 741162703 edges, 263855 markings/sec, 500 secs
lola: sara is running 505 secs || 163348328 markings, 748074666 edges, 294869 markings/sec, 505 secs
lola: sara is running 510 secs || 164828072 markings, 754928883 edges, 295949 markings/sec, 510 secs
lola: sara is running 515 secs || 166308117 markings, 761563998 edges, 296009 markings/sec, 515 secs
lola: sara is running 520 secs || 167885299 markings, 768406608 edges, 315436 markings/sec, 520 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Gluc <= 2) OR (Gluc + 1 <= GSSG) OR (start <= ADP))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2750142 markings, 8439884 edges, 550028 markings/sec, 0 secs
lola: sara is running 5 secs || 5315888 markings, 16280067 edges, 513149 markings/sec, 5 secs
lola: sara is running 10 secs || 7465307 markings, 23838428 edges, 429884 markings/sec, 10 secs
lola: sara is running 15 secs || 9482668 markings, 31520176 edges, 403472 markings/sec, 15 secs
lola: sara is running 20 secs || 11761548 markings, 38533377 edges, 455776 markings/sec, 20 secs
lola: sara is running 25 secs || 13902269 markings, 46018538 edges, 428144 markings/sec, 25 secs
lola: sara is running 30 secs || 15854766 markings, 53499703 edges, 390499 markings/sec, 30 secs
lola: sara is running 35 secs || 17649341 markings, 60693754 edges, 358915 markings/sec, 35 secs
lola: sara is running 40 secs || 19603542 markings, 68180420 edges, 390840 markings/sec, 40 secs
lola: sara is running 45 secs || 22029366 markings, 75514419 edges, 485165 markings/sec, 45 secs
lola: sara is running 50 secs || 24605691 markings, 82925246 edges, 515265 markings/sec, 50 secs
lola: sara is running 55 secs || 26595040 markings, 89908801 edges, 397870 markings/sec, 55 secs
lola: sara is running 60 secs || 28561091 markings, 97415025 edges, 393210 markings/sec, 60 secs
lola: sara is running 65 secs || 30277533 markings, 104137675 edges, 343288 markings/sec, 65 secs
lola: sara is running 70 secs || 32029742 markings, 111277044 edges, 350442 markings/sec, 70 secs
lola: sara is running 75 secs || 33720642 markings, 118188720 edges, 338180 markings/sec, 75 secs
lola: sara is running 80 secs || 35586720 markings, 125418344 edges, 373216 markings/sec, 80 secs
lola: sara is running 85 secs || 37420836 markings, 132563038 edges, 366823 markings/sec, 85 secs
lola: sara is running 90 secs || 39276207 markings, 139053251 edges, 371074 markings/sec, 90 secs
lola: sara is running 95 secs || 41470475 markings, 145931294 edges, 438854 markings/sec, 95 secs
lola: sara is running 100 secs || 43721801 markings, 153069876 edges, 450265 markings/sec, 100 secs
lola: sara is running 105 secs || 45722437 markings, 160535832 edges, 400127 markings/sec, 105 secs
lola: sara is running 110 secs || 47594665 markings, 167633776 edges, 374446 markings/sec, 110 secs
lola: sara is running 115 secs || 49249994 markings, 174396322 edges, 331066 markings/sec, 115 secs
lola: sara is running 120 secs || 50923682 markings, 181217861 edges, 334738 markings/sec, 120 secs
lola: sara is running 125 secs || 52595860 markings, 188076331 edges, 334436 markings/sec, 125 secs
lola: sara is running 130 secs || 54334057 markings, 194777175 edges, 347639 markings/sec, 130 secs
lola: sara is running 135 secs || 55979735 markings, 201196884 edges, 329136 markings/sec, 135 secs
lola: sara is running 140 secs || 57574180 markings, 207706113 edges, 318889 markings/sec, 140 secs
lola: sara is running 145 secs || 59204265 markings, 214473859 edges, 326017 markings/sec, 145 secs
lola: sara is running 150 secs || 60821487 markings, 221188312 edges, 323444 markings/sec, 150 secs
lola: sara is running 155 secs || 62568380 markings, 227704705 edges, 349379 markings/sec, 155 secs
lola: sara is running 160 secs || 64711210 markings, 234424425 edges, 428566 markings/sec, 160 secs
lola: sara is running 165 secs || 66943623 markings, 241471194 edges, 446483 markings/sec, 165 secs
lola: sara is running 170 secs || 69366622 markings, 248537057 edges, 484600 markings/sec, 170 secs
lola: sara is running 175 secs || 71453466 markings, 255464988 edges, 417369 markings/sec, 175 secs
lola: sara is running 180 secs || 73353669 markings, 262076741 edges, 380041 markings/sec, 180 secs
lola: sara is running 185 secs || 75269563 markings, 268743534 edges, 383179 markings/sec, 185 secs
lola: sara is running 190 secs || 77198375 markings, 275455933 edges, 385762 markings/sec, 190 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= F6P) OR (1 <= ATP) OR (Pi <= PEP) OR (3 <= NADH) OR ((NADPH + 1 <= NADPplus) AND (NADPplus + 1 <= _3PG)))))
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 10 literals and 2 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-ReachabilityCardinality-15.sara
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes no yes yes no yes no no yes no
lola: lola: ========================================
state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494726067067
--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-149440264500574"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;