Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r081-smll-158922977900434.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0001N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977900434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 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-C0001N0000000100-00
FORMULA_NAME GPPP-PT-C0001N0000000100-01
FORMULA_NAME GPPP-PT-C0001N0000000100-02
FORMULA_NAME GPPP-PT-C0001N0000000100-03
FORMULA_NAME GPPP-PT-C0001N0000000100-04
FORMULA_NAME GPPP-PT-C0001N0000000100-05
FORMULA_NAME GPPP-PT-C0001N0000000100-06
FORMULA_NAME GPPP-PT-C0001N0000000100-07
FORMULA_NAME GPPP-PT-C0001N0000000100-08
FORMULA_NAME GPPP-PT-C0001N0000000100-09
FORMULA_NAME GPPP-PT-C0001N0000000100-10
FORMULA_NAME GPPP-PT-C0001N0000000100-11
FORMULA_NAME GPPP-PT-C0001N0000000100-12
FORMULA_NAME GPPP-PT-C0001N0000000100-13
FORMULA_NAME GPPP-PT-C0001N0000000100-14
FORMULA_NAME GPPP-PT-C0001N0000000100-15

=== Now, execution of the tool begins

BK_START 1589745187652

[2020-05-17 19:53:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-17 19:53:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 19:53:09] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-05-17 19:53:09] [INFO ] Transformed 33 places.
[2020-05-17 19:53:09] [INFO ] Transformed 22 transitions.
[2020-05-17 19:53:09] [INFO ] Parsed PT model containing 33 places and 22 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 250 ms. (steps per millisecond=400 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:53:10] [INFO ] Computed 13 place invariants in 6 ms
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-17 19:53:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-17 19:53:10] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 8 ms.
[2020-05-17 19:53:10] [INFO ] Added : 19 causal constraints over 4 iterations in 48 ms. Result :sat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned unsat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-17 19:53:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 37 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-17 19:53:10] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2020-05-17 19:53:10] [INFO ] Added : 19 causal constraints over 4 iterations in 46 ms. Result :sat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:53:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-17 19:53:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-17 19:53:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 19 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-17 19:53:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-17 19:53:11] [INFO ] Flatten gal took : 39 ms
FORMULA GPPP-PT-C0001N0000000100-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 19:53:11] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 19:53:11] [INFO ] Applying decomposition
[2020-05-17 19:53:11] [INFO ] Flatten gal took : 7 ms
[2020-05-17 19:53:11] [INFO ] Input system was already deterministic with 22 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:53:11] [INFO ] Computed 13 place invariants in 3 ms
inv : 2*GSSG + GSH = 200
inv : 24*S7P - 24*GAP - 68*E4P - 44*F6P - 11*G6P - 48*FBP - 24*DHAP - 8*_1_3_BPG + 4*ADP - 4*_3PG - 4*_2PG - 4*PEP - 7*Gluc + 11*b2 + 16*c2 = 0
inv : b1 + b2 = 3
inv : Xu5P - 2*R5P - S7P - E4P + a2 = 0
inv : NADH - _1_3_BPG - _3PG - _2PG - PEP - Pyr = 0
inv : -14*S7P + 14*GAP + 42*E4P + 28*F6P + 7*G6P + 28*FBP + 14*DHAP + 4*_1_3_BPG + 4*_3PG + 4*_2PG + 4*PEP + 4*Pyr + 28*start + 4*Lac + 7*Gluc - 7*b2 - 10*c2 = 28
inv : NADplus + _1_3_BPG + _3PG + _2PG + PEP + Pyr = 200
inv : 2*Ru5P + 6*R5P + 9*S7P - 3*GAP - 9*E4P - 6*F6P - 6*FBP - 3*DHAP + 2*b2 - 2*a2 + 3*c2 = 0
inv : NADPplus + NADPH = 200
inv : 4*ATP - 24*S7P + 24*GAP + 68*E4P + 44*F6P + 11*G6P + 48*FBP + 24*DHAP + 8*_1_3_BPG + 4*_3PG + 4*_2PG + 4*PEP + 28*start + 7*Gluc - 11*b2 - 16*c2 = 1628
inv : a1 + a2 = 2
inv : 4*Pi + 14*S7P - 14*GAP - 42*E4P - 28*F6P - 7*G6P - 28*FBP - 14*DHAP - 7*Gluc + 7*b2 + 10*c2 = 0
inv : c1 + c2 = 7
Total of 13 invariants.
[2020-05-17 19:53:11] [INFO ] Computed 13 place invariants in 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph1939389679704180619.txt, -o, /tmp/graph1939389679704180619.bin, -w, /tmp/graph1939389679704180619.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1939389679704180619.bin, -l, -1, -v, -w, /tmp/graph1939389679704180619.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 19:53:11] [INFO ] Decomposing Gal with order
[2020-05-17 19:53:11] [INFO ] Proved 33 variables to be positive in 87 ms
[2020-05-17 19:53:11] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-17 19:53:11] [INFO ] Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:53:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:53:11] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-17 19:53:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 19:53:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 19:53:11] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-17 19:53:11] [INFO ] Flatten gal took : 69 ms
[2020-05-17 19:53:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-17 19:53:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-17 19:53:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !((G(F(X("((i3.u6.start>=1)&&((i1.u3.GSH>=2)||((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))))")))))
Formula 0 simplified : !GFX"((i3.u6.start>=1)&&((i1.u3.GSH>=2)||((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))))"
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 2 ordering constraints for composite.
[2020-05-17 19:53:12] [INFO ] Computing symmetric co enabling matrix : 22 transitions.
[2020-05-17 19:53:14] [INFO ] Computation of Finished co-enabling matrix. took 1655 ms. Total solver calls (SAT/UNSAT): 165(150/15)
[2020-05-17 19:53:14] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2020-05-17 19:53:15] [INFO ] Computation of Completed DNA matrix. took 1257 ms. Total solver calls (SAT/UNSAT): 49(0/49)
[2020-05-17 19:53:15] [INFO ] Built C files in 4333ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 697 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(X((LTLAP0==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(X((LTLAP0==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(X((LTLAP0==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
106998 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1070,5177068,1,0,7.17671e+06,6.38972e+06,314,1.02114e+07,664,1.70549e+07,20163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(G((F(G("(u5._2PG<1)")))U((G("((i3.u0.ADP>=1)&&(u5.PEP>=1))"))&&("(i2.u4.DHAP>=1)")))))||(!(F(G("(i2.u4.FBP>=1)"))))))
Formula 1 simplified : !(!G(FG"(u5._2PG<1)" U ("(i2.u4.DHAP>=1)" & G"((i3.u0.ADP>=1)&&(u5.PEP>=1))")) | !FG"(i2.u4.FBP>=1)")
Detected timeout of ITS tools.
[2020-05-17 20:13:11] [INFO ] Flatten gal took : 5 ms
[2020-05-17 20:13:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-17 20:13:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 12 LTL properties
Checking formula 0 : !(((!(G((F(G("(_2PG<1)")))U((G("((ADP>=1)&&(PEP>=1))"))&&("(DHAP>=1)")))))||(!(F(G("(FBP>=1)"))))))
Formula 0 simplified : !(!G(FG"(_2PG<1)" U ("(DHAP>=1)" & G"((ADP>=1)&&(PEP>=1))")) | !FG"(FBP>=1)")
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5302 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,53.0443,439784,1,0,55,1.52936e+06,98,33,1784,1.83321e+06,99
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((F("((NADH>=1)&&(Pyr>=1))"))||(G("((Xu5P>=1)&&(R5P>=1))")))))
Formula 1 simplified : !G(F"((NADH>=1)&&(Pyr>=1))" | G"((Xu5P>=1)&&(R5P>=1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2290 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,75.9408,770448,1,0,1112,3.2919e+06,112,35,1792,3.40001e+06,2752
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(((G(((X("((ATP>=7)&&(Lac>=7))"))&&("(NADH>=1)"))&&("(Pyr>=1)")))U(("((ATP>=7)&&(Lac>=7))")U("((Xu5P>=1)&&(E4P>=1))")))&&("(GSH>=2)"))))
Formula 2 simplified : !X("(GSH>=2)" & (G("(NADH>=1)" & "(Pyr>=1)" & X"((ATP>=7)&&(Lac>=7))") U ("((ATP>=7)&&(Lac>=7))" U "((Xu5P>=1)&&(E4P>=1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,75.952,770968,1,0,1113,3.29202e+06,155,35,1831,3.40019e+06,2765
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((!(F(!(G((!(("(FBP>=1)")U(X("(FBP>=1)"))))&&(!(X("((_1_3_BPG>=1)&&(ADP>=1))")))))))))
Formula 3 simplified : F!G(!("(FBP>=1)" U X"(FBP>=1)") & !X"((_1_3_BPG>=1)&&(ADP>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,76.0962,773872,1,0,1197,3.3106e+06,166,65,1839,3.4264e+06,2918
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F(X("(GSH>=2)")))))
Formula 4 simplified : !XFX"(GSH>=2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1536 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,91.4523,1119952,1,0,7878,5.39175e+06,173,2287,1839,6.05606e+06,14093
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X((G("((Ru5P<1)||(a2<1))"))||((F((X("((Ru5P>=1)&&(a1>=2))"))||("((ATP>=7)&&(Lac>=7))")))&&(X(X("((Ru5P>=1)&&(a1>=2))")))))))
Formula 5 simplified : !X(G"((Ru5P<1)||(a2<1))" | (F("((ATP>=7)&&(Lac>=7))" | X"((Ru5P>=1)&&(a1>=2))") & XX"((Ru5P>=1)&&(a1>=2))"))
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,91.5795,1122592,1,0,7942,5.40466e+06,187,2310,1848,6.07598e+06,14229
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((G("(GSH>=2)"))U(((X(X(G("(_2PG>=1)"))))U(F("(DHAP>=1)")))||(X("((Xu5P>=1)&&(R5P>=1))")))))
Formula 6 simplified : !(G"(GSH>=2)" U ((XXG"(_2PG>=1)" U F"(DHAP>=1)") | X"((Xu5P>=1)&&(R5P>=1))"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
29 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,91.868,1129192,1,0,8100,5.43936e+06,203,2343,1854,6.12284e+06,14577
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((F(!(F((X("((ATP>=7)&&(Lac>=7))"))&&("((ATP<7)||(Lac<7))")))))&&(G(X("((ATP>=7)&&(Lac>=7))")))))
Formula 7 simplified : !(F!F("((ATP<7)||(Lac<7))" & X"((ATP>=7)&&(Lac>=7))") & GX"((ATP>=7)&&(Lac>=7))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
94 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,92.8122,1137876,1,0,8103,5.46287e+06,212,2343,1856,6.15412e+06,14595
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G("((Xu5P>=1)&&(E4P>=1))"))))
Formula 8 simplified : !XG"((Xu5P>=1)&&(E4P>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,92.8133,1138140,1,0,8103,5.46287e+06,216,2343,1856,6.15412e+06,14600
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((!(G(X((F("((NADPH>=1)&&(GSSG>=1))"))U(F((!(G("(((NADPH>=1)&&(GSSG>=1))||((Ru5P>=1)&&(a2>=1)))")))||(G("((Ru5P>=1)&&(a2>=1))")))))))))
Formula 9 simplified : GX(F"((NADPH>=1)&&(GSSG>=1))" U F(!G"(((NADPH>=1)&&(GSSG>=1))||((Ru5P>=1)&&(a2>=1)))" | G"((Ru5P>=1)&&(a2>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
115 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,93.9676,1159456,1,0,8109,5.53042e+06,225,2344,1863,6.23669e+06,14624
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((!(X((!(X(F("(((ATP>=1)&&(Gluc>=1))&&(_3PG>=1))"))))||("(_3PG>=1)")))))
Formula 10 simplified : X("(_3PG>=1)" | !XF"(((ATP>=1)&&(Gluc>=1))&&(_3PG>=1))")
Detected timeout of ITS tools.
[2020-05-17 20:33:11] [INFO ] Flatten gal took : 4 ms
[2020-05-17 20:33:11] [INFO ] Input system was already deterministic with 22 transitions.
[2020-05-17 20:33:11] [INFO ] Transformed 33 places.
[2020-05-17 20:33:11] [INFO ] Transformed 22 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-17 20:33:11] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-17 20:33:11] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((!(X((!(X(F("(((ATP>=1)&&(Gluc>=1))&&(_3PG>=1))"))))||("(_3PG>=1)")))))
Formula 0 simplified : X("(_3PG>=1)" | !XF"(((ATP>=1)&&(Gluc>=1))&&(_3PG>=1))")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26770 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,267.718,2432528,1,0,2864,1.31305e+07,19,1402,1217,1.53174e+07,4595
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000100-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F("((ATP>=1)&&(F6P>=1))"))||((!(G(F("((ATP>=1)&&(F6P>=1))"))))&&(G("((G6P>=1)&&(b1>=3))")))))
Formula 1 simplified : !(F"((ATP>=1)&&(F6P>=1))" | (!GF"((ATP>=1)&&(F6P>=1))" & G"((G6P>=1)&&(b1>=3))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,267.78,2432892,1,0,2864,1.31305e+07,39,1402,1325,1.53174e+07,4658
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1589747871164

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-C0001N0000000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000000100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r081-smll-158922977900434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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