fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857800830
Last Updated
May 14, 2023

About the Execution of Marcie+red for GPPP-PT-C0010N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5606.960 23802.00 30073.00 373.00 FFTFFFTFFFFTFTFF normal

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-167838857800830.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-C0010N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800830
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:43 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.9K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 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-C0010N0000000100-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678642214092

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-C0010N0000000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:30:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:30:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:30:15] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-12 17:30:15] [INFO ] Transformed 33 places.
[2023-03-12 17:30:15] [INFO ] Transformed 22 transitions.
[2023-03-12 17:30:15] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 23 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 16) seen :1
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 568732 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568732 steps, saw 91444 distinct states, run finished after 3002 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:30:18] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 17:30:19] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 17:30:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 17:30:19] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 17:30:20] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 4538 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_C0010N0000000100
(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.713sec


RS generation: 0m 0.168sec


-> reachability set: #nodes 22693 (2.3e+04) #states 176,894,515,156 (11)



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

checking: EF [~ [FBP<=112]]
normalized: E [true U ~ [FBP<=112]]

abstracting: (FBP<=112)
states: 176,894,515,156 (11)
-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: EF [84<=start]
normalized: E [true U 84<=start]

abstracting: (84<=start)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: EF [~ [Lac<=161]]
normalized: E [true U ~ [Lac<=161]]

abstracting: (Lac<=161)
states: 176,894,515,156 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [~ [283<=NADplus]]
normalized: ~ [E [true U 283<=NADplus]]

abstracting: (283<=NADplus)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[PEP<=98 & 78<=a2]]
normalized: E [true U [PEP<=98 & 78<=a2]]

abstracting: (78<=a2)
states: 0
abstracting: (PEP<=98)
states: 176,894,515,156 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [[~ [c2<=ADP] | R5P<=207]]
normalized: ~ [E [true U ~ [[R5P<=207 | ~ [c2<=ADP]]]]]

abstracting: (c2<=ADP)
states: 176,894,515,156 (11)
abstracting: (R5P<=207)
states: 176,894,515,156 (11)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EF [~ [[[~ [NADPplus<=34] & [Pi<=52 & [~ [[Gluc<=FBP | 155<=G6P]] & a2<=191]]] | [[Pyr<=Lac & ~ [[[Ru5P<=E4P | start<=279] | ~ [NADH<=NADPplus]]]] | b1<=267]]]]
normalized: E [true U ~ [[[b1<=267 | [Pyr<=Lac & ~ [[~ [NADH<=NADPplus] | [Ru5P<=E4P | start<=279]]]]] | [[Pi<=52 & [a2<=191 & ~ [[Gluc<=FBP | 155<=G6P]]]] & ~ [NADPplus<=34]]]]]

abstracting: (NADPplus<=34)
states: 0
abstracting: (155<=G6P)
states: 0
abstracting: (Gluc<=FBP)
states: 41,495,943,880 (10)
abstracting: (a2<=191)
states: 176,894,515,156 (11)
abstracting: (Pi<=52)
states: 1
abstracting: (start<=279)
states: 176,894,515,156 (11)
abstracting: (Ru5P<=E4P)
states: 12,146,621,402 (10)
abstracting: (NADH<=NADPplus)
states: 176,894,515,156 (11)
abstracting: (Pyr<=Lac)
states: 117,153,484,818 (11)
abstracting: (b1<=267)
states: 176,894,515,156 (11)
-> the formula is FALSE

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

MC time: 0m 0.719sec

checking: EF [~ [[~ [[[[b1<=140 | [E4P<=134 | a1<=244]] & ~ [a2<=201]] & ADP<=147]] | [NADPH<=PEP & [[[~ [80<=c1] | [[228<=start | a1<=_3PG] & ~ [93<=GSH]]] | ~ [NADPplus<=317]] | NADPplus<=ADP]]]]]
normalized: E [true U ~ [[[NADPH<=PEP & [NADPplus<=ADP | [~ [NADPplus<=317] | [[~ [93<=GSH] & [228<=start | a1<=_3PG]] | ~ [80<=c1]]]]] | ~ [[ADP<=147 & [~ [a2<=201] & [b1<=140 | [E4P<=134 | a1<=244]]]]]]]]

abstracting: (a1<=244)
states: 176,894,515,156 (11)
abstracting: (E4P<=134)
states: 176,894,515,156 (11)
abstracting: (b1<=140)
states: 176,894,515,156 (11)
abstracting: (a2<=201)
states: 176,894,515,156 (11)
abstracting: (ADP<=147)
states: 176,894,515,156 (11)
abstracting: (80<=c1)
states: 0
abstracting: (a1<=_3PG)
states: 20,745,744,868 (10)
abstracting: (228<=start)
states: 0
abstracting: (93<=GSH)
states: 13,076,848,758 (10)
abstracting: (NADPplus<=317)
states: 176,894,515,156 (11)
abstracting: (NADPplus<=ADP)
states: 0
abstracting: (NADPH<=PEP)
states: 10,957,026,906 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.224sec

checking: AG [[[~ [[[[[c1<=NADPH | _2PG<=GSH] & ~ [[89<=Pi & 241<=FBP]]] & [[121<=PEP | ~ [[NADH<=139 & S7P<=47]]] | ~ [ATP<=b1]]] | G6P<=274]] | [ADP<=63 | 178<=NADplus]] | [~ [[100<=GAP & ~ [PEP<=238]]] & ~ [DHAP<=273]]]]
normalized: ~ [E [true U ~ [[[~ [DHAP<=273] & ~ [[100<=GAP & ~ [PEP<=238]]]] | [[ADP<=63 | 178<=NADplus] | ~ [[G6P<=274 | [[~ [ATP<=b1] | [121<=PEP | ~ [[NADH<=139 & S7P<=47]]]] & [~ [[89<=Pi & 241<=FBP]] & [c1<=NADPH | _2PG<=GSH]]]]]]]]]]

abstracting: (_2PG<=GSH)
states: 173,297,153,748 (11)
abstracting: (c1<=NADPH)
states: 146,517,827,348 (11)
abstracting: (241<=FBP)
states: 0
abstracting: (89<=Pi)
states: 0
abstracting: (S7P<=47)
states: 176,894,515,156 (11)
abstracting: (NADH<=139)
states: 176,894,515,156 (11)
abstracting: (121<=PEP)
states: 0
abstracting: (ATP<=b1)
states: 0
abstracting: (G6P<=274)
states: 176,894,515,156 (11)
abstracting: (178<=NADplus)
states: 176,894,515,156 (11)
abstracting: (ADP<=63)
states: 225
abstracting: (PEP<=238)
states: 176,894,515,156 (11)
abstracting: (100<=GAP)
states: 0
abstracting: (DHAP<=273)
states: 176,894,515,156 (11)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.094sec

checking: EF [[Gluc<=18 & [~ [[~ [[[[[143<=DHAP & 13<=start] & [R5P<=NADH | G6P<=237]] | [302<=PEP | [Pyr<=5 & 199<=GSSG]]] & ~ [GSSG<=212]]] & [~ [[ATP<=NADplus | ~ [NADplus<=248]]] | ~ [[~ [98<=F6P] | [FBP<=Lac & [b2<=186 & GSH<=229]]]]]]] & [~ [[~ [[[313<=Pi | GAP<=59] | ~ [NADH<=GSSG]]] | ~ [348<=b1]]] | [[[[[36<=R5P | [144<=Ru5P | R5P<=320]] & [~ [c2<=Ru5P] | NADH<=Gluc]] | ~ [[c1<=NADH | G6P<=19]]] & start<=247] | c1<=102]]]]]
normalized: E [true U [Gluc<=18 & [[[c1<=102 | [start<=247 & [~ [[c1<=NADH | G6P<=19]] | [[NADH<=Gluc | ~ [c2<=Ru5P]] & [36<=R5P | [144<=Ru5P | R5P<=320]]]]]] | ~ [[~ [348<=b1] | ~ [[~ [NADH<=GSSG] | [313<=Pi | GAP<=59]]]]]] & ~ [[[~ [[[FBP<=Lac & [b2<=186 & GSH<=229]] | ~ [98<=F6P]]] | ~ [[ATP<=NADplus | ~ [NADplus<=248]]]] & ~ [[~ [GSSG<=212] & [[302<=PEP | [Pyr<=5 & 199<=GSSG]] | [[R5P<=NADH | G6P<=237] & [143<=DHAP & 13<=start]]]]]]]]]]

abstracting: (13<=start)
states: 0
abstracting: (143<=DHAP)
states: 0
abstracting: (G6P<=237)
states: 176,894,515,156 (11)
abstracting: (R5P<=NADH)
states: 176,255,999,833 (11)
abstracting: (199<=GSSG)
states: 0
abstracting: (Pyr<=5)
states: 175,881,748,946 (11)
abstracting: (302<=PEP)
states: 0
abstracting: (GSSG<=212)
states: 176,894,515,156 (11)
abstracting: (NADplus<=248)
states: 176,894,515,156 (11)
abstracting: (ATP<=NADplus)
states: 0
abstracting: (98<=F6P)
states: 0
abstracting: (GSH<=229)
states: 176,894,515,156 (11)
abstracting: (b2<=186)
states: 176,894,515,156 (11)
abstracting: (FBP<=Lac)
states: 151,444,069,849 (11)
abstracting: (GAP<=59)
states: 176,894,515,156 (11)
abstracting: (313<=Pi)
states: 0
abstracting: (NADH<=GSSG)
states: 176,894,515,156 (11)
abstracting: (348<=b1)
states: 0
abstracting: (R5P<=320)
states: 176,894,515,156 (11)
abstracting: (144<=Ru5P)
states: 0
abstracting: (36<=R5P)
states: 0
abstracting: (c2<=Ru5P)
states: 246,728,912 (8)
abstracting: (NADH<=Gluc)
states: 68,173,999,985 (10)
abstracting: (G6P<=19)
states: 175,142,607,495 (11)
abstracting: (c1<=NADH)
states: 87,910,021,682 (10)
abstracting: (start<=247)
states: 176,894,515,156 (11)
abstracting: (c1<=102)
states: 176,894,515,156 (11)
abstracting: (Gluc<=18)
states: 174,649,057,881 (11)
-> the formula is FALSE

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

MC time: 0m 1.157sec

checking: AG [~ [[~ [[Xu5P<=_3PG | [[[FBP<=b2 | Gluc<=111] | [GAP<=Pyr | PEP<=NADPplus]] & 75<=GSSG]]] | [[[[[[64<=FBP | GAP<=DHAP] | ATP<=PEP] | ~ [333<=a2]] & [[45<=a2 | [a1<=228 | b2<=169]] & [[start<=222 & F6P<=39] | ADP<=c2]]] | c1<=a2] & [GAP<=a2 & [[[[c2<=204 & 189<=b1] & ~ [340<=_1_3_BPG]] | [279<=a1 | ~ [Xu5P<=NADplus]]] & E4P<=a1]]]]]]
normalized: ~ [E [true U [[[GAP<=a2 & [E4P<=a1 & [[279<=a1 | ~ [Xu5P<=NADplus]] | [~ [340<=_1_3_BPG] & [c2<=204 & 189<=b1]]]]] & [c1<=a2 | [[[ADP<=c2 | [start<=222 & F6P<=39]] & [45<=a2 | [a1<=228 | b2<=169]]] & [~ [333<=a2] | [ATP<=PEP | [64<=FBP | GAP<=DHAP]]]]]] | ~ [[Xu5P<=_3PG | [75<=GSSG & [[GAP<=Pyr | PEP<=NADPplus] | [FBP<=b2 | Gluc<=111]]]]]]]]

abstracting: (Gluc<=111)
states: 176,894,515,156 (11)
abstracting: (FBP<=b2)
states: 175,721,428,936 (11)
abstracting: (PEP<=NADPplus)
states: 176,894,515,156 (11)
abstracting: (GAP<=Pyr)
states: 117,000,039,124 (11)
abstracting: (75<=GSSG)
states: 117,556,653,682 (11)
abstracting: (Xu5P<=_3PG)
states: 8,191,066,468 (9)
abstracting: (GAP<=DHAP)
states: 117,056,743,826 (11)
abstracting: (64<=FBP)
states: 0
abstracting: (ATP<=PEP)
states: 0
abstracting: (333<=a2)
states: 0
abstracting: (b2<=169)
states: 176,894,515,156 (11)
abstracting: (a1<=228)
states: 176,894,515,156 (11)
abstracting: (45<=a2)
states: 0
abstracting: (F6P<=39)
states: 176,894,515,156 (11)
abstracting: (start<=222)
states: 176,894,515,156 (11)
abstracting: (ADP<=c2)
states: 225
abstracting: (c1<=a2)
states: 155,347,411,076 (11)
abstracting: (189<=b1)
states: 0
abstracting: (c2<=204)
states: 176,894,515,156 (11)
abstracting: (340<=_1_3_BPG)
states: 0
abstracting: (Xu5P<=NADplus)
states: 176,894,515,156 (11)
abstracting: (279<=a1)
states: 0
abstracting: (E4P<=a1)
states: 175,841,030,470 (11)
abstracting: (GAP<=a2)
states: 173,754,796,135 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.703sec

checking: EF [[[~ [[[Pi<=229 | [~ [GAP<=S7P] & ~ [R5P<=177]]] | [[224<=E4P & NADplus<=12] | GSSG<=R5P]]] | [NADPplus<=NADPH & [[[[GAP<=156 & ADP<=NADPplus] | [[[NADplus<=NADPH | E4P<=237] & [167<=b2 | 276<=GSSG]] & ~ [Xu5P<=NADH]]] | [~ [[[c1<=372 | NADPplus<=37] | ~ [228<=a1]]] & 216<=F6P]] & ~ [[~ [[354<=Ru5P & 23<=ATP]] & [[NADplus<=NADH & [Pyr<=ADP | c2<=79]] | [NADPH<=10 | [b1<=372 & NADplus<=152]]]]]]]] | ~ [[~ [163<=Ru5P] & [c2<=NADplus | ~ [[154<=Lac | [NADH<=51 & 342<=_3PG]]]]]]]]
normalized: E [true U [~ [[[c2<=NADplus | ~ [[154<=Lac | [NADH<=51 & 342<=_3PG]]]] & ~ [163<=Ru5P]]] | [[NADPplus<=NADPH & [~ [[[[NADPH<=10 | [b1<=372 & NADplus<=152]] | [NADplus<=NADH & [Pyr<=ADP | c2<=79]]] & ~ [[354<=Ru5P & 23<=ATP]]]] & [[216<=F6P & ~ [[~ [228<=a1] | [c1<=372 | NADPplus<=37]]]] | [[~ [Xu5P<=NADH] & [[167<=b2 | 276<=GSSG] & [NADplus<=NADPH | E4P<=237]]] | [GAP<=156 & ADP<=NADPplus]]]]] | ~ [[[GSSG<=R5P | [224<=E4P & NADplus<=12]] | [Pi<=229 | [~ [R5P<=177] & ~ [GAP<=S7P]]]]]]]]

abstracting: (GAP<=S7P)
states: 104,909,666,702 (11)
abstracting: (R5P<=177)
states: 176,894,515,156 (11)
abstracting: (Pi<=229)
states: 176,894,515,156 (11)
abstracting: (NADplus<=12)
states: 0
abstracting: (224<=E4P)
states: 0
abstracting: (GSSG<=R5P)
states: 0
abstracting: (ADP<=NADPplus)
states: 176,894,515,156 (11)
abstracting: (GAP<=156)
states: 176,894,515,156 (11)
abstracting: (E4P<=237)
states: 176,894,515,156 (11)
abstracting: (NADplus<=NADPH)
states: 0
abstracting: (276<=GSSG)
states: 0
abstracting: (167<=b2)
states: 0
abstracting: (Xu5P<=NADH)
states: 23,110,503,174 (10)
abstracting: (NADPplus<=37)
states: 0
abstracting: (c1<=372)
states: 176,894,515,156 (11)
abstracting: (228<=a1)
states: 0
abstracting: (216<=F6P)
states: 0
abstracting: (23<=ATP)
states: 176,894,515,156 (11)
abstracting: (354<=Ru5P)
states: 0
abstracting: (c2<=79)
states: 176,894,515,156 (11)
abstracting: (Pyr<=ADP)
states: 176,894,515,156 (11)
abstracting: (NADplus<=NADH)
states: 0
abstracting: (NADplus<=152)
states: 0
abstracting: (b1<=372)
states: 176,894,515,156 (11)
abstracting: (NADPH<=10)
states: 58,513,752,226 (10)
abstracting: (NADPplus<=NADPH)
states: 0
abstracting: (163<=Ru5P)
states: 0
abstracting: (342<=_3PG)
states: 0
abstracting: (NADH<=51)
states: 176,894,515,156 (11)
abstracting: (154<=Lac)
states: 0
abstracting: (c2<=NADplus)
states: 176,894,515,156 (11)
-> the formula is FALSE

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

MC time: 0m 1.492sec

checking: EF [[~ [c2<=330] | [[[353<=FBP & [[~ [[[Gluc<=Gluc | 129<=c2] & [c1<=116 & F6P<=b2]]] | ~ [[_2PG<=206 | Xu5P<=Pyr]]] & [[~ [[149<=R5P | _3PG<=G6P]] | 106<=E4P] & [[[S7P<=_2PG | b1<=125] & _1_3_BPG<=291] | ~ [164<=start]]]]] & 386<=Xu5P] & [[~ [[~ [[[Pyr<=39 & _3PG<=30] & ~ [R5P<=174]]] & ~ [[E4P<=46 & _2PG<=127]]]] | [[[~ [[177<=Gluc & Pyr<=263]] & PEP<=S7P] & ~ [[[GAP<=b2 | 180<=S7P] & [_3PG<=Xu5P & a1<=GSSG]]]] & 50<=NADPH]] & [81<=Gluc | [[[[_2PG<=_2PG | Lac<=341] & [~ [262<=R5P] & [start<=start & 21<=b1]]] & [Lac<=342 & [Pyr<=40 | _3PG<=a1]]] & [start<=Gluc | DHAP<=272]]]]]]]
normalized: E [true U [[[[81<=Gluc | [[start<=Gluc | DHAP<=272] & [[Lac<=342 & [Pyr<=40 | _3PG<=a1]] & [[[start<=start & 21<=b1] & ~ [262<=R5P]] & [_2PG<=_2PG | Lac<=341]]]]] & [[50<=NADPH & [~ [[[_3PG<=Xu5P & a1<=GSSG] & [GAP<=b2 | 180<=S7P]]] & [PEP<=S7P & ~ [[177<=Gluc & Pyr<=263]]]]] | ~ [[~ [[E4P<=46 & _2PG<=127]] & ~ [[~ [R5P<=174] & [Pyr<=39 & _3PG<=30]]]]]]] & [386<=Xu5P & [353<=FBP & [[[~ [164<=start] | [_1_3_BPG<=291 & [S7P<=_2PG | b1<=125]]] & [106<=E4P | ~ [[149<=R5P | _3PG<=G6P]]]] & [~ [[_2PG<=206 | Xu5P<=Pyr]] | ~ [[[c1<=116 & F6P<=b2] & [Gluc<=Gluc | 129<=c2]]]]]]]] | ~ [c2<=330]]]

abstracting: (c2<=330)
states: 176,894,515,156 (11)
abstracting: (129<=c2)
states: 0
abstracting: (Gluc<=Gluc)
states: 176,894,515,156 (11)
abstracting: (F6P<=b2)
states: 175,721,428,936 (11)
abstracting: (c1<=116)
states: 176,894,515,156 (11)
abstracting: (Xu5P<=Pyr)
states: 8,191,066,468 (9)
abstracting: (_2PG<=206)
states: 176,894,515,156 (11)
abstracting: (_3PG<=G6P)
states: 148,802,176,185 (11)
abstracting: (149<=R5P)
states: 0
abstracting: (106<=E4P)
states: 0
abstracting: (b1<=125)
states: 176,894,515,156 (11)
abstracting: (S7P<=_2PG)
states: 146,257,184,322 (11)
abstracting: (_1_3_BPG<=291)
states: 176,894,515,156 (11)
abstracting: (164<=start)
states: 0
abstracting: (353<=FBP)
states: 0
abstracting: (386<=Xu5P)
states: 0
abstracting: (_3PG<=30)
states: 176,894,515,156 (11)
abstracting: (Pyr<=39)
states: 176,894,515,156 (11)
abstracting: (R5P<=174)
states: 176,894,515,156 (11)
abstracting: (_2PG<=127)
states: 176,894,515,156 (11)
abstracting: (E4P<=46)
states: 176,894,515,156 (11)
abstracting: (Pyr<=263)
states: 176,894,515,156 (11)
abstracting: (177<=Gluc)
states: 0
abstracting: (PEP<=S7P)
states: 105,003,303,034 (11)
abstracting: (180<=S7P)
states: 0
abstracting: (GAP<=b2)
states: 172,997,174,826 (11)
abstracting: (a1<=GSSG)
states: 176,894,515,156 (11)
abstracting: (_3PG<=Xu5P)
states: 173,142,036,818 (11)
abstracting: (50<=NADPH)
states: 9,488,686,746 (9)
abstracting: (Lac<=341)
states: 176,894,515,156 (11)
abstracting: (_2PG<=_2PG)
states: 176,894,515,156 (11)
abstracting: (262<=R5P)
states: 0
abstracting: (21<=b1)
states: 37,261,037,918 (10)
abstracting: (start<=start)
states: 176,894,515,156 (11)
abstracting: (_3PG<=a1)
states: 166,966,169,583 (11)
abstracting: (Pyr<=40)
states: 176,894,515,156 (11)
abstracting: (Lac<=342)
states: 176,894,515,156 (11)
abstracting: (DHAP<=272)
states: 176,894,515,156 (11)
abstracting: (start<=Gluc)
states: 176,894,515,155 (11)
abstracting: (81<=Gluc)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.866sec

checking: AG [[[[[Gluc<=_2PG & ~ [b2<=DHAP]] & a1<=194] | _1_3_BPG<=132] | [[[[[~ [[[102<=FBP & Pi<=Ru5P] | 268<=G6P]] & [c2<=S7P | [~ [1<=FBP] | [GAP<=278 & DHAP<=NADPH]]]] & ~ [[[[a1<=240 & E4P<=a2] & ~ [181<=Pyr]] & [[133<=Lac & start<=364] & [360<=ADP | Lac<=334]]]]] & [[[_1_3_BPG<=DHAP | ~ [NADplus<=168]] | [[[Lac<=32 | ATP<=122] | [GSSG<=131 & _2PG<=203]] | [~ [b2<=389] | ~ [94<=FBP]]]] & Lac<=F6P]] & [[[Lac<=359 | c1<=246] | [G6P<=GSSG & [~ [[Xu5P<=c2 | 311<=_2PG]] & start<=144]]] | [[Pi<=Gluc | [[~ [ADP<=G6P] & a2<=start] & [Ru5P<=78 | [14<=_2PG | 350<=DHAP]]]] & ADP<=R5P]]] | [ADP<=S7P | start<=357]]]]
normalized: ~ [E [true U ~ [[[[ADP<=S7P | start<=357] | [[[ADP<=R5P & [Pi<=Gluc | [[Ru5P<=78 | [14<=_2PG | 350<=DHAP]] & [a2<=start & ~ [ADP<=G6P]]]]] | [[G6P<=GSSG & [start<=144 & ~ [[Xu5P<=c2 | 311<=_2PG]]]] | [Lac<=359 | c1<=246]]] & [[Lac<=F6P & [[[~ [94<=FBP] | ~ [b2<=389]] | [[GSSG<=131 & _2PG<=203] | [Lac<=32 | ATP<=122]]] | [_1_3_BPG<=DHAP | ~ [NADplus<=168]]]] & [~ [[[[360<=ADP | Lac<=334] & [133<=Lac & start<=364]] & [~ [181<=Pyr] & [a1<=240 & E4P<=a2]]]] & [[c2<=S7P | [[GAP<=278 & DHAP<=NADPH] | ~ [1<=FBP]]] & ~ [[268<=G6P | [102<=FBP & Pi<=Ru5P]]]]]]]] | [_1_3_BPG<=132 | [a1<=194 & [Gluc<=_2PG & ~ [b2<=DHAP]]]]]]]]

abstracting: (b2<=DHAP)
states: 8,852,082,238 (9)
abstracting: (Gluc<=_2PG)
states: 56,837,208,372 (10)
abstracting: (a1<=194)
states: 176,894,515,156 (11)
abstracting: (_1_3_BPG<=132)
states: 176,894,515,156 (11)
abstracting: (Pi<=Ru5P)
states: 1
abstracting: (102<=FBP)
states: 0
abstracting: (268<=G6P)
states: 0
abstracting: (1<=FBP)
states: 42,323,861,326 (10)
abstracting: (DHAP<=NADPH)
states: 171,694,004,850 (11)
abstracting: (GAP<=278)
states: 176,894,515,156 (11)
abstracting: (c2<=S7P)
states: 246,728,912 (8)
abstracting: (E4P<=a2)
states: 176,565,005,176 (11)
abstracting: (a1<=240)
states: 176,894,515,156 (11)
abstracting: (181<=Pyr)
states: 0
abstracting: (start<=364)
states: 176,894,515,156 (11)
abstracting: (133<=Lac)
states: 0
abstracting: (Lac<=334)
states: 176,894,515,156 (11)
abstracting: (360<=ADP)
states: 0
abstracting: (NADplus<=168)
states: 0
abstracting: (_1_3_BPG<=DHAP)
states: 117,153,484,818 (11)
abstracting: (ATP<=122)
states: 0
abstracting: (Lac<=32)
states: 176,894,515,156 (11)
abstracting: (_2PG<=203)
states: 176,894,515,156 (11)
abstracting: (GSSG<=131)
states: 176,894,515,156 (11)
abstracting: (b2<=389)
states: 176,894,515,156 (11)
abstracting: (94<=FBP)
states: 0
abstracting: (Lac<=F6P)
states: 99,933,137,541 (10)
abstracting: (c1<=246)
states: 176,894,515,156 (11)
abstracting: (Lac<=359)
states: 176,894,515,156 (11)
abstracting: (311<=_2PG)
states: 0
abstracting: (Xu5P<=c2)
states: 176,658,967,654 (11)
abstracting: (start<=144)
states: 176,894,515,156 (11)
abstracting: (G6P<=GSSG)
states: 176,894,515,156 (11)
abstracting: (ADP<=G6P)
states: 1
abstracting: (a2<=start)
states: 3,525,118,042 (9)
abstracting: (350<=DHAP)
states: 0
abstracting: (14<=_2PG)
states: 0
abstracting: (Ru5P<=78)
states: 176,894,515,156 (11)
abstracting: (Pi<=Gluc)
states: 1
abstracting: (ADP<=R5P)
states: 1
abstracting: (start<=357)
states: 176,894,515,156 (11)
abstracting: (ADP<=S7P)
states: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.500sec

checking: EF [[[[[~ [[~ [Pi<=276] & c2<=110]] & 130<=R5P] | ~ [[[~ [187<=a2] | [[~ [b1<=165] & NADPplus<=Ru5P] & [[PEP<=1 | NADplus<=NADplus] | [NADPH<=NADPH | NADPplus<=96]]]] | _1_3_BPG<=68]]] & [[119<=NADPH | [[137<=Lac | [[~ [380<=GSSG] | [72<=start | F6P<=S7P]] | 281<=Pyr]] & [[[G6P<=258 | [Pi<=_2PG | GSH<=290]] & ~ [[G6P<=222 | 84<=ADP]]] & [NADPplus<=c1 & _2PG<=25]]]] | 192<=NADPplus]] | [[[[[~ [356<=R5P] | ~ [Pi<=F6P]] & ~ [[[[337<=S7P | 200<=_1_3_BPG] | ~ [278<=R5P]] | [NADPplus<=GSSG & [Gluc<=334 | 40<=S7P]]]]] & ~ [FBP<=Xu5P]] & [Lac<=167 & ~ [[~ [[[E4P<=b2 | G6P<=3] & [15<=DHAP & Ru5P<=134]]] | [73<=DHAP | 394<=ADP]]]]] & [c1<=191 & [268<=Pyr | [NADH<=b1 | ~ [[~ [_1_3_BPG<=29] & b1<=3]]]]]]]]
normalized: E [true U [[[c1<=191 & [268<=Pyr | [NADH<=b1 | ~ [[b1<=3 & ~ [_1_3_BPG<=29]]]]]] & [[Lac<=167 & ~ [[[73<=DHAP | 394<=ADP] | ~ [[[15<=DHAP & Ru5P<=134] & [E4P<=b2 | G6P<=3]]]]]] & [~ [FBP<=Xu5P] & [~ [[[NADPplus<=GSSG & [Gluc<=334 | 40<=S7P]] | [~ [278<=R5P] | [337<=S7P | 200<=_1_3_BPG]]]] & [~ [Pi<=F6P] | ~ [356<=R5P]]]]]] | [[192<=NADPplus | [119<=NADPH | [[[NADPplus<=c1 & _2PG<=25] & [~ [[G6P<=222 | 84<=ADP]] & [G6P<=258 | [Pi<=_2PG | GSH<=290]]]] & [137<=Lac | [281<=Pyr | [[72<=start | F6P<=S7P] | ~ [380<=GSSG]]]]]]] & [~ [[_1_3_BPG<=68 | [[[[NADPH<=NADPH | NADPplus<=96] | [PEP<=1 | NADplus<=NADplus]] & [NADPplus<=Ru5P & ~ [b1<=165]]] | ~ [187<=a2]]]] | [130<=R5P & ~ [[c2<=110 & ~ [Pi<=276]]]]]]]]

abstracting: (Pi<=276)
states: 176,894,515,156 (11)
abstracting: (c2<=110)
states: 176,894,515,156 (11)
abstracting: (130<=R5P)
states: 0
abstracting: (187<=a2)
states: 0
abstracting: (b1<=165)
states: 176,894,515,156 (11)
abstracting: (NADPplus<=Ru5P)
states: 0
abstracting: (NADplus<=NADplus)
states: 176,894,515,156 (11)
abstracting: (PEP<=1)
states: 134,641,352,223 (11)
abstracting: (NADPplus<=96)
states: 0
abstracting: (NADPH<=NADPH)
states: 176,894,515,156 (11)
abstracting: (_1_3_BPG<=68)
states: 176,894,515,156 (11)
abstracting: (380<=GSSG)
states: 0
abstracting: (F6P<=S7P)
states: 147,961,026,082 (11)
abstracting: (72<=start)
states: 0
abstracting: (281<=Pyr)
states: 0
abstracting: (137<=Lac)
states: 0
abstracting: (GSH<=290)
states: 176,894,515,156 (11)
abstracting: (Pi<=_2PG)
states: 1
abstracting: (G6P<=258)
states: 176,894,515,156 (11)
abstracting: (84<=ADP)
states: 176,274,179,861 (11)
abstracting: (G6P<=222)
states: 176,894,515,156 (11)
abstracting: (_2PG<=25)
states: 176,894,515,156 (11)
abstracting: (NADPplus<=c1)
states: 0
abstracting: (119<=NADPH)
states: 0
abstracting: (192<=NADPplus)
states: 48,848,041,966 (10)
abstracting: (356<=R5P)
states: 0
abstracting: (Pi<=F6P)
states: 1
abstracting: (200<=_1_3_BPG)
states: 0
abstracting: (337<=S7P)
states: 0
abstracting: (278<=R5P)
states: 0
abstracting: (40<=S7P)
states: 0
abstracting: (Gluc<=334)
states: 176,894,515,156 (11)
abstracting: (NADPplus<=GSSG)
states: 0
abstracting: (FBP<=Xu5P)
states: 175,744,053,809 (11)
abstracting: (G6P<=3)
states: 105,302,176,481 (11)
abstracting: (E4P<=b2)
states: 176,492,696,566 (11)
abstracting: (Ru5P<=134)
states: 176,894,515,156 (11)
abstracting: (15<=DHAP)
states: 0
abstracting: (394<=ADP)
states: 0
abstracting: (73<=DHAP)
states: 0
abstracting: (Lac<=167)
states: 176,894,515,156 (11)
abstracting: (_1_3_BPG<=29)
states: 176,894,515,156 (11)
abstracting: (b1<=3)
states: 71,877,785,188 (10)
abstracting: (NADH<=b1)
states: 94,721,794,942 (10)
abstracting: (268<=Pyr)
states: 0
abstracting: (c1<=191)
states: 176,894,515,156 (11)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.903sec

checking: EF [[[[R5P<=261 & [~ [[[[[Gluc<=c2 | F6P<=Xu5P] | NADH<=Pi] & [[a1<=289 & 135<=Pyr] | Pyr<=NADplus]] & ~ [Pi<=R5P]]] & ~ [[[[[145<=NADplus & 114<=Lac] | [Lac<=168 | GSSG<=27]] | [[c2<=86 & NADPplus<=Gluc] & [b1<=235 | 219<=start]]] & [~ [Pi<=66] | ~ [[ADP<=ADP | Ru5P<=a2]]]]]]] | ~ [[246<=ATP & ~ [38<=start]]]] & [[[[~ [[~ [[GSH<=a1 | a2<=88]] & [[347<=_1_3_BPG | _3PG<=b1] & ~ [145<=FBP]]]] & [[[[FBP<=160 & 152<=b2] & [361<=Xu5P | ADP<=45]] | ~ [[R5P<=391 | 256<=c1]]] | ~ [F6P<=230]]] & ~ [[~ [[_2PG<=330 | 394<=Pyr]] | ~ [b2<=4]]]] & [[[[~ [[360<=GSH | Xu5P<=GAP]] | [[204<=b2 & Xu5P<=372] & [PEP<=GAP | Pi<=185]]] & ~ [[[192<=Gluc & c1<=307] | 163<=GSH]]] | 153<=Ru5P] & [[~ [[~ [320<=Xu5P] & [286<=GAP & 393<=DHAP]]] | 116<=NADplus] | [105<=ATP | b1<=_3PG]]]] & [c2<=135 & [R5P<=366 | [45<=R5P & [34<=_2PG | [[[R5P<=389 | PEP<=c2] | ~ [F6P<=_1_3_BPG]] | ATP<=239]]]]]]]]
normalized: E [true U [[[c2<=135 & [R5P<=366 | [45<=R5P & [34<=_2PG | [ATP<=239 | [~ [F6P<=_1_3_BPG] | [R5P<=389 | PEP<=c2]]]]]]] & [[[[105<=ATP | b1<=_3PG] | [116<=NADplus | ~ [[[286<=GAP & 393<=DHAP] & ~ [320<=Xu5P]]]]] & [153<=Ru5P | [~ [[163<=GSH | [192<=Gluc & c1<=307]]] & [[[PEP<=GAP | Pi<=185] & [204<=b2 & Xu5P<=372]] | ~ [[360<=GSH | Xu5P<=GAP]]]]]] & [~ [[~ [b2<=4] | ~ [[_2PG<=330 | 394<=Pyr]]]] & [[~ [F6P<=230] | [~ [[R5P<=391 | 256<=c1]] | [[361<=Xu5P | ADP<=45] & [FBP<=160 & 152<=b2]]]] & ~ [[[~ [145<=FBP] & [347<=_1_3_BPG | _3PG<=b1]] & ~ [[GSH<=a1 | a2<=88]]]]]]]] & [~ [[246<=ATP & ~ [38<=start]]] | [R5P<=261 & [~ [[[~ [[ADP<=ADP | Ru5P<=a2]] | ~ [Pi<=66]] & [[[b1<=235 | 219<=start] & [c2<=86 & NADPplus<=Gluc]] | [[Lac<=168 | GSSG<=27] | [145<=NADplus & 114<=Lac]]]]] & ~ [[~ [Pi<=R5P] & [[Pyr<=NADplus | [a1<=289 & 135<=Pyr]] & [NADH<=Pi | [Gluc<=c2 | F6P<=Xu5P]]]]]]]]]]

abstracting: (F6P<=Xu5P)
states: 175,744,053,809 (11)
abstracting: (Gluc<=c2)
states: 176,687,528,091 (11)
abstracting: (NADH<=Pi)
states: 176,894,515,156 (11)
abstracting: (135<=Pyr)
states: 0
abstracting: (a1<=289)
states: 176,894,515,156 (11)
abstracting: (Pyr<=NADplus)
states: 176,894,515,156 (11)
abstracting: (Pi<=R5P)
states: 1
abstracting: (114<=Lac)
states: 0
abstracting: (145<=NADplus)
states: 176,894,515,156 (11)
abstracting: (GSSG<=27)
states: 25,372,740 (7)
abstracting: (Lac<=168)
states: 176,894,515,156 (11)
abstracting: (NADPplus<=Gluc)
states: 0
abstracting: (c2<=86)
states: 176,894,515,156 (11)
abstracting: (219<=start)
states: 0
abstracting: (b1<=235)
states: 176,894,515,156 (11)
abstracting: (Pi<=66)
states: 144,695,459,221 (11)
abstracting: (Ru5P<=a2)
states: 111,633,781,754 (11)
abstracting: (ADP<=ADP)
states: 176,894,515,156 (11)
abstracting: (R5P<=261)
states: 176,894,515,156 (11)
abstracting: (38<=start)
states: 0
abstracting: (246<=ATP)
states: 176,894,515,156 (11)
abstracting: (a2<=88)
states: 176,894,515,156 (11)
abstracting: (GSH<=a1)
states: 25,506,811,837 (10)
abstracting: (_3PG<=b1)
states: 159,321,241,632 (11)
abstracting: (347<=_1_3_BPG)
states: 0
abstracting: (145<=FBP)
states: 0
abstracting: (152<=b2)
states: 0
abstracting: (FBP<=160)
states: 176,894,515,156 (11)
abstracting: (ADP<=45)
states: 1
abstracting: (361<=Xu5P)
states: 0
abstracting: (256<=c1)
states: 0
abstracting: (R5P<=391)
states: 176,894,515,156 (11)
abstracting: (F6P<=230)
states: 176,894,515,156 (11)
abstracting: (394<=Pyr)
states: 0
abstracting: (_2PG<=330)
states: 176,894,515,156 (11)
abstracting: (b2<=4)
states: 23,178,995,230 (10)
abstracting: (Xu5P<=GAP)
states: 8,199,570,366 (9)
abstracting: (360<=GSH)
states: 0
abstracting: (Xu5P<=372)
states: 176,894,515,156 (11)
abstracting: (204<=b2)
states: 0
abstracting: (Pi<=185)
states: 176,894,515,156 (11)
abstracting: (PEP<=GAP)
states: 117,153,484,818 (11)
abstracting: (c1<=307)
states: 176,894,515,156 (11)
abstracting: (192<=Gluc)
states: 0
abstracting: (163<=GSH)
states: 0
abstracting: (153<=Ru5P)
states: 0
abstracting: (320<=Xu5P)
states: 0
abstracting: (393<=DHAP)
states: 0
abstracting: (286<=GAP)
states: 0
abstracting: (116<=NADplus)
states: 176,894,515,156 (11)
abstracting: (b1<=_3PG)
states: 35,554,531,859 (10)
abstracting: (105<=ATP)
states: 176,894,515,156 (11)
abstracting: (PEP<=c2)
states: 176,894,515,156 (11)
abstracting: (R5P<=389)
states: 176,894,515,156 (11)
abstracting: (F6P<=_1_3_BPG)
states: 151,444,069,849 (11)
abstracting: (ATP<=239)
states: 0
abstracting: (34<=_2PG)
states: 0
abstracting: (45<=R5P)
states: 0
abstracting: (R5P<=366)
states: 176,894,515,156 (11)
abstracting: (c2<=135)
states: 176,894,515,156 (11)
-> the formula is FALSE

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

MC time: 0m 1.327sec

totally nodes used: 1360902 (1.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1330171 709377 2039548
used/not used/entry size/cache size: 789669 66319195 16 1024MB
basic ops cache: hits/miss/sum: 30019217 19869438 49888655
used/not used/entry size/cache size: 11843108 4934108 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: 1323467 714140 2037607
used/not used/entry size/cache size: 685529 7703079 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 66114266
1 966967
2 23012
3 1827
4 573
5 130
6 111
7 72
8 71
9 168
>= 10 1667

Total processing time: 0m16.745sec


BK_STOP 1678642237894

--------------------
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:1481 (67), effective:355 (16)

initing FirstDep: 0m 0.000sec


iterations count:850 (38), effective:124 (5)

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-C0010N0000000100"
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-C0010N0000000100, 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-167838857800830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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 ;