About the Execution of Irma.full for GPPP-PT-C0100N0000001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.410 | 3285673.00 | 4634928.00 | 87945.80 | F?F?T?FTTTFF?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 196K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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-full
Input is GPPP-PT-C0100N0000001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001300318
=====================================================================
--------------------
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-C0100N0000001000-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000001000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527067195872
BK_STOP 1527070481545
--------------------
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-C0100N0000001000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 538454, 'Memory': 15953.19, 'Tool': 'marcie'}, {'Time': 1045652, 'Memory': 15953.35, 'Tool': 'marcie'}, {'Time': 1417628, 'Memory': 15952.78, 'Tool': 'lola'}, {'Time': 1429570, 'Memory': 15923.15, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
CTLCardinality marcie GPPP-PT-C0100N0000001000...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 1.330sec
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.843sec
iterations count:11921 (541), effective:2875 (130)
RS generation: 3m19.648sec
-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)
starting MCC model checker
--------------------------
initing FirstDep: 0m 0.000sec
iterations count:100 (4), effective:11 (0)
checking: ~ [AG [EF [3<=GSH]]]
normalized: E [true U ~ [E [true U 3<=GSH]]]
abstracting: (3<=GSH)
states: 20,156,724,355,828,212 (16)
sat_reach.icc:155: Timeout: after 212 sec
/usr/bin/mcc-head: line 8: 7 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
CTLCardinality marcie GPPP-PT-C0100N0000001000...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
check for maximal unmarked siphon
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
net check time: 0m 0.000sec
init dd package: 0m 1.267sec
parse successfull
net created successfully
Net: GPPP_PT_C0100N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)
check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
net check time: 0m 0.000sec
init dd package: 0m 3.527sec
initing FirstDep: 0m 0.000sec
iterations count:11921 (541), effective:2875 (130)
RS generation: 3m18.795sec
-> reachability set: #nodes 713713 (7.1e+05) #states 20,292,531,036,711,574 (16)
starting MCC model checker
--------------------------
initing FirstDep: 0m 0.000sec
checking: ~ [AG [EF [3<=GSH]]]
normalized: E [true U ~ [E [true U 3<=GSH]]]
abstracting: (3<=GSH)
states: 20,156,724,355,828,212 (16)
iterations count:100 (4), effective:11 (0)
sat_reach.icc:155: Timeout: after 212 sec
MC time: 3m33.113sec
checking: AX [EF [~ [3<=NADPplus]]]
normalized: ~ [EX [~ [E [true U ~ [3<=NADPplus]]]]]
abstracting: (3<=NADPplus)
states: 20,292,531,036,711,574 (16)
before gc: list nodes free: 1847
after gc: idd nodes used:1285464, unused:62714536; list nodes free:529846094
.-> the formula is FALSE
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m21.271sec
checking: AF [AG [[GAP<=GSSG | 1<=c1]]]
normalized: ~ [EG [E [true U ~ [[GAP<=GSSG | 1<=c1]]]]]
abstracting: (1<=c1)
states: 20,195,337,077,365,934 (16)
abstracting: (GAP<=GSSG)
states: 20,292,531,036,711,574 (16)
net_ddint.h:596: Timeout: after 210 sec
/usr/bin/mcc-head: line 8: 7 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
CTLCardinality lola GPPP-PT-C0100N0000001000...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GPPP-PT-C0100N0000001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000001000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ GPPP-PT-C0100N0000001000 @ 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-C0100N0000001000-CTLCardinality.task
lola: (E (F (((GSSG <= 1) OR (GSSG + 1 <= F6P)))) OR (((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1)) AND ((2 <= _2PG) OR A (X ((3 <= FBP)))))) : (A (G (E (G ((S7P <= Pi))))) OR E (X ((c1 <= b1)))) : NOT((((3 <= NADPplus) OR (GSSG <= NADplus)) AND NOT(E (F ((ATP <= DHAP)))))) : (((E (G ((3 <= a1))) AND (Lac <= F6P)) OR E (F (((ATP <= R5P) AND (F6P <= Ru5P))))) AND A (F (A (G ((Ru5P <= ADP)))))) : NOT(A (G (E (F ((3 <= GSH)))))) : A (F (A (G (((1 <= c1) OR (GAP <= GSSG)))))) : A (X (((1 <= NADPplus) AND E (G ((F6P <= R5P)))))) : (E (((S7P <= Ru5P) U (3 <= NADH))) OR A (F (((c1 <= 0) OR ((Ru5P <= _2PG) AND (3 <= R5P)))))) : E (F (E (F (((1 <= Gluc) AND (Gluc <= R5P)))))) : E (F ((A (G ((DHAP <= NADH))) OR ((3 <= DHAP) AND (2 <= DHAP) AND (GSSG <= FBP))))) : A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP)))))) : (A (G ((E4P <= 0))) OR (NOT(A (F ((1 <= F6P)))) AND NOT(A (G ((1 <= Ru5P)))))) : A (G (((3 <= PEP) OR (((GSSG <= ADP) OR (PEP <= c1)) AND (ADP <= ATP))))) : NOT((E (F (((3 <= NADH) OR (3 <= Lac)))) OR NOT(A (X (TRUE))))) : A (X (E (F ((NADPplus <= 2))))) : NOT(NOT((E (F ((NADplus <= PEP))) AND A (F ((1 <= Gluc))))))
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 (((GSSG <= 1) OR (GSSG + 1 <= F6P)))) OR (((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1)) AND ((2 <= _2PG) OR A (X ((3 <= FBP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((GSSG <= 1) OR (GSSG + 1 <= F6P))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2634759 markings, 9790582 edges, 526952 markings/sec, 0 secs
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: ((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= NADPH) OR ((1 <= S7P) AND (FBP <= b1)) OR (a1 <= 1))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((S7P <= Pi))))) OR E (X ((c1 <= b1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((S7P <= Pi)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (Pi + 1 <= S7P))))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1680809 markings, 11413948 edges, 336149 markings/sec, 0 secs
lola: 3217612 markings, 23404277 edges, 307361 markings/sec, 5 secs
lola: 4734230 markings, 34584658 edges, 303324 markings/sec, 10 secs
lola: 6422651 markings, 46093716 edges, 337684 markings/sec, 15 secs
lola: 7961606 markings, 58001729 edges, 307791 markings/sec, 20 secs
lola: 9366991 markings, 69754098 edges, 281077 markings/sec, 25 secs
lola: 10908254 markings, 81470969 edges, 308253 markings/sec, 30 secs
lola: 12191829 markings, 90996479 edges, 256715 markings/sec, 35 secs
lola: 13565694 markings, 100222135 edges, 274773 markings/sec, 40 secs
lola: 14869193 markings, 110222840 edges, 260700 markings/sec, 45 secs
lola: 16080870 markings, 119875681 edges, 242335 markings/sec, 50 secs
lola: 17385703 markings, 129199335 edges, 260967 markings/sec, 55 secs
lola: 18875097 markings, 141988636 edges, 297879 markings/sec, 60 secs
lola: 20356510 markings, 154709447 edges, 296283 markings/sec, 65 secs
lola: 21716526 markings, 166945146 edges, 272003 markings/sec, 70 secs
lola: 22991705 markings, 178812254 edges, 255036 markings/sec, 75 secs
lola: 24349162 markings, 189484085 edges, 271491 markings/sec, 80 secs
lola: 25574499 markings, 199637509 edges, 245067 markings/sec, 85 secs
lola: 26760722 markings, 209969950 edges, 237245 markings/sec, 90 secs
lola: 28023335 markings, 220242455 edges, 252523 markings/sec, 95 secs
lola: 29412650 markings, 232176080 edges, 277863 markings/sec, 100 secs
lola: 30797450 markings, 244064611 edges, 276960 markings/sec, 105 secs
lola: 32079460 markings, 255390913 edges, 256402 markings/sec, 110 secs
lola: 33269541 markings, 266467269 edges, 238016 markings/sec, 115 secs
lola: 34449972 markings, 276819951 edges, 236086 markings/sec, 120 secs
lola: 35614534 markings, 287731575 edges, 232912 markings/sec, 125 secs
lola: 36763362 markings, 298490583 edges, 229766 markings/sec, 130 secs
lola: 37920393 markings, 309329054 edges, 231406 markings/sec, 135 secs
lola: 38938324 markings, 319480715 edges, 203586 markings/sec, 140 secs
lola: 39951623 markings, 329591283 edges, 202660 markings/sec, 145 secs
lola: 41139279 markings, 341269373 edges, 237531 markings/sec, 150 secs
lola: 42477471 markings, 351811664 edges, 267638 markings/sec, 155 secs
lola: 43708261 markings, 361923254 edges, 246158 markings/sec, 160 secs
lola: 44884239 markings, 372215767 edges, 235196 markings/sec, 165 secs
lola: 46118608 markings, 382172445 edges, 246874 markings/sec, 170 secs
lola: 47525915 markings, 392885229 edges, 281461 markings/sec, 175 secs
lola: 48810782 markings, 404017832 edges, 256973 markings/sec, 180 secs
lola: 50043736 markings, 414676130 edges, 246591 markings/sec, 185 secs
lola: 51233755 markings, 424342911 edges, 238004 markings/sec, 190 secs
lola: 52598999 markings, 435573534 edges, 273049 markings/sec, 195 secs
lola: 53959910 markings, 446760865 edges, 272182 markings/sec, 200 secs
lola: 55313227 markings, 457903400 edges, 270663 markings/sec, 205 secs
lola: 56668329 markings, 469037924 edges, 271020 markings/sec, 210 secs
lola: 58012728 markings, 480096754 edges, 268880 markings/sec, 215 secs
lola: 59351740 markings, 491106315 edges, 267802 markings/sec, 220 secs
lola: 60683331 markings, 502057832 edges, 266318 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((3 <= NADPplus) OR (GSSG <= NADplus)) AND NOT(E (F ((ATP <= DHAP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NADPplus <= 2) AND (NADplus + 1 <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NADPplus <= 2) AND (NADplus + 1 <= GSSG))
lola: processed formula length: 43
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 2 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 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ATP <= DHAP)))
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-C0100N0000001000-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((3 <= a1))) AND (Lac <= F6P)) OR E (F (((ATP <= R5P) AND (F6P <= Ru5P))))) AND A (F (A (G ((Ru5P <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= a1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (a1 <= 2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 407 markings, 407 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Lac <= F6P)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Lac <= F6P)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: processed formula with 1 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 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((Ru5P <= ADP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((Ru5P <= ADP)))))
lola: processed formula: A (F (A (G ((Ru5P <= ADP)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 4391050 markings, 6646691 edges, 878210 markings/sec, 0 secs
lola: 8647499 markings, 13006552 edges, 851290 markings/sec, 5 secs
lola: 12765476 markings, 19168191 edges, 823595 markings/sec, 10 secs
lola: 16870117 markings, 25309621 edges, 820928 markings/sec, 15 secs
lola: 20917605 markings, 31363305 edges, 809498 markings/sec, 20 secs
lola: 24946821 markings, 37388775 edges, 805843 markings/sec, 25 secs
lola: 29030293 markings, 43481753 edges, 816694 markings/sec, 30 secs
lola: 33098805 markings, 49553814 edges, 813702 markings/sec, 35 secs
lola: 37158870 markings, 55602706 edges, 812013 markings/sec, 40 secs
lola: 41190074 markings, 61622348 edges, 806241 markings/sec, 45 secs
lola: 45196801 markings, 67625137 edges, 801345 markings/sec, 50 secs
lola: 49190632 markings, 73582327 edges, 798766 markings/sec, 55 secs
lola: 53212753 markings, 79570138 edges, 804424 markings/sec, 60 secs
lola: 57173547 markings, 85502742 edges, 792159 markings/sec, 65 secs
lola: 61173454 markings, 91450494 edges, 799981 markings/sec, 70 secs
lola: 65125226 markings, 97361830 edges, 790354 markings/sec, 75 secs
lola: 69100931 markings, 103296605 edges, 795141 markings/sec, 80 secs
lola: 73068337 markings, 109198376 edges, 793481 markings/sec, 85 secs
lola: 77009899 markings, 115072579 edges, 788312 markings/sec, 90 secs
lola: 80934900 markings, 120923309 edges, 785000 markings/sec, 95 secs
lola: 84855494 markings, 126769998 edges, 784119 markings/sec, 100 secs
lola: 88763522 markings, 132607544 edges, 781606 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((3 <= GSH))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (3 <= GSH))))
lola: processed formula length: 35
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2340317 markings, 11861195 edges, 3689348869717491712 markings/sec, 0 secs
lola: 4521971 markings, 24197076 edges, 436331 markings/sec, 5 secs
lola: 7017962 markings, 36452311 edges, 499198 markings/sec, 10 secs
lola: 8945671 markings, 48217773 edges, 385542 markings/sec, 15 secs
lola: 10945979 markings, 59860953 edges, 400062 markings/sec, 20 secs
lola: 12853462 markings, 69740856 edges, 381497 markings/sec, 25 secs
lola: 14687229 markings, 79337457 edges, 366753 markings/sec, 30 secs
lola: 16260210 markings, 88813251 edges, 314596 markings/sec, 35 secs
lola: 18340519 markings, 99564246 edges, 416062 markings/sec, 40 secs
lola: 20179202 markings, 111427549 edges, 367737 markings/sec, 45 secs
lola: 22089493 markings, 123232713 edges, 382058 markings/sec, 50 secs
lola: 24050368 markings, 134591274 edges, 392175 markings/sec, 55 secs
lola: 25619047 markings, 145459602 edges, 313736 markings/sec, 60 secs
lola: 27050320 markings, 155829189 edges, 286255 markings/sec, 65 secs
lola: 28680260 markings, 165955693 edges, 325988 markings/sec, 70 secs
lola: 30223883 markings, 175068263 edges, 308725 markings/sec, 75 secs
lola: 31637337 markings, 183629272 edges, 282691 markings/sec, 80 secs
lola: 32870023 markings, 192383940 edges, 246537 markings/sec, 85 secs
lola: 34333289 markings, 200719435 edges, 292653 markings/sec, 90 secs
lola: 36149990 markings, 211286205 edges, 363340 markings/sec, 95 secs
lola: 37664187 markings, 221520756 edges, 302839 markings/sec, 100 secs
lola: 39470347 markings, 232222734 edges, 361232 markings/sec, 105 secs
lola: 41184576 markings, 242223707 edges, 342846 markings/sec, 110 secs
lola: 42613136 markings, 252119250 edges, 285712 markings/sec, 115 secs
lola: 43866599 markings, 261447588 edges, 250693 markings/sec, 120 secs
lola: 45430415 markings, 271291728 edges, 312763 markings/sec, 125 secs
lola: 46777166 markings, 279445136 edges, 269350 markings/sec, 130 secs
lola: 48197838 markings, 287591885 edges, 284134 markings/sec, 135 secs
lola: 49327779 markings, 295340767 edges, 225988 markings/sec, 140 secs
lola: 50478889 markings, 303133958 edges, 230222 markings/sec, 145 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 51312750 markings, 307453762 edges
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= c1) OR (GAP <= GSSG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((1 <= c1) OR (GAP <= GSSG))))))
lola: processed formula: A (F (A (G (((1 <= c1) OR (GAP <= GSSG))))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3924896 markings, 7746002 edges, 784979 markings/sec, 0 secs
lola: 7675592 markings, 15174543 edges, 750139 markings/sec, 5 secs
lola: 11381387 markings, 22517227 edges, 741159 markings/sec, 10 secs
lola: 15068668 markings, 29825936 edges, 737456 markings/sec, 15 secs
lola: 18750917 markings, 37125220 edges, 736450 markings/sec, 20 secs
lola: 22418578 markings, 44396628 edges, 733532 markings/sec, 25 secs
lola: 26071771 markings, 51640410 edges, 730639 markings/sec, 30 secs
lola: 29712490 markings, 58859995 edges, 728144 markings/sec, 35 secs
lola: 33337930 markings, 66049247 edges, 725088 markings/sec, 40 secs
lola: 36951336 markings, 73215167 edges, 722681 markings/sec, 45 secs
lola: 40543452 markings, 80339371 edges, 718423 markings/sec, 50 secs
lola: 44127133 markings, 87447390 edges, 716736 markings/sec, 55 secs
lola: 47706309 markings, 94545899 edges, 715835 markings/sec, 60 secs
lola: 51280730 markings, 101635534 edges, 714884 markings/sec, 65 secs
lola: 54849443 markings, 108714375 edges, 713743 markings/sec, 70 secs
lola: 58419369 markings, 115795649 edges, 713985 markings/sec, 75 secs
lola: 61986753 markings, 122871872 edges, 713477 markings/sec, 80 secs
lola: 65540736 markings, 129921471 edges, 710797 markings/sec, 85 secs
lola: 69093505 markings, 136969217 edges, 710554 markings/sec, 90 secs
lola: 72645469 markings, 144015362 edges, 710393 markings/sec, 95 secs
lola: 76193276 markings, 151053282 edges, 709561 markings/sec, 100 secs
lola: 79732233 markings, 158073613 edges, 707791 markings/sec, 105 secs
lola: 83263180 markings, 165078057 edges, 706189 markings/sec, 110 secs
lola: 86775908 markings, 172046881 edges, 702546 markings/sec, 115 secs
lola: 90292445 markings, 179023257 edges, 703307 markings/sec, 120 secs
lola: 93800948 markings, 185983699 edges, 701701 markings/sec, 125 secs
lola: 97294854 markings, 192915161 edges, 698781 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= NADPplus) AND E (G ((F6P <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= NADPplus)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= NADPplus)))
lola: processed formula: A (X ((1 <= NADPplus)))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((F6P <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (R5P + 1 <= F6P))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 801 markings, 800 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((S7P <= Ru5P) U (3 <= NADH))) OR A (F (((c1 <= 0) OR ((Ru5P <= _2PG) AND (3 <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((S7P <= Ru5P) U (3 <= NADH)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((S7P <= Ru5P) U (3 <= NADH))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3014 markings, 3415 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= Gluc) AND (Gluc <= 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-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 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((DHAP <= NADH))) OR ((3 <= DHAP) AND (2 <= DHAP) AND (GSSG <= FBP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((DHAP <= NADH)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (NADH + 1 <= DHAP))))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4088 markings, 10253 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP))))))
lola: processed formula: A (F ((((FBP <= ATP) OR (G6P + 1 <= b2)) AND A (G ((Pyr <= DHAP))))))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5986 markings, 7773 edges
lola: ========================================
lola: subprocess 11 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((E4P <= 0))) OR (NOT(A (F ((1 <= F6P)))) AND NOT(A (G ((1 <= Ru5P))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E4P <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-11.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: 14 markings, 13 edges
lola: ========================================
lola: subprocess 12 will run for 722 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((F6P <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= F6P)))
lola: processed formula length: 25
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 802 markings, 801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 722 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= PEP) OR (((GSSG <= ADP) OR (PEP <= c1)) AND (ADP <= 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2570844 markings, 10925706 edges, 514169 markings/sec, 0 secs
lola: sara is running 5 secs || 4852366 markings, 20796782 edges, 456304 markings/sec, 5 secs
lola: sara is running 10 secs || 6750652 markings, 30922326 edges, 379657 markings/sec, 10 secs
lola: sara is running 15 secs || 8499535 markings, 40155115 edges, 349777 markings/sec, 15 secs
lola: sara is running 20 secs || 10229475 markings, 48912646 edges, 345988 markings/sec, 20 secs
lola: sara is running 25 secs || 11752419 markings, 57185418 edges, 304589 markings/sec, 25 secs
lola: sara is running 30 secs || 13378048 markings, 65528911 edges, 325126 markings/sec, 30 secs
lola: sara is running 35 secs || 14998658 markings, 73983448 edges, 324122 markings/sec, 35 secs
lola: sara is running 40 secs || 16473737 markings, 81974223 edges, 295016 markings/sec, 40 secs
lola: sara is running 45 secs || 18080865 markings, 90054347 edges, 321426 markings/sec, 45 secs
lola: sara is running 50 secs || 19706512 markings, 98663401 edges, 325129 markings/sec, 50 secs
lola: sara is running 55 secs || 21228338 markings, 106912548 edges, 304365 markings/sec, 55 secs
lola: sara is running 60 secs || 23012315 markings, 115855739 edges, 356795 markings/sec, 60 secs
lola: sara is running 65 secs || 24745854 markings, 125170464 edges, 346708 markings/sec, 65 secs
lola: sara is running 70 secs || 26449122 markings, 134084737 edges, 340654 markings/sec, 70 secs
lola: sara is running 75 secs || 28102135 markings, 142561306 edges, 330603 markings/sec, 75 secs
lola: sara is running 80 secs || 29602221 markings, 150735821 edges, 300017 markings/sec, 80 secs
lola: sara is running 85 secs || 31241682 markings, 159232755 edges, 327892 markings/sec, 85 secs
lola: sara is running 90 secs || 32742423 markings, 168362093 edges, 300148 markings/sec, 90 secs
lola: sara is running 95 secs || 34064177 markings, 176543091 edges, 264351 markings/sec, 95 secs
lola: sara is running 100 secs || 35533422 markings, 184673602 edges, 293849 markings/sec, 100 secs
lola: sara is running 105 secs || 36994663 markings, 192292971 edges, 292248 markings/sec, 105 secs
lola: sara is running 110 secs || 38313723 markings, 199413878 edges, 263812 markings/sec, 110 secs
lola: sara is running 115 secs || 39739134 markings, 206820735 edges, 285082 markings/sec, 115 secs
lola: sara is running 120 secs || 40980959 markings, 214056769 edges, 248365 markings/sec, 120 secs
lola: sara is running 125 secs || 42194495 markings, 221580285 edges, 242707 markings/sec, 125 secs
lola: sara is running 130 secs || 43313146 markings, 228386641 edges, 223730 markings/sec, 130 secs
lola: sara is running 135 secs || 44658961 markings, 235509533 edges, 269163 markings/sec, 135 secs
lola: sara is running 140 secs || 45997645 markings, 242592105 edges, 267737 markings/sec, 140 secs
lola: sara is running 145 secs || 47246508 markings, 249356198 edges, 249773 markings/sec, 145 secs
lola: sara is running 150 secs || 48616872 markings, 256441773 edges, 274073 markings/sec, 150 secs
lola: sara is running 155 secs || 49790673 markings, 263281476 edges, 234760 markings/sec, 155 secs
lola: sara is running 160 secs || 50934548 markings, 270436284 edges, 228775 markings/sec, 160 secs
lola: sara is running 165 secs || 52026505 markings, 277014803 edges, 218391 markings/sec, 165 secs
lola: sara is running 170 secs || 53291917 markings, 283937146 edges, 253082 markings/sec, 170 secs
lola: sara is running 175 secs || 54721867 markings, 291420308 edges, 285990 markings/sec, 175 secs
lola: sara is running 180 secs || 56077788 markings, 298721486 edges, 271184 markings/sec, 180 secs
lola: sara is running 185 secs || 57520870 markings, 306216448 edges, 288616 markings/sec, 185 secs
lola: sara is running 190 secs || 58733373 markings, 313348158 edges, 242501 markings/sec, 190 secs
lola: sara is running 195 secs || 59932908 markings, 320776727 edges, 239907 markings/sec, 195 secs
lola: sara is running 200 secs || 61044842 markings, 327561516 edges, 222387 markings/sec, 200 secs
lola: sara is running 205 secs || 62512104 markings, 335266711 edges, 293452 markings/sec, 205 secs
lola: sara is running 210 secs || 64153841 markings, 344060094 edges, 328347 markings/sec, 210 secs
lola: sara is running 215 secs || 65675805 markings, 352223739 edges, 304393 markings/sec, 215 secs
lola: sara is running 220 secs || 67208473 markings, 359843252 edges, 306534 markings/sec, 220 secs
lola: sara is running 225 secs || 68643579 markings, 367613561 edges, 287021 markings/sec, 225 secs
lola: sara is running 230 secs || 70025533 markings, 375012125 edges, 276391 markings/sec, 230 secs
lola: sara is running 235 secs || 71387384 markings, 382231919 edges, 272370 markings/sec, 235 secs
lola: sara is running 240 secs || 72557065 markings, 389408085 edges, 233936 markings/sec, 240 secs
lola: sara is running 245 secs || 73657853 markings, 396164742 edges, 220158 markings/sec, 245 secs
lola: sara is running 250 secs || 74884614 markings, 403465561 edges, 245352 markings/sec, 250 secs
lola: sara is running 255 secs || 76247771 markings, 411204780 edges, 272631 markings/sec, 255 secs
lola: sara is running 260 secs || 77550258 markings, 419293486 edges, 260497 markings/sec, 260 secs
lola: sara is running 265 secs || 78739030 markings, 426560284 edges, 237754 markings/sec, 265 secs
lola: sara is running 270 secs || 80134775 markings, 433852293 edges, 279149 markings/sec, 270 secs
lola: sara is running 275 secs || 81496503 markings, 441056493 edges, 272346 markings/sec, 275 secs
lola: sara is running 280 secs || 82750523 markings, 447905356 edges, 250804 markings/sec, 280 secs
lola: sara is running 285 secs || 84131048 markings, 454961580 edges, 276105 markings/sec, 285 secs
lola: sara is running 290 secs || 85225046 markings, 461454930 edges, 218800 markings/sec, 290 secs
lola: sara is running 295 secs || 86304198 markings, 468205035 edges, 215830 markings/sec, 295 secs
lola: sara is running 300 secs || 87336998 markings, 474464048 edges, 206560 markings/sec, 300 secs
lola: sara is running 305 secs || 88520274 markings, 481096695 edges, 236655 markings/sec, 305 secs
lola: sara is running 310 secs || 89682830 markings, 488020834 edges, 232511 markings/sec, 310 secs
lola: sara is running 315 secs || 90840506 markings, 495187076 edges, 231535 markings/sec, 315 secs
lola: sara is running 320 secs || 91918749 markings, 501738884 edges, 215649 markings/sec, 320 secs
lola: sara is running 325 secs || 93209438 markings, 508624582 edges, 258138 markings/sec, 325 secs
lola: sara is running 330 secs || 94509864 markings, 515467562 edges, 260085 markings/sec, 330 secs
lola: sara is running 335 secs || 95753568 markings, 522150739 edges, 248741 markings/sec, 335 secs
lola: sara is running 340 secs || 97108733 markings, 529206699 edges, 271033 markings/sec, 340 secs
lola: sara is running 345 secs || 98198764 markings, 535427614 edges, 218006 markings/sec, 345 secs
lola: sara is running 350 secs || 99269275 markings, 541977585 edges, 214102 markings/sec, 350 secs
lola: sara is running 355 secs || 100242244 markings, 547974156 edges, 194594 markings/sec, 355 secs
lola: sara is running 360 secs || 101343133 markings, 554556485 edges, 220178 markings/sec, 360 secs
lola: sara is running 365 secs || 102509595 markings, 561065215 edges, 233292 markings/sec, 365 secs
lola: sara is running 370 secs || 103608629 markings, 567814081 edges, 219807 markings/sec, 370 secs
lola: sara is running 375 secs || 104625281 markings, 574069525 edges, 203330 markings/sec, 375 secs
lola: sara is running 380 secs || 105773973 markings, 580910949 edges, 229738 markings/sec, 380 secs
lola: sara is running 385 secs || 107097539 markings, 587580011 edges, 264713 markings/sec, 385 secs
lola: sara is running 390 secs || 108434687 markings, 594808080 edges, 267430 markings/sec, 390 secs
lola: sara is running 395 secs || 109705766 markings, 601633678 edges, 254216 markings/sec, 395 secs
lola: sara is running 400 secs || 111015191 markings, 608474061 edges, 261885 markings/sec, 400 secs
lola: sara is running 405 secs || 112116738 markings, 615190849 edges, 220309 markings/sec, 405 secs
lola: sara is running 410 secs || 113220742 markings, 621956746 edges, 220801 markings/sec, 410 secs
lola: sara is running 415 secs || 114361997 markings, 628881615 edges, 228251 markings/sec, 415 secs
lola: sara is running 420 secs || 115615050 markings, 635869283 edges, 250611 markings/sec, 420 secs
lola: sara is running 425 secs || 116771874 markings, 642954773 edges, 231365 markings/sec, 425 secs
lola: sara is running 430 secs || 117845064 markings, 649540403 edges, 214638 markings/sec, 430 secs
lola: sara is running 435 secs || 119045655 markings, 656685479 edges, 240118 markings/sec, 435 secs
lola: sara is running 440 secs || 120638860 markings, 664769711 edges, 318641 markings/sec, 440 secs
lola: sara is running 445 secs || 122150439 markings, 672913085 edges, 302316 markings/sec, 445 secs
lola: sara is running 450 secs || 123706509 markings, 681042162 edges, 311214 markings/sec, 450 secs
lola: sara is running 455 secs || 125064790 markings, 687948198 edges, 271656 markings/sec, 455 secs
lola: sara is running 460 secs || 126384547 markings, 695053038 edges, 263951 markings/sec, 460 secs
lola: sara is running 465 secs || 127640921 markings, 701800787 edges, 251275 markings/sec, 465 secs
lola: sara is running 470 secs || 128906287 markings, 708622947 edges, 253073 markings/sec, 470 secs
lola: sara is running 475 secs || 130019211 markings, 715438925 edges, 222585 markings/sec, 475 secs
lola: sara is running 480 secs || 131060634 markings, 721797954 edges, 208285 markings/sec, 480 secs
lola: sara is running 485 secs || 132199543 markings, 728667539 edges, 227782 markings/sec, 485 secs
lola: sara is running 490 secs || 133423666 markings, 735496135 edges, 244825 markings/sec, 490 secs
lola: sara is running 495 secs || 134561532 markings, 742475768 edges, 227573 markings/sec, 495 secs
lola: sara is running 500 secs || 135598928 markings, 748903638 edges, 207479 markings/sec, 500 secs
lola: sara is running 505 secs || 136809678 markings, 755945283 edges, 242150 markings/sec, 505 secs
lola: sara is running 510 secs || 138172525 markings, 763837155 edges, 272569 markings/sec, 510 secs
lola: sara is running 515 secs || 139512811 markings, 772092240 edges, 268057 markings/sec, 515 secs
lola: sara is running 520 secs || 140756334 markings, 779638290 edges, 248705 markings/sec, 520 secs
lola: sara is running 525 secs || 142109997 markings, 786591248 edges, 270733 markings/sec, 525 secs
lola: sara is running 530 secs || 143387126 markings, 793368509 edges, 255426 markings/sec, 530 secs
lola: sara is running 535 secs || 144546842 markings, 799730029 edges, 231943 markings/sec, 535 secs
lola: sara is running 540 secs || 145857793 markings, 806431390 edges, 262190 markings/sec, 540 secs
lola: sara is running 545 secs || 146983552 markings, 813003837 edges, 225152 markings/sec, 545 secs
lola: sara is running 550 secs || 148033958 markings, 819525372 edges, 210081 markings/sec, 550 secs
lola: sara is running 555 secs || 149018622 markings, 825578033 edges, 196933 markings/sec, 555 secs
lola: sara is running 560 secs || 150158043 markings, 832102767 edges, 227884 markings/sec, 560 secs
lola: sara is running 565 secs || 151242960 markings, 838374119 edges, 216983 markings/sec, 565 secs
lola: sara is running 570 secs || 152309218 markings, 844915300 edges, 213252 markings/sec, 570 secs
lola: sara is running 575 secs || 153276695 markings, 850913750 edges, 193495 markings/sec, 575 secs
lola: sara is running 580 secs || 154422248 markings, 857571825 edges, 229111 markings/sec, 580 secs
lola: sara is running 585 secs || 155580298 markings, 864194973 edges, 231610 markings/sec, 585 secs
lola: sara is running 590 secs || 156720920 markings, 871220262 edges, 228124 markings/sec, 590 secs
lola: sara is running 595 secs || 157780042 markings, 877743493 edges, 211824 markings/sec, 595 secs
lola: sara is running 600 secs || 158975965 markings, 884545196 edges, 239185 markings/sec, 600 secs
lola: sara is running 605 secs || 160267083 markings, 891057191 edges, 258224 markings/sec, 605 secs
lola: sara is running 610 secs || 161583292 markings, 898173928 edges, 263242 markings/sec, 610 secs
lola: sara is running 615 secs || 162817927 markings, 904806854 edges, 246927 markings/sec, 615 secs
lola: sara is running 620 secs || 164002561 markings, 911043436 edges, 236927 markings/sec, 620 secs
lola: sara is running 625 secs || 165007952 markings, 917137689 edges, 201078 markings/sec, 625 secs
lola: sara is running 630 secs || 166033748 markings, 923459322 edges, 205159 markings/sec, 630 secs
lola: sara is running 635 secs || 166998160 markings, 929337890 edges, 192882 markings/sec, 635 secs
lola: sara is running 640 secs || 168126433 markings, 935600095 edges, 225655 markings/sec, 640 secs
lola: sara is running 645 secs || 169130675 markings, 941639116 edges, 200848 markings/sec, 645 secs
lola: sara is running 650 secs || 170143989 markings, 947969976 edges, 202663 markings/sec, 650 secs
lola: sara is running 655 secs || 171111209 markings, 953833906 edges, 193444 markings/sec, 655 secs
lola: sara is running 660 secs || 172206121 markings, 960098769 edges, 218982 markings/sec, 660 secs
lola: sara is running 665 secs || 173324382 markings, 966555256 edges, 223652 markings/sec, 665 secs
lola: sara is running 670 secs || 174406897 markings, 973271366 edges, 216503 markings/sec, 670 secs
lola: sara is running 675 secs || 175419830 markings, 979499775 edges, 202587 markings/sec, 675 secs
lola: sara is running 680 secs || 176578479 markings, 986123065 edges, 231730 markings/sec, 680 secs
lola: sara is running 685 secs || 177930151 markings, 992950841 edges, 270334 markings/sec, 685 secs
lola: sara is running 690 secs || 179290568 markings, 1000284064 edges, 272083 markings/sec, 690 secs
lola: sara is running 695 secs || 180581172 markings, 1007208404 edges, 258121 markings/sec, 695 secs
lola: sara is running 700 secs || 181827407 markings, 1013898483 edges, 249247 markings/sec, 700 secs
lola: sara is running 705 secs || 182880175 markings, 1020371591 edges, 210554 markings/sec, 705 secs
lola: sara is running 710 secs || 183880544 markings, 1026490805 edges, 200074 markings/sec, 710 secs
lola: sara is running 715 secs || 184967560 markings, 1033075303 edges, 217403 markings/sec, 715 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 722 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((3 <= NADH) OR (3 <= Lac)))) OR NOT(A (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-CTLCardinality-13.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: 20 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1084 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((NADPplus <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (NADPplus <= 2)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1992094 markings, 11324781 edges, 2532752247494803456 markings/sec, 0 secs
lola: 4034770 markings, 23132543 edges, 408535 markings/sec, 5 secs
lola: 5782850 markings, 34498508 edges, 349616 markings/sec, 10 secs
lola: 7829687 markings, 46053867 edges, 409367 markings/sec, 15 secs
lola: 9653408 markings, 57079978 edges, 364744 markings/sec, 20 secs
lola: 11263335 markings, 67458227 edges, 321985 markings/sec, 25 secs
lola: 12822119 markings, 77641017 edges, 311757 markings/sec, 30 secs
lola: 14515495 markings, 88061293 edges, 338675 markings/sec, 35 secs
lola: 16059191 markings, 97492326 edges, 308739 markings/sec, 40 secs
lola: 17581583 markings, 106823018 edges, 304478 markings/sec, 45 secs
lola: 19323151 markings, 118501878 edges, 348314 markings/sec, 50 secs
lola: 21068114 markings, 130209787 edges, 348993 markings/sec, 55 secs
lola: 22618831 markings, 141613717 edges, 310143 markings/sec, 60 secs
lola: 24223354 markings, 153013799 edges, 320905 markings/sec, 65 secs
lola: 25901034 markings, 163931446 edges, 335536 markings/sec, 70 secs
lola: 27250063 markings, 173815940 edges, 269806 markings/sec, 75 secs
lola: 28508823 markings, 183185126 edges, 251752 markings/sec, 80 secs
lola: 29859431 markings, 193068245 edges, 270122 markings/sec, 85 secs
lola: 31133639 markings, 202565107 edges, 254842 markings/sec, 90 secs
lola: 32525920 markings, 212421411 edges, 278456 markings/sec, 95 secs
lola: 33655890 markings, 220635741 edges, 225994 markings/sec, 100 secs
lola: 34896287 markings, 229371180 edges, 248079 markings/sec, 105 secs
lola: 36494045 markings, 240128573 edges, 319552 markings/sec, 110 secs
lola: 38118422 markings, 251021149 edges, 324875 markings/sec, 115 secs
lola: 39615854 markings, 261662781 edges, 299486 markings/sec, 120 secs
lola: 41000742 markings, 272052411 edges, 276978 markings/sec, 125 secs
lola: 42633923 markings, 282764859 edges, 326636 markings/sec, 130 secs
lola: 44055951 markings, 292519193 edges, 284406 markings/sec, 135 secs
lola: 45208815 markings, 301309102 edges, 230573 markings/sec, 140 secs
lola: 46462561 markings, 310310973 edges, 250749 markings/sec, 145 secs
lola: 47631687 markings, 319069036 edges, 233825 markings/sec, 150 secs
lola: 48843979 markings, 327865814 edges, 242458 markings/sec, 155 secs
lola: 50100288 markings, 336750292 edges, 251262 markings/sec, 160 secs
lola: 51131560 markings, 344280751 edges, 206254 markings/sec, 165 secs
lola: 52255128 markings, 352152214 edges, 224714 markings/sec, 170 secs
lola: 53762765 markings, 362406761 edges, 301527 markings/sec, 175 secs
lola: 55399853 markings, 373388224 edges, 327418 markings/sec, 180 secs
lola: 56931591 markings, 384105685 edges, 306348 markings/sec, 185 secs
lola: 58327416 markings, 394577648 edges, 279165 markings/sec, 190 secs
lola: 59923344 markings, 405227653 edges, 319186 markings/sec, 195 secs
lola: 61411358 markings, 415294022 edges, 297603 markings/sec, 200 secs
lola: 62616100 markings, 424388700 edges, 240948 markings/sec, 205 secs
lola: 63880202 markings, 433538798 edges, 252820 markings/sec, 210 secs
lola: 65090597 markings, 442560958 edges, 242079 markings/sec, 215 secs
lola: 66327241 markings, 451576833 edges, 247329 markings/sec, 220 secs
lola: 67619006 markings, 460705984 edges, 258353 markings/sec, 225 secs
lola: 68680813 markings, 468470311 edges, 212361 markings/sec, 230 secs
lola: 69848479 markings, 476663802 edges, 233533 markings/sec, 235 secs
lola: 71134802 markings, 486479555 edges, 257265 markings/sec, 240 secs
lola: 72435502 markings, 496504168 edges, 260140 markings/sec, 245 secs
lola: 73777494 markings, 506847833 edges, 268398 markings/sec, 250 secs
lola: 74944158 markings, 516686734 edges, 233333 markings/sec, 255 secs
lola: 76085936 markings, 526394021 edges, 228356 markings/sec, 260 secs
lola: 77465992 markings, 536769598 edges, 276011 markings/sec, 265 secs
lola: 78725011 markings, 546456869 edges, 251804 markings/sec, 270 secs
lola: 79734126 markings, 554851549 edges, 201823 markings/sec, 275 secs
lola: 80666391 markings, 562911912 edges, 186453 markings/sec, 280 secs
lola: 81700338 markings, 571358384 edges, 206789 markings/sec, 285 secs
lola: 82664842 markings, 579607455 edges, 192901 markings/sec, 290 secs
lola: 83653594 markings, 587808654 edges, 197750 markings/sec, 295 secs
lola: 84681433 markings, 596259884 edges, 205568 markings/sec, 300 secs
lola: 85637731 markings, 603663383 edges, 191260 markings/sec, 305 secs
lola: 86425663 markings, 610483265 edges, 157586 markings/sec, 310 secs
lola: 87368884 markings, 617974579 edges, 188644 markings/sec, 315 secs
lola: 88846978 markings, 628137047 edges, 295619 markings/sec, 320 secs
lola: 90453432 markings, 638915435 edges, 321291 markings/sec, 325 secs
lola: 91960539 markings, 649480601 edges, 301421 markings/sec, 330 secs
lola: 93325518 markings, 659719773 edges, 272996 markings/sec, 335 secs
lola: 94913990 markings, 670337671 edges, 317694 markings/sec, 340 secs
lola: 96396877 markings, 680349805 edges, 296577 markings/sec, 345 secs
lola: 97579765 markings, 689246533 edges, 236578 markings/sec, 350 secs
lola: 98794152 markings, 698071783 edges, 242877 markings/sec, 355 secs
lola: 99986793 markings, 706879870 edges, 238528 markings/sec, 360 secs
lola: 101170266 markings, 715641345 edges, 236695 markings/sec, 365 secs
lola: 102471370 markings, 724890872 edges, 260221 markings/sec, 370 secs
lola: 103564182 markings, 732678363 edges, 218562 markings/sec, 375 secs
lola: 104674570 markings, 740628766 edges, 222078 markings/sec, 380 secs
lola: 106199251 markings, 750976563 edges, 304936 markings/sec, 385 secs
lola: 107866433 markings, 762162598 edges, 333436 markings/sec, 390 secs
lola: 109440070 markings, 773167679 edges, 314727 markings/sec, 395 secs
lola: 110873208 markings, 783916868 edges, 286628 markings/sec, 400 secs
lola: 112520801 markings, 794848683 edges, 329519 markings/sec, 405 secs
lola: 113987574 markings, 804843507 edges, 293355 markings/sec, 410 secs
lola: 115188740 markings, 813975978 edges, 240233 markings/sec, 415 secs
lola: 116487185 markings, 823307448 edges, 259689 markings/sec, 420 secs
lola: 117699745 markings, 832445875 edges, 242512 markings/sec, 425 secs
lola: 118971209 markings, 841567927 edges, 254293 markings/sec, 430 secs
lola: 120233694 markings, 850444783 edges, 252497 markings/sec, 435 secs
lola: 121269804 markings, 858112679 edges, 207222 markings/sec, 440 secs
lola: 122424690 markings, 866249113 edges, 230977 markings/sec, 445 secs
lola: 124060532 markings, 877200256 edges, 327168 markings/sec, 450 secs
lola: 125667499 markings, 887976585 edges, 321393 markings/sec, 455 secs
lola: 127145252 markings, 898532734 edges, 295551 markings/sec, 460 secs
lola: 128522005 markings, 908862935 edges, 275351 markings/sec, 465 secs
lola: 130151577 markings, 919499280 edges, 325914 markings/sec, 470 secs
lola: 131558202 markings, 929178658 edges, 281325 markings/sec, 475 secs
lola: 132725980 markings, 938110867 edges, 233556 markings/sec, 480 secs
lola: 133997310 markings, 947205879 edges, 254266 markings/sec, 485 secs
lola: 135173278 markings, 956065363 edges, 235194 markings/sec, 490 secs
lola: 136428883 markings, 965095629 edges, 251121 markings/sec, 495 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F ((NADplus <= PEP))) AND A (F ((1 <= Gluc))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NADplus <= PEP)))
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-C0100N0000001000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2616922 markings, 8946061 edges, 523384 markings/sec, 0 secs
lola: sara is running 5 secs || 4960388 markings, 17279373 edges, 468693 markings/sec, 5 secs
lola: sara is running 10 secs || 7234048 markings, 25789396 edges, 454732 markings/sec, 10 secs
lola: sara is running 15 secs || 9992400 markings, 34752428 edges, 551670 markings/sec, 15 secs
lola: sara is running 20 secs || 12510390 markings, 42937384 edges, 503598 markings/sec, 20 secs
lola: sara is running 25 secs || 14984858 markings, 51001414 edges, 494894 markings/sec, 25 secs
lola: sara is running 30 secs || 17280153 markings, 58512458 edges, 459059 markings/sec, 30 secs
lola: sara is running 35 secs || 19589798 markings, 66013919 edges, 461929 markings/sec, 35 secs
lola: sara is running 40 secs || 21837669 markings, 73350055 edges, 449574 markings/sec, 40 secs
lola: sara is running 45 secs || 24096610 markings, 80720053 edges, 451788 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no unknown yes unknown no yes yes yes no no unknown no unknown no
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000001000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 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-full"
echo " Input is GPPP-PT-C0100N0000001000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-blw7-152650001300318"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;