Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033388600322.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 TCPcondis-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033388600322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 2.6K Apr 12 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 12 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 20:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 05:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-05-00
FORMULA_NAME TCPcondis-PT-05-01
FORMULA_NAME TCPcondis-PT-05-02
FORMULA_NAME TCPcondis-PT-05-03
FORMULA_NAME TCPcondis-PT-05-04
FORMULA_NAME TCPcondis-PT-05-05
FORMULA_NAME TCPcondis-PT-05-06
FORMULA_NAME TCPcondis-PT-05-07
FORMULA_NAME TCPcondis-PT-05-08
FORMULA_NAME TCPcondis-PT-05-09
FORMULA_NAME TCPcondis-PT-05-10
FORMULA_NAME TCPcondis-PT-05-11
FORMULA_NAME TCPcondis-PT-05-12
FORMULA_NAME TCPcondis-PT-05-13
FORMULA_NAME TCPcondis-PT-05-14
FORMULA_NAME TCPcondis-PT-05-15

=== Now, execution of the tool begins

BK_START 1590504641774

[2020-05-26 14:50:44] [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-26 14:50:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 14:50:44] [WARNING] Skipping unknown tool specific annotation : Tina
[2020-05-26 14:50:44] [WARNING] Unknown XML tag in source file: size
[2020-05-26 14:50:44] [WARNING] Unknown XML tag in source file: color
[2020-05-26 14:50:44] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-05-26 14:50:44] [INFO ] Transformed 30 places.
[2020-05-26 14:50:44] [INFO ] Transformed 32 transitions.
[2020-05-26 14:50:44] [INFO ] Parsed PT model containing 30 places and 32 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 252 steps, including 0 resets, run visited all 36 properties in 5 ms. (steps per millisecond=50 )
[2020-05-26 14:50:44] [INFO ] Flatten gal took : 34 ms
[2020-05-26 14:50:44] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 14:50:44] [INFO ] Applying decomposition
[2020-05-26 14:50:44] [INFO ] Flatten gal took : 7 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/graph5219783181936738260.txt, -o, /tmp/graph5219783181936738260.bin, -w, /tmp/graph5219783181936738260.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/graph5219783181936738260.bin, -l, -1, -v, -w, /tmp/graph5219783181936738260.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 14:50:44] [INFO ] Input system was already deterministic with 32 transitions.
[2020-05-26 14:50:44] [INFO ] Decomposing Gal with order
[2020-05-26 14:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 14:50:44] [INFO ] Removed a total of 24 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 30 cols
[2020-05-26 14:50:44] [INFO ] Computed 9 place invariants in 5 ms
inv : SYNRCVD + xSYN - xSYNACK - xSYNSENT = 0
inv : ESTAB + FINWAIT1 + FINWAIT2 - xCLOSEWAIT - xESTAB - xFIN + xSYNACK - xSYNRCVD = 0
inv : SYNACK - SYNRCVD + xSYNACK - xSYNRCVD = 0
inv : CLOSEWAIT + ESTAB + FIN + xCLOSED + xCLOSEWAIT + xCLOSING + xLASTACK + xLISTEN + xSYNACK + xSYNSENT + xTIMEWAIT = 5
inv : xCLOSED + xCLOSEWAIT + xCLOSING + xESTAB + xFINWAIT1 + xFINWAIT2 + xLASTACK + xLISTEN + xSYNRCVD + xSYNSENT + xTIMEWAIT = 5
inv : FINACK + xCLOSED + xCLOSEWAIT + xESTAB + xFIN + xFINWAIT2 + xLISTEN + xSYNRCVD + xSYNSENT + xTIMEWAIT = 5
inv : CLOSED + FINWAIT2 + LISTEN + SYN + TIMEWAIT - xCLOSED - xCLOSEWAIT - xCLOSING + xFINACK - xLASTACK - xLISTEN - xSYNSENT - xTIMEWAIT = 0
inv : CLOSED + FINWAIT2 + LISTEN + SYNRCVD + SYNSENT + TIMEWAIT - xCLOSED - xCLOSEWAIT - xCLOSING + xFINACK - xLASTACK - xLISTEN - xSYNACK - xSYNSENT - xTIMEWAIT = 0
inv : CLOSEWAIT + CLOSING - FINWAIT2 + LASTACK + xCLOSED + 2*xCLOSEWAIT + xCLOSING + xESTAB + xFIN - xFINACK + xLASTACK + xLISTEN + xSYNRCVD + xSYNSENT + xTIMEWAIT = 5
Total of 9 invariants.
[2020-05-26 14:50:44] [INFO ] Computed 9 place invariants in 11 ms
[2020-05-26 14:50:44] [INFO ] Flatten gal took : 69 ms
[2020-05-26 14:50:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-26 14:50:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-26 14:50:44] [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 16 LTL properties
Checking formula 0 : !((G((("(((u0.SYNSENT>=1)&&(u8.xSYN>=1))&&(i1.i1.u9.xSYNACK>=1))")U(!(X(G("((i1.i0.u2.FIN>=1)&&(i2.i0.u5.xESTAB>=1))")))))&&("(u8.xCLOSED>=1)"))))
Formula 0 simplified : !G("(u8.xCLOSED>=1)" & ("(((u0.SYNSENT>=1)&&(u8.xSYN>=1))&&(i1.i1.u9.xSYNACK>=1))" U !XG"((i1.i0.u2.FIN>=1)&&(i2.i0.u5.xESTAB>=1))"))
[2020-05-26 14:50:44] [INFO ] Proved 30 variables to be positive in 107 ms
[2020-05-26 14:50:44] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-26 14:50:44] [INFO ] Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 14:50:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 14:50:44] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2020-05-26 14:50:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-26 14:50:46] [INFO ] Computing symmetric co enabling matrix : 32 transitions.
Reverse transition relation is NOT exact ! Due to transitions raf2, xraf2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
[2020-05-26 14:50:47] [INFO ] Computation of co-enabling matrix(18/32) took 822 ms. Total solver calls (SAT/UNSAT): 341(341/0)
[2020-05-26 14:50:48] [INFO ] Computation of Finished co-enabling matrix. took 1161 ms. Total solver calls (SAT/UNSAT): 419(419/0)
[2020-05-26 14:50:48] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2020-05-26 14:50:49] [INFO ] Computation of Completed DNA matrix. took 896 ms. Total solver calls (SAT/UNSAT): 114(0/114)
[2020-05-26 14:50:49] [INFO ] Built C files in 4534ms 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 885 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 87 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](( ((LTLAP0==true))U(!( X([]((LTLAP1==true)))) ) ) && ( (LTLAP2==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, [](( ((LTLAP0==true))U(!( X([]((LTLAP1==true)))) ) ) && ( (LTLAP2==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, [](( ((LTLAP0==true))U(!( X([]((LTLAP1==true)))) ) ) && ( (LTLAP2==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)
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
561 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,5.63662,131048,1,0,122137,13665,643,738686,222,481962,154882
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(X((X((G("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT2>=1))"))U(F(("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT2>=1))")U("(i2.i1.u7.xCLOSEWAIT>=1)")))))&&("(i2.i0.u5.xESTAB>=1)"))))))
Formula 1 simplified : !FGX("(i2.i0.u5.xESTAB>=1)" & X(G"((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT2>=1))" U F("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT2>=1))" U "(i2.i1.u7.xCLOSEWAIT>=1)")))
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
122 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,6.86976,148104,1,0,139826,14224,663,851481,223,507679,182280
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G(((F("((i1.i0.u2.FIN>=1)&&(i2.i0.u5.xESTAB>=1))"))&&("(i1.i0.u2.FIN>=1)"))&&("(i2.i0.u6.xFINWAIT2>=1)")))U(X("((u0.SYN>=1)&&(u8.xSYNSENT>=1))")))U(((("((i1.i1.u9.SYNRCVD>=1)&&(i1.i1.u9.xSYNACK>=1))")U("((i1.i0.u2.FIN<1)||(i2.i0.u5.xESTAB<1))"))&&("(u0.SYN>=1)"))&&("(u8.xSYNSENT>=1)"))))
Formula 2 simplified : !((G("(i1.i0.u2.FIN>=1)" & "(i2.i0.u6.xFINWAIT2>=1)" & F"((i1.i0.u2.FIN>=1)&&(i2.i0.u5.xESTAB>=1))") U X"((u0.SYN>=1)&&(u8.xSYNSENT>=1))") U ("(u0.SYN>=1)" & "(u8.xSYNSENT>=1)" & ("((i1.i1.u9.SYNRCVD>=1)&&(i1.i1.u9.xSYNACK>=1))" U "((i1.i0.u2.FIN<1)||(i2.i0.u5.xESTAB<1))")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3878 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,45.7732,794400,1,0,726759,35572,725,5.30566e+06,228,2.68374e+06,633001
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X((F(G("(u0.LISTEN<1)")))||(F("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1))"))))))
Formula 3 simplified : !FX(FG"(u0.LISTEN<1)" | F"((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2332 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,69.0871,1063016,1,0,1.03741e+06,45620,756,6.93145e+06,228,2.88936e+06,938818
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((F((F("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))"))||("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))")))||(F("(u8.xLISTEN>=1)")))||(G("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))"))))
Formula 4 simplified : !(F("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))" | F"((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))") | F"(u8.xLISTEN>=1)" | G"((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1425 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,83.3357,1257320,1,0,1.18861e+06,48090,794,8.22672e+06,231,3.90596e+06,1086648
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!((X("((u0.CLOSED>=1)||((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1)))"))U((((!(X("((i1.i1.u4.FINWAIT1>=1)&&(i1.i0.u2.xFINACK>=1))")))&&("(i1.i0.u2.FIN>=1)"))&&("(i2.i0.u5.xESTAB>=1)"))U("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1))")))))
Formula 5 simplified : X"((u0.CLOSED>=1)||((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1)))" U (("(i1.i0.u2.FIN>=1)" & "(i2.i0.u5.xESTAB>=1)" & !X"((i1.i1.u4.FINWAIT1>=1)&&(i1.i0.u2.xFINACK>=1))") U "((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
802 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.3614,1362392,1,0,1.33305e+06,49714,861,8.68792e+06,231,3.97258e+06,1255867
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!(X(!(F("(((u0.LISTEN<1)||(u8.xSYN<1))||((i1.i1.u4.FINWAIT2>=1)&&(i2.i1.u3.xFIN>=1)))")))))))
Formula 6 simplified : !X!X!F"(((u0.LISTEN<1)||(u8.xSYN<1))||((i1.i1.u4.FINWAIT2>=1)&&(i2.i1.u3.xFIN>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
887 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,100.224,1492016,1,0,1.48645e+06,64675,880,9.3522e+06,231,4.55899e+06,1369663
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(G(F((G(F(G(F(G(X(F("((i1.i0.u1.LASTACK>=1)&&(i1.i0.u2.xFINACK>=1))"))))))))&&(F("(u0.CLOSED>=1)"))))))))
Formula 7 simplified : !G!GF(GFGFGXF"((i1.i0.u1.LASTACK>=1)&&(i1.i0.u2.xFINACK>=1))" & F"(u0.CLOSED>=1)")
99 unique states visited
3 strongly connected components in search stack
112 transitions explored
99 items max in DFS search stack
42906 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,529.287,4081908,1,0,3.93541e+06,130842,955,2.32885e+07,231,9.61686e+06,2875899
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(!(F(X(("((i1.i1.u4.FINWAIT2>=1)&&(i2.i1.u3.xFIN>=1))")U("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))")))))))
Formula 8 simplified : !G!FX("((i1.i1.u4.FINWAIT2>=1)&&(i2.i1.u3.xFIN>=1))" U "((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5004 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,579.333,4134972,1,0,3.98985e+06,131353,440,2.3539e+07,138,9.75904e+06,64277
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((!(F("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1))")))&&(F("(u0.CLOSED>=1)")))&&(!(X(G("(u0.CLOSED>=1)"))))))
Formula 9 simplified : !(!F"((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT1>=1))" & F"(u0.CLOSED>=1)" & !XG"(u0.CLOSED>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1062 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,589.949,4134972,1,0,3.98985e+06,131353,515,2.3539e+07,148,9.75904e+06,426244
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))"))U(X(!(G("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))"))))))
Formula 10 simplified : !(X"((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))" U X!G"((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,589.95,4134972,1,0,3.98985e+06,131353,542,2.3539e+07,149,9.75904e+06,426258
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA TCPcondis-PT-05-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((!(("(u8.xTIMEWAIT>=1)")U("((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))")))&&(G("((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT2>=1))")))))
Formula 11 simplified : !F(!("(u8.xTIMEWAIT>=1)" U "((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1))") & G"((i1.i0.u2.FIN>=1)&&(i2.i0.u6.xFINWAIT2>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1532 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,605.271,4134972,1,0,3.98985e+06,131353,591,2.3539e+07,150,9.75904e+06,629421
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(!(("((i1.i1.u9.SYNRCVD>=1)&&(i1.i1.u9.xSYNACK>=1))")U((G("((i2.i1.u3.FINACK>=1)&&(i2.i1.u7.xLASTACK>=1))"))U("(u0.TIMEWAIT>=1)"))))))
Formula 12 simplified : !G!("((i1.i1.u9.SYNRCVD>=1)&&(i1.i1.u9.xSYNACK>=1))" U (G"((i2.i1.u3.FINACK>=1)&&(i2.i1.u7.xLASTACK>=1))" U "(u0.TIMEWAIT>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
209 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,607.356,4134972,1,0,3.98985e+06,131353,617,2.3539e+07,150,9.75904e+06,708166
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G((("(i2.i0.u5.xESTAB>=1)")U(F(G((G("(i2.i0.u5.xESTAB<1)"))||("((i1.i1.u4.FINWAIT1>=1)&&(i1.i0.u2.xFINACK>=1))")))))U("((i1.i0.u2.FIN<1)||(i2.i0.u6.xFINWAIT1<1))"))))
Formula 13 simplified : !G(("(i2.i0.u5.xESTAB>=1)" U FG("((i1.i1.u4.FINWAIT1>=1)&&(i1.i0.u2.xFINACK>=1))" | G"(i2.i0.u5.xESTAB<1)")) U "((i1.i0.u2.FIN<1)||(i2.i0.u6.xFINWAIT1<1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
386 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,611.223,4134972,1,0,3.98985e+06,131353,658,2.3539e+07,151,9.75904e+06,847515
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F((X("((i1.i1.u4.FINWAIT1>=1)&&(i2.i1.u3.xFIN>=1))"))&&(F("((i1.i1.u9.SYNRCVD>=1)&&(i1.i1.u9.xSYNACK>=1))"))))&&(X((X("((u0.SYNSENT>=1)&&(u8.xSYN>=1))"))U("((u0.SYNSENT>=1)&&(u8.xSYN>=1))")))))
Formula 14 simplified : !(F(X"((i1.i1.u4.FINWAIT1>=1)&&(i2.i1.u3.xFIN>=1))" & F"((i1.i1.u9.SYNRCVD>=1)&&(i1.i1.u9.xSYNACK>=1))") & X(X"((u0.SYNSENT>=1)&&(u8.xSYN>=1))" U "((u0.SYNSENT>=1)&&(u8.xSYN>=1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
334 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,614.558,4134972,1,0,3.98985e+06,131353,696,2.3539e+07,154,9.75904e+06,967289
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((!(X((((((!(G("((u0.LISTEN>=1)&&(u8.xSYN>=1))")))&&("(i1.i1.u4.FINWAIT1>=1)"))&&("(i1.i0.u2.xFINACK>=1)"))&&("(i1.i1.u9.ESTAB>=1)"))&&("(i2.i1.u3.xFIN>=1)"))&&("((u0.LISTEN<1)||(u8.xSYN<1))"))))U("((u0.LISTEN>=1)&&(u8.xSYN>=1))")))
Formula 15 simplified : !(!X("((u0.LISTEN<1)||(u8.xSYN<1))" & "(i1.i0.u2.xFINACK>=1)" & "(i1.i1.u4.FINWAIT1>=1)" & "(i1.i1.u9.ESTAB>=1)" & "(i2.i1.u3.xFIN>=1)" & !G"((u0.LISTEN>=1)&&(u8.xSYN>=1))") U "((u0.LISTEN>=1)&&(u8.xSYN>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4423 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,658.798,4134972,1,0,3.98985e+06,131353,769,2.3539e+07,154,9.75904e+06,1477761
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA TCPcondis-PT-05-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590505317442

--------------------
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="TCPcondis-PT-05"
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 TCPcondis-PT-05, 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 r193-csrt-159033388600322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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