fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r108-blw3-149441612600567
Last Updated
June 27, 2017

About the Execution of LoLA for S_GPPP-PT-C0100N0000100000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15949.290 331578.00 638080.00 2654.90 TFFFTTTTFFTT?TFT 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 S_GPPP-PT-C0100N0000100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600567
=====================================================================

--------------------
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 1496398052300


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000100000: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_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 || 4275765 markings, 7579369 edges, 855153 markings/sec, 0 secs
lola: sara is running 5 secs || 8075063 markings, 15143799 edges, 759860 markings/sec, 5 secs
lola: sara is running 10 secs || 12125963 markings, 22723368 edges, 810180 markings/sec, 10 secs
lola: sara is running 15 secs || 16250149 markings, 30436799 edges, 824837 markings/sec, 15 secs
lola: sara is running 20 secs || 20322623 markings, 38065614 edges, 814495 markings/sec, 20 secs
lola: sara is running 25 secs || 24465892 markings, 45501338 edges, 828654 markings/sec, 25 secs
lola: sara is running 30 secs || 28830759 markings, 52422036 edges, 872973 markings/sec, 30 secs
lola: sara is running 35 secs || 33160220 markings, 59282873 edges, 865892 markings/sec, 35 secs
lola: sara is running 40 secs || 37524981 markings, 66200232 edges, 872952 markings/sec, 40 secs
lola: sara is running 45 secs || 41293138 markings, 73234171 edges, 753631 markings/sec, 45 secs
lola: sara is running 50 secs || 44469749 markings, 79939207 edges, 635322 markings/sec, 50 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: ...considering subproblem: E (F ((FIREABLE(Transketolase2) AND NOT FIREABLE(Glutathione_reductose) AND FIREABLE(Lactate_dehydrogenase))))
lola: 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: sara: place or transition ordering is non-deterministicplace 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 || 4307210 markings, 7777193 edges, 861442 markings/sec, 0 secs
lola: sara is running 5 secs || 8495184 markings, 15361116 edges, 837595 markings/sec, 5 secs
lola: sara is running 10 secs || 12648050 markings, 22882103 edges, 830573 markings/sec, 10 secs
lola: sara is running 15 secs || 16648768 markings, 30079870 edges, 800144 markings/sec, 15 secs
lola: sara is running 20 secs || 20520521 markings, 37073084 edges, 774351 markings/sec, 20 secs

lola: sara is running 25 secs || 24369044 markings, 44008722 edges, 769705 markings/sec, 25 secs
lola: sara is running 30 secs || 28423767 markings, 51009023 edges, 810945 markings/sec, 30 secs
lola: sara is running 35 secs || 32372090 markings, 57755936 edges, 789665 markings/sec, 35 secs
lola: sara is running 40 secs || 36353171 markings, 64966776 edges, 796216 markings/sec, 40 secs
lola: sara is running 45 secs || 40487765 markings, 72456124 edges, 826919 markings/sec, 45 secs
lola: sara is running 50 secs || 44617885 markings, 79938106 edges, 826024 markings/sec, 50 secs
lola: sara is running 55 secs || 48772894 markings, 87465729 edges, 831002 markings/sec, 55 secs
lola: sara is running 60 secs || 52905180 markings, 94752872 edges, 826457 markings/sec, 60 secs
lola: sara is running 65 secs || 56893349 markings, 101515834 edges, 797634 markings/sec, 65 secs
lola: sara is running 70 secs || 60803804 markings, 108141010 edges, 782091 markings/sec, 70 secs
lola: sara is running 75 secs || 64692794 markings, 114730936 edges, 777798 markings/sec, 75 secs
lola: sara is running 80 secs || 68554000 markings, 121342680 edges, 772241 markings/sec, 80 secs
lola: sara is running 85 secs || 71727555 markings, 127703171 edges, 634711 markings/sec, 85 secs
lola: sara is running 90 secs || 75170162 markings, 134069674 edges, 688521 markings/sec, 90 secs
lola: sara is running 95 secs || 78792876 markings, 140600951 edges, 724543 markings/sec, 95 secs
lola: sara is running 100 secs || 82511915 markings, 147306973 edges, 743808 markings/sec, 100 secs
lola: sara is running 105 secs || 86256558 markings, 154060523 edges, 748929 markings/sec, 105 secs
lola: sara is running 110 secs || 90022583 markings, 160853419 edges, 753205 markings/sec, 110 secs
lola: sara is running 115 secs || 93989242 markings, 167724347 edges, 793332 markings/sec, 115 secs
lola: sara is running 120 secs || 97667800 markings, 173623570 edges, 735712 markings/sec, 120 secs
lola: sara is running 125 secs || 101450768 markings, 179689591 edges, 756594 markings/sec, 125 secs
lola: sara is running 130 secs || 105581083 markings, 186446955 edges, 826063 markings/sec, 130 secs
lola: sara is running 135 secs || 109676297 markings, 193178230 edges, 819043 markings/sec, 135 secs
lola: sara is running 140 secs || 113722161 markings, 199823273 edges, 809173 markings/sec, 140 secs
lola: sara is running 145 secs || 117746084 markings, 206431254 edges, 804785 markings/sec, 145 secs
lola: sara is running 150 secs || 121594120 markings, 212987142 edges, 769607 markings/sec, 150 secs
lola: sara is running 155 secs || 124984346 markings, 219104513 edges, 678045 markings/sec, 155 secs
lola: sara is running 160 secs || 128496523 markings, 225280172 edges, 702435 markings/sec, 160 secs
lola: sara is running 165 secs || 132190920 markings, 231542694 edges, 738879 markings/sec, 165 secs
lola: sara is running 170 secs || 135973059 markings, 237955021 edges, 756428 markings/sec, 170 secs
lola: sara is running 175 secs || 139817360 markings, 244473941 edges, 768860 markings/sec, 175 secs
lola: sara is running 180 secs || 143655421 markings, 250982946 edges, 767612 markings/sec, 180 secs
lola: sara is running 185 secs || 147513421 markings, 257527241 edges, 771600 markings/sec, 185 secs
lola: sara is running 190 secs || 151393677 markings, 264110354 edges, 776051 markings/sec, 190 secs
lola: sara is running 195 secs || 154951295 markings, 270731036 edges, 711524 markings/sec, 195 secs
lola: sara is running 200 secs || 157955957 markings, 276749618 edges, 600932 markings/sec, 200 secs
lola: sara is running 205 secs || 160957839 markings, 282762341 edges, 600376 markings/sec, 205 secs
lola: sara is running 210 secs || 164116791 markings, 288999866 edges, 631790 markings/sec, 210 secs
lola: sara is running 215 secs || 167966519 markings, 295177381 edges, 769946 markings/sec, 215 secs
lola: sara is running 220 secs || 171657571 markings, 301096181 edges, 738210 markings/sec, 220 secs
lola: sara is running 225 secs || 175613440 markings, 307966910 edges, 791174 markings/sec, 225 secs
lola: sara is running 230 secs || 179253840 markings, 314534840 edges, 728080 markings/sec, 230 secs
lola: sara is running 235 secs || 181873948 markings, 319263674 edges, 524022 markings/sec, 235 secs
lola: sara is running 240 secs || 181876415 markings, 319268570 edges, 493 markings/sec, 240 secs
lola: sara is running 245 secs || 181909052 markings, 319333925 edges, 6527 markings/sec, 245 secs
lola: sara is running 250 secs || 181923411 markings, 319362664 edges, 2872 markings/sec, 250 secs
lola: sara is running 255 secs || 181934595 markings, 319382414 edges, 2237 markings/sec, 255 secs
lola: sara is running 260 secs || 182012589 markings, 319518252 edges, 15599 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 356 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: ========================================
lola: subprocess 8 will run for 401 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: 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: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
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 534 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 641 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: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 802 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: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-12.sara
lola: subprocess 13 will run for 1069 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1604 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: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityFireability-14.sara
lola: subprocess 15 will run for 3209 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(remove)))
lola: ========================================
lola: lola: SUBTASK
========================================
lola: lola: state equation: calling and running sara
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: place 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: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes unknown yes no yes no no yes yes yes yes
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 1496398383878

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_GPPP-PT-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/S_GPPP-PT-C0100N0000100000.tgz
mv S_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 S_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 r108-blw3-149441612600567"
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 ;