About the Execution of M4M.full for GPPP-PT-C1000N0000001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.320 | 790929.00 | 604919.00 | 9220.00 | FTTFFFFTFFFF?FFF | 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 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 mcc4mcc-full
Input is GPPP-PT-C1000N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006400355
=====================================================================
--------------------
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-C1000N0000001000-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527551429197
BK_STOP 1527552220126
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C1000N0000001000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 1288008, 'Memory': 15951.49, 'Tool': 'lola'}, {'Time': 1308000, 'Memory': 15952.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola GPPP-PT-C1000N0000001000...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GPPP-PT-C1000N0000001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
GPPP-PT-C1000N0000001000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ GPPP-PT-C1000N0000001000 @ 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-C1000N0000001000-ReachabilityCardinality.task
lola: A (G ((S7P <= GSSG))) : E (F ((((Pi <= S7P) OR (S7P <= ADP) OR (3 <= Ru5P)) AND (NADPplus <= _3PG)))) : E (F (((F6P <= 0) AND (Pyr + 1 <= Lac) AND ((2 <= a1) OR (Lac <= S7P) OR (GSSG + 1 <= NADplus))))) : A (G ((((NADplus <= b1) OR (1 <= E4P) OR (R5P <= 2)) AND (2 <= ATP)))) : E (F (((NADPplus + 1 <= start) AND (GSSG <= 1)))) : E (F ((3 <= R5P))) : A (G ((FBP <= NADPplus))) : E (F (((1 <= FBP) AND (2 <= _1_3_BPG)))) : A (G (((FBP <= 2) OR (c2 + 1 <= GSH) OR (b1 <= 1) OR (a2 + 1 <= Xu5P)))) : A (G (((_2PG <= S7P) OR (1 <= R5P) OR ((Lac <= b2) AND (2 <= Pyr)) OR ((2 <= E4P) AND ((1 <= DHAP) OR (3 <= NADplus)))))) : A (G ((2 <= NADPplus))) : A (G (((GAP <= R5P) OR (_2PG <= Lac) OR (Gluc <= 1) OR ((R5P <= 2) AND (GAP <= 0))))) : A (G ((((_1_3_BPG <= NADplus) OR (FBP <= c2)) AND (start <= 1) AND ((_2PG <= 1) OR (GAP + 1 <= NADH))))) : A (G (((PEP <= 2) OR (a1 + 1 <= GSSG) OR ((ADP + 1 <= start) AND (PEP + 1 <= F6P))))) : E (F (((FBP <= 2) AND (ADP + 1 <= NADH) AND (Ru5P <= 1) AND (start <= 1)))) : A (G (((2 <= a1) OR (2 <= NADPH) OR ((1 <= DHAP) AND (3 <= c2)) OR (_1_3_BPG + 1 <= _2PG) OR (Pyr <= 1))))
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 ((S7P <= GSSG)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17007 markings, 17006 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Pi <= S7P) OR (S7P <= ADP) OR (3 <= Ru5P)) AND (NADPplus <= _3PG))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2004 markings, 2003 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((F6P <= 0) AND (Pyr + 1 <= Lac) AND ((2 <= a1) OR (Lac <= S7P) OR (GSSG + 1 <= NADplus)))))
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-C1000N0000001000-ReachabilityCardinality-2.sara
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NADplus <= b1) OR (1 <= E4P) OR (R5P <= 2)) AND (2 <= ATP))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4002 markings, 4001 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADPplus + 1 <= start) AND (GSSG <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= R5P)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-5.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FBP <= NADPplus)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2005 markings, 2004 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= FBP) AND (2 <= _1_3_BPG))))
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-C1000N0000001000-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2015 markings, 2014 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FBP <= 2) OR (c2 + 1 <= GSH) OR (b1 <= 1) OR (a2 + 1 <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((_2PG <= S7P) OR (1 <= R5P) OR ((Lac <= b2) AND (2 <= Pyr)) OR ((2 <= E4P) AND ((1 <= DHAP) OR (3 <= NADplus))))))
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 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= NADPplus)))
lola: ========================================
lola: SUBTASK
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-9.sara
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2004 markings, 2003 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((GAP <= R5P) OR (_2PG <= Lac) OR (Gluc <= 1) OR ((R5P <= 2) AND (GAP <= 0)))))
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 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((_1_3_BPG <= NADplus) OR (FBP <= c2)) AND (start <= 1) AND ((_2PG <= 1) OR (GAP + 1 <= NADH)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3215342 markings, 10153684 edges, 643068 markings/sec, 0 secs
lola: sara is running 5 secs || 6342046 markings, 20138207 edges, 625341 markings/sec, 5 secs
lola: sara is running 10 secs || 9380743 markings, 29848554 edges, 607739 markings/sec, 10 secs
lola: sara is running 15 secs || 12512365 markings, 39861501 edges, 626324 markings/sec, 15 secs
lola: sara is running 20 secs || 15646831 markings, 49889145 edges, 626893 markings/sec, 20 secs
lola: sara is running 25 secs || 18618568 markings, 59397582 edges, 594347 markings/sec, 25 secs
lola: sara is running 30 secs || 21627289 markings, 69023087 edges, 601744 markings/sec, 30 secs
lola: sara is running 35 secs || 24502543 markings, 78224472 edges, 575051 markings/sec, 35 secs
lola: sara is running 40 secs || 27199732 markings, 86859141 edges, 539438 markings/sec, 40 secs
lola: sara is running 45 secs || 30288432 markings, 96744070 edges, 617740 markings/sec, 45 secs
lola: sara is running 50 secs || 33387237 markings, 106667380 edges, 619761 markings/sec, 50 secs
lola: sara is running 55 secs || 36502427 markings, 116638704 edges, 623038 markings/sec, 55 secs
lola: sara is running 60 secs || 39532201 markings, 126338242 edges, 605955 markings/sec, 60 secs
lola: sara is running 65 secs || 42567937 markings, 136059865 edges, 607147 markings/sec, 65 secs
lola: sara is running 70 secs || 45590089 markings, 145737088 edges, 604430 markings/sec, 70 secs
lola: sara is running 75 secs || 48622977 markings, 155448127 edges, 606578 markings/sec, 75 secs
lola: sara is running 80 secs || 51632632 markings, 165087850 edges, 601931 markings/sec, 80 secs
lola: sara is running 85 secs || 54650538 markings, 174753490 edges, 603581 markings/sec, 85 secs
lola: sara is running 90 secs || 57660652 markings, 184393529 edges, 602023 markings/sec, 90 secs
lola: sara is running 95 secs || 60686288 markings, 194082825 edges, 605127 markings/sec, 95 secs
lola: sara is running 100 secs || 63687124 markings, 203691794 edges, 600167 markings/sec, 100 secs
lola: sara is running 105 secs || 66698005 markings, 213337018 edges, 602176 markings/sec, 105 secs
lola: sara is running 110 secs || 69693704 markings, 222932968 edges, 599140 markings/sec, 110 secs
lola: sara is running 115 secs || 72700745 markings, 232564892 edges, 601408 markings/sec, 115 secs
lola: sara is running 120 secs || 75688335 markings, 242133885 edges, 597518 markings/sec, 120 secs
lola: sara is running 125 secs || 78685455 markings, 251733034 edges, 599424 markings/sec, 125 secs
lola: sara is running 130 secs || 81665808 markings, 261282673 edges, 596071 markings/sec, 130 secs
lola: sara is running 135 secs || 84639370 markings, 270805253 edges, 594712 markings/sec, 135 secs
lola: sara is running 140 secs || 87636657 markings, 280408604 edges, 599457 markings/sec, 140 secs
lola: sara is running 145 secs || 90602436 markings, 289910361 edges, 593156 markings/sec, 145 secs
lola: sara is running 150 secs || 93577507 markings, 299436571 edges, 595014 markings/sec, 150 secs
lola: sara is running 155 secs || 96540396 markings, 308928263 edges, 592578 markings/sec, 155 secs
lola: sara is running 160 secs || 99510024 markings, 318446495 edges, 593926 markings/sec, 160 secs
lola: sara is running 165 secs || 102486134 markings, 327980102 edges, 595222 markings/sec, 165 secs
lola: sara is running 170 secs || 105447159 markings, 337464892 edges, 592205 markings/sec, 170 secs
lola: sara is running 175 secs || 108394356 markings, 346904900 edges, 589439 markings/sec, 175 secs
lola: sara is running 180 secs || 111369369 markings, 356439363 edges, 595003 markings/sec, 180 secs
lola: sara is running 185 secs || 114310316 markings, 365858648 edges, 588189 markings/sec, 185 secs
lola: sara is running 190 secs || 117251580 markings, 375284146 edges, 588253 markings/sec, 190 secs
lola: sara is running 195 secs || 120230244 markings, 384824047 edges, 595733 markings/sec, 195 secs
lola: sara is running 200 secs || 123169413 markings, 394242285 edges, 587834 markings/sec, 200 secs
lola: sara is running 205 secs || 126102827 markings, 403641806 edges, 586683 markings/sec, 205 secs
lola: sara is running 210 secs || 129066894 markings, 413139571 edges, 592813 markings/sec, 210 secs
lola: sara is running 215 secs || 131997934 markings, 422530990 edges, 586208 markings/sec, 215 secs
lola: sara is running 220 secs || 134931745 markings, 431931094 edges, 586762 markings/sec, 220 secs
lola: sara is running 225 secs || 137886966 markings, 441399691 edges, 591044 markings/sec, 225 secs
lola: sara is running 230 secs || 140804572 markings, 450747266 edges, 583521 markings/sec, 230 secs
lola: sara is running 235 secs || 143716698 markings, 460076973 edges, 582425 markings/sec, 235 secs
lola: sara is running 240 secs || 146700913 markings, 469638123 edges, 596843 markings/sec, 240 secs
lola: sara is running 245 secs || 149682682 markings, 479191191 edges, 596354 markings/sec, 245 secs
lola: sara is running 250 secs || 152665045 markings, 488745910 edges, 596473 markings/sec, 250 secs
lola: sara is running 255 secs || 155647134 markings, 498305615 edges, 596418 markings/sec, 255 secs
lola: sara is running 260 secs || 158651396 markings, 507930330 edges, 600852 markings/sec, 260 secs
lola: sara is running 265 secs || 161627104 markings, 517463002 edges, 595142 markings/sec, 265 secs
lola: sara is running 270 secs || 164581199 markings, 526932189 edges, 590819 markings/sec, 270 secs
lola: sara is running 275 secs || 166274923 markings, 532356887 edges, 338745 markings/sec, 275 secs
lola: sara is running 280 secs || 166279610 markings, 532371956 edges, 937 markings/sec, 280 secs
lola: sara is running 285 secs || 166294312 markings, 532419227 edges, 2940 markings/sec, 285 secs
lola: sara is running 290 secs || 166296090 markings, 532424905 edges, 356 markings/sec, 290 secs
lola: sara is running 295 secs || 166296124 markings, 532425021 edges, 7 markings/sec, 295 secs
lola: sara is running 300 secs || 166296130 markings, 532425059 edges, 1 markings/sec, 300 secs
lola: sara is running 305 secs || 166296288 markings, 532425530 edges, 32 markings/sec, 305 secs
lola: sara is running 310 secs || 166302804 markings, 532446512 edges, 1303 markings/sec, 310 secs
lola: sara is running 315 secs || 166302808 markings, 532446545 edges, 1 markings/sec, 315 secs
lola: sara is running 320 secs || 166302819 markings, 532446573 edges, 2 markings/sec, 320 secs
lola: sara is running 325 secs || 166302833 markings, 532446596 edges, 3 markings/sec, 325 secs
lola: sara is running 330 secs || 166302848 markings, 532446623 edges, 3 markings/sec, 330 secs
lola: sara is running 335 secs || 166302858 markings, 532446643 edges, 2 markings/sec, 335 secs
lola: sara is running 340 secs || 166302865 markings, 532446673 edges, 1 markings/sec, 340 secs
lola: sara is running 345 secs || 166305032 markings, 532453665 edges, 433 markings/sec, 345 secs
lola: sara is running 350 secs || 166305040 markings, 532453688 edges, 2 markings/sec, 350 secs
lola: sara is running 355 secs || 166305048 markings, 532453710 edges, 2 markings/sec, 355 secs
lola: sara is running 360 secs || 166305050 markings, 532453734 edges, 0 markings/sec, 360 secs
lola: sara is running 365 secs || 166364100 markings, 532643493 edges, 11810 markings/sec, 365 secs
lola: sara is running 370 secs || 166366196 markings, 532650263 edges, 419 markings/sec, 370 secs
lola: sara is running 375 secs || 166366246 markings, 532650352 edges, 10 markings/sec, 375 secs
lola: sara is running 380 secs || 166374050 markings, 532675496 edges, 1561 markings/sec, 380 secs
lola: sara is running 385 secs || 166374064 markings, 532675522 edges, 3 markings/sec, 385 secs
lola: sara is running 390 secs || 166374075 markings, 532675542 edges, 2 markings/sec, 390 secs
lola: sara is running 395 secs || 166374087 markings, 532675564 edges, 2 markings/sec, 395 secs
lola: sara is running 400 secs || 166374092 markings, 532675588 edges, 1 markings/sec, 400 secs
lola: sara is running 405 secs || 166374098 markings, 532675609 edges, 1 markings/sec, 405 secs
lola: sara is running 410 secs || 166374103 markings, 532675627 edges, 1 markings/sec, 410 secs
lola: sara is running 415 secs || 166374108 markings, 532675641 edges, 1 markings/sec, 415 secs
lola: sara is running 420 secs || 166374109 markings, 532675657 edges, 0 markings/sec, 420 secs
lola: sara is running 425 secs || 166374117 markings, 532675676 edges, 2 markings/sec, 425 secs
lola: sara is running 430 secs || 166374122 markings, 532675701 edges, 1 markings/sec, 430 secs
lola: sara is running 435 secs || 166378118 markings, 532688506 edges, 799 markings/sec, 435 secs
lola: sara is running 440 secs || 166378122 markings, 532688533 edges, 1 markings/sec, 440 secs
lola: sara is running 445 secs || 166378126 markings, 532688554 edges, 1 markings/sec, 445 secs
lola: sara is running 450 secs || 166378136 markings, 532688579 edges, 2 markings/sec, 450 secs
lola: sara is running 455 secs || 166378142 markings, 532688607 edges, 1 markings/sec, 455 secs
lola: sara is running 460 secs || 166378150 markings, 532688633 edges, 2 markings/sec, 460 secs
lola: sara is running 465 secs || 166378152 markings, 532688652 edges, 0 markings/sec, 465 secs
lola: sara is running 470 secs || 166378160 markings, 532688672 edges, 2 markings/sec, 470 secs
lola: sara is running 475 secs || 166391766 markings, 532732416 edges, 2721 markings/sec, 475 secs
lola: sara is running 480 secs || 166393258 markings, 532737211 edges, 298 markings/sec, 480 secs
lola: sara is running 485 secs || 166393268 markings, 532737250 edges, 2 markings/sec, 485 secs
lola: sara is running 490 secs || 166393278 markings, 532737289 edges, 2 markings/sec, 490 secs
lola: sara is running 495 secs || 166393287 markings, 532737312 edges, 2 markings/sec, 495 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 931 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((PEP <= 2) OR (a1 + 1 <= GSSG) OR ((ADP + 1 <= start) AND (PEP + 1 <= F6P)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1691 markings, 1690 edges
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-13.sara
lola: subprocess 14 will run for 1397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FBP <= 2) AND (ADP + 1 <= NADH) AND (Ru5P <= 1) AND (start <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: lola: state equation: calling and running sarausing 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-C1000N0000001000-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-13.sara.
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-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: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2792 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= a1) OR (2 <= NADPH) OR ((1 <= DHAP) AND (3 <= c2)) OR (_1_3_BPG + 1 <= _2PG) OR (Pyr <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-15.sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no no yes no no no no unknown no no no
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-C1000N0000001000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
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-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 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 mcc4mcc-full"
echo " Input is GPPP-PT-C1000N0000001000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-blw7-152650006400355"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;