Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857700774.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is GPPP-PT-C0001N0000000001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857700774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

--------------------
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-C0001N0000000001-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678638679976

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:31:21] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-12 16:31:21] [INFO ] Transformed 33 places.
[2023-03-12 16:31:21] [INFO ] Transformed 22 transitions.
[2023-03-12 16:31:21] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Probably explored full state space saw : 10380 states, properties seen :0
Probabilistic random walk after 52788 steps, saw 10380 distinct states, run finished after 434 ms. (steps per millisecond=121 ) properties seen :0
Explored full state space saw : 10380 states, properties seen :0
Exhaustive walk after 52788 steps, saw 10380 distinct states, run finished after 235 ms. (steps per millisecond=224 ) properties seen :0
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 1499 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: GPPP_PT_C0001N0000000001
(NrP: 33 NrTr: 22 NrArc: 83)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.753sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



starting MCC model checker
--------------------------

checking: EF [6<=b2]
normalized: E [true U 6<=b2]

abstracting: (6<=b2)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [GAP<=6]]
normalized: E [true U ~ [GAP<=6]]

abstracting: (GAP<=6)
states: 10,380 (4)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [4<=_1_3_BPG]
normalized: E [true U 4<=_1_3_BPG]

abstracting: (4<=_1_3_BPG)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [6<=NADPplus]]
normalized: ~ [E [true U 6<=NADPplus]]

abstracting: (6<=NADPplus)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [a2<=4]
normalized: ~ [E [true U ~ [a2<=4]]]

abstracting: (a2<=4)
states: 10,380 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[5<=Xu5P & 3<=Xu5P]]
normalized: E [true U [5<=Xu5P & 3<=Xu5P]]

abstracting: (3<=Xu5P)
states: 0
abstracting: (5<=Xu5P)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[Pyr<=4 & ~ [[[~ [3<=a2] & NADplus<=0] | [[[[[5<=ATP & [DHAP<=1 | NADH<=5]] | ~ [[2<=FBP & Lac<=6]]] | [_3PG<=5 | Xu5P<=b2]] | [NADplus<=start | [1<=GSH | G6P<=Ru5P]]] | c1<=3]]]]]
normalized: E [true U [~ [[[[[[1<=GSH | G6P<=Ru5P] | NADplus<=start] | [[_3PG<=5 | Xu5P<=b2] | [~ [[2<=FBP & Lac<=6]] | [5<=ATP & [DHAP<=1 | NADH<=5]]]]] | c1<=3] | [~ [3<=a2] & NADplus<=0]]] & Pyr<=4]]

abstracting: (Pyr<=4)
states: 10,380 (4)
abstracting: (NADplus<=0)
states: 6,048 (3)
abstracting: (3<=a2)
states: 0
abstracting: (c1<=3)
states: 7,380 (3)
abstracting: (NADH<=5)
states: 10,380 (4)
abstracting: (DHAP<=1)
states: 8,154 (3)
abstracting: (5<=ATP)
states: 1,440 (3)
abstracting: (Lac<=6)
states: 10,374 (4)
abstracting: (2<=FBP)
states: 240
abstracting: (Xu5P<=b2)
states: 9,312 (3)
abstracting: (_3PG<=5)
states: 10,380 (4)
abstracting: (NADplus<=start)
states: 6,048 (3)
abstracting: (G6P<=Ru5P)
states: 9,186 (3)
abstracting: (1<=GSH)
states: 5,190 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [[NADH<=c2 | ~ [[4<=_1_3_BPG & 1<=GSH]]]] & ~ [[~ [R5P<=4] | [[[[~ [GSH<=_3PG] | start<=0] & [6<=a1 & ~ [[a1<=start | 7<=NADPH]]]] & ~ [[E4P<=7 & [c1<=7 & [7<=_1_3_BPG & 7<=NADH]]]]] & ~ [Pi<=6]]]]]]
normalized: E [true U [~ [[[~ [Pi<=6] & [~ [[[[7<=_1_3_BPG & 7<=NADH] & c1<=7] & E4P<=7]] & [[~ [[a1<=start | 7<=NADPH]] & 6<=a1] & [~ [GSH<=_3PG] | start<=0]]]] | ~ [R5P<=4]]] & ~ [[~ [[4<=_1_3_BPG & 1<=GSH]] | NADH<=c2]]]]

abstracting: (NADH<=c2)
states: 10,080 (4)
abstracting: (1<=GSH)
states: 5,190 (3)
abstracting: (4<=_1_3_BPG)
states: 0
abstracting: (R5P<=4)
states: 10,380 (4)
abstracting: (start<=0)
states: 10,374 (4)
abstracting: (GSH<=_3PG)
states: 5,400 (3)
abstracting: (6<=a1)
states: 0
abstracting: (7<=NADPH)
states: 0
abstracting: (a1<=start)
states: 108
abstracting: (E4P<=7)
states: 10,380 (4)
abstracting: (c1<=7)
states: 10,380 (4)
abstracting: (7<=NADH)
states: 0
abstracting: (7<=_1_3_BPG)
states: 0
abstracting: (Pi<=6)
states: 9,846 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[[~ [[~ [b2<=6] & ~ [[_3PG<=FBP | ~ [DHAP<=NADH]]]]] & [~ [6<=Pyr] | ~ [[[Pi<=_2PG | ~ [a1<=3]] & ~ [PEP<=1]]]]] | 5<=NADplus] | [[[[~ [[[2<=Gluc & ADP<=_2PG] & [ADP<=4 & c2<=start]]] & [~ [[NADPplus<=5 & NADH<=1]] & ~ [[GSSG<=6 & NADPH<=2]]]] | 1<=NADplus] & ~ [[5<=R5P & ~ [GSH<=ADP]]]] | [c1<=G6P & NADPH<=GSH]]]]]
normalized: E [true U ~ [[[[c1<=G6P & NADPH<=GSH] | [~ [[~ [GSH<=ADP] & 5<=R5P]] & [[[~ [[GSSG<=6 & NADPH<=2]] & ~ [[NADPplus<=5 & NADH<=1]]] & ~ [[[ADP<=4 & c2<=start] & [2<=Gluc & ADP<=_2PG]]]] | 1<=NADplus]]] | [[[~ [[~ [PEP<=1] & [~ [a1<=3] | Pi<=_2PG]]] | ~ [6<=Pyr]] & ~ [[~ [[~ [DHAP<=NADH] | _3PG<=FBP]] & ~ [b2<=6]]]] | 5<=NADplus]]]]

abstracting: (5<=NADplus)
states: 0
abstracting: (b2<=6)
states: 10,380 (4)
abstracting: (_3PG<=FBP)
states: 8,196 (3)
abstracting: (DHAP<=NADH)
states: 8,658 (3)
abstracting: (6<=Pyr)
states: 0
abstracting: (Pi<=_2PG)
states: 234
abstracting: (a1<=3)
states: 10,380 (4)
abstracting: (PEP<=1)
states: 9,960 (3)
abstracting: (1<=NADplus)
states: 4,332 (3)
abstracting: (ADP<=_2PG)
states: 42
abstracting: (2<=Gluc)
states: 138
abstracting: (c2<=start)
states: 606
abstracting: (ADP<=4)
states: 480
abstracting: (NADH<=1)
states: 4,332 (3)
abstracting: (NADPplus<=5)
states: 10,380 (4)
abstracting: (NADPH<=2)
states: 10,380 (4)
abstracting: (GSSG<=6)
states: 10,380 (4)
abstracting: (5<=R5P)
states: 0
abstracting: (GSH<=ADP)
states: 10,350 (4)
abstracting: (NADPH<=GSH)
states: 6,920 (3)
abstracting: (c1<=G6P)
states: 192
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [~ [[[[[~ [DHAP<=Gluc] & ~ [[7<=GAP | Pyr<=S7P]]] & ~ [[[1<=Pyr | 1<=NADPplus] | [~ [GSH<=0] & ~ [G6P<=6]]]]] | ATP<=7] | [[[_2PG<=G6P | ~ [7<=GAP]] | ~ [[[[FBP<=3 & Lac<=Ru5P] & [NADH<=ADP & c2<=DHAP]] & 7<=Ru5P]]] | ~ [[[~ [NADPplus<=ADP] | [1<=S7P & ATP<=b2]] & ~ [[ATP<=F6P | NADH<=Gluc]]]]]]]]
normalized: E [true U ~ [[[[~ [[[~ [G6P<=6] & ~ [GSH<=0]] | [1<=Pyr | 1<=NADPplus]]] & [~ [[7<=GAP | Pyr<=S7P]] & ~ [DHAP<=Gluc]]] | ATP<=7] | [~ [[~ [[ATP<=F6P | NADH<=Gluc]] & [[1<=S7P & ATP<=b2] | ~ [NADPplus<=ADP]]]] | [~ [[[[NADH<=ADP & c2<=DHAP] & [FBP<=3 & Lac<=Ru5P]] & 7<=Ru5P]] | [~ [7<=GAP] | _2PG<=G6P]]]]]]

abstracting: (_2PG<=G6P)
states: 7,938 (3)
abstracting: (7<=GAP)
states: 0
abstracting: (7<=Ru5P)
states: 0
abstracting: (Lac<=Ru5P)
states: 3,876 (3)
abstracting: (FBP<=3)
states: 10,380 (4)
abstracting: (c2<=DHAP)
states: 1,158 (3)
abstracting: (NADH<=ADP)
states: 10,350 (4)
abstracting: (NADPplus<=ADP)
states: 10,352 (4)
abstracting: (ATP<=b2)
states: 3,408 (3)
abstracting: (1<=S7P)
states: 84
abstracting: (NADH<=Gluc)
states: 1,752 (3)
abstracting: (ATP<=F6P)
states: 3,534 (3)
abstracting: (ATP<=7)
states: 10,134 (4)
abstracting: (DHAP<=Gluc)
states: 5,772 (3)
abstracting: (Pyr<=S7P)
states: 7,224 (3)
abstracting: (7<=GAP)
states: 0
abstracting: (1<=NADPplus)
states: 6,920 (3)
abstracting: (1<=Pyr)
states: 3,156 (3)
abstracting: (GSH<=0)
states: 5,190 (3)
abstracting: (G6P<=6)
states: 10,380 (4)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [~ [[[[ADP<=start & Pyr<=_3PG] | [~ [[[[[_1_3_BPG<=5 | 6<=NADPplus] & [7<=Gluc & _3PG<=4]] | [~ [a2<=E4P] | [2<=R5P | Pyr<=3]]] | [[4<=b1 & [F6P<=1 | ADP<=4]] | ~ [G6P<=ADP]]]] & [~ [[[~ [S7P<=R5P] & [start<=6 | start<=NADPplus]] | [[Gluc<=5 | GSSG<=0] | start<=b2]]] | [~ [[~ [S7P<=3] | [Pyr<=F6P & 7<=FBP]]] | GAP<=2]]]] & 5<=GSH]]]
normalized: ~ [E [true U [[[[[~ [[[Pyr<=F6P & 7<=FBP] | ~ [S7P<=3]]] | GAP<=2] | ~ [[[[Gluc<=5 | GSSG<=0] | start<=b2] | [[start<=6 | start<=NADPplus] & ~ [S7P<=R5P]]]]] & ~ [[[~ [G6P<=ADP] | [[F6P<=1 | ADP<=4] & 4<=b1]] | [[[2<=R5P | Pyr<=3] | ~ [a2<=E4P]] | [[7<=Gluc & _3PG<=4] & [_1_3_BPG<=5 | 6<=NADPplus]]]]]] | [ADP<=start & Pyr<=_3PG]] & 5<=GSH]]]

abstracting: (5<=GSH)
states: 0
abstracting: (Pyr<=_3PG)
states: 7,716 (3)
abstracting: (ADP<=start)
states: 24
abstracting: (6<=NADPplus)
states: 0
abstracting: (_1_3_BPG<=5)
states: 10,380 (4)
abstracting: (_3PG<=4)
states: 10,380 (4)
abstracting: (7<=Gluc)
states: 0
abstracting: (a2<=E4P)
states: 10,158 (4)
abstracting: (Pyr<=3)
states: 10,380 (4)
abstracting: (2<=R5P)
states: 0
abstracting: (4<=b1)
states: 0
abstracting: (ADP<=4)
states: 480
abstracting: (F6P<=1)
states: 9,822 (3)
abstracting: (G6P<=ADP)
states: 10,380 (4)
abstracting: (S7P<=R5P)
states: 10,296 (4)
abstracting: (start<=NADPplus)
states: 10,378 (4)
abstracting: (start<=6)
states: 10,380 (4)
abstracting: (start<=b2)
states: 10,374 (4)
abstracting: (GSSG<=0)
states: 5,190 (3)
abstracting: (Gluc<=5)
states: 10,380 (4)
abstracting: (GAP<=2)
states: 9,600 (3)
abstracting: (S7P<=3)
states: 10,380 (4)
abstracting: (7<=FBP)
states: 0
abstracting: (Pyr<=F6P)
states: 7,974 (3)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [[[[PEP<=4 & _2PG<=6] & [[[a1<=Xu5P | [[_2PG<=0 | GAP<=6] | ~ [ATP<=1]]] | [7<=E4P | [[7<=Gluc | Ru5P<=5] | [_2PG<=b2 & _1_3_BPG<=FBP]]]] & [[[~ [2<=E4P] & ~ [c2<=0]] & [[5<=G6P & NADPH<=4] | ~ [Lac<=5]]] | [~ [R5P<=_3PG] | 2<=_3PG]]]] | ~ [[[[[~ [NADPplus<=4] & GAP<=PEP] & ~ [[Xu5P<=6 | PEP<=6]]] | [~ [[2<=ADP | Pyr<=6]] & DHAP<=_3PG]] & ~ [NADH<=Ru5P]]]]] & R5P<=5]]
normalized: E [true U [~ [[~ [[~ [NADH<=Ru5P] & [[~ [[2<=ADP | Pyr<=6]] & DHAP<=_3PG] | [~ [[Xu5P<=6 | PEP<=6]] & [~ [NADPplus<=4] & GAP<=PEP]]]]] | [[[[~ [R5P<=_3PG] | 2<=_3PG] | [[~ [Lac<=5] | [5<=G6P & NADPH<=4]] & [~ [c2<=0] & ~ [2<=E4P]]]] & [[[[_2PG<=b2 & _1_3_BPG<=FBP] | [7<=Gluc | Ru5P<=5]] | 7<=E4P] | [[~ [ATP<=1] | [_2PG<=0 | GAP<=6]] | a1<=Xu5P]]] & [PEP<=4 & _2PG<=6]]]] & R5P<=5]]

abstracting: (R5P<=5)
states: 10,380 (4)
abstracting: (_2PG<=6)
states: 10,380 (4)
abstracting: (PEP<=4)
states: 10,380 (4)
abstracting: (a1<=Xu5P)
states: 156
abstracting: (GAP<=6)
states: 10,380 (4)
abstracting: (_2PG<=0)
states: 7,710 (3)
abstracting: (ATP<=1)
states: 5,010 (3)
abstracting: (7<=E4P)
states: 0
abstracting: (Ru5P<=5)
states: 10,380 (4)
abstracting: (7<=Gluc)
states: 0
abstracting: (_1_3_BPG<=FBP)
states: 8,712 (3)
abstracting: (_2PG<=b2)
states: 8,226 (3)
abstracting: (2<=E4P)
states: 0
abstracting: (c2<=0)
states: 606
abstracting: (NADPH<=4)
states: 10,380 (4)
abstracting: (5<=G6P)
states: 0
abstracting: (Lac<=5)
states: 10,332 (4)
abstracting: (2<=_3PG)
states: 420
abstracting: (R5P<=_3PG)
states: 10,224 (4)
abstracting: (GAP<=PEP)
states: 6,114 (3)
abstracting: (NADPplus<=4)
states: 10,380 (4)
abstracting: (PEP<=6)
states: 10,380 (4)
abstracting: (Xu5P<=6)
states: 10,380 (4)
abstracting: (DHAP<=_3PG)
states: 6,114 (3)
abstracting: (Pyr<=6)
states: 10,380 (4)
abstracting: (2<=ADP)
states: 10,320 (4)
abstracting: (NADH<=Ru5P)
states: 1,632 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[[[[b1<=7 | [[PEP<=4 | [NADPH<=FBP & 1<=NADPH]] | ~ [5<=NADplus]]] & R5P<=7] & ~ [[6<=E4P & NADH<=b2]]] | [[[[[[5<=ATP | 1<=Ru5P] | [GSH<=_2PG | GSSG<=c2]] & [[start<=a1 & Xu5P<=b1] | [4<=c1 & Gluc<=2]]] | [[[NADPH<=5 & _3PG<=1] & ~ [1<=NADPplus]] | ~ [PEP<=Lac]]] | [_2PG<=Xu5P & 1<=NADH]] & [DHAP<=6 & E4P<=ADP]]] | [1<=S7P & E4P<=5]]]]
normalized: E [true U ~ [[[1<=S7P & E4P<=5] | [[[DHAP<=6 & E4P<=ADP] & [[_2PG<=Xu5P & 1<=NADH] | [[~ [PEP<=Lac] | [~ [1<=NADPplus] & [NADPH<=5 & _3PG<=1]]] | [[[4<=c1 & Gluc<=2] | [start<=a1 & Xu5P<=b1]] & [[GSH<=_2PG | GSSG<=c2] | [5<=ATP | 1<=Ru5P]]]]]] | [~ [[6<=E4P & NADH<=b2]] & [R5P<=7 & [b1<=7 | [~ [5<=NADplus] | [PEP<=4 | [NADPH<=FBP & 1<=NADPH]]]]]]]]]]

abstracting: (1<=NADPH)
states: 6,920 (3)
abstracting: (NADPH<=FBP)
states: 4,282 (3)
abstracting: (PEP<=4)
states: 10,380 (4)
abstracting: (5<=NADplus)
states: 0
abstracting: (b1<=7)
states: 10,380 (4)
abstracting: (R5P<=7)
states: 10,380 (4)
abstracting: (NADH<=b2)
states: 2,076 (3)
abstracting: (6<=E4P)
states: 0
abstracting: (1<=Ru5P)
states: 1,212 (3)
abstracting: (5<=ATP)
states: 1,440 (3)
abstracting: (GSSG<=c2)
states: 10,077 (4)
abstracting: (GSH<=_2PG)
states: 5,400 (3)
abstracting: (Xu5P<=b1)
states: 10,380 (4)
abstracting: (start<=a1)
states: 10,380 (4)
abstracting: (Gluc<=2)
states: 10,338 (4)
abstracting: (4<=c1)
states: 3,000 (3)
abstracting: (_3PG<=1)
states: 9,960 (3)
abstracting: (NADPH<=5)
states: 10,380 (4)
abstracting: (1<=NADPplus)
states: 6,920 (3)
abstracting: (PEP<=Lac)
states: 9,330 (3)
abstracting: (1<=NADH)
states: 9,072 (3)
abstracting: (_2PG<=Xu5P)
states: 7,938 (3)
abstracting: (E4P<=ADP)
states: 10,380 (4)
abstracting: (DHAP<=6)
states: 10,380 (4)
abstracting: (E4P<=5)
states: 10,380 (4)
abstracting: (1<=S7P)
states: 84
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[~ [[[~ [[[1<=FBP & 7<=Lac] | [5<=PEP | 3<=E4P]]] | [_2PG<=NADH & [NADplus<=start | ~ [b1<=ADP]]]] | [4<=DHAP | ~ [[2<=c2 & [1<=E4P | b1<=1]]]]]] | [Ru5P<=_1_3_BPG | [[~ [[1<=NADPH & 5<=b2]] | [PEP<=Xu5P | 3<=GSSG]] | [[[PEP<=NADPH | Gluc<=Xu5P] | ~ [a1<=b2]] | [[[E4P<=DHAP | NADplus<=5] & [_3PG<=4 & 6<=S7P]] & [[_2PG<=5 & 7<=_1_3_BPG] & ~ [3<=a2]]]]]]]] | Ru5P<=5]]
normalized: ~ [E [true U ~ [[Ru5P<=5 | ~ [[[Ru5P<=_1_3_BPG | [[[[~ [3<=a2] & [_2PG<=5 & 7<=_1_3_BPG]] & [[_3PG<=4 & 6<=S7P] & [E4P<=DHAP | NADplus<=5]]] | [~ [a1<=b2] | [PEP<=NADPH | Gluc<=Xu5P]]] | [[PEP<=Xu5P | 3<=GSSG] | ~ [[1<=NADPH & 5<=b2]]]]] | ~ [[[4<=DHAP | ~ [[2<=c2 & [1<=E4P | b1<=1]]]] | [[_2PG<=NADH & [NADplus<=start | ~ [b1<=ADP]]] | ~ [[[5<=PEP | 3<=E4P] | [1<=FBP & 7<=Lac]]]]]]]]]]]]

abstracting: (7<=Lac)
states: 6
abstracting: (1<=FBP)
states: 2,226 (3)
abstracting: (3<=E4P)
states: 0
abstracting: (5<=PEP)
states: 0
abstracting: (b1<=ADP)
states: 10,236 (4)
abstracting: (NADplus<=start)
states: 6,048 (3)
abstracting: (_2PG<=NADH)
states: 10,380 (4)
abstracting: (b1<=1)
states: 228
abstracting: (1<=E4P)
states: 4,398 (3)
abstracting: (2<=c2)
states: 9,522 (3)
abstracting: (4<=DHAP)
states: 240
abstracting: (5<=b2)
states: 0
abstracting: (1<=NADPH)
states: 6,920 (3)
abstracting: (3<=GSSG)
states: 0
abstracting: (PEP<=Xu5P)
states: 7,938 (3)
abstracting: (Gluc<=Xu5P)
states: 8,772 (3)
abstracting: (PEP<=NADPH)
states: 9,350 (3)
abstracting: (a1<=b2)
states: 2,676 (3)
abstracting: (NADplus<=5)
states: 10,380 (4)
abstracting: (E4P<=DHAP)
states: 7,740 (3)
abstracting: (6<=S7P)
states: 0
abstracting: (_3PG<=4)
states: 10,380 (4)
abstracting: (7<=_1_3_BPG)
states: 0
abstracting: (_2PG<=5)
states: 10,380 (4)
abstracting: (3<=a2)
states: 0
abstracting: (Ru5P<=_1_3_BPG)
states: 9,354 (3)
abstracting: (Ru5P<=5)
states: 10,380 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[6<=start & [[7<=G6P & [[[[[_3PG<=c2 | _2PG<=7] | ~ [NADPplus<=3]] | ~ [[5<=FBP | GAP<=a2]]] & ~ [start<=NADPH]] | [~ [6<=NADPplus] | [[[G6P<=FBP & a1<=GSH] | [c1<=ADP | _1_3_BPG<=6]] & [[5<=GAP | G6P<=1] | [2<=Pyr | S7P<=0]]]]]] & [3<=Lac | ~ [[[4<=c2 & _2PG<=ADP] & ~ [[[c1<=3 & Gluc<=_1_3_BPG] | ~ [Gluc<=6]]]]]]]] | [7<=DHAP & [[[[[[[4<=Pyr | 7<=ATP] | [start<=1 | 1<=Pyr]] & ~ [[G6P<=G6P & 1<=FBP]]] & [4<=Pi & [[_3PG<=GSSG | Pyr<=NADPH] | [7<=S7P & b1<=5]]]] | ~ [[~ [1<=_2PG] | a2<=5]]] & 5<=R5P] | [1<=NADPH & ~ [[[[6<=S7P | [2<=Lac | 5<=c1]] & ~ [4<=Pi]] & ~ [start<=Ru5P]]]]]]]]
normalized: E [true U [[7<=DHAP & [[1<=NADPH & ~ [[~ [start<=Ru5P] & [~ [4<=Pi] & [6<=S7P | [2<=Lac | 5<=c1]]]]]] | [5<=R5P & [~ [[a2<=5 | ~ [1<=_2PG]]] | [[4<=Pi & [[7<=S7P & b1<=5] | [_3PG<=GSSG | Pyr<=NADPH]]] & [~ [[G6P<=G6P & 1<=FBP]] & [[start<=1 | 1<=Pyr] | [4<=Pyr | 7<=ATP]]]]]]]] | [6<=start & [[3<=Lac | ~ [[~ [[~ [Gluc<=6] | [c1<=3 & Gluc<=_1_3_BPG]]] & [4<=c2 & _2PG<=ADP]]]] & [7<=G6P & [[[[[2<=Pyr | S7P<=0] | [5<=GAP | G6P<=1]] & [[c1<=ADP | _1_3_BPG<=6] | [G6P<=FBP & a1<=GSH]]] | ~ [6<=NADPplus]] | [~ [start<=NADPH] & [~ [[5<=FBP | GAP<=a2]] | [~ [NADPplus<=3] | [_3PG<=c2 | _2PG<=7]]]]]]]]]]

abstracting: (_2PG<=7)
states: 10,380 (4)
abstracting: (_3PG<=c2)
states: 10,332 (4)
abstracting: (NADPplus<=3)
states: 10,380 (4)
abstracting: (GAP<=a2)
states: 6,306 (3)
abstracting: (5<=FBP)
states: 0
abstracting: (start<=NADPH)
states: 10,378 (4)
abstracting: (6<=NADPplus)
states: 0
abstracting: (a1<=GSH)
states: 5,244 (3)
abstracting: (G6P<=FBP)
states: 9,288 (3)
abstracting: (_1_3_BPG<=6)
states: 10,380 (4)
abstracting: (c1<=ADP)
states: 9,882 (3)
abstracting: (G6P<=1)
states: 10,314 (4)
abstracting: (5<=GAP)
states: 54
abstracting: (S7P<=0)
states: 10,296 (4)
abstracting: (2<=Pyr)
states: 492
abstracting: (7<=G6P)
states: 0
abstracting: (_2PG<=ADP)
states: 10,380 (4)
abstracting: (4<=c2)
states: 7,380 (3)
abstracting: (Gluc<=_1_3_BPG)
states: 9,018 (3)
abstracting: (c1<=3)
states: 7,380 (3)
abstracting: (Gluc<=6)
states: 10,380 (4)
abstracting: (3<=Lac)
states: 1,572 (3)
abstracting: (6<=start)
states: 0
abstracting: (7<=ATP)
states: 474
abstracting: (4<=Pyr)
states: 0
abstracting: (1<=Pyr)
states: 3,156 (3)
abstracting: (start<=1)
states: 10,380 (4)
abstracting: (1<=FBP)
states: 2,226 (3)
abstracting: (G6P<=G6P)
states: 10,380 (4)
abstracting: (Pyr<=NADPH)
states: 9,164 (3)
abstracting: (_3PG<=GSSG)
states: 8,835 (3)
abstracting: (b1<=5)
states: 10,380 (4)
abstracting: (7<=S7P)
states: 0
abstracting: (4<=Pi)
states: 7,854 (3)
abstracting: (1<=_2PG)
states: 2,670 (3)
abstracting: (a2<=5)
states: 10,380 (4)
abstracting: (5<=R5P)
states: 0
abstracting: (5<=c1)
states: 1,488 (3)
abstracting: (2<=Lac)
states: 3,552 (3)
abstracting: (6<=S7P)
states: 0
abstracting: (4<=Pi)
states: 7,854 (3)
abstracting: (start<=Ru5P)
states: 10,374 (4)
abstracting: (1<=NADPH)
states: 6,920 (3)
abstracting: (7<=DHAP)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[[[~ [[[[[Pi<=Lac & PEP<=b2] & [6<=NADPplus | Gluc<=a1]] & ~ [F6P<=NADPplus]] | [Ru5P<=1 | [[4<=c1 | NADplus<=S7P] | c1<=5]]]] | [[4<=b1 | 7<=Pyr] | [[b2<=4 | [[6<=b1 | 3<=NADH] | b1<=S7P]] & GAP<=6]]] | [[~ [[[c1<=5 & 5<=a1] | 1<=Lac]] | [[start<=4 | [[NADPplus<=6 | 5<=NADH] & ~ [GSSG<=4]]] & [1<=NADH & [~ [F6P<=ADP] | ~ [a2<=3]]]]] | [[7<=GAP & [~ [[Gluc<=5 & b1<=0]] & [_3PG<=4 | [Pi<=Pi & GAP<=Lac]]]] | [5<=_1_3_BPG & NADPplus<=4]]]] & ~ [6<=G6P]] | [ATP<=_3PG & ~ [[[~ [[~ [Lac<=0] & start<=start]] | ~ [a1<=NADH]] & [[[~ [[GSSG<=1 & 3<=G6P]] | [[b2<=6 | GAP<=NADPH] | [2<=NADH & GAP<=S7P]]] | [a1<=4 | [[3<=Pyr & 5<=NADH] & ~ [Lac<=E4P]]]] & [[[[1<=Ru5P | 1<=PEP] & ~ [Xu5P<=NADplus]] & ~ [Ru5P<=Gluc]] & 1<=a2]]]]]]]
normalized: ~ [E [true U ~ [[[ATP<=_3PG & ~ [[[[1<=a2 & [~ [Ru5P<=Gluc] & [~ [Xu5P<=NADplus] & [1<=Ru5P | 1<=PEP]]]] & [[a1<=4 | [~ [Lac<=E4P] & [3<=Pyr & 5<=NADH]]] | [[[2<=NADH & GAP<=S7P] | [b2<=6 | GAP<=NADPH]] | ~ [[GSSG<=1 & 3<=G6P]]]]] & [~ [a1<=NADH] | ~ [[start<=start & ~ [Lac<=0]]]]]]] | [~ [6<=G6P] & [[[[5<=_1_3_BPG & NADPplus<=4] | [7<=GAP & [[_3PG<=4 | [Pi<=Pi & GAP<=Lac]] & ~ [[Gluc<=5 & b1<=0]]]]] | [[[1<=NADH & [~ [a2<=3] | ~ [F6P<=ADP]]] & [start<=4 | [~ [GSSG<=4] & [NADPplus<=6 | 5<=NADH]]]] | ~ [[1<=Lac | [c1<=5 & 5<=a1]]]]] | [[[GAP<=6 & [b2<=4 | [b1<=S7P | [6<=b1 | 3<=NADH]]]] | [4<=b1 | 7<=Pyr]] | ~ [[[Ru5P<=1 | [c1<=5 | [4<=c1 | NADplus<=S7P]]] | [~ [F6P<=NADPplus] & [[6<=NADPplus | Gluc<=a1] & [Pi<=Lac & PEP<=b2]]]]]]]]]]]]

abstracting: (PEP<=b2)
states: 8,226 (3)
abstracting: (Pi<=Lac)
states: 1,446 (3)
abstracting: (Gluc<=a1)
states: 10,248 (4)
abstracting: (6<=NADPplus)
states: 0
abstracting: (F6P<=NADPplus)
states: 9,148 (3)
abstracting: (NADplus<=S7P)
states: 6,048 (3)
abstracting: (4<=c1)
states: 3,000 (3)
abstracting: (c1<=5)
states: 9,522 (3)
abstracting: (Ru5P<=1)
states: 10,332 (4)
abstracting: (7<=Pyr)
states: 0
abstracting: (4<=b1)
states: 0
abstracting: (3<=NADH)
states: 0
abstracting: (6<=b1)
states: 0
abstracting: (b1<=S7P)
states: 96
abstracting: (b2<=4)
states: 10,380 (4)
abstracting: (GAP<=6)
states: 10,380 (4)
abstracting: (5<=a1)
states: 0
abstracting: (c1<=5)
states: 9,522 (3)
abstracting: (1<=Lac)
states: 6,882 (3)
abstracting: (5<=NADH)
states: 0
abstracting: (NADPplus<=6)
states: 10,380 (4)
abstracting: (GSSG<=4)
states: 10,380 (4)
abstracting: (start<=4)
states: 10,380 (4)
abstracting: (F6P<=ADP)
states: 10,380 (4)
abstracting: (a2<=3)
states: 10,380 (4)
abstracting: (1<=NADH)
states: 9,072 (3)
abstracting: (b1<=0)
states: 96
abstracting: (Gluc<=5)
states: 10,380 (4)
abstracting: (GAP<=Lac)
states: 7,698 (3)
abstracting: (Pi<=Pi)
states: 10,380 (4)
abstracting: (_3PG<=4)
states: 10,380 (4)
abstracting: (7<=GAP)
states: 0
abstracting: (NADPplus<=4)
states: 10,380 (4)
abstracting: (5<=_1_3_BPG)
states: 0
abstracting: (6<=G6P)
states: 0
abstracting: (Lac<=0)
states: 3,498 (3)
abstracting: (start<=start)
states: 10,380 (4)
abstracting: (a1<=NADH)
states: 7,248 (3)
abstracting: (3<=G6P)
states: 18
abstracting: (GSSG<=1)
states: 10,380 (4)
abstracting: (GAP<=NADPH)
states: 7,692 (3)
abstracting: (b2<=6)
states: 10,380 (4)
abstracting: (GAP<=S7P)
states: 5,358 (3)
abstracting: (2<=NADH)
states: 6,048 (3)
abstracting: (5<=NADH)
states: 0
abstracting: (3<=Pyr)
states: 0
abstracting: (Lac<=E4P)
states: 5,010 (3)
abstracting: (a1<=4)
states: 10,380 (4)
abstracting: (1<=PEP)
states: 2,670 (3)
abstracting: (1<=Ru5P)
states: 1,212 (3)
abstracting: (Xu5P<=NADplus)
states: 9,762 (3)
abstracting: (Ru5P<=Gluc)
states: 9,258 (3)
abstracting: (1<=a2)
states: 3,576 (3)
abstracting: (ATP<=_3PG)
states: 3,342 (3)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 18588 (1.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7482 15186 22668
used/not used/entry size/cache size: 17415 67091449 16 1024MB
basic ops cache: hits/miss/sum: 28133 93147 121280
used/not used/entry size/cache size: 128576 16648640 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 5544 10453 15997
used/not used/entry size/cache size: 10453 8378155 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67091884
1 16570
2 243
3 34
4 15
5 13
6 12
7 13
8 18
9 8
>= 10 54

Total processing time: 0m 4.357sec


BK_STOP 1678638688359

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
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


initing FirstDep: 0m 0.000sec


iterations count:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec

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-C0001N0000000001"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is GPPP-PT-C0001N0000000001, 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 r170-tall-167838857700774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;