About the Execution of ITS-Tools for GPPP-PT-C0001N0000010000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
292.380 | 4935.00 | 11968.00 | 263.80 | FTFFFFFFFTTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is GPPP-PT-C0001N0000010000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217su-smll-146468018600472
=====================================================================
--------------------
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-C0001N0000010000-CTLFireability-0
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-1
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-15
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-2
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-3
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-4
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-5
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-6
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-7
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-8
FORMULA_NAME GPPP-PT-C0001N0000010000-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1464772831683
its-ctl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.013315,4220,2,41,5,87,6,0,161,41,0
Converting to forward existential form...Done !
original formula: (A((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1)) U (ATP>=1 * Gluc>=1)) + (EF((((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1)))) + (AF(GSH>=2) + (Pyr>=1 * NADH>=1))))
=> equivalent forward existential formula: [FwdG((((Init * !(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))))) * !(E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1)))))) * !((Pyr>=1 * NADH>=1))),!(GSH>=2))] = FALSE
Checking (exact) 0 :[FwdG((((Init * !(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))))) * !(E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1)))))) * !((Pyr>=1 * NADH>=1))),!(GSH>=2))] = FALSE
Checking (exact) 0 :FwdG((((Init * !(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))))) * !(E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1)))))) * !((Pyr>=1 * NADH>=1))),!(GSH>=2))
Checking (exact) 1 :(((Init * !(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))))) * !(E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1)))))) * !((Pyr>=1 * NADH>=1)))
Checking (exact) 1 :!((Pyr>=1 * NADH>=1))
Checking (exact) 1 :((Init * !(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))))) * !(E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1))))))
Checking (exact) 1 :!(E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1)))))
Checking (exact) 1 :E(TRUE U (((Xu5P>=1 * R5P>=1) * (G6P>=1 * b1>=3)) * ((Xu5P>=1 * R5P>=1) + (ADP>=1 * _1_3_BPG>=1))))
Checking (exact) 1 :(Init * !(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1)))))))
Checking (exact) 1 :!(!((E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))))
Checking (exact) 1 :(E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1)))) + EG(!((ATP>=1 * Gluc>=1))))
Checking (exact) 1 :E(!((ATP>=1 * Gluc>=1)) U (!((!((GSSG>=1 * NADPH>=1)) * (PEP>=1 * ADP>=1))) * !((ATP>=1 * Gluc>=1))))
Checking (exact) 1 :EG(!((ATP>=1 * Gluc>=1)))
Fast SCC detection found none.
Checking (exact) 1 :Init
(forward)formula 0,0,0.023931,4524,1,0,6,101,58,4,525,41,16
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (AF(EX(!((G6P>=1 * b1>=3)))) * AX(!(EF((ATP>=7 * Lac>=7)))))
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!((G6P>=1 * b1>=3)))))] = FALSE * [(FwdU(EY(Init),TRUE) * (ATP>=7 * Lac>=7))] = FALSE)
Checking (exact) 0 :([FwdG(Init,!(EX(!((G6P>=1 * b1>=3)))))] = FALSE * [(FwdU(EY(Init),TRUE) * (ATP>=7 * Lac>=7))] = FALSE)
Checking (exact) 1 :[(FwdU(EY(Init),TRUE) * (ATP>=7 * Lac>=7))] = FALSE
Checking (exact) 0 :(FwdU(EY(Init),TRUE) * (ATP>=7 * Lac>=7))
Checking (exact) 1 :[FwdG(Init,!(EX(!((G6P>=1 * b1>=3)))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(EX(!((G6P>=1 * b1>=3)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EX(!((G6P>=1 * b1>=3))))
Checking (exact) 1 :EX(!((G6P>=1 * b1>=3)))
(forward)formula 1,1,0.025101,4524,1,0,6,101,66,5,531,45,17
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF((A((Pyr>=1 * NADH>=1) U (PEP>=1 * ADP>=1)) * A((ATP>=7 * Lac>=7) U ((NADPplus>=2 * G6P>=1) * b2>=1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((E(!((PEP>=1 * ADP>=1)) U (!((Pyr>=1 * NADH>=1)) * !((PEP>=1 * ADP>=1)))) + EG(!((PEP>=1 * ADP>=1)))))) * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((ATP>=7 * Lac>=7)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))] != FALSE
Checking (exact) 0 :[(((FwdU(Init,TRUE) * !((E(!((PEP>=1 * ADP>=1)) U (!((Pyr>=1 * NADH>=1)) * !((PEP>=1 * ADP>=1)))) + EG(!((PEP>=1 * ADP>=1)))))) * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((ATP>=7 * Lac>=7)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))] != FALSE
Checking (exact) 0 :(((FwdU(Init,TRUE) * !((E(!((PEP>=1 * ADP>=1)) U (!((Pyr>=1 * NADH>=1)) * !((PEP>=1 * ADP>=1)))) + EG(!((PEP>=1 * ADP>=1)))))) * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((ATP>=7 * Lac>=7)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))
Checking (exact) 1 :!(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((ATP>=7 * Lac>=7)) * !(((NADPplus>=2 * G6P>=1) * b2>=1)))))
Checking (exact) 1 :E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((ATP>=7 * Lac>=7)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))
(forward)formula 2,0,0.0285,4796,1,0,6,101,76,5,546,47,19
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !((EF((Pyr>=1 * NADH>=1)) + (GSH>=2 * ((ATP>=7 * Lac>=7) + (GSSG>=1 * NADPH>=1)))))
=> equivalent forward existential formula: [((Init * !((GSH>=2 * ((ATP>=7 * Lac>=7) + (GSSG>=1 * NADPH>=1))))) * !(E(TRUE U (Pyr>=1 * NADH>=1))))] != FALSE
Checking (exact) 0 :[((Init * !((GSH>=2 * ((ATP>=7 * Lac>=7) + (GSSG>=1 * NADPH>=1))))) * !(E(TRUE U (Pyr>=1 * NADH>=1))))] != FALSE
Checking (exact) 0 :((Init * !((GSH>=2 * ((ATP>=7 * Lac>=7) + (GSSG>=1 * NADPH>=1))))) * !(E(TRUE U (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :!(E(TRUE U (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :E(TRUE U (Pyr>=1 * NADH>=1))
Checking (exact) 1 :(Init * !((GSH>=2 * ((ATP>=7 * Lac>=7) + (GSSG>=1 * NADPH>=1)))))
(forward)formula 3,1,0.029898,4800,1,0,6,101,80,5,552,50,20
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AG(!(AG(((NADPplus>=2 * G6P>=1) * b2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))))
Checking (exact) 1 :!(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1))))
Checking (exact) 1 :E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))
(forward)formula 4,1,0.031181,4800,1,0,6,101,80,5,552,50,20
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (EF((AG((Pyr>=1 * NADH>=1)) * EG(GAP>=1))) * !(((!(((Xu5P>=1 * R5P>=1) + start>=1)) * (Pyr>=1 * NADH>=1)) * E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1)))))
=> equivalent forward existential formula: ([((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !((!(((Xu5P>=1 * R5P>=1) + start>=1)) * (Pyr>=1 * NADH>=1))))] != FALSE + [((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !(E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1))))] != FALSE)
Checking (exact) 0 :([((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !((!(((Xu5P>=1 * R5P>=1) + start>=1)) * (Pyr>=1 * NADH>=1))))] != FALSE + [((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !(E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1))))] != FALSE)
Checking (exact) 0 :[((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !((!(((Xu5P>=1 * R5P>=1) + start>=1)) * (Pyr>=1 * NADH>=1))))] != FALSE
Checking (exact) 0 :((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !((!(((Xu5P>=1 * R5P>=1) + start>=1)) * (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :!((!(((Xu5P>=1 * R5P>=1) + start>=1)) * (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :(Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1))))
Checking (exact) 1 :E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))
Checking (exact) 1 :(!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1))
Checking (exact) 1 :EG(GAP>=1)
Checking (exact) 0 :[((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !(E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1))))] != FALSE
Checking (exact) 0 :((Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))) * !(E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1))))
Checking (exact) 1 :!(E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1)))
Checking (exact) 1 :E((Pyr>=1 * NADH>=1) U (Xu5P>=1 * R5P>=1))
Checking (exact) 1 :(Init * E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1))))
Checking (exact) 1 :E(TRUE U (!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1)))
Checking (exact) 1 :(!(E(TRUE U !((Pyr>=1 * NADH>=1)))) * EG(GAP>=1))
Checking (exact) 1 :EG(GAP>=1)
(forward)formula 5,0,0.035854,4800,1,0,6,101,97,5,573,52,23
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(AF(EF((Pyr>=1 * NADH>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U (Pyr>=1 * NADH>=1))))] = FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),!(E(TRUE U (Pyr>=1 * NADH>=1))))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(E(TRUE U (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Checking (exact) 1 :!(E(TRUE U (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :E(TRUE U (Pyr>=1 * NADH>=1))
(forward)formula 6,0,0.036772,4800,1,0,6,101,97,5,573,52,25
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))) + AG(EF((PEP>=1 * ADP>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))))),TRUE) * !(E(TRUE U (PEP>=1 * ADP>=1))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * !((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))))),TRUE) * !(E(TRUE U (PEP>=1 * ADP>=1))))] != FALSE
Checking (exact) 0 :(FwdU((Init * !((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))))),TRUE) * !(E(TRUE U (PEP>=1 * ADP>=1))))
Checking (exact) 1 :!(E(TRUE U (PEP>=1 * ADP>=1)))
Checking (exact) 1 :E(TRUE U (PEP>=1 * ADP>=1))
Checking (exact) 1 :FwdU((Init * !((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))))),TRUE)
Checking (exact) 1 :(Init * !((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1))))))
Checking (exact) 1 :!((E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))))
Checking (exact) 1 :(E((Pyr>=1 * NADH>=1) U (Ru5P>=1 * a2>=1)) * EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1))))
Checking (exact) 1 :EX(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) * (GSSG>=1 * NADPH>=1)))
Checking (exact) 1 :Init
(forward)formula 7,1,0.039769,4800,1,0,6,101,112,5,587,52,27
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))) + (EX((!((Xu5P>=1 * R5P>=1)) + (E4P>=1 * Xu5P>=1))) * ((!((Ru5P>=1 * a1>=2)) * AF(DHAP>=1)) + DHAP>=1)))
=> equivalent forward existential formula: ([((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(EX((!((Xu5P>=1 * R5P>=1)) + (E4P>=1 * Xu5P>=1)))))] = FALSE * ([(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)) * (Ru5P>=1 * a1>=2))] = FALSE * [FwdG(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)),!(DHAP>=1))] = FALSE))
Checking (exact) 0 :([((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(EX((!((Xu5P>=1 * R5P>=1)) + (E4P>=1 * Xu5P>=1)))))] = FALSE * ([(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)) * (Ru5P>=1 * a1>=2))] = FALSE * [FwdG(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)),!(DHAP>=1))] = FALSE))
Checking (exact) 1 :([(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)) * (Ru5P>=1 * a1>=2))] = FALSE * [FwdG(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)),!(DHAP>=1))] = FALSE)
Checking (exact) 1 :[FwdG(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)),!(DHAP>=1))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1)),!(DHAP>=1))
Checking (exact) 1 :((Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))) * !(DHAP>=1))
Checking (exact) 1 :!(DHAP>=1)
Checking (exact) 1 :(Init * !(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1)))))
Checking (exact) 1 :!(EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))))
Checking (exact) 1 :EX((((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1)))
Checking (exact) 1 :(((GAP>=1 + _2PG>=1) * !((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) + EG(_2PG>=1))
Checking (exact) 1 :EG(_2PG>=1)
Checking (exact) 1 :Init
(forward)formula 8,0,0.043302,4800,1,0,6,101,124,5,601,53,31
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: A(E((GSSG>=1 * NADPH>=1) U FBP>=1) U EF((PEP>=1 * ADP>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (PEP>=1 * ADP>=1)))))) * !(E(!(E(TRUE U (PEP>=1 * ADP>=1))) U (!(E((GSSG>=1 * NADPH>=1) U FBP>=1)) * !(E(TRUE U (PEP>=1 * ADP>=1)))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E(TRUE U (PEP>=1 * ADP>=1)))))) * !(E(!(E(TRUE U (PEP>=1 * ADP>=1))) U (!(E((GSSG>=1 * NADPH>=1) U FBP>=1)) * !(E(TRUE U (PEP>=1 * ADP>=1)))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E(TRUE U (PEP>=1 * ADP>=1)))))) * !(E(!(E(TRUE U (PEP>=1 * ADP>=1))) U (!(E((GSSG>=1 * NADPH>=1) U FBP>=1)) * !(E(TRUE U (PEP>=1 * ADP>=1)))))))
Checking (exact) 1 :!(E(!(E(TRUE U (PEP>=1 * ADP>=1))) U (!(E((GSSG>=1 * NADPH>=1) U FBP>=1)) * !(E(TRUE U (PEP>=1 * ADP>=1))))))
Checking (exact) 1 :E(!(E(TRUE U (PEP>=1 * ADP>=1))) U (!(E((GSSG>=1 * NADPH>=1) U FBP>=1)) * !(E(TRUE U (PEP>=1 * ADP>=1)))))
Checking (exact) 1 :!(E(TRUE U (PEP>=1 * ADP>=1)))
Checking (exact) 1 :E(TRUE U (PEP>=1 * ADP>=1))
Checking (exact) 1 :(!(E((GSSG>=1 * NADPH>=1) U FBP>=1)) * !(E(TRUE U (PEP>=1 * ADP>=1))))
Checking (exact) 1 :!(E(TRUE U (PEP>=1 * ADP>=1)))
Checking (exact) 1 :E(TRUE U (PEP>=1 * ADP>=1))
Checking (exact) 1 :!(E((GSSG>=1 * NADPH>=1) U FBP>=1))
Checking (exact) 1 :E((GSSG>=1 * NADPH>=1) U FBP>=1)
(forward)formula 9,0,0.046313,4800,1,0,6,101,130,5,604,53,33
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(AG(_2PG>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(_2PG>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(_2PG>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(_2PG>=1))))
Checking (exact) 1 :!(E(TRUE U !(_2PG>=1)))
Checking (exact) 1 :E(TRUE U !(_2PG>=1))
(forward)formula 10,0,0.046869,4800,1,0,6,101,131,5,606,54,34
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(((EF(((NADPplus>=2 * G6P>=1) * b2>=1)) + EX((F6P>=1 * ATP>=1))) + (Xu5P>=1 * R5P>=1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((Xu5P>=1 * R5P>=1))) * !(EX((F6P>=1 * ATP>=1)))) * !(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1))))] = FALSE
Checking (exact) 0 :[(((FwdU(Init,TRUE) * !((Xu5P>=1 * R5P>=1))) * !(EX((F6P>=1 * ATP>=1)))) * !(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1))))] = FALSE
Checking (exact) 0 :(((FwdU(Init,TRUE) * !((Xu5P>=1 * R5P>=1))) * !(EX((F6P>=1 * ATP>=1)))) * !(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1))))
Checking (exact) 1 :!(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)))
Checking (exact) 1 :E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1))
Checking (exact) 1 :((FwdU(Init,TRUE) * !((Xu5P>=1 * R5P>=1))) * !(EX((F6P>=1 * ATP>=1))))
Checking (exact) 1 :!(EX((F6P>=1 * ATP>=1)))
Checking (exact) 1 :EX((F6P>=1 * ATP>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * !((Xu5P>=1 * R5P>=1)))
Checking (exact) 1 :!((Xu5P>=1 * R5P>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 11,0,0.049144,4800,1,0,6,101,135,5,609,54,36
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(EF((((S7P>=1 * GAP>=1) * c1>=7) * (((S7P>=1 * GAP>=1) * c1>=7) * (Pyr>=1 * NADH>=1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),TRUE) * (((S7P>=1 * GAP>=1) * c1>=7) * (((S7P>=1 * GAP>=1) * c1>=7) * (Pyr>=1 * NADH>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),TRUE) * (((S7P>=1 * GAP>=1) * c1>=7) * (((S7P>=1 * GAP>=1) * c1>=7) * (Pyr>=1 * NADH>=1))))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),TRUE) * (((S7P>=1 * GAP>=1) * c1>=7) * (((S7P>=1 * GAP>=1) * c1>=7) * (Pyr>=1 * NADH>=1))))
(forward)formula 12,0,0.050047,4800,1,0,6,101,145,5,617,54,36
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(EF((!((G6P>=1 * b1>=3)) * (DHAP>=1 * _3PG>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!((G6P>=1 * b1>=3)) * (DHAP>=1 * _3PG>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (!((G6P>=1 * b1>=3)) * (DHAP>=1 * _3PG>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (!((G6P>=1 * b1>=3)) * (DHAP>=1 * _3PG>=1)))))
Checking (exact) 1 :!(E(TRUE U (!((G6P>=1 * b1>=3)) * (DHAP>=1 * _3PG>=1))))
Checking (exact) 1 :E(TRUE U (!((G6P>=1 * b1>=3)) * (DHAP>=1 * _3PG>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 13,0,0.051752,4800,1,0,6,101,150,5,621,54,37
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG((EF((GSH>=2 + _2PG>=1)) + AF(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + (Xu5P>=1 * R5P>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U (GSH>=2 + _2PG>=1)))),!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + (Xu5P>=1 * R5P>=1))))] = FALSE
Checking (exact) 0 :[FwdG((FwdU(Init,TRUE) * !(E(TRUE U (GSH>=2 + _2PG>=1)))),!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + (Xu5P>=1 * R5P>=1))))] = FALSE
Checking (exact) 0 :FwdG((FwdU(Init,TRUE) * !(E(TRUE U (GSH>=2 + _2PG>=1)))),!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + (Xu5P>=1 * R5P>=1))))
Checking (exact) 1 :(FwdU(Init,TRUE) * !(E(TRUE U (GSH>=2 + _2PG>=1))))
Checking (exact) 1 :!(E(TRUE U (GSH>=2 + _2PG>=1)))
Checking (exact) 1 :E(TRUE U (GSH>=2 + _2PG>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 14,0,0.053698,4800,1,0,6,101,153,5,627,56,39
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: A(AX(!(start>=1)) U E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))) * !(E(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)) U (!(!(EX(!(!(start>=1))))) * !(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))) * !(E(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)) U (!(!(EX(!(!(start>=1))))) * !(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))) * !(E(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)) U (!(!(EX(!(!(start>=1))))) * !(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))))
Checking (exact) 1 :!(E(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)) U (!(!(EX(!(!(start>=1))))) * !(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)))))
Checking (exact) 1 :E(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)) U (!(!(EX(!(!(start>=1))))) * !(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))
Checking (exact) 1 :!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))
Checking (exact) 1 :E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)
Checking (exact) 1 :(!(!(EX(!(!(start>=1))))) * !(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)))
Checking (exact) 1 :!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))
Checking (exact) 1 :E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)
Checking (exact) 1 :!(!(EX(!(!(start>=1)))))
Checking (exact) 1 :EX(!(!(start>=1)))
Checking (exact) 1 :(Init * !(EG(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)))))
Checking (exact) 1 :!(EG(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))))
Checking (exact) 1 :EG(!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)))
Checking (exact) 1 :!(E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1))
Checking (exact) 1 :E(((S7P>=1 * GAP>=1) * c1>=7) U DHAP>=1)
(forward)formula 15,0,0.059569,4800,1,0,6,101,158,5,630,56,42
FORMULA GPPP-PT-C0001N0000010000-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
BK_STOP 1464772836618
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
Jun 01, 2016 9:20:35 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 9:20:35 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 45 ms
Jun 01, 2016 9:20:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 01, 2016 9:20:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2016 9:20:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 56 ms
Jun 01, 2016 9:20:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 15 ms
Jun 01, 2016 9:20:35 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
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-C0001N0000010000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000010000.tgz
mv GPPP-PT-C0001N0000010000 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000010000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r217su-smll-146468018600472"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
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 ;