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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:39 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.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:41 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-C0001N0000001000-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000001000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678640973942

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-C0001N0000001000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:09:35] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-12 17:09:35] [INFO ] Transformed 33 places.
[2023-03-12 17:09:35] [INFO ] Transformed 22 transitions.
[2023-03-12 17:09:35] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) 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 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 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 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 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 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 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 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 20 ms. (steps per millisecond=50 ) 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 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) 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 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 353551 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353551 steps, saw 116644 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:09:39] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-12 17:09:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:09:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 17:09:39] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:14
[2023-03-12 17:09:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:09:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-12 17:09:39] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :2
[2023-03-12 17:09:39] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 17:09:39] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :2
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 2 different solutions.
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 565 ms.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 15
Applied a total of 12 rules in 38 ms. Remains 26 /33 variables (removed 7) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 26 cols
[2023-03-12 17:09:40] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 17:09:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 26/33 places, 15/22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 352985 steps, run visited all 1 properties in 374 ms. (steps per millisecond=943 )
Probabilistic random walk after 352985 steps, saw 141488 distinct states, run finished after 374 ms. (steps per millisecond=943 ) properties seen :1
FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 5557 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_C0001N0000001000
(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.700sec


RS generation: 0m 5.480sec


-> reachability set: #nodes 4058 (4.1e+03) #states 14,353,505,166 (10)



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

checking: EF [~ [PEP<=1579]]
normalized: E [true U ~ [PEP<=1579]]

abstracting: (PEP<=1579)
states: 14,353,505,166 (10)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AG [~ [1922<=Xu5P]]
normalized: ~ [E [true U 1922<=Xu5P]]

abstracting: (1922<=Xu5P)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [[~ [Xu5P<=2033] | NADPH<=1639]]
normalized: ~ [E [true U ~ [[NADPH<=1639 | ~ [Xu5P<=2033]]]]]

abstracting: (Xu5P<=2033)
states: 14,353,505,166 (10)
abstracting: (NADPH<=1639)
states: 11,763,992,240 (10)
-> the formula is FALSE

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

MC time: 2m20.809sec

checking: AG [NADH<=GSSG]
normalized: ~ [E [true U ~ [NADH<=GSSG]]]

abstracting: (NADH<=GSSG)
states: 14,304,840,846 (10)
-> the formula is FALSE

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

MC time: 0m22.614sec

checking: AG [~ [[_2PG<=DHAP & 3403<=_1_3_BPG]]]
normalized: ~ [E [true U [_2PG<=DHAP & 3403<=_1_3_BPG]]]

abstracting: (3403<=_1_3_BPG)
states: 0
abstracting: (_2PG<=DHAP)
states: 10,043,047,014 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[~ [[1530<=Lac & ATP<=2192]] | 677<=start]]
normalized: ~ [E [true U ~ [[677<=start | ~ [[1530<=Lac & ATP<=2192]]]]]]

abstracting: (ATP<=2192)
states: 0
abstracting: (1530<=Lac)
states: 0
abstracting: (677<=start)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[1279<=_3PG & ~ [[~ [NADH<=2243] & 260<=NADH]]]]
normalized: E [true U [1279<=_3PG & ~ [[260<=NADH & ~ [NADH<=2243]]]]]

abstracting: (NADH<=2243)
states: 14,353,505,166 (10)
abstracting: (260<=NADH)
states: 0
abstracting: (1279<=_3PG)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [[DHAP<=ADP | [[2814<=DHAP | 3654<=GSH] & ~ [[c2<=3778 & [[~ [E4P<=986] | ~ [[NADH<=1861 & [3553<=R5P & 2345<=R5P]]]] & FBP<=2586]]]]]]
normalized: ~ [E [true U ~ [[DHAP<=ADP | [~ [[c2<=3778 & [FBP<=2586 & [~ [[NADH<=1861 & [3553<=R5P & 2345<=R5P]]] | ~ [E4P<=986]]]]] & [2814<=DHAP | 3654<=GSH]]]]]]

abstracting: (3654<=GSH)
states: 0
abstracting: (2814<=DHAP)
states: 0
abstracting: (E4P<=986)
states: 14,353,505,166 (10)
abstracting: (2345<=R5P)
states: 0
abstracting: (3553<=R5P)
states: 0
abstracting: (NADH<=1861)
states: 14,353,505,166 (10)
abstracting: (FBP<=2586)
states: 14,353,505,166 (10)
abstracting: (c2<=3778)
states: 14,353,505,166 (10)
abstracting: (DHAP<=ADP)
states: 14,353,505,166 (10)
-> the formula is TRUE

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

MC time: 0m 0.023sec

checking: AG [[~ [[[[2633<=S7P & ~ [Xu5P<=3920]] & [[NADPplus<=GSH & [~ [start<=a2] & [700<=b2 | F6P<=G6P]]] & ~ [3738<=Gluc]]] & FBP<=start]] | 1272<=b1]]
normalized: ~ [E [true U ~ [[1272<=b1 | ~ [[FBP<=start & [[~ [3738<=Gluc] & [NADPplus<=GSH & [[700<=b2 | F6P<=G6P] & ~ [start<=a2]]]] & [2633<=S7P & ~ [Xu5P<=3920]]]]]]]]]

abstracting: (Xu5P<=3920)
states: 14,353,505,166 (10)
abstracting: (2633<=S7P)
states: 0
abstracting: (start<=a2)
states: 14,351,502,165 (10)
abstracting: (F6P<=G6P)
states: 11,975,942,979 (10)
abstracting: (700<=b2)
states: 0
abstracting: (NADPplus<=GSH)
states: 7,180,339,166 (9)
abstracting: (3738<=Gluc)
states: 0
abstracting: (FBP<=start)
states: 11,877,795,930 (10)
abstracting: (1272<=b1)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.631sec

checking: EF [~ [[[a1<=3151 | ~ [[[Xu5P<=F6P & [[[74<=F6P | c2<=3800] & [Gluc<=E4P & 3941<=PEP]] & a1<=Ru5P]] | a1<=ADP]]] & [[Pi<=1313 | ~ [NADH<=295]] & _3PG<=1733]]]]
normalized: E [true U ~ [[[_3PG<=1733 & [Pi<=1313 | ~ [NADH<=295]]] & [a1<=3151 | ~ [[a1<=ADP | [Xu5P<=F6P & [a1<=Ru5P & [[Gluc<=E4P & 3941<=PEP] & [74<=F6P | c2<=3800]]]]]]]]]]

abstracting: (c2<=3800)
states: 14,353,505,166 (10)
abstracting: (74<=F6P)
states: 0
abstracting: (3941<=PEP)
states: 0
abstracting: (Gluc<=E4P)
states: 14,229,319,104 (10)
abstracting: (a1<=Ru5P)
states: 927,389,463 (8)
abstracting: (Xu5P<=F6P)
states: 13,572,334,776 (10)
abstracting: (a1<=ADP)
states: 14,293,415,136 (10)
abstracting: (a1<=3151)
states: 14,353,505,166 (10)
abstracting: (NADH<=295)
states: 14,353,505,166 (10)
abstracting: (Pi<=1313)
states: 14,353,505,166 (10)
abstracting: (_3PG<=1733)
states: 14,353,505,166 (10)
-> the formula is FALSE

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

MC time: 0m 0.036sec

checking: AG [[~ [2587<=NADplus] | [[~ [[[~ [2467<=b2] & E4P<=2620] & [~ [[3712<=NADPplus & ADP<=c1]] | [PEP<=NADH & 1438<=FBP]]]] | ~ [[[[1941<=F6P | NADplus<=Gluc] & [[[_1_3_BPG<=R5P | b1<=1532] | _3PG<=_3PG] | Xu5P<=ATP]] | 1817<=S7P]]] | [2941<=DHAP & NADPplus<=1740]]]]
normalized: ~ [E [true U ~ [[[[2941<=DHAP & NADPplus<=1740] | [~ [[1817<=S7P | [[Xu5P<=ATP | [_3PG<=_3PG | [_1_3_BPG<=R5P | b1<=1532]]] & [1941<=F6P | NADplus<=Gluc]]]] | ~ [[[[PEP<=NADH & 1438<=FBP] | ~ [[3712<=NADPplus & ADP<=c1]]] & [E4P<=2620 & ~ [2467<=b2]]]]]] | ~ [2587<=NADplus]]]]]

abstracting: (2587<=NADplus)
states: 0
abstracting: (2467<=b2)
states: 0
abstracting: (E4P<=2620)
states: 14,353,505,166 (10)
abstracting: (ADP<=c1)
states: 2,253,376,125 (9)
abstracting: (3712<=NADPplus)
states: 0
abstracting: (1438<=FBP)
states: 0
abstracting: (PEP<=NADH)
states: 14,353,505,166 (10)
abstracting: (NADplus<=Gluc)
states: 0
abstracting: (1941<=F6P)
states: 0
abstracting: (b1<=1532)
states: 14,353,505,166 (10)
abstracting: (_1_3_BPG<=R5P)
states: 8,280,406,134 (9)
abstracting: (_3PG<=_3PG)
states: 14,353,505,166 (10)
abstracting: (Xu5P<=ATP)

before gc: list nodes free: 610152

after gc: idd nodes used:54882, unused:63945118; list nodes free:649852382
states: 14,353,505,166 (10)
abstracting: (1817<=S7P)
states: 0
abstracting: (NADPplus<=1740)
states: 12,488,482,006 (10)
abstracting: (2941<=DHAP)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000001000-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m48.147sec

checking: AG [[[[NADH<=2618 & c2<=563] & ~ [2722<=_1_3_BPG]] | [~ [[2985<=NADplus | [[[[G6P<=3944 & E4P<=1910] & [NADPH<=2596 & 3757<=ATP]] | ~ [FBP<=E4P]] | _2PG<=204]]] & [~ [[[~ [S7P<=b1] | [[[PEP<=411 | b1<=NADplus] & ~ [Ru5P<=NADPH]] & ADP<=NADPplus]] | ~ [[Pyr<=344 | ATP<=1400]]]] | G6P<=b2]]]]
normalized: ~ [E [true U ~ [[[[G6P<=b2 | ~ [[~ [[Pyr<=344 | ATP<=1400]] | [[ADP<=NADPplus & [~ [Ru5P<=NADPH] & [PEP<=411 | b1<=NADplus]]] | ~ [S7P<=b1]]]]] & ~ [[2985<=NADplus | [_2PG<=204 | [~ [FBP<=E4P] | [[NADPH<=2596 & 3757<=ATP] & [G6P<=3944 & E4P<=1910]]]]]]] | [~ [2722<=_1_3_BPG] & [NADH<=2618 & c2<=563]]]]]]

abstracting: (c2<=563)
states: 14,353,505,166 (10)
abstracting: (NADH<=2618)
states: 14,353,505,166 (10)
abstracting: (2722<=_1_3_BPG)
states: 0
abstracting: (E4P<=1910)
states: 14,353,505,166 (10)
abstracting: (G6P<=3944)
states: 14,353,505,166 (10)
abstracting: (3757<=ATP)
states: 14,353,505,166 (10)
abstracting: (NADPH<=2596)
states: 14,353,505,166 (10)
abstracting: (FBP<=E4P)
states: 12,174,240,078 (10)
abstracting: (_2PG<=204)
states: 14,353,505,166 (10)
abstracting: (2985<=NADplus)
states: 0
abstracting: (S7P<=b1)
states: 14,353,505,166 (10)
abstracting: (b1<=NADplus)
states: 14,353,505,166 (10)
abstracting: (PEP<=411)
states: 14,353,505,166 (10)
abstracting: (Ru5P<=NADPH)
states: 14,353,016,678 (10)
abstracting: (ADP<=NADPplus)
states: 14,290,961,685 (10)
abstracting: (ATP<=1400)
states: 0
abstracting: (Pyr<=344)
states: 14,353,505,166 (10)
abstracting: (G6P<=b2)
states: 14,345,493,162 (10)
-> the formula is TRUE

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

MC time: 0m19.766sec

checking: EF [[[[~ [_3PG<=b2] | ~ [[[[~ [[NADPH<=1926 & S7P<=3023]] | [[GSH<=1057 & _1_3_BPG<=3787] & [685<=a2 & _3PG<=start]]] & Gluc<=3268] | 1603<=_3PG]]] | [[324<=Gluc | [[[[[b2<=1546 & Ru5P<=602] | [b2<=3609 | S7P<=Xu5P]] & [[F6P<=1166 | ATP<=ATP] | ~ [ADP<=3079]]] | ~ [[[GSSG<=1165 & NADPplus<=63] & [Pyr<=3997 & ATP<=NADplus]]]] | [[3819<=R5P | ~ [[start<=start | a1<=2062]]] & [Lac<=E4P & [[1640<=NADPplus & Xu5P<=3192] & GSSG<=195]]]]] | c1<=3100]] & ~ [_3PG<=3428]]]
normalized: E [true U [~ [_3PG<=3428] & [[c1<=3100 | [324<=Gluc | [[[Lac<=E4P & [GSSG<=195 & [1640<=NADPplus & Xu5P<=3192]]] & [3819<=R5P | ~ [[start<=start | a1<=2062]]]] | [~ [[[Pyr<=3997 & ATP<=NADplus] & [GSSG<=1165 & NADPplus<=63]]] | [[~ [ADP<=3079] | [F6P<=1166 | ATP<=ATP]] & [[b2<=3609 | S7P<=Xu5P] | [b2<=1546 & Ru5P<=602]]]]]]] | [~ [[1603<=_3PG | [Gluc<=3268 & [[[685<=a2 & _3PG<=start] & [GSH<=1057 & _1_3_BPG<=3787]] | ~ [[NADPH<=1926 & S7P<=3023]]]]]] | ~ [_3PG<=b2]]]]]

abstracting: (_3PG<=b2)
states: 8,672,994,330 (9)
abstracting: (S7P<=3023)
states: 14,353,505,166 (10)
abstracting: (NADPH<=1926)
states: 13,822,690,882 (10)
abstracting: (_1_3_BPG<=3787)
states: 14,353,505,166 (10)
abstracting: (GSH<=1057)
states: 7,585,418,814 (9)
abstracting: (_3PG<=start)
states: 8,280,406,134 (9)
abstracting: (685<=a2)
states: 0
abstracting: (Gluc<=3268)
states: 14,353,505,166 (10)
abstracting: (1603<=_3PG)
states: 0
abstracting: (Ru5P<=602)
states: 14,353,505,166 (10)
abstracting: (b2<=1546)
states: 14,353,505,166 (10)
abstracting: (S7P<=Xu5P)
states: 14,305,433,142 (10)
abstracting: (b2<=3609)
states: 14,353,505,166 (10)
abstracting: (ATP<=ATP)
states: 14,353,505,166 (10)
abstracting: (F6P<=1166)
states: 14,353,505,166 (10)
abstracting: (ADP<=3079)
states: 14,353,505,166 (10)
abstracting: (NADPplus<=63)
states: 459,082,624 (8)
abstracting: (GSSG<=1165)
states: 14,353,505,166 (10)
abstracting: (ATP<=NADplus)
states: 0
abstracting: (Pyr<=3997)
states: 14,353,505,166 (10)
abstracting: (a1<=2062)
states: 14,353,505,166 (10)
abstracting: (start<=start)
states: 14,353,505,166 (10)
abstracting: (3819<=R5P)
states: 0
abstracting: (Xu5P<=3192)
states: 14,353,505,166 (10)
abstracting: (1640<=NADPplus)
states: 2,589,512,926 (9)
abstracting: (GSSG<=195)
states: 2,810,476,536 (9)
abstracting: (Lac<=E4P)
states: 9,065,582,526 (9)
abstracting: (324<=Gluc)
states: 0
abstracting: (c1<=3100)
states: 14,353,505,166 (10)
abstracting: (_3PG<=3428)
states: 14,353,505,166 (10)
-> the formula is FALSE

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

MC time: 2m13.276sec

checking: AG [[~ [[[16<=GSSG & ~ [Pi<=a2]] & ~ [[c2<=168 & 2179<=start]]]] | [[[[~ [[[S7P<=a1 & 338<=FBP] | 3547<=GSSG]] & [[[[GSSG<=649 & S7P<=GSH] | ~ [Gluc<=828]] | [~ [Pi<=978] | [NADPplus<=3777 | NADplus<=2478]]] & [[[Ru5P<=Gluc & Lac<=b1] & a2<=2023] & [~ [b1<=FBP] & a1<=3341]]]] | ~ [[~ [3338<=Ru5P] & Pi<=b2]]] | [[~ [[[[3582<=R5P & _3PG<=Xu5P] | [3358<=_2PG | E4P<=1520]] & ~ [[FBP<=2552 | NADPplus<=Lac]]]] & Lac<=NADPplus] | ATP<=2511]] & NADH<=446]]]
normalized: ~ [E [true U ~ [[[NADH<=446 & [[ATP<=2511 | [Lac<=NADPplus & ~ [[~ [[FBP<=2552 | NADPplus<=Lac]] & [[3358<=_2PG | E4P<=1520] | [3582<=R5P & _3PG<=Xu5P]]]]]] | [~ [[Pi<=b2 & ~ [3338<=Ru5P]]] | [[[[a1<=3341 & ~ [b1<=FBP]] & [a2<=2023 & [Ru5P<=Gluc & Lac<=b1]]] & [[[NADPplus<=3777 | NADplus<=2478] | ~ [Pi<=978]] | [~ [Gluc<=828] | [GSSG<=649 & S7P<=GSH]]]] & ~ [[3547<=GSSG | [S7P<=a1 & 338<=FBP]]]]]]] | ~ [[~ [[c2<=168 & 2179<=start]] & [16<=GSSG & ~ [Pi<=a2]]]]]]]]

abstracting: (Pi<=a2)
states: 1,588,379,793 (9)
abstracting: (16<=GSSG)
states: 14,124,078,510 (10)
abstracting: (2179<=start)
states: 0
abstracting: (c2<=168)
states: 14,353,505,166 (10)
abstracting: (338<=FBP)
states: 0
abstracting: (S7P<=a1)
states: 14,353,505,166 (10)
abstracting: (3547<=GSSG)
states: 0
abstracting: (S7P<=GSH)
states: 14,353,441,134 (10)
abstracting: (GSSG<=649)
states: 9,320,457,900 (9)
abstracting: (Gluc<=828)
states: 14,353,505,166 (10)
abstracting: (Pi<=978)
states: 14,353,505,166 (10)
abstracting: (NADplus<=2478)
states: 14,353,505,166 (10)
abstracting: (NADPplus<=3777)
states: 14,353,505,166 (10)
abstracting: (Lac<=b1)
states: 14,045,043,012 (10)
abstracting: (Ru5P<=Gluc)
states: 13,456,160,718 (10)
abstracting: (a2<=2023)
states: 14,353,505,166 (10)
abstracting: (b1<=FBP)
states: 72,108,036 (7)
abstracting: (a1<=3341)
states: 14,353,505,166 (10)
abstracting: (3338<=Ru5P)
states: 0
abstracting: (Pi<=b2)
states: 1,588,379,793 (9)
abstracting: (_3PG<=Xu5P)
states: 8,476,700,232 (9)
abstracting: (3582<=R5P)
states: 0
abstracting: (E4P<=1520)
states: 14,353,505,166 (10)
abstracting: (3358<=_2PG)
states: 0
abstracting: (NADPplus<=Lac)
states: 12,042,030 (7)
abstracting: (FBP<=2552)
states: 14,353,505,166 (10)
abstracting: (Lac<=NADPplus)
states: 14,348,636,302 (10)
abstracting: (ATP<=2511)
states: 0
abstracting: (NADH<=446)
states: 14,353,505,166 (10)
-> the formula is TRUE

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

MC time: 0m20.810sec

checking: AG [[[~ [[3525<=ADP | [[1282<=E4P | ~ [[c1<=Xu5P & [start<=_2PG & 1363<=Pi]]]] | [S7P<=S7P | [a1<=673 | ~ [[GSH<=2764 & 117<=NADPH]]]]]]] | ~ [[G6P<=_1_3_BPG | GAP<=NADplus]]] | [[Xu5P<=Gluc | b1<=1096] & [[[[~ [843<=a1] | 3872<=GAP] | start<=905] & [[~ [[2504<=F6P & [2871<=NADPplus | G6P<=552]]] & [[[Gluc<=3853 & b1<=F6P] | _2PG<=3882] & [~ [3194<=PEP] | [NADPplus<=b2 | PEP<=856]]]] | [[[~ [3429<=Pi] | [S7P<=2768 & 192<=ADP]] | [~ [GSH<=F6P] & [NADPplus<=Lac | Lac<=929]]] | ~ [[102<=ATP & 3056<=F6P]]]]] | [~ [1558<=Xu5P] | ~ [[[~ [[c1<=1870 | NADH<=140]] & [~ [R5P<=383] | [Xu5P<=2658 | 3189<=FBP]]] & c1<=3576]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[c1<=3576 & [[[Xu5P<=2658 | 3189<=FBP] | ~ [R5P<=383]] & ~ [[c1<=1870 | NADH<=140]]]]] | ~ [1558<=Xu5P]] | [[[~ [[102<=ATP & 3056<=F6P]] | [[[NADPplus<=Lac | Lac<=929] & ~ [GSH<=F6P]] | [[S7P<=2768 & 192<=ADP] | ~ [3429<=Pi]]]] | [[[[NADPplus<=b2 | PEP<=856] | ~ [3194<=PEP]] & [_2PG<=3882 | [Gluc<=3853 & b1<=F6P]]] & ~ [[2504<=F6P & [2871<=NADPplus | G6P<=552]]]]] & [start<=905 | [3872<=GAP | ~ [843<=a1]]]]] & [Xu5P<=Gluc | b1<=1096]] | [~ [[G6P<=_1_3_BPG | GAP<=NADplus]] | ~ [[3525<=ADP | [[S7P<=S7P | [a1<=673 | ~ [[GSH<=2764 & 117<=NADPH]]]] | [1282<=E4P | ~ [[c1<=Xu5P & [start<=_2PG & 1363<=Pi]]]]]]]]]]]]

abstracting: (1363<=Pi)
states: 0
abstracting: (start<=_2PG)
states: 14,351,502,165 (10)
abstracting: (c1<=Xu5P)
states: 288,432,144 (8)
abstracting: (1282<=E4P)
states: 0
abstracting: (117<=NADPH)
states: 13,514,244,744 (10)
abstracting: (GSH<=2764)
states: 14,353,505,166 (10)
abstracting: (a1<=673)
states: 14,353,505,166 (10)
abstracting: (S7P<=S7P)
states: 14,353,505,166 (10)
abstracting: (3525<=ADP)
states: 0
abstracting: (GAP<=NADplus)
states: 14,353,505,166 (10)
abstracting: (G6P<=_1_3_BPG)
states: 13,690,511,835 (10)
abstracting: (b1<=1096)
states: 14,353,505,166 (10)
abstracting: (Xu5P<=Gluc)
states: 13,496,220,738 (10)
abstracting: (843<=a1)
states: 0
abstracting: (3872<=GAP)
states: 0
abstracting: (start<=905)
states: 14,353,505,166 (10)
abstracting: (G6P<=552)
states: 14,353,505,166 (10)
abstracting: (2871<=NADPplus)
states: 0
abstracting: (2504<=F6P)
states: 0
abstracting: (b1<=F6P)
states: 72,108,036 (7)
abstracting: (Gluc<=3853)
states: 14,353,505,166 (10)
abstracting: (_2PG<=3882)
states: 14,353,505,166 (10)
abstracting: (3194<=PEP)
states: 0
abstracting: (PEP<=856)
states: 14,353,505,166 (10)
abstracting: (NADPplus<=b2)
states: 8,150,142 (6)
abstracting: (3429<=Pi)
states: 0
abstracting: (192<=ADP)
states: 0
abstracting: (S7P<=2768)
states: 14,353,505,166 (10)
abstracting: (GSH<=F6P)
states: 14,619,306 (7)
abstracting: (Lac<=929)
states: 14,353,505,166 (10)
abstracting: (NADPplus<=Lac)
states: 12,042,030 (7)
abstracting: (3056<=F6P)
states: 0
abstracting: (102<=ATP)
states: 14,353,505,166 (10)
abstracting: (1558<=Xu5P)
states: 0
abstracting: (NADH<=140)
states: 14,353,505,166 (10)
abstracting: (c1<=1870)
states: 14,353,505,166 (10)
abstracting: (R5P<=383)
states: 14,353,505,166 (10)
abstracting: (3189<=FBP)
states: 0
abstracting: (Xu5P<=2658)
states: 14,353,505,166 (10)
abstracting: (c1<=3576)
states: 14,353,505,166 (10)
-> the formula is TRUE

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

MC time: 1m27.713sec

checking: EF [[~ [[[~ [[[3452<=S7P | E4P<=G6P] & [GSSG<=_2PG & FBP<=3994]]] | b1<=2412] | [_3PG<=2340 & [[[~ [c2<=FBP] & ~ [[2389<=Ru5P | ATP<=Gluc]]] | 3360<=E4P] & [[2579<=Ru5P & GSSG<=b2] | a1<=R5P]]]]] & [[~ [[~ [[~ [DHAP<=158] & [~ [b1<=3087] | E4P<=3113]]] & [G6P<=2224 | [[[NADPplus<=NADplus & GAP<=_1_3_BPG] | NADH<=2281] & NADH<=2001]]]] | [~ [[[[[1436<=a1 & Ru5P<=FBP] | [c1<=2433 & G6P<=2606]] & [[_2PG<=Ru5P & S7P<=ATP] & [S7P<=2823 | DHAP<=42]]] & [~ [[F6P<=_3PG & 2897<=c1]] & [~ [c1<=377] & ~ [_2PG<=2771]]]]] & [[ADP<=a1 | [[1769<=R5P | GSH<=_2PG] & [~ [R5P<=_2PG] & ~ [Pi<=G6P]]]] | 1237<=c1]]] & [~ [[[3033<=b2 | ~ [NADPplus<=Gluc]] & [251<=Pyr & [[[3438<=Lac & a1<=b2] & [Ru5P<=b2 & 3799<=c2]] | ~ [Xu5P<=NADplus]]]]] | [~ [DHAP<=S7P] | c1<=DHAP]]]]]
normalized: E [true U [[[[c1<=DHAP | ~ [DHAP<=S7P]] | ~ [[[251<=Pyr & [~ [Xu5P<=NADplus] | [[Ru5P<=b2 & 3799<=c2] & [3438<=Lac & a1<=b2]]]] & [3033<=b2 | ~ [NADPplus<=Gluc]]]]] & [[[1237<=c1 | [ADP<=a1 | [[~ [Pi<=G6P] & ~ [R5P<=_2PG]] & [1769<=R5P | GSH<=_2PG]]]] & ~ [[[[~ [_2PG<=2771] & ~ [c1<=377]] & ~ [[F6P<=_3PG & 2897<=c1]]] & [[[S7P<=2823 | DHAP<=42] & [_2PG<=Ru5P & S7P<=ATP]] & [[c1<=2433 & G6P<=2606] | [1436<=a1 & Ru5P<=FBP]]]]]] | ~ [[[G6P<=2224 | [NADH<=2001 & [NADH<=2281 | [NADPplus<=NADplus & GAP<=_1_3_BPG]]]] & ~ [[[E4P<=3113 | ~ [b1<=3087]] & ~ [DHAP<=158]]]]]]] & ~ [[[_3PG<=2340 & [[a1<=R5P | [2579<=Ru5P & GSSG<=b2]] & [3360<=E4P | [~ [[2389<=Ru5P | ATP<=Gluc]] & ~ [c2<=FBP]]]]] | [b1<=2412 | ~ [[[GSSG<=_2PG & FBP<=3994] & [3452<=S7P | E4P<=G6P]]]]]]]]

abstracting: (E4P<=G6P)
states: 11,919,858,951 (10)
abstracting: (3452<=S7P)
states: 0
abstracting: (FBP<=3994)
states: 14,353,505,166 (10)
abstracting: (GSSG<=_2PG)
states: 24,072,030 (7)
abstracting: (b1<=2412)
states: 14,353,505,166 (10)
abstracting: (c2<=FBP)
states: 1,862,790,930 (9)
abstracting: (ATP<=Gluc)
states: 0
abstracting: (2389<=Ru5P)
states: 0
abstracting: (3360<=E4P)
states: 0
abstracting: (GSSG<=b2)
states: 16,292,142 (7)
abstracting: (2579<=Ru5P)
states: 0
abstracting: (a1<=R5P)
states: 90,135,045 (7)
abstracting: (_3PG<=2340)
states: 14,353,505,166 (10)
abstracting: (DHAP<=158)
states: 14,353,505,166 (10)
abstracting: (b1<=3087)
states: 14,353,505,166 (10)
abstracting: (E4P<=3113)
states: 14,353,505,166 (10)
abstracting: (GAP<=_1_3_BPG)
states: 9,922,866,954 (9)
abstracting: (NADPplus<=NADplus)
states: 14,329,160,846 (10)
abstracting: (NADH<=2281)
states: 14,353,505,166 (10)
abstracting: (NADH<=2001)
states: 14,353,505,166 (10)
abstracting: (G6P<=2224)
states: 14,353,505,166 (10)
abstracting: (Ru5P<=FBP)
states: 13,518,253,749 (10)
abstracting: (1436<=a1)
states: 0
abstracting: (G6P<=2606)
states: 14,353,505,166 (10)
abstracting: (c1<=2433)
states: 14,353,505,166 (10)
abstracting: (S7P<=ATP)
states: 14,353,505,166 (10)
abstracting: (_2PG<=Ru5P)
states: 8,476,700,232 (9)
abstracting: (DHAP<=42)
states: 14,353,505,166 (10)
abstracting: (S7P<=2823)
states: 14,353,505,166 (10)
abstracting: (2897<=c1)
states: 0
abstracting: (F6P<=_3PG)
states: 12,693,017,337 (10)
abstracting: (c1<=377)
states: 14,353,505,166 (10)
abstracting: (_2PG<=2771)
states: 14,353,505,166 (10)
abstracting: (GSH<=_2PG)
states: 17,052,522 (7)
abstracting: (1769<=R5P)
states: 0
abstracting: (R5P<=_2PG)
states: 14,253,355,116 (10)
abstracting: (Pi<=G6P)
states: 1,588,379,793 (9)
abstracting: (ADP<=a1)
states: 174,261,087 (8)
abstracting: (1237<=c1)
states: 0
abstracting: (NADPplus<=Gluc)
states: 7,671,664 (6)
abstracting: (3033<=b2)
states: 0
abstracting: (a1<=b2)
states: 1,804,703,901 (9)
abstracting: (3438<=Lac)
states: 0
abstracting: (3799<=c2)
states: 0
abstracting: (Ru5P<=b2)
states: 13,476,190,728 (10)
abstracting: (Xu5P<=NADplus)
states: 14,353,505,166 (10)
abstracting: (251<=Pyr)
states: 0
abstracting: (DHAP<=S7P)
states: 8,184,262,086 (9)
abstracting: (c1<=DHAP)
states: 1,402,100,700 (9)
-> the formula is FALSE

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

MC time: 5m47.274sec

totally nodes used: 90398802 (9.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 734417454 237568978 971986432
used/not used/entry size/cache size: 0 67108864 16 1024MB
basic ops cache: hits/miss/sum: 93151888 126664562 219816450
used/not used/entry size/cache size: 16707586 69630 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: 1203574 192064 1395638
used/not used/entry size/cache size: 136555 8252053 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 66761928
1 336803
2 3018
3 19
4 9
5 10
6 8
7 9
8 4
9 9
>= 10 7047

Total processing time: 14m51.664sec


BK_STOP 1678641873622

--------------------
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

2060
iterations count:155740 (7079), effective:36555 (1661)

initing FirstDep: 0m 0.000sec

3142 3879
iterations count:230442 (10474), effective:57400 (2609)
3512 3858
iterations count:281923 (12814), effective:70707 (3213)

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

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