fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r156-oct2-158972913600130
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Ring-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.110 127918.00 155071.00 126.20 FFFFFFFTFFTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972913600130.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Ring-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913600130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 47K Mar 24 05:38 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 Ring-PT-none-00
FORMULA_NAME Ring-PT-none-01
FORMULA_NAME Ring-PT-none-02
FORMULA_NAME Ring-PT-none-03
FORMULA_NAME Ring-PT-none-04
FORMULA_NAME Ring-PT-none-05
FORMULA_NAME Ring-PT-none-06
FORMULA_NAME Ring-PT-none-07
FORMULA_NAME Ring-PT-none-08
FORMULA_NAME Ring-PT-none-09
FORMULA_NAME Ring-PT-none-10
FORMULA_NAME Ring-PT-none-11
FORMULA_NAME Ring-PT-none-12
FORMULA_NAME Ring-PT-none-13
FORMULA_NAME Ring-PT-none-14
FORMULA_NAME Ring-PT-none-15

=== Now, execution of the tool begins

BK_START 1589877905973

[2020-05-19 08:45:08] [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-19 08:45:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 08:45:08] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-19 08:45:08] [INFO ] Transformed 139 places.
[2020-05-19 08:45:08] [INFO ] Transformed 87 transitions.
[2020-05-19 08:45:08] [INFO ] Found NUPN structural information;
[2020-05-19 08:45:08] [INFO ] Parsed PT model containing 139 places and 87 transitions in 83 ms.
Reduce places removed 6 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2936 steps, including 0 resets, run visited all 44 properties in 25 ms. (steps per millisecond=117 )
[2020-05-19 08:45:08] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 08:45:08] [INFO ] Flatten gal took : 39 ms
FORMULA Ring-PT-none-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Ring-PT-none-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 08:45:08] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 08:45:08] [INFO ] Applying decomposition
[2020-05-19 08:45:08] [INFO ] Flatten gal took : 60 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/graph14153790813762360724.txt, -o, /tmp/graph14153790813762360724.bin, -w, /tmp/graph14153790813762360724.weights], workingDir=null]
[2020-05-19 08:45:09] [INFO ] Input system was already deterministic with 87 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph14153790813762360724.bin, -l, -1, -v, -w, /tmp/graph14153790813762360724.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 08:45:09] [INFO ] Decomposing Gal with order
[2020-05-19 08:45:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 08:45:09] [INFO ] Removed a total of 28 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 87 rows 133 cols
[2020-05-19 08:45:09] [INFO ] Computed 58 place invariants in 17 ms
inv : P117 + P68 + P77 + P78 = 1
inv : P100 + P104 + P128 - P50 - P60 + P99 = 0
inv : P113 + P4 + P5 = 1
inv : P101 + P102 + P103 + P26 = 1
inv : P25 + P26 + P61 = 1
inv : P10 + P7 = 1
inv : P106 + P45 + P58 = 1
inv : P2 + P3 + P57 = 1
inv : P109 + P17 + P24 + P42 = 1
inv : P44 + P46 + P60 = 1
inv : P100 + P102 + P94 + P95 = 1
inv : P105 + P129 + P50 + P95 + P96 = 1
inv : P59 + P8 + P9 = 1
inv : P111 + P130 + P42 + P43 + P8 = 1
inv : P31 + P85 = 1
inv : P47 + P48 + P58 = 1
inv : P119 + P72 = 1
inv : P38 + P67 + P70 = 1
inv : P110 + P122 + P135 + P3 + P78 = 1
inv : P11 + P12 + P120 + P97 = 1
inv : P136 + P18 = 1
inv : P127 + P88 = 1
inv : P76 + P80 - P82 - P83 = 0
inv : P115 + P87 = 1
inv : P108 + P109 + P112 + P131 + P9 = 1
inv : P30 + P40 = 1
inv : P6 + P63 = 1
inv : P75 + P79 + P80 = 1
inv : P49 + P50 + P60 = 1
inv : P107 + P45 + P46 = 1
inv : P103 + P126 = 1
inv : P108 + P109 + P111 + P112 + P138 + P16 + P17 + P18 + P27 + P42 + P43 + P48 + P8 + P9 = 1
inv : P56 + P82 + P83 = 1
inv : P51 + P62 = 1
inv : P32 + P34 + P35 + P54 + P66 + P73 = 1
inv : P132 + P16 + P17 + P18 + P27 + P48 = 1
inv : P52 + P53 = 1
inv : P121 + P133 + P72 + P77 + P83 = 1
inv : P37 + P66 = 1
inv : P110 + P121 + P122 + P123 + P137 + P3 + P68 + P71 + P72 + P77 + P78 + P82 + P83 = 1
inv : P61 + P74 + P79 = 1
inv : P14 + P20 + P23 = 1
inv : P114 + P4 + P57 = 1
inv : P21 + P97 = 1
inv : P41 + P89 + P90 = 1
inv : P41 + P91 + P93 = 1
inv : P1 + P5 - P8 - P9 = 0
inv : P84 + P86 = 1
inv : P110 + P116 = 1
inv : P19 + P28 + P30 + P55 = 1
inv : P125 + P33 = 1
inv : P100 + P102 + P103 + P104 + P105 + P139 + P26 - P60 + P95 + P96 + P99 = 0
inv : P124 + P27 = 1
inv : P38 + P39 + P65 = 1
inv : P118 + P71 = 1
inv : P123 + P134 + P68 + P71 + P82 = 1
inv : P64 + P81 = 1
inv : P14 + P15 + P98 = 1
Total of 58 invariants.
[2020-05-19 08:45:09] [INFO ] Computed 58 place invariants in 19 ms
[2020-05-19 08:45:09] [INFO ] Flatten gal took : 109 ms
[2020-05-19 08:45:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-19 08:45:09] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-19 08:45:09] [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], 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 : !((!(X(G(("(i6.i1.u45.P14==1)")U("((i7.u42.P91==1)&&(i7.u43.P94==1))"))))))
Formula 0 simplified : XG("(i6.i1.u45.P14==1)" U "((i7.u42.P91==1)&&(i7.u43.P94==1))")
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 14 ordering constraints for composite.
built 3 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
21 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,0.235512,26544,1,0,24891,840,1416,39727,376,1674,37438
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Ring-PT-none-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X("((i7.u43.P94==1)&&(i7.u44.P96==1))"))U("((i7.u44.P129==1)&&(i7.u44.P139==1))"))))
Formula 1 simplified : !G(X"((i7.u43.P94==1)&&(i7.u44.P96==1))" U "((i7.u44.P129==1)&&(i7.u44.P139==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
9 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,0.325794,30600,1,0,33720,894,1541,52605,384,1829,51980
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Ring-PT-none-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((("((i7.u43.P94==1)&&(i7.u44.P96==1))")U("(((i1.i1.u36.P75==1)&&(i1.i1.u36.P76==1))||((i3.i2.u25.P104==1)&&(i3.i2.u25.P60==1)))"))||(X(F(G("((i7.u43.P100==1)&&(i7.u42.P91==1))")))))))
Formula 2 simplified : !X(("((i7.u43.P94==1)&&(i7.u44.P96==1))" U "(((i1.i1.u36.P75==1)&&(i1.i1.u36.P76==1))||((i3.i2.u25.P104==1)&&(i3.i2.u25.P60==1)))") | XFG"((i7.u43.P100==1)&&(i7.u42.P91==1))")
[2020-05-19 08:45:09] [INFO ] Proved 133 variables to be positive in 542 ms
[2020-05-19 08:45:09] [INFO ] Computing symmetric may disable matrix : 87 transitions.
[2020-05-19 08:45:09] [INFO ] Computation of disable matrix completed :0/87 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 08:45:09] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 08:45:09] [INFO ] Computing symmetric may enable matrix : 87 transitions.
[2020-05-19 08:45:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 08:45:11] [INFO ] Computing symmetric co enabling matrix : 87 transitions.
[2020-05-19 08:45:12] [INFO ] Computation of co-enabling matrix(9/87) took 1266 ms. Total solver calls (SAT/UNSAT): 104(10/94)
[2020-05-19 08:45:15] [INFO ] Computation of co-enabling matrix(42/87) took 4314 ms. Total solver calls (SAT/UNSAT): 304(25/279)
[2020-05-19 08:45:18] [INFO ] Computation of Finished co-enabling matrix. took 7296 ms. Total solver calls (SAT/UNSAT): 470(64/406)
[2020-05-19 08:45:18] [INFO ] Computing Do-Not-Accords matrix : 87 transitions.
[2020-05-19 08:45:18] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 15(0/15)
[2020-05-19 08:45:18] [INFO ] Built C files in 9993ms 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 1194 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(( ((LTLAP2==true))U((LTLAP4==true))) || ( X(<>([]((LTLAP5==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(( ((LTLAP2==true))U((LTLAP4==true))) || ( X(<>([]((LTLAP5==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(( ((LTLAP2==true))U((LTLAP4==true))) || ( X(<>([]((LTLAP5==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)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6561 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,65.9419,784100,1,0,1.53736e+06,960,1657,1.94631e+06,390,2476,798728
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Ring-PT-none-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(((F(G(F("(((i3.i2.u1.P45==1)&&(i3.i2.u1.P47==1))&&(i3.i2.u26.P62==1))"))))U((X("(((i7.u43.P102==1)&&(i1.i1.u10.P126==1))&&(i7.u42.P91==1))"))||("(((i7.u43.P102==1)&&(i1.i1.u10.P126==1))&&(i7.u42.P91==1))")))&&(X("(((i0.i0.u4.P2==1)&&(i0.i0.u0.P4==1))&&(i4.u29.P63==1))")))))
Formula 3 simplified : !F((FGF"(((i3.i2.u1.P45==1)&&(i3.i2.u1.P47==1))&&(i3.i2.u26.P62==1))" U ("(((i7.u43.P102==1)&&(i1.i1.u10.P126==1))&&(i7.u42.P91==1))" | X"(((i7.u43.P102==1)&&(i1.i1.u10.P126==1))&&(i7.u42.P91==1))")) & X"(((i0.i0.u4.P2==1)&&(i0.i0.u0.P4==1))&&(i4.u29.P63==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3764 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,103.574,1620788,1,0,3.16901e+06,965,1774,5.53371e+06,393,2704,2052561
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Ring-PT-none-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(X("((i6.i0.u40.P115==1)&&(i1.i1.u38.P84==1))")))||(("((i6.i0.u40.P115==1)&&(i1.i1.u38.P84==1))")U(G((((G("(((i3.i2.u25.P46==1)&&(i3.i2.u25.P50==1))&&(i3.i0.u27.P53==1))"))&&("(i6.i0.u40.P115==1)"))&&("(i1.i1.u38.P84==1)"))||("(((i3.i2.u25.P46==1)&&(i3.i2.u25.P50==1))&&(i3.i0.u27.P53==1))"))))))
Formula 4 simplified : !(FX"((i6.i0.u40.P115==1)&&(i1.i1.u38.P84==1))" | ("((i6.i0.u40.P115==1)&&(i1.i1.u38.P84==1))" U G("(((i3.i2.u25.P46==1)&&(i3.i2.u25.P50==1))&&(i3.i0.u27.P53==1))" | ("(i1.i1.u38.P84==1)" & "(i6.i0.u40.P115==1)" & G"(((i3.i2.u25.P46==1)&&(i3.i2.u25.P50==1))&&(i3.i0.u27.P53==1))"))))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
148 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,105.059,1654776,1,0,3.24436e+06,966,1829,5.6689e+06,396,2715,2132231
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Ring-PT-none-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(((G(X(G("((((((i7.u43.P102==1)&&(i1.i1.u10.P126==1))&&(i7.u42.P91==1))&&(i3.i2.u1.P45==1))&&(i3.i2.u1.P48==1))&&(i3.i0.u27.P53==1))"))))&&("(((i3.i2.u1.P45!=1)||(i3.i2.u1.P48!=1))||(i3.i0.u27.P53!=1))"))||("((((i3.i2.u1.P45==1)&&(i3.i2.u1.P48==1))&&(i3.i0.u27.P53==1))&&((i1.i1.u37.P56!=1)||(i1.i1.u34.P72!=1)))"))))
Formula 5 simplified : !G("((((i3.i2.u1.P45==1)&&(i3.i2.u1.P48==1))&&(i3.i0.u27.P53==1))&&((i1.i1.u37.P56!=1)||(i1.i1.u34.P72!=1)))" | ("(((i3.i2.u1.P45!=1)||(i3.i2.u1.P48!=1))||(i3.i0.u27.P53!=1))" & GXG"((((((i7.u43.P102==1)&&(i1.i1.u10.P126==1))&&(i7.u42.P91==1))&&(i3.i2.u1.P45==1))&&(i3.i2.u1.P48==1))&&(i3.i0.u27.P53==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 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,105.064,1655228,1,0,3.24442e+06,966,1947,5.66896e+06,400,2715,2132434
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Ring-PT-none-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F((X((X(X(G(("((i7.u43.P100==1)&&(i7.u42.P91==1))")U("((i0.i0.u4.P57==1)&&(i1.i0.u11.P88==1))")))))||(G("(i4.u41.P41==1)"))))||(G("(i4.u41.P41==1)"))))))
Formula 6 simplified : F(G"(i4.u41.P41==1)" | X(XXG("((i7.u43.P100==1)&&(i7.u42.P91==1))" U "((i0.i0.u4.P57==1)&&(i1.i0.u11.P88==1))") | G"(i4.u41.P41==1)"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,105.069,1655480,1,0,3.24463e+06,966,1972,5.66916e+06,400,2715,2132818
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Ring-PT-none-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("((i6.i0.u3.P12==1)&&(i6.i1.u18.P21==1))")))
Formula 7 simplified : !F"((i6.i0.u3.P12==1)&&(i6.i1.u18.P21==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 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,105.072,1655480,1,0,3.24483e+06,966,1995,5.66964e+06,400,2715,2133287
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Ring-PT-none-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G("(((i3.i2.u25.P46!=1)||(i3.i2.u25.P50!=1))||(i3.i0.u27.P53!=1))"))))
Formula 8 simplified : !XG"(((i3.i2.u25.P46!=1)||(i3.i2.u25.P50!=1))||(i3.i0.u27.P53!=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
64 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,105.723,1671240,1,0,3.28199e+06,966,2032,5.74554e+06,401,2718,2177246
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Ring-PT-none-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(!(X(F(X("((i3.i0.u9.P125!=1)||(i3.i0.u27.P52!=1))"))))))U(("((i0.i0.u0.P113!=1)||(i0.i0.u0.P114!=1))")&&((X("((i3.i0.u9.P125==1)&&(i3.i0.u27.P52==1))"))||("(((i0.i0.u4.P2==1)&&(i0.i0.u0.P4==1))&&(i4.u29.P63==1))")))))
Formula 9 simplified : !(X!XFX"((i3.i0.u9.P125!=1)||(i3.i0.u27.P52!=1))" U ("((i0.i0.u0.P113!=1)||(i0.i0.u0.P114!=1))" & ("(((i0.i0.u4.P2==1)&&(i0.i0.u0.P4==1))&&(i4.u29.P63==1))" | X"((i3.i0.u9.P125==1)&&(i3.i0.u27.P52==1))")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
549 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,111.219,1739196,1,0,3.44288e+06,966,2107,5.95695e+06,407,2726,2383302
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Ring-PT-none-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(!(X(X((X(G("((i7.u44.P129==1)&&(i7.u44.P139==1))")))U(!(("(((i0.i0.u5.P116==1)&&(i2.i1.u33.P70==1))&&(i2.i0.u6.P78==1))")U("((i3.i2.u1.P106==1)&&(i3.i2.u1.P107==1))"))))))))&&(G("((i7.u44.P129==1)&&(i7.u44.P139==1))"))))
Formula 10 simplified : !(G"((i7.u44.P129==1)&&(i7.u44.P139==1))" & F!XX(XG"((i7.u44.P129==1)&&(i7.u44.P139==1))" U !("(((i0.i0.u5.P116==1)&&(i2.i1.u33.P70==1))&&(i2.i0.u6.P78==1))" U "((i3.i2.u1.P106==1)&&(i3.i2.u1.P107==1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 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,111.272,1740208,1,0,3.44535e+06,975,2115,5.95921e+06,407,2773,2387464
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Ring-PT-none-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(G(X((X("((i2.i1.u31.P65!=1)||(i2.i1.u33.P67!=1))"))&&("(((i1.i1.u36.P80!=1)||(i1.i1.u37.P82!=1))||(i1.i1.u38.P86!=1))"))))))
Formula 11 simplified : GX("(((i1.i1.u36.P80!=1)||(i1.i1.u37.P82!=1))||(i1.i1.u38.P86!=1))" & X"((i2.i1.u31.P65!=1)||(i2.i1.u33.P67!=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
138 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,112.649,1786408,1,0,3.55882e+06,975,2183,6.15088e+06,408,2793,2505449
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Ring-PT-none-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G(!(X("(((i0.i0.u4.P2==1)&&(i0.i0.u0.P4==1))&&(i4.u29.P63==1))"))))&&(X("((i6.i0.u40.P120==1)&&(i6.i0.u40.P87==1))"))))
Formula 12 simplified : !(G!X"(((i0.i0.u4.P2==1)&&(i0.i0.u0.P4==1))&&(i4.u29.P63==1))" & X"((i6.i0.u40.P120==1)&&(i6.i0.u40.P87==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,112.654,1786936,1,0,3.55882e+06,975,2207,6.15088e+06,411,2793,2505476
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Ring-PT-none-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589878033891

--------------------
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="Ring-PT-none"
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 Ring-PT-none, 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 r156-oct2-158972913600130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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