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.r161-tall-167838845700841.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 marcie
Input is GPPP-PT-C0100N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845700841
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 12K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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-C0100N0000000010-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679884280068

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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000010
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: GPPP_PT_C0100N0000000010
(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.805sec


RS generation: 0m 0.123sec


-> reachability set: #nodes 19855 (2.0e+04) #states 14,184,612,091 (10)



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

checking: EF [40<=_3PG]
normalized: E [true U 40<=_3PG]

abstracting: (40<=_3PG)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [AF [a2<=551]]
normalized: ~ [E [true U EG [~ [a2<=551]]]]

abstracting: (a2<=551)
states: 14,184,612,091 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.174sec

checking: EF [~ [[~ [110<=Xu5P] & ~ [[[F6P<=R5P & ~ [EG [NADplus<=305]]] | ~ [E [DHAP<=594 U 565<=_1_3_BPG]]]]]]]
normalized: E [true U ~ [[~ [[~ [E [DHAP<=594 U 565<=_1_3_BPG]] | [F6P<=R5P & ~ [EG [NADplus<=305]]]]] & ~ [110<=Xu5P]]]]

abstracting: (110<=Xu5P)
states: 0
abstracting: (NADplus<=305)
states: 14,184,612,091 (10)

EG iterations: 0
abstracting: (F6P<=R5P)
states: 11,631,716,841 (10)
abstracting: (565<=_1_3_BPG)
states: 0
abstracting: (DHAP<=594)
states: 14,184,612,091 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.154sec

checking: E [AF [EG [PEP<=338]] U [~ [EF [_2PG<=a1]] & [b2<=NADH & ~ [EX [145<=_2PG]]]]]
normalized: E [~ [EG [~ [EG [PEP<=338]]]] U [[b2<=NADH & ~ [EX [145<=_2PG]]] & ~ [E [true U _2PG<=a1]]]]

abstracting: (_2PG<=a1)
states: 14,089,499,985 (10)
abstracting: (145<=_2PG)
states: 0
.abstracting: (b2<=NADH)
states: 42
abstracting: (PEP<=338)
states: 14,184,612,091 (10)

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.335sec

checking: E [~ [EF [[ATP<=GSSG & AX [[381<=F6P | 432<=Xu5P]]]]] U ~ [b1<=R5P]]
normalized: E [~ [E [true U [ATP<=GSSG & ~ [EX [~ [[381<=F6P | 432<=Xu5P]]]]]]] U ~ [b1<=R5P]]

abstracting: (b1<=R5P)
states: 1,342 (3)
abstracting: (432<=Xu5P)
states: 0
abstracting: (381<=F6P)
states: 0
.abstracting: (ATP<=GSSG)
states: 5,371,021,962 (9)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.578sec

checking: AG [[[~ [EX [53<=NADPplus]] | EX [A [[NADplus<=265 | c2<=692] U AG [R5P<=223]]]] & AX [[[~ [Pi<=571] | 283<=Lac] & Xu5P<=457]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[Xu5P<=457 & [283<=Lac | ~ [Pi<=571]]]]]] & [EX [[~ [EG [E [true U ~ [R5P<=223]]]] & ~ [E [E [true U ~ [R5P<=223]] U [~ [[NADplus<=265 | c2<=692]] & E [true U ~ [R5P<=223]]]]]]] | ~ [EX [53<=NADPplus]]]]]]]

abstracting: (53<=NADPplus)
states: 0
.abstracting: (R5P<=223)
states: 14,184,612,091 (10)
abstracting: (c2<=692)
states: 26,713,066 (7)
abstracting: (NADplus<=265)
states: 14,184,612,091 (10)
abstracting: (R5P<=223)
states: 14,184,612,091 (10)
abstracting: (R5P<=223)
states: 14,184,612,091 (10)
.
EG iterations: 1
.abstracting: (Pi<=571)
states: 1
abstracting: (283<=Lac)
states: 0
abstracting: (Xu5P<=457)
states: 14,184,612,091 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AF [[[[NADPplus<=35 & EX [~ [Gluc<=446]]] | 497<=_1_3_BPG] | AG [[EF [S7P<=Pyr] | Ru5P<=_3PG]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[Ru5P<=_3PG | E [true U S7P<=Pyr]]]]] | [497<=_1_3_BPG | [NADPplus<=35 & EX [~ [Gluc<=446]]]]]]]]

abstracting: (Gluc<=446)
states: 14,184,612,091 (10)
.abstracting: (NADPplus<=35)
states: 14,184,612,091 (10)
abstracting: (497<=_1_3_BPG)
states: 0
abstracting: (S7P<=Pyr)
states: 14,168,881,627 (10)
abstracting: (Ru5P<=_3PG)
states: 1,469,038,568 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.274sec

checking: ~ [AG [AX [[[[[282<=a2 & GAP<=GSSG] | 592<=GAP] | AG [DHAP<=NADPH]] | ~ [A [370<=NADPplus U Pi<=697]]]]]]
normalized: E [true U EX [~ [[~ [[~ [EG [~ [Pi<=697]]] & ~ [E [~ [Pi<=697] U [~ [370<=NADPplus] & ~ [Pi<=697]]]]]] | [~ [E [true U ~ [DHAP<=NADPH]]] | [592<=GAP | [282<=a2 & GAP<=GSSG]]]]]]]

abstracting: (GAP<=GSSG)
states: 13,352,480,066 (10)
abstracting: (282<=a2)
states: 0
abstracting: (592<=GAP)
states: 0
abstracting: (DHAP<=NADPH)
states: 13,699,402,791 (10)
abstracting: (Pi<=697)
states: 12,603,053,755 (10)
abstracting: (370<=NADPplus)
states: 0
abstracting: (Pi<=697)
states: 12,603,053,755 (10)
abstracting: (Pi<=697)
states: 12,603,053,755 (10)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.046sec

checking: E [[Ru5P<=165 | [AF [[EX [a1<=b1] | [~ [c1<=330] | [435<=Xu5P & GSSG<=519]]]] | AX [GSSG<=NADPplus]]] U AG [~ [AG [GSSG<=176]]]]
normalized: E [[Ru5P<=165 | [~ [EX [~ [GSSG<=NADPplus]]] | ~ [EG [~ [[[[435<=Xu5P & GSSG<=519] | ~ [c1<=330]] | EX [a1<=b1]]]]]]] U ~ [E [true U ~ [E [true U ~ [GSSG<=176]]]]]]

abstracting: (GSSG<=176)
states: 14,184,612,091 (10)
abstracting: (a1<=b1)
states: 14,184,015,816 (10)
.abstracting: (c1<=330)
states: 14,157,899,025 (10)
abstracting: (GSSG<=519)
states: 14,184,612,091 (10)
abstracting: (435<=Xu5P)
states: 0
.
EG iterations: 1
abstracting: (GSSG<=NADPplus)
states: 10,950,082,886 (10)
.abstracting: (Ru5P<=165)
states: 14,184,612,091 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: AG [EF [[[~ [AX [PEP<=437]] & [~ [EX [670<=DHAP]] | AF [Pi<=137]]] | [[~ [DHAP<=NADPplus] & [~ [179<=_2PG] | A [562<=G6P U 170<=Pi]]] & 686<=Ru5P]]]]
normalized: ~ [E [true U ~ [E [true U [[686<=Ru5P & [[[~ [EG [~ [170<=Pi]]] & ~ [E [~ [170<=Pi] U [~ [562<=G6P] & ~ [170<=Pi]]]]] | ~ [179<=_2PG]] & ~ [DHAP<=NADPplus]]] | [[~ [EG [~ [Pi<=137]]] | ~ [EX [670<=DHAP]]] & EX [~ [PEP<=437]]]]]]]]

abstracting: (PEP<=437)
states: 14,184,612,091 (10)
.abstracting: (670<=DHAP)
states: 0
.abstracting: (Pi<=137)
states: 1
.
EG iterations: 1
abstracting: (DHAP<=NADPplus)
states: 13,776,284,256 (10)
abstracting: (179<=_2PG)
states: 0
abstracting: (170<=Pi)
states: 14,184,612,090 (10)
abstracting: (562<=G6P)
states: 0
abstracting: (170<=Pi)
states: 14,184,612,090 (10)
abstracting: (170<=Pi)
states: 14,184,612,090 (10)
..
EG iterations: 2
abstracting: (686<=Ru5P)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: A [693<=_3PG U [AG [[EF [[GAP<=76 & NADH<=56]] | AG [[a1<=c1 | 39<=Pyr]]]] | [EG [~ [[EF [GAP<=Ru5P] & ~ [Pi<=GSSG]]]] | EF [EX [[216<=GAP & Pi<=FBP]]]]]]
normalized: [~ [EG [~ [[[E [true U EX [[216<=GAP & Pi<=FBP]]] | EG [~ [[~ [Pi<=GSSG] & E [true U GAP<=Ru5P]]]]] | ~ [E [true U ~ [[~ [E [true U ~ [[a1<=c1 | 39<=Pyr]]]] | E [true U [GAP<=76 & NADH<=56]]]]]]]]]] & ~ [E [~ [[[E [true U EX [[216<=GAP & Pi<=FBP]]] | EG [~ [[~ [Pi<=GSSG] & E [true U GAP<=Ru5P]]]]] | ~ [E [true U ~ [[~ [E [true U ~ [[a1<=c1 | 39<=Pyr]]]] | E [true U [GAP<=76 & NADH<=56]]]]]]]] U [~ [693<=_3PG] & ~ [[[E [true U EX [[216<=GAP & Pi<=FBP]]] | EG [~ [[~ [Pi<=GSSG] & E [true U GAP<=Ru5P]]]]] | ~ [E [true U ~ [[~ [E [true U ~ [[a1<=c1 | 39<=Pyr]]]] | E [true U [GAP<=76 & NADH<=56]]]]]]]]]]]]

abstracting: (NADH<=56)
states: 14,184,612,091 (10)
abstracting: (GAP<=76)
states: 14,184,612,091 (10)
abstracting: (39<=Pyr)
states: 0
abstracting: (a1<=c1)
states: 3,068,525,580 (9)
abstracting: (GAP<=Ru5P)
states: 13,604,300,822 (10)
abstracting: (Pi<=GSSG)
states: 1
..
EG iterations: 2
abstracting: (Pi<=FBP)
states: 1
abstracting: (216<=GAP)
states: 0
.abstracting: (693<=_3PG)
states: 0
abstracting: (NADH<=56)
states: 14,184,612,091 (10)
abstracting: (GAP<=76)
states: 14,184,612,091 (10)
abstracting: (39<=Pyr)
states: 0
abstracting: (a1<=c1)
states: 3,068,525,580 (9)
abstracting: (GAP<=Ru5P)
states: 13,604,300,822 (10)
abstracting: (Pi<=GSSG)
states: 1
..
EG iterations: 2
abstracting: (Pi<=FBP)
states: 1
abstracting: (216<=GAP)
states: 0
.abstracting: (NADH<=56)
states: 14,184,612,091 (10)
abstracting: (GAP<=76)
states: 14,184,612,091 (10)
abstracting: (39<=Pyr)
states: 0
abstracting: (a1<=c1)
states: 3,068,525,580 (9)
abstracting: (GAP<=Ru5P)
states: 13,604,300,822 (10)
abstracting: (Pi<=GSSG)
states: 1
..
EG iterations: 2
abstracting: (Pi<=FBP)
states: 1
abstracting: (216<=GAP)
states: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.232sec

checking: EX [AX [[[~ [[650<=_2PG & [b1<=260 & 171<=c1]]] & E [GSH<=FBP U AG [c1<=a1]]] | E [[AX [Xu5P<=GSSG] & EX [c2<=b1]] U [EX [346<=R5P] & A [_3PG<=680 U c2<=96]]]]]]
normalized: EX [~ [EX [~ [[E [[EX [c2<=b1] & ~ [EX [~ [Xu5P<=GSSG]]]] U [[~ [EG [~ [c2<=96]]] & ~ [E [~ [c2<=96] U [~ [_3PG<=680] & ~ [c2<=96]]]]] & EX [346<=R5P]]] | [E [GSH<=FBP U ~ [E [true U ~ [c1<=a1]]]] & ~ [[650<=_2PG & [b1<=260 & 171<=c1]]]]]]]]]

abstracting: (171<=c1)
states: 26,713,066 (7)
abstracting: (b1<=260)
states: 14,184,612,049 (10)
abstracting: (650<=_2PG)
states: 0
abstracting: (c1<=a1)
states: 11,899,910,448 (10)
abstracting: (GSH<=FBP)
states: 1,362,024,889 (9)
abstracting: (346<=R5P)
states: 0
.abstracting: (c2<=96)
states: 26,713,066 (7)
abstracting: (_3PG<=680)
states: 14,184,612,091 (10)
abstracting: (c2<=96)
states: 26,713,066 (7)
abstracting: (c2<=96)
states: 26,713,066 (7)
.
EG iterations: 1
abstracting: (Xu5P<=GSSG)
states: 4,848,291,179 (9)
.abstracting: (c2<=b1)
states: 26,713,066 (7)
...-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.150sec

checking: AX [[EF [[[[~ [263<=E4P] & [332<=ADP | 317<=_1_3_BPG]] | [~ [_2PG<=b2] | [Lac<=203 | E4P<=138]]] & EX [~ [S7P<=b2]]]] | AG [[[AF [240<=Pyr] & [~ [673<=_2PG] & [G6P<=Pyr & Pi<=220]]] & EX [AF [412<=F6P]]]]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [[EX [~ [EG [~ [412<=F6P]]]] & [[[G6P<=Pyr & Pi<=220] & ~ [673<=_2PG]] & ~ [EG [~ [240<=Pyr]]]]]]]] | E [true U [EX [~ [S7P<=b2]] & [[[Lac<=203 | E4P<=138] | ~ [_2PG<=b2]] | [[332<=ADP | 317<=_1_3_BPG] & ~ [263<=E4P]]]]]]]]]

abstracting: (263<=E4P)
states: 0
abstracting: (317<=_1_3_BPG)
states: 0
abstracting: (332<=ADP)
states: 14,184,612,090 (10)
abstracting: (_2PG<=b2)
states: 14,184,612,091 (10)
abstracting: (E4P<=138)
states: 14,184,612,091 (10)
abstracting: (Lac<=203)
states: 14,184,612,091 (10)
abstracting: (S7P<=b2)
states: 14,184,612,091 (10)
.abstracting: (240<=Pyr)
states: 0

EG iterations: 0
abstracting: (673<=_2PG)
states: 0
abstracting: (Pi<=220)
states: 1
abstracting: (G6P<=Pyr)
states: 1,853,403,607 (9)
abstracting: (412<=F6P)
states: 0

EG iterations: 0
..-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.285sec

checking: ~ [AG [[EF [[[AG [524<=NADH] | 427<=ADP] | [A [NADH<=328 U 4<=Lac] | [_3PG<=548 & Gluc<=Ru5P]]]] | [[~ [[[GSH<=194 | _2PG<=ADP] & [_3PG<=GSSG | Xu5P<=R5P]]] & ~ [A [PEP<=96 U NADPH<=_1_3_BPG]]] | EX [[~ [NADplus<=411] & [NADPH<=654 | Xu5P<=NADPH]]]]]]]
normalized: E [true U ~ [[[EX [[[NADPH<=654 | Xu5P<=NADPH] & ~ [NADplus<=411]]] | [~ [[~ [EG [~ [NADPH<=_1_3_BPG]]] & ~ [E [~ [NADPH<=_1_3_BPG] U [~ [PEP<=96] & ~ [NADPH<=_1_3_BPG]]]]]] & ~ [[[_3PG<=GSSG | Xu5P<=R5P] & [GSH<=194 | _2PG<=ADP]]]]] | E [true U [[[_3PG<=548 & Gluc<=Ru5P] | [~ [EG [~ [4<=Lac]]] & ~ [E [~ [4<=Lac] U [~ [NADH<=328] & ~ [4<=Lac]]]]]] | [427<=ADP | ~ [E [true U ~ [524<=NADH]]]]]]]]]

abstracting: (524<=NADH)
states: 0
abstracting: (427<=ADP)
states: 14,184,612,090 (10)
abstracting: (4<=Lac)
states: 472,740,594 (8)
abstracting: (NADH<=328)
states: 14,184,612,091 (10)
abstracting: (4<=Lac)
states: 472,740,594 (8)
abstracting: (4<=Lac)
states: 472,740,594 (8)
......................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 374
abstracting: (Gluc<=Ru5P)
states: 1
abstracting: (_3PG<=548)
states: 14,184,612,091 (10)
abstracting: (_2PG<=ADP)
states: 14,184,612,091 (10)
abstracting: (GSH<=194)
states: 14,184,612,091 (10)
abstracting: (Xu5P<=R5P)
states: 843,203,701 (8)
abstracting: (_3PG<=GSSG)
states: 13,243,530,430 (10)
abstracting: (NADPH<=_1_3_BPG)
states: 1,200,924,731 (9)
abstracting: (PEP<=96)
states: 14,184,612,091 (10)
abstracting: (NADPH<=_1_3_BPG)
states: 1,200,924,731 (9)
abstracting: (NADPH<=_1_3_BPG)
states: 1,200,924,731 (9)
......................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 374
abstracting: (NADplus<=411)
states: 14,184,612,091 (10)
abstracting: (Xu5P<=NADPH)
states: 7,548,861,706 (9)
abstracting: (NADPH<=654)
states: 14,184,612,091 (10)
.-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.761sec

checking: E [EX [FBP<=Xu5P] U [[~ [[A [[GSH<=Lac & start<=E4P] U [NADPH<=410 | G6P<=67]] & [[[DHAP<=S7P | E4P<=400] & ~ [E4P<=350]] | ~ [AX [NADplus<=88]]]]] & A [[b1<=c1 | [[257<=GSH | c1<=R5P] | [345<=PEP | 291<=DHAP]]] U ~ [a2<=Ru5P]]] & 278<=b1]]
normalized: E [EX [FBP<=Xu5P] U [278<=b1 & [[~ [EG [a2<=Ru5P]] & ~ [E [a2<=Ru5P U [a2<=Ru5P & ~ [[b1<=c1 | [[345<=PEP | 291<=DHAP] | [257<=GSH | c1<=R5P]]]]]]]] & ~ [[[EX [~ [NADplus<=88]] | [~ [E4P<=350] & [DHAP<=S7P | E4P<=400]]] & [~ [EG [~ [[NADPH<=410 | G6P<=67]]]] & ~ [E [~ [[NADPH<=410 | G6P<=67]] U [~ [[GSH<=Lac & start<=E4P]] & ~ [[NADPH<=410 | G6P<=67]]]]]]]]]]]

abstracting: (G6P<=67)
states: 14,184,612,091 (10)
abstracting: (NADPH<=410)
states: 14,184,612,091 (10)
abstracting: (start<=E4P)
states: 14,184,612,090 (10)
abstracting: (GSH<=Lac)
states: 1,682,510,011 (9)
abstracting: (G6P<=67)
states: 14,184,612,091 (10)
abstracting: (NADPH<=410)
states: 14,184,612,091 (10)
abstracting: (G6P<=67)
states: 14,184,612,091 (10)
abstracting: (NADPH<=410)
states: 14,184,612,091 (10)
.
EG iterations: 1
abstracting: (E4P<=400)
states: 14,184,612,091 (10)
abstracting: (DHAP<=S7P)
states: 8,162,828,509 (9)
abstracting: (E4P<=350)
states: 14,184,612,091 (10)
abstracting: (NADplus<=88)
states: 14,184,612,091 (10)
.abstracting: (c1<=R5P)
states: 90,721,104 (7)
abstracting: (257<=GSH)
states: 0
abstracting: (291<=DHAP)
states: 0
abstracting: (345<=PEP)
states: 0
abstracting: (b1<=c1)
states: 110,388,528 (8)
abstracting: (a2<=Ru5P)
states: 596,317 (5)
abstracting: (a2<=Ru5P)
states: 596,317 (5)
abstracting: (a2<=Ru5P)
states: 596,317 (5)
......................................................................................................................................................................................................
EG iterations: 198
abstracting: (278<=b1)
states: 42
abstracting: (FBP<=Xu5P)
states: 14,022,012,372 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.599sec

checking: [E [~ [[ATP<=692 & [[E [33<=NADH U ADP<=_1_3_BPG] & ADP<=397] | ~ [EG [S7P<=545]]]]] U EG [[AF [~ [658<=Pyr]] & NADH<=506]]] & ~ [EF [[[[[[FBP<=c1 & 398<=Xu5P] & AX [Pi<=497]] & ~ [FBP<=592]] & [[258<=start & [start<=NADPplus & a2<=GSH]] | GAP<=58]] & [~ [[c1<=457 | Pi<=c1]] | EF [700<=a1]]]]]]
normalized: [~ [E [true U [[E [true U 700<=a1] | ~ [[c1<=457 | Pi<=c1]]] & [[GAP<=58 | [258<=start & [start<=NADPplus & a2<=GSH]]] & [~ [FBP<=592] & [~ [EX [~ [Pi<=497]]] & [FBP<=c1 & 398<=Xu5P]]]]]]] & E [~ [[ATP<=692 & [~ [EG [S7P<=545]] | [ADP<=397 & E [33<=NADH U ADP<=_1_3_BPG]]]]] U EG [[NADH<=506 & ~ [EG [658<=Pyr]]]]]]

abstracting: (658<=Pyr)
states: 0
.
EG iterations: 1
abstracting: (NADH<=506)
states: 14,184,612,091 (10)

EG iterations: 0
abstracting: (ADP<=_1_3_BPG)
states: 1
abstracting: (33<=NADH)
states: 0
abstracting: (ADP<=397)
states: 1
abstracting: (S7P<=545)
states: 14,184,612,091 (10)

EG iterations: 0
abstracting: (ATP<=692)
states: 14,184,612,091 (10)
abstracting: (398<=Xu5P)
states: 0
abstracting: (FBP<=c1)
states: 14,092,407,457 (10)
abstracting: (Pi<=497)
states: 1
.abstracting: (FBP<=592)
states: 14,184,612,091 (10)
abstracting: (a2<=GSH)
states: 596,317 (5)
abstracting: (start<=NADPplus)
states: 14,184,612,091 (10)
abstracting: (258<=start)
states: 0
abstracting: (GAP<=58)
states: 14,184,612,091 (10)
abstracting: (Pi<=c1)
states: 26,713,066 (7)
abstracting: (c1<=457)
states: 14,157,899,025 (10)
abstracting: (700<=a1)
states: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.318sec

totally nodes used: 33893236 (3.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 78178165 53827400 132005565
used/not used/entry size/cache size: 47844350 19264514 16 1024MB
basic ops cache: hits/miss/sum: 23928315 17010687 40939002
used/not used/entry size/cache size: 13650668 3126548 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: 715164 466831 1181995
used/not used/entry size/cache size: 455122 7933486 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 42281613
1 19017945
2 4686289
3 905066
4 161712
5 28774
6 8030
7 3309
8 2272
9 1671
>= 10 12183

Total processing time: 1m34.386sec


BK_STOP 1679884374518

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

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:1727 (78), effective:414 (18)

initing FirstDep: 0m 0.000sec


iterations count:22 (1), effective:0 (0)

iterations count:32 (1), effective:5 (0)

iterations count:1738 (79), effective:435 (19)

iterations count:22 (1), effective:0 (0)

iterations count:39 (1), effective:4 (0)

iterations count:479 (21), effective:118 (5)

iterations count:22 (1), effective:0 (0)

iterations count:243 (11), effective:40 (1)

iterations count:22 (1), effective:0 (0)

iterations count:22 (1), effective:0 (0)

iterations count:22 (1), effective:0 (0)

iterations count:22 (1), effective:0 (0)

iterations count:196 (8), effective:27 (1)

iterations count:91 (4), effective:10 (0)

iterations count:22 (1), effective:0 (0)

iterations count:196 (8), effective:27 (1)

iterations count:91 (4), effective:10 (0)

iterations count:22 (1), effective:0 (0)

iterations count:196 (8), effective:27 (1)

iterations count:91 (4), effective:10 (0)

iterations count:303 (13), effective:59 (2)

iterations count:560 (25), effective:108 (4)

iterations count:22 (1), effective:0 (0)

iterations count:22 (1), effective:0 (0)

iterations count:22 (1), effective:0 (0)

iterations count:226 (10), effective:41 (1)

iterations count:22 (1), effective:0 (0)

iterations count:22 (1), effective:0 (0)

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-C0100N0000000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is GPPP-PT-C0100N0000000010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r161-tall-167838845700841"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;