About the Execution of ITS-Tools for GPPP-PT-C1000N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15766.500 | 3600000.00 | 3516718.00 | 38343.20 | TFFFFFFFFTF????? | normal |
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-158922978100530.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-C1000N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922978100530
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:15 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:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:51 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-C1000N0000000010-00
FORMULA_NAME GPPP-PT-C1000N0000000010-01
FORMULA_NAME GPPP-PT-C1000N0000000010-02
FORMULA_NAME GPPP-PT-C1000N0000000010-03
FORMULA_NAME GPPP-PT-C1000N0000000010-04
FORMULA_NAME GPPP-PT-C1000N0000000010-05
FORMULA_NAME GPPP-PT-C1000N0000000010-06
FORMULA_NAME GPPP-PT-C1000N0000000010-07
FORMULA_NAME GPPP-PT-C1000N0000000010-08
FORMULA_NAME GPPP-PT-C1000N0000000010-09
FORMULA_NAME GPPP-PT-C1000N0000000010-10
FORMULA_NAME GPPP-PT-C1000N0000000010-11
FORMULA_NAME GPPP-PT-C1000N0000000010-12
FORMULA_NAME GPPP-PT-C1000N0000000010-13
FORMULA_NAME GPPP-PT-C1000N0000000010-14
FORMULA_NAME GPPP-PT-C1000N0000000010-15
=== Now, execution of the tool begins
BK_START 1589800649092
[2020-05-18 11:17:31] [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-18 11:17:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 11:17:31] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-18 11:17:31] [INFO ] Transformed 33 places.
[2020-05-18 11:17:31] [INFO ] Transformed 22 transitions.
[2020-05-18 11:17:31] [INFO ] Parsed PT model containing 33 places and 22 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100008 steps, including 229 resets, run finished after 201 ms. (steps per millisecond=497 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 11:17:32] [INFO ] Invariants computation overflowed in 6 ms
[2020-05-18 11:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:17:32] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-18 11:17:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-18 11:17:32] [INFO ] Flatten gal took : 48 ms
FORMULA GPPP-PT-C1000N0000000010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 11:17:32] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 11:17:32] [INFO ] Applying decomposition
[2020-05-18 11:17:32] [INFO ] Flatten gal took : 10 ms
[2020-05-18 11:17:32] [INFO ] Input system was already deterministic with 22 transitions.
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/graph6186750303133904788.txt, -o, /tmp/graph6186750303133904788.bin, -w, /tmp/graph6186750303133904788.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/graph6186750303133904788.bin, -l, -1, -v, -w, /tmp/graph6186750303133904788.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 11:17:32] [INFO ] Decomposing Gal with order
[2020-05-18 11:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 11:17:32] [INFO ] Invariants computation overflowed in 3 ms
Total of 0 invariants.
[2020-05-18 11:17:32] [INFO ] Computed 0 place invariants in 4 ms
[2020-05-18 11:17:32] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-18 11:17:32] [INFO ] Flatten gal took : 57 ms
[2020-05-18 11:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-18 11:17:32] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-18 11:17:32] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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(X(!(X(G(((((X("(i2.u6.start>=1)"))U("(i2.u6.start>=1)"))&&("(u8.S7P>=1)"))&&("(i5.u4.GAP>=1)"))&&("(i5.u9.c1>=7000)"))))))))))
Formula 0 simplified : !GFXX!XG("(i5.u4.GAP>=1)" & "(i5.u9.c1>=7000)" & "(u8.S7P>=1)" & (X"(i2.u6.start>=1)" U "(i2.u6.start>=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-18 11:17:33] [INFO ] Proved 33 variables to be positive in 170 ms
[2020-05-18 11:17:33] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2020-05-18 11:17:33] [INFO ] Computation of disable matrix completed :0/22 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 11:17:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 11:17:33] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2020-05-18 11:17:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 11:17:34] [INFO ] Computing symmetric co enabling matrix : 22 transitions.
[2020-05-18 11:17:34] [INFO ] Computation of Finished co-enabling matrix. took 304 ms. Total solver calls (SAT/UNSAT): 10(10/0)
[2020-05-18 11:17:34] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2020-05-18 11:17:34] [INFO ] Computation of Completed DNA matrix. took 291 ms. Total solver calls (SAT/UNSAT): 51(0/51)
[2020-05-18 11:17:34] [INFO ] Built C files in 2116ms 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 704 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(X(X(!( X([](( ( ( (X((LTLAP0==true)))U((LTLAP0==true)) ) && ( (LTLAP1==true) ) ) && ( (LTLAP2==true) ) ) && ( (LTLAP3==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(X(!( X([](( ( ( (X((LTLAP0==true)))U((LTLAP0==true)) ) && ( (LTLAP1==true) ) ) && ( (LTLAP2==true) ) ) && ( (LTLAP3==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(X(!( X([](( ( ( (X((LTLAP0==true)))U((LTLAP0==true)) ) && ( (LTLAP1==true) ) ) && ( (LTLAP2==true) ) ) && ( (LTLAP3==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, i0.u3.Glutathione_oxidation, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/19/2/22
Computing Next relation with stutter on 4 deadlock states
Detected timeout of ITS tools.
[2020-05-18 11:37:33] [INFO ] Flatten gal took : 7 ms
[2020-05-18 11:37:33] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-18 11:37:33] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 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 13 LTL properties
Checking formula 0 : !((G(F(X(X(!(X(G(((((X("(start>=1)"))U("(start>=1)"))&&("(S7P>=1)"))&&("(GAP>=1)"))&&("(c1>=7000)"))))))))))
Formula 0 simplified : !GFXX!XG("(GAP>=1)" & "(S7P>=1)" & "(c1>=7000)" & (X"(start>=1)" U "(start>=1)"))
Detected timeout of ITS tools.
[2020-05-18 11:57:35] [INFO ] Flatten gal took : 345 ms
[2020-05-18 11:57:35] [INFO ] Input system was already deterministic with 22 transitions.
[2020-05-18 11:57:35] [INFO ] Transformed 33 places.
[2020-05-18 11:57:35] [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-18 11:57:35] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-18 11:57:35] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 12 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 13 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(X(X(!(X(G(((((X("(start>=1)"))U("(start>=1)"))&&("(S7P>=1)"))&&("(GAP>=1)"))&&("(c1>=7000)"))))))))))
Formula 0 simplified : !GFXX!XG("(GAP>=1)" & "(S7P>=1)" & "(c1>=7000)" & (X"(start>=1)" U "(start>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :1/19/2/22
Computing Next relation with stutter on 4 deadlock states
1107 unique states visited
0 strongly connected components in search stack
1384 transitions explored
282 items max in DFS search stack
2226 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,22.2814,453672,1,0,326,2.14955e+06,82,582,1771,2.42248e+06,2824
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C1000N0000000010-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F((G(("(_2PG>=1)")U("(DHAP>=1)")))&&((!(F("((ADP>=1)&&(PEP>=1))")))||("(start<1)"))))))
Formula 1 simplified : !XF(G("(_2PG>=1)" U "(DHAP>=1)") & ("(start<1)" | !F"((ADP>=1)&&(PEP>=1))"))
Computing Next relation with stutter on 4 deadlock states
300 unique states visited
300 strongly connected components in search stack
300 transitions explored
300 items max in DFS search stack
6769 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,89.9784,1763136,1,0,2752,9.4339e+06,141,2728,1820,1.18682e+07,9405
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((!(F(!(F((!(G(X("((_1_3_BPG>=1)&&(ADP>=1))"))))U("((_1_3_BPG>=1)&&(ADP>=1))"))))))&&(!(G("((GSH>=2)||((NADPH>=1)&&(GSSG>=1)))")))))
Formula 2 simplified : !(!F!F(!GX"((_1_3_BPG>=1)&&(ADP>=1))" U "((_1_3_BPG>=1)&&(ADP>=1))") & !G"((GSH>=2)||((NADPH>=1)&&(GSSG>=1)))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7297 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,162.95,2215368,1,0,3062,1.22828e+07,18,2945,930,1.48398e+07,2241
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((X(F("((Xu5P>=1)&&(E4P>=1))")))||(X(F(X(F(X(G("(((S7P>=1)&&(GAP>=1))&&(c1>=7000))")))))))))
Formula 3 simplified : !(XF"((Xu5P>=1)&&(E4P>=1))" | XFXFXG"(((S7P>=1)&&(GAP>=1))&&(c1>=7000))")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10524 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,268.197,2426996,1,0,3062,1.41372e+07,23,2945,1005,1.5509e+07,3316
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F((("(((NADPplus>=2)&&(G6P>=1))&&(b2>=1))")U("((Xu5P>=1)&&(E4P>=1))"))U((F("(GSH>=2)"))U("((Xu5P>=1)&&(E4P>=1))"))))||(G("(GSH>=2)"))))
Formula 4 simplified : !(F(("(((NADPplus>=2)&&(G6P>=1))&&(b2>=1))" U "((Xu5P>=1)&&(E4P>=1))") U (F"(GSH>=2)" U "((Xu5P>=1)&&(E4P>=1))")) | G"(GSH>=2)")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5232 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,320.513,2426996,1,0,3062,1.41372e+07,42,2945,1356,1.5509e+07,6251
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(!(X(G((!(G("((_1_3_BPG>=1)&&(ADP>=1))")))&&(!(G("((NADH>=1)&&(Pyr>=1))")))))))))
Formula 5 simplified : !F!XG(!G"((_1_3_BPG>=1)&&(ADP>=1))" & !G"((NADH>=1)&&(Pyr>=1))")
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
27469 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,595.195,3037432,1,0,3959,1.6538e+07,27,3177,1112,2.05001e+07,8864
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(!(("((Ru5P>=1)&&(a2>=1))")U((F(X("((_1_3_BPG>=1)&&(ADP>=1))")))U("((_1_3_BPG>=1)&&(ADP>=1))"))))))
Formula 6 simplified : !X!("((Ru5P>=1)&&(a2>=1))" U (FX"((_1_3_BPG>=1)&&(ADP>=1))" U "((_1_3_BPG>=1)&&(ADP>=1))"))
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8221 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,677.411,3278108,1,0,4119,1.79911e+07,22,3293,1128,2.19787e+07,1992
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F((F("((NADPH>=1)&&(GSSG>=1))"))&&("((NADPH<1)||(GSSG<1))"))))
Formula 7 simplified : !F("((NADPH<1)||(GSSG<1))" & F"((NADPH>=1)&&(GSSG>=1))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
157 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,678.976,3278108,1,0,4119,1.79911e+07,36,3293,1384,2.19787e+07,2444
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C1000N0000000010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F(G("(((NADPplus>=2)&&(G6P>=1))&&(b2>=1))")))||(X((G("(_3PG<1)"))&&("(_3PG>=1)")))))
Formula 8 simplified : !(FG"(((NADPplus>=2)&&(G6P>=1))&&(b2>=1))" | X("(_3PG>=1)" & G"(_3PG<1)"))
Computing Next relation with stutter on 4 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
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-C1000N0000000010"
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-C1000N0000000010, 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-158922978100530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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 '
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 ;