About the Execution of Irma.struct for GPPP-PT-C0100N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.300 | 596982.00 | 639273.00 | 11876.00 | FTTTTTTFTTFFTT?F | 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)
...................................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is GPPP-PT-C0100N0000000100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003600315
=====================================================================
--------------------
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-C0100N0000000100-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527197421868
BK_STOP 1527198018850
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0100N0000000100 as instance name.
Using GPPP as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 582753, 'Memory': 15952.82, 'Tool': 'lola'}, {'Time': 669654, 'Memory': 15952.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola GPPP-PT-C0100N0000000100...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ GPPP-PT-C0100N0000000100 @ 3540 seconds
----- Start make result stderr -----
----- 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-C0100N0000000100-ReachabilityFireability.task
lola: E (F ((FIREABLE(remove)))) : A (G ((FIREABLE(Phosphofructokinase) OR NOT FIREABLE(remove) OR (NOT FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Phosphofructokinase) AND FIREABLE(Ru5P_epimerase) AND NOT FIREABLE(Glutathione_oxidation))))) : E (F (FIREABLE(Enolase))) : E (F (FIREABLE(Enolase))) : E (F (((NOT FIREABLE(Aldolase)) AND FIREABLE(Enolase) AND ((FIREABLE(Aldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Pyruvate_kinase)) OR FIREABLE(Phosphofructokinase))))) : A (G (())) : A (G ((NOT FIREABLE(remove) OR NOT FIREABLE(Transketolase1)))) : E (F (())) : E (F ((FIREABLE(GAP_dehydrogenase) AND (FIREABLE(Phosphoclucose_isomerase) OR (NOT FIREABLE(TIM_backward) AND NOT FIREABLE(Transketolase1)))))) : E (F ((FIREABLE(Glutathione_reductose) AND ((FIREABLE(Transaldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Hexokinase)) OR FIREABLE(generate))))) : A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(Aldolase) OR (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(TIM_backward)) OR NOT FIREABLE(Glutathione_reductose)))) : A (G ((NOT FIREABLE(Enolase) OR ((FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)) AND NOT FIREABLE(TIM_backward) AND FIREABLE(Glutathione_oxidation) AND FIREABLE(Phosphofructokinase))))) : A (G ((NOT FIREABLE(Glutathione_oxidation) OR NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Transketolase1) OR NOT FIREABLE(G6P_dehydrogenase) OR NOT FIREABLE(Lactate_dehydrogenase)))) : A (G (())) : E (F ((FIREABLE(GAP_dehydrogenase) AND FIREABLE(generate) AND FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Pyruvate_kinase)))) : E (F (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: 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-C0100N0000000100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphofructokinase) OR NOT FIREABLE(remove) OR (NOT FIREABLE(Phosphoglycerate_kinase) AND NOT FIREABLE(Phosphofructokinase) AND FIREABLE(Ru5P_epimerase) AND NOT FIREABLE(Glutathione_oxidation)))))
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 34 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability.sara.
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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(Aldolase)) AND FIREABLE(Enolase) AND ((FIREABLE(Aldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Pyruvate_kinase)) OR FIREABLE(Phosphofructokinase)))))
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-C0100N0000000100-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 214 markings, 213 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 321 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-C0100N0000000100-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: 0 markings, 0 edges
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-4.sara.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(remove) OR NOT FIREABLE(Transketolase1))))
lola: ========================================
lola: SUBTASK
lola: sara: place or transition ordering is non-deterministic
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-C0100N0000000100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-6.sara.
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: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000000100-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GAP_dehydrogenase) AND (FIREABLE(Phosphoclucose_isomerase) OR (NOT FIREABLE(TIM_backward) AND NOT FIREABLE(Transketolase1))))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-8.sara.
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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Glutathione_reductose) AND ((FIREABLE(Transaldolase) AND FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Hexokinase)) OR FIREABLE(generate)))))
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 17 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 409 markings, 408 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(Aldolase) OR (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(TIM_backward)) OR NOT FIREABLE(Glutathione_reductose))))
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: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 215 markings, 214 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Enolase) OR ((FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)) AND NOT FIREABLE(TIM_backward) AND FIREABLE(Glutathione_oxidation) AND FIREABLE(Phosphofructokinase)))))
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 14 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Glutathione_oxidation) OR NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Transketolase1) OR NOT FIREABLE(G6P_dehydrogenase) 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 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-12.sara.
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: subprocess 13 will run for 1179 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-C0100N0000000100-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GAP_dehydrogenase) AND FIREABLE(generate) AND FIREABLE(Phosphoglycerate_kinase) AND NOT 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 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4169081 markings, 9988250 edges, 833816 markings/sec, 0 secs
lola: sara is running 5 secs || 7727071 markings, 18402871 edges, 711598 markings/sec, 5 secs
lola: sara is running 10 secs || 11957443 markings, 26109697 edges, 846074 markings/sec, 10 secs
lola: sara is running 15 secs || 15890289 markings, 33159302 edges, 786569 markings/sec, 15 secs
lola: sara is running 20 secs || 19986603 markings, 40503374 edges, 819263 markings/sec, 20 secs
lola: sara is running 25 secs || 23959958 markings, 47575227 edges, 794671 markings/sec, 25 secs
lola: sara is running 30 secs || 27834602 markings, 54568061 edges, 774929 markings/sec, 30 secs
lola: sara is running 35 secs || 31627114 markings, 61554747 edges, 758502 markings/sec, 35 secs
lola: sara is running 40 secs || 35678811 markings, 68754580 edges, 810339 markings/sec, 40 secs
lola: sara is running 45 secs || 39716343 markings, 76128298 edges, 807506 markings/sec, 45 secs
lola: sara is running 50 secs || 43937780 markings, 83497069 edges, 844287 markings/sec, 50 secs
lola: sara is running 55 secs || 47820955 markings, 90541746 edges, 776635 markings/sec, 55 secs
lola: sara is running 60 secs || 51921654 markings, 97962756 edges, 820140 markings/sec, 60 secs
lola: sara is running 65 secs || 56084468 markings, 105463025 edges, 832563 markings/sec, 65 secs
lola: sara is running 70 secs || 58995309 markings, 113193263 edges, 582168 markings/sec, 70 secs
lola: sara is running 75 secs || 61965885 markings, 121099595 edges, 594115 markings/sec, 75 secs
lola: sara is running 80 secs || 64912712 markings, 128938706 edges, 589365 markings/sec, 80 secs
lola: sara is running 85 secs || 67836277 markings, 136719032 edges, 584713 markings/sec, 85 secs
lola: sara is running 90 secs || 70487656 markings, 143772328 edges, 530276 markings/sec, 90 secs
lola: sara is running 95 secs || 73372342 markings, 151447910 edges, 576937 markings/sec, 95 secs
lola: sara is running 100 secs || 76241949 markings, 159081430 edges, 573921 markings/sec, 100 secs
lola: sara is running 105 secs || 79124476 markings, 166752178 edges, 576505 markings/sec, 105 secs
lola: sara is running 110 secs || 81967314 markings, 174313500 edges, 568568 markings/sec, 110 secs
lola: sara is running 115 secs || 84751057 markings, 181717803 edges, 556749 markings/sec, 115 secs
lola: sara is running 120 secs || 87626256 markings, 189365596 edges, 575040 markings/sec, 120 secs
lola: sara is running 125 secs || 90501886 markings, 197014354 edges, 575126 markings/sec, 125 secs
lola: sara is running 130 secs || 93401151 markings, 204725500 edges, 579853 markings/sec, 130 secs
lola: sara is running 135 secs || 96324343 markings, 212500100 edges, 584638 markings/sec, 135 secs
lola: sara is running 140 secs || 99247343 markings, 220274532 edges, 584600 markings/sec, 140 secs
lola: sara is running 145 secs || 102086988 markings, 227823526 edges, 567929 markings/sec, 145 secs
lola: sara is running 150 secs || 104963659 markings, 235472282 edges, 575334 markings/sec, 150 secs
lola: sara is running 155 secs || 107808912 markings, 243040830 edges, 569051 markings/sec, 155 secs
lola: sara is running 160 secs || 110734780 markings, 250813059 edges, 585174 markings/sec, 160 secs
lola: sara is running 165 secs || 113639380 markings, 258533564 edges, 580920 markings/sec, 165 secs
lola: sara is running 170 secs || 116422932 markings, 265929509 edges, 556710 markings/sec, 170 secs
lola: sara is running 175 secs || 119297919 markings, 273565871 edges, 574997 markings/sec, 175 secs
lola: sara is running 180 secs || 122142409 markings, 281118693 edges, 568898 markings/sec, 180 secs
lola: sara is running 185 secs || 125013620 markings, 288737958 edges, 574242 markings/sec, 185 secs
lola: sara is running 190 secs || 127972633 markings, 296574363 edges, 591803 markings/sec, 190 secs
lola: sara is running 195 secs || 131126066 markings, 303574124 edges, 630687 markings/sec, 195 secs
lola: sara is running 200 secs || 134267857 markings, 311187032 edges, 628358 markings/sec, 200 secs
lola: sara is running 205 secs || 137434240 markings, 318401857 edges, 633277 markings/sec, 205 secs
lola: sara is running 210 secs || 140817666 markings, 326128314 edges, 676685 markings/sec, 210 secs
lola: sara is running 215 secs || 144290647 markings, 334093532 edges, 694596 markings/sec, 215 secs
lola: sara is running 220 secs || 147757367 markings, 342042144 edges, 693344 markings/sec, 220 secs
lola: sara is running 225 secs || 151074205 markings, 349590783 edges, 663368 markings/sec, 225 secs
lola: sara is running 230 secs || 154558467 markings, 357585878 edges, 696852 markings/sec, 230 secs
lola: sara is running 235 secs || 157610649 markings, 364988270 edges, 610436 markings/sec, 235 secs
lola: sara is running 240 secs || 161047470 markings, 373141064 edges, 687364 markings/sec, 240 secs
lola: sara is running 245 secs || 164282943 markings, 380884683 edges, 647095 markings/sec, 245 secs
lola: sara is running 250 secs || 167704111 markings, 388753535 edges, 684234 markings/sec, 250 secs
lola: sara is running 255 secs || 171261073 markings, 396941847 edges, 711392 markings/sec, 255 secs
lola: sara is running 260 secs || 174788665 markings, 405051746 edges, 705518 markings/sec, 260 secs
lola: sara is running 265 secs || 178303272 markings, 413126989 edges, 702921 markings/sec, 265 secs
lola: sara is running 270 secs || 181603176 markings, 420629381 edges, 659981 markings/sec, 270 secs
lola: sara is running 275 secs || 184998415 markings, 428386019 edges, 679048 markings/sec, 275 secs
lola: sara is running 280 secs || 187608551 markings, 434702723 edges, 522027 markings/sec, 280 secs
lola: sara is running 285 secs || 187623990 markings, 434733158 edges, 3088 markings/sec, 285 secs
lola: sara is running 290 secs || 187624020 markings, 434733197 edges, 6 markings/sec, 290 secs
lola: sara is running 295 secs || 187624073 markings, 434733267 edges, 11 markings/sec, 295 secs
lola: sara is running 300 secs || 187643670 markings, 434769306 edges, 3919 markings/sec, 300 secs
lola: sara is running 305 secs || 187643680 markings, 434769321 edges, 2 markings/sec, 305 secs
lola: sara is running 310 secs || 187643695 markings, 434769338 edges, 3 markings/sec, 310 secs
lola: sara is running 315 secs || 187643706 markings, 434769354 edges, 2 markings/sec, 315 secs
lola: sara is running 320 secs || 187643724 markings, 434769377 edges, 4 markings/sec, 320 secs
lola: sara is running 325 secs || 187643736 markings, 434769395 edges, 2 markings/sec, 325 secs
lola: sara is running 330 secs || 187643751 markings, 434769412 edges, 3 markings/sec, 330 secs
lola: sara is running 335 secs || 187643760 markings, 434769425 edges, 2 markings/sec, 335 secs
lola: sara is running 340 secs || 187643766 markings, 434769434 edges, 1 markings/sec, 340 secs
lola: sara is running 345 secs || 187643782 markings, 434769454 edges, 3 markings/sec, 345 secs
lola: sara is running 350 secs || 187643797 markings, 434769473 edges, 3 markings/sec, 350 secs
lola: sara is running 355 secs || 187643808 markings, 434769489 edges, 2 markings/sec, 355 secs
lola: sara is running 360 secs || 187643820 markings, 434769503 edges, 2 markings/sec, 360 secs
lola: sara is running 365 secs || 187745698 markings, 434952848 edges, 20376 markings/sec, 365 secs
lola: sara is running 370 secs || 187745711 markings, 434952882 edges, 3 markings/sec, 370 secs
lola: sara is running 375 secs || 187745724 markings, 434952914 edges, 3 markings/sec, 375 secs
lola: sara is running 380 secs || 187745738 markings, 434952948 edges, 3 markings/sec, 380 secs
lola: sara is running 385 secs || 187747756 markings, 434957670 edges, 404 markings/sec, 385 secs
lola: sara is running 390 secs || 187756380 markings, 434971080 edges, 1725 markings/sec, 390 secs
lola: sara is running 395 secs || 187761182 markings, 434977382 edges, 960 markings/sec, 395 secs
lola: sara is running 400 secs || 187761213 markings, 434977423 edges, 6 markings/sec, 400 secs
lola: sara is running 405 secs || 187761252 markings, 434977474 edges, 8 markings/sec, 405 secs
lola: sara is running 410 secs || 187761273 markings, 434977502 edges, 4 markings/sec, 410 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2987 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-C0100N0000000100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: no yes yes yes yes yes yes no yes yes no no yes yes unknown no
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
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-C0100N0000000100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
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-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is GPPP-PT-C0100N0000000100, 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 r091-blw7-152650003600315"
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 '
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 ;