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

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

=== Now, execution of the tool begins

BK_START 1494724347283


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ GPPP-PT-C0100N0000100000 @ 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-C0100N0000100000-ReachabilityFireability.task
lola: A (G (())) : E (F (FIREABLE(remove))) : E (F ((NOT FIREABLE(Ru5P_epimerase) AND FIREABLE(remove)))) : E (F ((FIREABLE(Phosphoglycerate_mutase) AND FIREABLE(generate) AND FIREABLE(Glutathione_oxidation) AND (FIREABLE(Ru5P_epimerase) OR FIREABLE(Hexokinase))))) : E (F (((NOT FIREABLE(Phosphofructokinase) OR NOT FIREABLE(generate)) AND FIREABLE(Transketolase2)))) : E (F ((FIREABLE(Transketolase2) AND NOT FIREABLE(Glutathione_reductose) AND FIREABLE(Lactate_dehydrogenase)))) : A (G ((NOT FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Lactate_dehydrogenase) OR NOT FIREABLE(remove) OR NOT FIREABLE(Lactate_dehydrogenase) OR (FIREABLE(TIM_backward) AND FIREABLE(Enolase))))) : E (F ((FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation)))) : A (G ((FIREABLE(Ru5P_isomerase) OR FIREABLE(Hexokinase) OR FIREABLE(Enolase) OR ((FIREABLE(Ru5P_isomerase) OR FIREABLE(Phosphofructokinase)) AND FIREABLE(generate)) OR FIREABLE(Ru5P_epimerase) OR FIREABLE(generate) OR FIREABLE(G6P_dehydrogenase) OR (FIREABLE(Pyruvate_kinase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Phosphoglycerate_mutase))))) : E (F (FIREABLE(Lactate_dehydrogenase))) : A (G ((FIREABLE(Phosphoglycerate_kinase) OR FIREABLE(Transketolase2) OR NOT FIREABLE(Lactate_dehydrogenase)))) : A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(GAP_dehydrogenase)))) : E (F (FIREABLE(Pyruvate_kinase))) : E (F (FIREABLE(Pyruvate_kinase))) : E (F ((FIREABLE(Enolase) AND (NOT FIREABLE(Aldolase) OR (FIREABLE(Transaldolase) AND FIREABLE(TIM_forward)) OR NOT FIREABLE(Enolase))))) : A (G (NOT FIREABLE(remove)))
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 (()))
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-C0100N0000100000-ReachabilityFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(remove)))
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-C0100N0000100000-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Ru5P_epimerase) AND FIREABLE(remove))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-2.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Phosphoglycerate_mutase) AND FIREABLE(generate) AND FIREABLE(Glutathione_oxidation) AND (FIREABLE(Ru5P_epimerase) OR FIREABLE(Hexokinase)))))
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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4365014 markings, 7736940 edges, 873003 markings/sec, 0 secs
lola: sara is running 5 secs || 8179812 markings, 15348307 edges, 762960 markings/sec, 5 secs
lola: sara is running 10 secs || 12162133 markings, 22786739 edges, 796464 markings/sec, 10 secs
lola: sara is running 15 secs || 16215219 markings, 30372805 edges, 810617 markings/sec, 15 secs
lola: sara is running 20 secs || 20224733 markings, 37885223 edges, 801903 markings/sec, 20 secs
lola: sara is running 25 secs || 24276146 markings, 45201326 edges, 810283 markings/sec, 25 secs
lola: sara is running 30 secs || 28504683 markings, 51905351 edges, 845707 markings/sec, 30 secs
lola: sara is running 35 secs || 32686373 markings, 58531929 edges, 836338 markings/sec, 35 secs
lola: sara is running 40 secs || 36836268 markings, 65108638 edges, 829979 markings/sec, 40 secs
lola: sara is running 45 secs || 40810768 markings, 72121761 edges, 794900 markings/sec, 45 secs
lola: sara is running 50 secs || 43916673 markings, 78783014 edges, 621181 markings/sec, 50 secs
lola: sara is running 55 secs || 47090171 markings, 85422475 edges, 634700 markings/sec, 55 secs

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 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(Phosphofructokinase) OR NOT FIREABLE(generate)) AND FIREABLE(Transketolase2))))
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 9 literals and 3 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-C0100N0000100000-ReachabilityFireability-4.sara
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================lola:
========================================
lola: ...considering subproblem: E (F ((FIREABLE(Transketolase2) AND NOT FIREABLE(Glutathione_reductose) AND FIREABLE(Lactate_dehydrogenase))))
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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-4.sara.
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Lactate_dehydrogenase) OR NOT FIREABLE(remove) OR NOT FIREABLE(Lactate_dehydrogenase) OR (FIREABLE(TIM_backward) AND FIREABLE(Enolase)))))
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 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4365566 markings, 7882858 edges, 873113 markings/sec, 0 secs
lola: sara is running 5 secs || 8559717 markings, 15477996 edges, 838830 markings/sec, 5 secs
lola: sara is running 10 secs || 12679595 markings, 22939169 edges, 823976 markings/sec, 10 secs
lola: sara is running 15 secs || 16668414 markings, 30114978 edges, 797764 markings/sec, 15 secs
lola: sara is running 20 secs || 20529708 markings, 37089598 edges, 772259 markings/sec, 20 secs

lola: sara is running 25 secs || 24377073 markings, 44023114 edges, 769473 markings/sec, 25 secs
lola: sara is running 30 secs || 28463971 markings, 51073518 edges, 817380 markings/sec, 30 secs
lola: sara is running 35 secs || 32429211 markings, 57859411 edges, 793048 markings/sec, 35 secs
lola: sara is running 40 secs || 36419146 markings, 65086266 edges, 797987 markings/sec, 40 secs
lola: sara is running 45 secs || 40565690 markings, 72597369 edges, 829309 markings/sec, 45 secs
lola: sara is running 50 secs || 44693061 markings, 80074313 edges, 825474 markings/sec, 50 secs
lola: sara is running 55 secs || 48856152 markings, 87616589 edges, 832618 markings/sec, 55 secs
lola: sara is running 60 secs || 52934965 markings, 94801431 edges, 815763 markings/sec, 60 secs
lola: sara is running 65 secs || 56919015 markings, 101559318 edges, 796810 markings/sec, 65 secs
lola: sara is running 70 secs || 60834740 markings, 108193549 edges, 783145 markings/sec, 70 secs
lola: sara is running 75 secs || 64709570 markings, 114759542 edges, 774966 markings/sec, 75 secs
lola: sara is running 80 secs || 68572721 markings, 121380023 edges, 772630 markings/sec, 80 secs
lola: sara is running 85 secs || 71764154 markings, 127776475 edges, 638287 markings/sec, 85 secs
lola: sara is running 90 secs || 75216253 markings, 134152619 edges, 690420 markings/sec, 90 secs
lola: sara is running 95 secs || 78858087 markings, 140718663 edges, 728367 markings/sec, 95 secs
lola: sara is running 100 secs || 82580779 markings, 147431294 edges, 744538 markings/sec, 100 secs
lola: sara is running 105 secs || 86300129 markings, 154138972 edges, 743870 markings/sec, 105 secs
lola: sara is running 110 secs || 90063348 markings, 160927139 edges, 752644 markings/sec, 110 secs
lola: sara is running 115 secs || 94028807 markings, 167787815 edges, 793092 markings/sec, 115 secs
lola: sara is running 120 secs || 97687325 markings, 173654900 edges, 731704 markings/sec, 120 secs
lola: sara is running 125 secs || 101429345 markings, 179655244 edges, 748404 markings/sec, 125 secs
lola: sara is running 130 secs || 105574740 markings, 186436879 edges, 829079 markings/sec, 130 secs
lola: sara is running 135 secs || 109668944 markings, 193166181 edges, 818841 markings/sec, 135 secs
lola: sara is running 140 secs || 113696015 markings, 199780311 edges, 805414 markings/sec, 140 secs
lola: sara is running 145 secs || 117694856 markings, 206347112 edges, 799768 markings/sec, 145 secs
lola: sara is running 150 secs || 121533509 markings, 212878288 edges, 767731 markings/sec, 150 secs
lola: sara is running 155 secs || 124920809 markings, 218990037 edges, 677460 markings/sec, 155 secs
lola: sara is running 160 secs || 128407911 markings, 225129975 edges, 697420 markings/sec, 160 secs
lola: sara is running 165 secs || 132084233 markings, 231361829 edges, 735264 markings/sec, 165 secs
lola: sara is running 170 secs || 135857008 markings, 237758212 edges, 754555 markings/sec, 170 secs
lola: sara is running 175 secs || 139687193 markings, 244253179 edges, 766037 markings/sec, 175 secs
lola: sara is running 180 secs || 143497762 markings, 250715702 edges, 762114 markings/sec, 180 secs
lola: sara is running 185 secs || 147340968 markings, 257234834 edges, 768641 markings/sec, 185 secs
lola: sara is running 190 secs || 151201948 markings, 263784762 edges, 772196 markings/sec, 190 secs
lola: sara is running 195 secs || 154802413 markings, 270432802 edges, 720093 markings/sec, 195 secs
lola: sara is running 200 secs || 157814855 markings, 276466997 edges, 602488 markings/sec, 200 secs
lola: sara is running 205 secs || 160790985 markings, 282428143 edges, 595226 markings/sec, 205 secs
lola: sara is running 210 secs || 163846362 markings, 288547734 edges, 611075 markings/sec, 210 secs
lola: sara is running 215 secs || 167722680 markings, 294786352 edges, 775264 markings/sec, 215 secs
lola: sara is running 220 secs || 171374257 markings, 300641895 edges, 730315 markings/sec, 220 secs
lola: sara is running 225 secs || 175293449 markings, 307387345 edges, 783838 markings/sec, 225 secs
lola: sara is running 230 secs || 178901033 markings, 313899132 edges, 721517 markings/sec, 230 secs
lola: sara is running 235 secs || 181882575 markings, 319280918 edges, 596308 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Ru5P_isomerase) OR FIREABLE(Hexokinase) OR FIREABLE(Enolase) OR ((FIREABLE(Ru5P_isomerase) OR FIREABLE(Phosphofructokinase)) AND FIREABLE(generate)) OR FIREABLE(Ru5P_epimerase) OR FIREABLE(generate) OR FIREABLE(G6P_dehydrogenase) OR (FIREABLE(Pyruvate_kinase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Phosphoglycerate_mutase)))))
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: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Lactate_dehydrogenase)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphoglycerate_kinase) OR FIREABLE(Transketolase2) OR NOT FIREABLE(Lactate_dehydrogenase))))
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 16 literals and 4 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 647 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(GAP_dehydrogenase))))
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 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-11.sara
lola: The predicate is not invariant.
lola: lola: subprocess 12 will run for 808 seconds at most (--localtimelimit=-1)
state equation: calling and running sara
lola: ========================================
lola: lola: ========================================...considering subproblem: E (F (FIREABLE(Pyruvate_kinase)))

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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-12.sara
lola: ========================================
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Pyruvate_kinase)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1617 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Enolase) AND (NOT FIREABLE(Aldolase) OR (FIREABLE(Transaldolase) AND FIREABLE(TIM_forward)) OR NOT FIREABLE(Enolase)))))
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 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-14.sara
lola: The predicate is reachable.
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 15 will run for 3235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(remove)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-15.sara.try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-14.sara.

sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityFireability-11.sara.
sara: sara: place or transition ordering is non-deterministicplace or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: yes no no no yes yes unknown yes no yes no no yes yes yes yes
lola: ========================================
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494724653242

--------------------
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-C0100N0000100000"
export BK_EXAMINATION="ReachabilityFireability"
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-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 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-C0100N0000100000, examination is ReachabilityFireability"
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-149440264500567"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;