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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:35 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:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678638825937

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-C0001N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:33:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:33:47] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 16:33:47] [INFO ] Transformed 33 places.
[2023-03-12 16:33:47] [INFO ] Transformed 22 transitions.
[2023-03-12 16:33:47] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) 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 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 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 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 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 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 590991 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{5=1}
Probabilistic random walk after 590991 steps, saw 102005 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :1
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 15 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:33:50] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-12 16:33:51] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 16:33:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:33:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-12 16:33:51] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :1
[2023-03-12 16:33:51] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 16:33:51] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :1
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 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 3 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 18 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 16:33:51] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 26/33 places, 15/22 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished Best-First random walk after 636 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=636 )
FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 4156 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_C0001N0000000010
(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.711sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)



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

checking: EF [38<=Pyr]
normalized: E [true U 38<=Pyr]

abstracting: (38<=Pyr)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [28<=Xu5P]
normalized: E [true U 28<=Xu5P]

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

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

MC time: 0m 0.000sec

checking: AG [b2<=27]
normalized: ~ [E [true U ~ [b2<=27]]]

abstracting: (b2<=27)
states: 1,655,346 (6)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [5<=E4P]
normalized: E [true U 5<=E4P]

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

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

MC time: 0m 0.000sec

checking: AG [a1<=14]
normalized: ~ [E [true U ~ [a1<=14]]]

abstracting: (a1<=14)
states: 1,655,346 (6)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[~ [1<=GSSG] | ~ [26<=Pyr]]]
normalized: ~ [E [true U ~ [[~ [26<=Pyr] | ~ [1<=GSSG]]]]]

abstracting: (1<=GSSG)
states: 1,504,860 (6)
abstracting: (26<=Pyr)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [NADPplus<=Ru5P]
normalized: E [true U NADPplus<=Ru5P]

abstracting: (NADPplus<=Ru5P)
states: 84,194 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [~ [[~ [GSSG<=G6P] | ~ [[R5P<=37 | ~ [Xu5P<=NADplus]]]]]]
normalized: E [true U ~ [[~ [[~ [Xu5P<=NADplus] | R5P<=37]] | ~ [GSSG<=G6P]]]]

abstracting: (GSSG<=G6P)
states: 160,944 (5)
abstracting: (R5P<=37)
states: 1,655,346 (6)
abstracting: (Xu5P<=NADplus)
states: 1,655,346 (6)
-> the formula is TRUE

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

MC time: 0m 0.021sec

checking: AG [[[b2<=4 & [[~ [[~ [[5<=_2PG & FBP<=E4P]] & [~ [c1<=F6P] | ~ [[NADPH<=29 & Pyr<=DHAP]]]]] & ~ [24<=Pyr]] | G6P<=24]] | ~ [[[b1<=FBP | 20<=Pyr] & 18<=b1]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[~ [c1<=F6P] | ~ [[NADPH<=29 & Pyr<=DHAP]]] & ~ [[5<=_2PG & FBP<=E4P]]]] & ~ [24<=Pyr]] | G6P<=24] & b2<=4] | ~ [[[b1<=FBP | 20<=Pyr] & 18<=b1]]]]]]

abstracting: (18<=b1)
states: 0
abstracting: (20<=Pyr)
states: 0
abstracting: (b1<=FBP)
states: 8,316 (3)
abstracting: (b2<=4)
states: 1,655,346 (6)
abstracting: (G6P<=24)
states: 1,655,346 (6)
abstracting: (24<=Pyr)
states: 0
abstracting: (FBP<=E4P)
states: 1,404,018 (6)
abstracting: (5<=_2PG)
states: 8,778 (3)
abstracting: (Pyr<=DHAP)
states: 1,158,234 (6)
abstracting: (NADPH<=29)
states: 1,655,346 (6)
abstracting: (c1<=F6P)
states: 62,370 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[Ru5P<=12 & [[Ru5P<=4 & Lac<=F6P] | [~ [35<=b2] | [[~ [[4<=c2 & [[24<=ADP & Lac<=11] | [8<=b1 | a2<=24]]]] & a2<=GSH] & [_2PG<=S7P & [[[[24<=PEP & a2<=18] | ~ [40<=a2]] | 19<=c2] & G6P<=GSH]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[~ [40<=a2] | [24<=PEP & a2<=18]] | 19<=c2] & G6P<=GSH] & _2PG<=S7P] & [~ [[[[8<=b1 | a2<=24] | [24<=ADP & Lac<=11]] & 4<=c2]] & a2<=GSH]] | ~ [35<=b2]] | [Ru5P<=4 & Lac<=F6P]] & Ru5P<=12]]]]

abstracting: (Ru5P<=12)
states: 1,655,346 (6)
abstracting: (Lac<=F6P)
states: 1,025,178 (6)
abstracting: (Ru5P<=4)
states: 1,655,346 (6)
abstracting: (35<=b2)
states: 0
abstracting: (a2<=GSH)
states: 1,628,382 (6)
abstracting: (4<=c2)
states: 586,740 (5)
abstracting: (Lac<=11)
states: 1,655,346 (6)
abstracting: (24<=ADP)
states: 0
abstracting: (a2<=24)
states: 1,655,346 (6)
abstracting: (8<=b1)
states: 0
abstracting: (_2PG<=S7P)
states: 954,954 (5)
abstracting: (G6P<=GSH)
states: 1,645,392 (6)
abstracting: (19<=c2)
states: 0
abstracting: (a2<=18)
states: 1,655,346 (6)
abstracting: (24<=PEP)
states: 0
abstracting: (40<=a2)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[~ [a1<=GSH] & [[~ [[~ [[b2<=NADH & [[4<=F6P & Xu5P<=Pi] & 10<=ATP]]] | [~ [b2<=a2] & 18<=start]]] | [~ [Lac<=24] | [[~ [R5P<=39] & ~ [22<=F6P]] | ~ [[[[33<=Xu5P & GSSG<=25] | [ATP<=NADPplus & Pyr<=PEP]] | a1<=27]]]]] & Ru5P<=G6P]]]
normalized: E [true U [[[[[~ [[[[ATP<=NADPplus & Pyr<=PEP] | [33<=Xu5P & GSSG<=25]] | a1<=27]] | [~ [22<=F6P] & ~ [R5P<=39]]] | ~ [Lac<=24]] | ~ [[[~ [b2<=a2] & 18<=start] | ~ [[[[4<=F6P & Xu5P<=Pi] & 10<=ATP] & b2<=NADH]]]]] & Ru5P<=G6P] & ~ [a1<=GSH]]]

abstracting: (a1<=GSH)
states: 1,505,490 (6)
abstracting: (Ru5P<=G6P)
states: 1,551,858 (6)
abstracting: (b2<=NADH)
states: 1,619,310 (6)
abstracting: (10<=ATP)
states: 1,655,346 (6)
abstracting: (Xu5P<=Pi)
states: 1,655,346 (6)
abstracting: (4<=F6P)
states: 0
abstracting: (18<=start)
states: 0
abstracting: (b2<=a2)
states: 1,644,951 (6)
abstracting: (Lac<=24)
states: 1,655,346 (6)
abstracting: (R5P<=39)
states: 1,655,346 (6)
abstracting: (22<=F6P)
states: 0
abstracting: (a1<=27)
states: 1,655,346 (6)
abstracting: (GSSG<=25)
states: 1,655,346 (6)
abstracting: (33<=Xu5P)
states: 0
abstracting: (Pyr<=PEP)
states: 1,158,234 (6)
abstracting: (ATP<=NADPplus)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [[[start<=36 | [NADplus<=F6P & [[~ [[[~ [_1_3_BPG<=Pi] & [E4P<=26 & 27<=DHAP]] | [[NADPH<=30 & _3PG<=E4P] & c1<=13]]] & ~ [[[NADH<=b2 | NADH<=R5P] & ~ [NADPH<=4]]]] & 25<=R5P]]] | [[~ [R5P<=Pi] & 31<=_1_3_BPG] & [~ [[[[[ATP<=GAP & 6<=DHAP] | [22<=NADPplus | NADplus<=3]] & [~ [4<=Lac] & [DHAP<=6 & 18<=ATP]]] & ~ [[c2<=S7P & Pi<=start]]]] | Gluc<=9]]]]
normalized: ~ [E [true U ~ [[[[Gluc<=9 | ~ [[~ [[c2<=S7P & Pi<=start]] & [[[DHAP<=6 & 18<=ATP] & ~ [4<=Lac]] & [[22<=NADPplus | NADplus<=3] | [ATP<=GAP & 6<=DHAP]]]]]] & [31<=_1_3_BPG & ~ [R5P<=Pi]]] | [start<=36 | [NADplus<=F6P & [25<=R5P & [~ [[~ [NADPH<=4] & [NADH<=b2 | NADH<=R5P]]] & ~ [[[c1<=13 & [NADPH<=30 & _3PG<=E4P]] | [[E4P<=26 & 27<=DHAP] & ~ [_1_3_BPG<=Pi]]]]]]]]]]]]

abstracting: (_1_3_BPG<=Pi)
states: 1,463,385 (6)
abstracting: (27<=DHAP)
states: 0
abstracting: (E4P<=26)
states: 1,655,346 (6)
abstracting: (_3PG<=E4P)
states: 1,045,506 (6)
abstracting: (NADPH<=30)
states: 1,655,346 (6)
abstracting: (c1<=13)
states: 1,655,346 (6)
abstracting: (NADH<=R5P)
states: 87,318 (4)
abstracting: (NADH<=b2)
states: 124,278 (5)
abstracting: (NADPH<=4)
states: 394,130 (5)
abstracting: (25<=R5P)
states: 0
abstracting: (NADplus<=F6P)
states: 0
abstracting: (start<=36)
states: 1,655,346 (6)
abstracting: (R5P<=Pi)
states: 1,655,346 (6)
abstracting: (31<=_1_3_BPG)
states: 0
abstracting: (6<=DHAP)
states: 1,848 (3)
abstracting: (ATP<=GAP)
states: 0
abstracting: (NADplus<=3)
states: 0
abstracting: (22<=NADPplus)
states: 0
abstracting: (4<=Lac)
states: 32,340 (4)
abstracting: (18<=ATP)
states: 1,655,346 (6)
abstracting: (DHAP<=6)
states: 1,655,115 (6)
abstracting: (Pi<=start)
states: 183,183 (5)
abstracting: (c2<=S7P)
states: 214,830 (5)
abstracting: (Gluc<=9)
states: 1,655,346 (6)
-> the formula is TRUE

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

MC time: 0m 0.007sec

checking: EF [~ [[[[[[~ [21<=GAP] | _3PG<=29] | ~ [[Gluc<=R5P & [S7P<=16 | ATP<=37]]]] | Gluc<=29] & [E4P<=22 | ~ [S7P<=8]]] | [~ [[~ [6<=NADplus] & start<=GSSG]] & [[[[[13<=G6P & _3PG<=35] | NADH<=40] | Lac<=NADH] & [~ [_1_3_BPG<=13] | 33<=Lac]] | [[[[Ru5P<=6 & E4P<=Pi] & ~ [b1<=GSSG]] | ~ [[Gluc<=20 & ADP<=GSSG]]] & [[[S7P<=13 | 20<=Pi] | [b1<=6 & PEP<=start]] | [~ [GSH<=FBP] | [NADplus<=GAP & b1<=24]]]]]]]]]
normalized: E [true U ~ [[[[[[[[NADplus<=GAP & b1<=24] | ~ [GSH<=FBP]] | [[b1<=6 & PEP<=start] | [S7P<=13 | 20<=Pi]]] & [~ [[Gluc<=20 & ADP<=GSSG]] | [~ [b1<=GSSG] & [Ru5P<=6 & E4P<=Pi]]]] | [[33<=Lac | ~ [_1_3_BPG<=13]] & [Lac<=NADH | [NADH<=40 | [13<=G6P & _3PG<=35]]]]] & ~ [[start<=GSSG & ~ [6<=NADplus]]]] | [[E4P<=22 | ~ [S7P<=8]] & [Gluc<=29 | [~ [[Gluc<=R5P & [S7P<=16 | ATP<=37]]] | [_3PG<=29 | ~ [21<=GAP]]]]]]]]

abstracting: (21<=GAP)
states: 0
abstracting: (_3PG<=29)
states: 1,655,346 (6)
abstracting: (ATP<=37)
states: 672,903 (5)
abstracting: (S7P<=16)
states: 1,655,346 (6)
abstracting: (Gluc<=R5P)
states: 1,550,934 (6)
abstracting: (Gluc<=29)
states: 1,655,346 (6)
abstracting: (S7P<=8)
states: 1,655,346 (6)
abstracting: (E4P<=22)
states: 1,655,346 (6)
abstracting: (6<=NADplus)
states: 1,655,346 (6)
abstracting: (start<=GSSG)
states: 1,655,325 (6)
abstracting: (_3PG<=35)
states: 1,655,346 (6)
abstracting: (13<=G6P)
states: 0
abstracting: (NADH<=40)
states: 1,655,346 (6)
abstracting: (Lac<=NADH)
states: 1,537,767 (6)
abstracting: (_1_3_BPG<=13)
states: 1,655,346 (6)
abstracting: (33<=Lac)
states: 0
abstracting: (E4P<=Pi)
states: 1,655,346 (6)
abstracting: (Ru5P<=6)
states: 1,655,346 (6)
abstracting: (b1<=GSSG)
states: 1,224,384 (6)
abstracting: (ADP<=GSSG)
states: 370,776 (5)
abstracting: (Gluc<=20)
states: 1,655,346 (6)
abstracting: (20<=Pi)
states: 0
abstracting: (S7P<=13)
states: 1,655,346 (6)
abstracting: (PEP<=start)
states: 954,954 (5)
abstracting: (b1<=6)
states: 1,655,346 (6)
abstracting: (GSH<=FBP)
states: 153,426 (5)
abstracting: (b1<=24)
states: 1,655,346 (6)
abstracting: (NADplus<=GAP)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: AG [[[NADH<=NADplus | [[FBP<=37 | ~ [[[[GSSG<=PEP | PEP<=GSH] & [b1<=_3PG | ATP<=Pi]] & [[_2PG<=28 | GSSG<=34] | ~ [G6P<=E4P]]]]] & ~ [ATP<=30]]] | ~ [[~ [[[[~ [ATP<=ADP] | ~ [_2PG<=15]] | GSSG<=c2] | ~ [[[start<=Pyr & 21<=b2] & c1<=b2]]]] & [[GSSG<=_2PG | [~ [[5<=Ru5P & 38<=DHAP]] | [19<=NADPplus | [~ [NADplus<=c2] & NADH<=16]]]] | [~ [NADplus<=Xu5P] | 19<=GSSG]]]]]]
normalized: ~ [E [true U ~ [[[NADH<=NADplus | [[FBP<=37 | ~ [[[~ [G6P<=E4P] | [_2PG<=28 | GSSG<=34]] & [[b1<=_3PG | ATP<=Pi] & [GSSG<=PEP | PEP<=GSH]]]]] & ~ [ATP<=30]]] | ~ [[[[19<=GSSG | ~ [NADplus<=Xu5P]] | [GSSG<=_2PG | [[19<=NADPplus | [NADH<=16 & ~ [NADplus<=c2]]] | ~ [[5<=Ru5P & 38<=DHAP]]]]] & ~ [[~ [[c1<=b2 & [start<=Pyr & 21<=b2]]] | [GSSG<=c2 | [~ [_2PG<=15] | ~ [ATP<=ADP]]]]]]]]]]]

abstracting: (ATP<=ADP)
states: 0
abstracting: (_2PG<=15)
states: 1,655,346 (6)
abstracting: (GSSG<=c2)
states: 570,738 (5)
abstracting: (21<=b2)
states: 0
abstracting: (start<=Pyr)
states: 1,655,115 (6)
abstracting: (c1<=b2)
states: 44,352 (4)
abstracting: (38<=DHAP)
states: 0
abstracting: (5<=Ru5P)
states: 0
abstracting: (NADplus<=c2)
states: 0
abstracting: (NADH<=16)
states: 1,655,346 (6)
abstracting: (19<=NADPplus)
states: 157,652 (5)
abstracting: (GSSG<=_2PG)
states: 252,630 (5)
abstracting: (NADplus<=Xu5P)
states: 0
abstracting: (19<=GSSG)
states: 0
abstracting: (ATP<=30)
states: 0
abstracting: (PEP<=GSH)
states: 1,581,678 (6)
abstracting: (GSSG<=PEP)
states: 252,630 (5)
abstracting: (ATP<=Pi)
states: 0
abstracting: (b1<=_3PG)
states: 119,427 (5)
abstracting: (GSSG<=34)
states: 1,655,346 (6)
abstracting: (_2PG<=28)
states: 1,655,346 (6)
abstracting: (G6P<=E4P)
states: 1,641,024 (6)
abstracting: (FBP<=37)
states: 1,655,346 (6)
abstracting: (NADH<=NADplus)
states: 1,655,346 (6)
-> the formula is TRUE

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

MC time: 0m 0.022sec

checking: EF [[[ATP<=E4P & ~ [[~ [7<=Pyr] & [[[[31<=Xu5P | 15<=start] & [_1_3_BPG<=c1 | c2<=Gluc]] & [23<=Lac | ~ [a1<=37]]] | ~ [[[_1_3_BPG<=4 & FBP<=ADP] & [8<=PEP | 23<=Xu5P]]]]]]] & [~ [[[NADPplus<=start & [4<=DHAP & a2<=33]] & ~ [[GSH<=Gluc | NADH<=_1_3_BPG]]]] | [[[~ [a1<=2] | [[~ [25<=FBP] | Gluc<=17] & [37<=ADP & ~ [[19<=GSH & 15<=G6P]]]]] & [[[[[Pyr<=GSSG | GSSG<=_2PG] | ~ [Pi<=24]] & 7<=F6P] | 29<=Pi] & [[c2<=4 | [35<=a2 | [8<=b2 & 20<=a2]]] | [[37<=NADH & [Lac<=a1 & S7P<=ADP]] & [[GSSG<=c2 | 20<=c1] & Lac<=26]]]]] & F6P<=NADplus]]]]
normalized: E [true U [[[F6P<=NADplus & [[[[[Lac<=26 & [GSSG<=c2 | 20<=c1]] & [37<=NADH & [Lac<=a1 & S7P<=ADP]]] | [c2<=4 | [35<=a2 | [8<=b2 & 20<=a2]]]] & [29<=Pi | [7<=F6P & [~ [Pi<=24] | [Pyr<=GSSG | GSSG<=_2PG]]]]] & [[[37<=ADP & ~ [[19<=GSH & 15<=G6P]]] & [Gluc<=17 | ~ [25<=FBP]]] | ~ [a1<=2]]]] | ~ [[~ [[GSH<=Gluc | NADH<=_1_3_BPG]] & [NADPplus<=start & [4<=DHAP & a2<=33]]]]] & [ATP<=E4P & ~ [[[~ [[[8<=PEP | 23<=Xu5P] & [_1_3_BPG<=4 & FBP<=ADP]]] | [[23<=Lac | ~ [a1<=37]] & [[_1_3_BPG<=c1 | c2<=Gluc] & [31<=Xu5P | 15<=start]]]] & ~ [7<=Pyr]]]]]]

abstracting: (7<=Pyr)
states: 231
abstracting: (15<=start)
states: 0
abstracting: (31<=Xu5P)
states: 0
abstracting: (c2<=Gluc)
states: 214,830 (5)
abstracting: (_1_3_BPG<=c1)
states: 1,655,346 (6)
abstracting: (a1<=37)
states: 1,655,346 (6)
abstracting: (23<=Lac)
states: 0
abstracting: (FBP<=ADP)
states: 1,655,346 (6)
abstracting: (_1_3_BPG<=4)
states: 1,646,568 (6)
abstracting: (23<=Xu5P)
states: 0
abstracting: (8<=PEP)
states: 0
abstracting: (ATP<=E4P)
states: 0
abstracting: (a2<=33)
states: 1,655,346 (6)
abstracting: (4<=DHAP)
states: 32,340 (4)
abstracting: (NADPplus<=start)
states: 78,837 (4)
abstracting: (NADH<=_1_3_BPG)
states: 156,618 (5)
abstracting: (GSH<=Gluc)
states: 150,990 (5)
abstracting: (a1<=2)
states: 1,655,346 (6)
abstracting: (25<=FBP)
states: 0
abstracting: (Gluc<=17)
states: 1,655,346 (6)
abstracting: (15<=G6P)
states: 0
abstracting: (19<=GSH)
states: 150,486 (5)
abstracting: (37<=ADP)
states: 0
abstracting: (GSSG<=_2PG)
states: 252,630 (5)
abstracting: (Pyr<=GSSG)
states: 1,553,202 (6)
abstracting: (Pi<=24)
states: 1,655,346 (6)
abstracting: (7<=F6P)
states: 0
abstracting: (29<=Pi)
states: 0
abstracting: (20<=a2)
states: 0
abstracting: (8<=b2)
states: 0
abstracting: (35<=a2)
states: 0
abstracting: (c2<=4)
states: 1,353,198 (6)
abstracting: (S7P<=ADP)
states: 1,655,346 (6)
abstracting: (Lac<=a1)
states: 1,533,609 (6)
abstracting: (37<=NADH)
states: 0
abstracting: (20<=c1)
states: 0
abstracting: (GSSG<=c2)
states: 570,738 (5)
abstracting: (Lac<=26)
states: 1,655,346 (6)
abstracting: (F6P<=NADplus)
states: 1,655,346 (6)
-> the formula is FALSE

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

MC time: 0m 0.016sec

checking: EF [[~ [DHAP<=ADP] | ~ [[[[[[S7P<=NADplus | ~ [NADH<=c2]] & 11<=b2] & [~ [[R5P<=0 | 8<=ADP]] | ~ [b2<=ADP]]] | [[[[GSSG<=GSSG | [c2<=Xu5P | 30<=c1]] | [[a1<=ADP & 19<=FBP] & [NADH<=c1 | Ru5P<=33]]] | [b2<=2 | PEP<=37]] & [[[F6P<=NADPH | [DHAP<=9 | ATP<=c2]] | [[NADH<=PEP | a2<=35] & [Lac<=Pyr | ADP<=R5P]]] & FBP<=21]]] | [[[[[Lac<=G6P & [Pi<=Ru5P | S7P<=NADplus]] & [[NADplus<=GSSG & Pyr<=b2] & [GSH<=10 & a2<=c2]]] | [~ [[35<=GAP | start<=NADH]] & ~ [5<=NADH]]] & Xu5P<=GSSG] | NADPplus<=17]]]]]
normalized: E [true U [~ [[[NADPplus<=17 | [Xu5P<=GSSG & [[~ [5<=NADH] & ~ [[35<=GAP | start<=NADH]]] | [[[GSH<=10 & a2<=c2] & [NADplus<=GSSG & Pyr<=b2]] & [Lac<=G6P & [Pi<=Ru5P | S7P<=NADplus]]]]]] | [[[FBP<=21 & [[[Lac<=Pyr | ADP<=R5P] & [NADH<=PEP | a2<=35]] | [F6P<=NADPH | [DHAP<=9 | ATP<=c2]]]] & [[b2<=2 | PEP<=37] | [[[NADH<=c1 | Ru5P<=33] & [a1<=ADP & 19<=FBP]] | [GSSG<=GSSG | [c2<=Xu5P | 30<=c1]]]]] | [[~ [b2<=ADP] | ~ [[R5P<=0 | 8<=ADP]]] & [11<=b2 & [S7P<=NADplus | ~ [NADH<=c2]]]]]]] | ~ [DHAP<=ADP]]]

abstracting: (DHAP<=ADP)
states: 1,655,346 (6)
abstracting: (NADH<=c2)
states: 801,108 (5)
abstracting: (S7P<=NADplus)
states: 1,655,346 (6)
abstracting: (11<=b2)
states: 0
abstracting: (8<=ADP)
states: 1,167,243 (6)
abstracting: (R5P<=0)
states: 1,643,796 (6)
abstracting: (b2<=ADP)
states: 1,655,346 (6)
abstracting: (30<=c1)
states: 0
abstracting: (c2<=Xu5P)
states: 214,830 (5)
abstracting: (GSSG<=GSSG)
states: 1,655,346 (6)
abstracting: (19<=FBP)
states: 0
abstracting: (a1<=ADP)
states: 1,648,416 (6)
abstracting: (Ru5P<=33)
states: 1,655,346 (6)
abstracting: (NADH<=c1)
states: 1,655,346 (6)
abstracting: (PEP<=37)
states: 1,655,346 (6)
abstracting: (b2<=2)
states: 1,650,726 (6)
abstracting: (ATP<=c2)
states: 0
abstracting: (DHAP<=9)
states: 1,655,346 (6)
abstracting: (F6P<=NADPH)
states: 1,640,122 (6)
abstracting: (a2<=35)
states: 1,655,346 (6)
abstracting: (NADH<=PEP)
states: 156,618 (5)
abstracting: (ADP<=R5P)
states: 2,079 (3)
abstracting: (Lac<=Pyr)
states: 1,158,234 (6)
abstracting: (FBP<=21)
states: 1,655,346 (6)
abstracting: (S7P<=NADplus)
states: 1,655,346 (6)
abstracting: (Pi<=Ru5P)
states: 183,183 (5)
abstracting: (Lac<=G6P)
states: 977,592 (5)
abstracting: (Pyr<=b2)
states: 1,000,230 (6)
abstracting: (NADplus<=GSSG)
states: 0
abstracting: (a2<=c2)
states: 1,639,407 (6)
abstracting: (GSH<=10)
states: 902,916 (5)
abstracting: (start<=NADH)
states: 1,655,115 (6)
abstracting: (35<=GAP)
states: 0
abstracting: (5<=NADH)
states: 454,608 (5)
abstracting: (Xu5P<=GSSG)
states: 1,646,148 (6)
abstracting: (NADPplus<=17)
states: 1,418,868 (6)
-> the formula is FALSE

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

MC time: 0m 0.012sec

totally nodes used: 51939 (5.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 172453 110750 283203
used/not used/entry size/cache size: 133153 66975711 16 1024MB
basic ops cache: hits/miss/sum: 109563 238997 348560
used/not used/entry size/cache size: 308455 16468761 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: 12693 18721 31414
used/not used/entry size/cache size: 18721 8369887 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 67062180
1 45882
2 524
3 89
4 21
5 8
6 21
7 5
8 8
9 6
>= 10 120

Total processing time: 0m 4.415sec


BK_STOP 1678638836880

--------------------
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:1795 (81), effective:420 (19)

initing FirstDep: 0m 0.000sec


iterations count:2044 (92), effective:497 (22)

iterations count:2316 (105), effective:613 (27)

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

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