About the Execution of ITS-Tools for SwimmingPool-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.620 | 1536028.00 | 1575059.00 | 295.20 | FTTTTTTFFTFFFFFF | normal |
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-159033388500250.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 SwimmingPool-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033388500250
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.2K Apr 12 18:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 18:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.2K Apr 10 21:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 21:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:50 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
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-02-00
FORMULA_NAME SwimmingPool-PT-02-01
FORMULA_NAME SwimmingPool-PT-02-02
FORMULA_NAME SwimmingPool-PT-02-03
FORMULA_NAME SwimmingPool-PT-02-04
FORMULA_NAME SwimmingPool-PT-02-05
FORMULA_NAME SwimmingPool-PT-02-06
FORMULA_NAME SwimmingPool-PT-02-07
FORMULA_NAME SwimmingPool-PT-02-08
FORMULA_NAME SwimmingPool-PT-02-09
FORMULA_NAME SwimmingPool-PT-02-10
FORMULA_NAME SwimmingPool-PT-02-11
FORMULA_NAME SwimmingPool-PT-02-12
FORMULA_NAME SwimmingPool-PT-02-13
FORMULA_NAME SwimmingPool-PT-02-14
FORMULA_NAME SwimmingPool-PT-02-15
=== Now, execution of the tool begins
BK_START 1590498049826
[2020-05-26 13:00:52] [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 13:00:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 13:00:53] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-05-26 13:00:53] [INFO ] Transformed 9 places.
[2020-05-26 13:00:53] [INFO ] Transformed 7 transitions.
[2020-05-26 13:00:53] [INFO ] Parsed PT model containing 9 places and 7 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 146 steps, including 0 resets, run visited all 20 properties in 2 ms. (steps per millisecond=73 )
[2020-05-26 13:00:53] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-26 13:00:53] [INFO ] Flatten gal took : 68 ms
FORMULA SwimmingPool-PT-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-02-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 13:00:53] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2020-05-26 13:00:53] [INFO ] Applying decomposition
[2020-05-26 13:00:53] [INFO ] Flatten gal took : 2 ms
Built C files in :
/home/mcc/execution
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/graph5871937897462898599.txt, -o, /tmp/graph5871937897462898599.bin, -w, /tmp/graph5871937897462898599.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/graph5871937897462898599.bin, -l, -1, -v, -w, /tmp/graph5871937897462898599.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 13:00:53] [INFO ] Decomposing Gal with order
[2020-05-26 13:00:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 13:00:53] [INFO ] Input system was already deterministic with 7 transitions.
[2020-05-26 13:00:53] [INFO ] Flatten gal took : 45 ms
[2020-05-26 13:00:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-26 13:00:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-26 13:00:53] [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]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 7 rows 9 cols
[2020-05-26 13:00:53] [INFO ] Computed 3 place invariants in 3 ms
inv : Undress + InBath + Dress + Bags = 30
inv : WaitBag + Undress + Dress + Dressed + Cabins = 20
inv : Entered + WaitBag + Undress + InBath + Dress + Dressed + Out = 40
Total of 3 invariants.
[2020-05-26 13:00:53] [INFO ] Computed 3 place invariants in 6 ms
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 12 LTL properties
Checking formula 0 : !((X(X(G((X((X(X("((u0.Entered>=1)&&(u2.Cabins>=1))")))&&("(u1.Undress>=1)")))||("(u2.Dress>=1)"))))))
Formula 0 simplified : !XXG("(u2.Dress>=1)" | X("(u1.Undress>=1)" & XX"((u0.Entered>=1)&&(u2.Cabins>=1))"))
built 3 ordering constraints for composite.
[2020-05-26 13:00:54] [INFO ] Proved 9 variables to be positive in 320 ms
[2020-05-26 13:00:54] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2020-05-26 13:00:54] [INFO ] Computation of disable matrix completed :0/7 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:00:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:00:54] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2020-05-26 13:00:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:00:56] [INFO ] Computing symmetric co enabling matrix : 7 transitions.
[2020-05-26 13:00:56] [INFO ] Computation of Finished co-enabling matrix. took 281 ms. Total solver calls (SAT/UNSAT): 21(21/0)
[2020-05-26 13:00:56] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2020-05-26 13:00:56] [INFO ] Computation of Completed DNA matrix. took 216 ms. Total solver calls (SAT/UNSAT): 12(0/12)
[2020-05-26 13:00:56] [INFO ] Built C files in 3352ms 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 377 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 50 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(X([](( X(( X(X((LTLAP0==true))) ) && ( (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, X(X([](( X(( X(X((LTLAP0==true))) ) && ( (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, X(X([](( X(( X(X((LTLAP0==true))) ) && ( (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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-26 13:20:53] [INFO ] Flatten gal took : 3 ms
[2020-05-26 13:20:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-26 13:20:53] [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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 12 LTL properties
Checking formula 0 : !((X(X(G((X((X(X("((Entered>=1)&&(Cabins>=1))")))&&("(Undress>=1)")))||("(Dress>=1)"))))))
Formula 0 simplified : !XXG("(Dress>=1)" | X("(Undress>=1)" & XX"((Entered>=1)&&(Cabins>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
2325 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,23.2694,299512,1,0,13,1.49101e+06,24,0,439,1.65896e+06,35
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(((X((!(("((WaitBag>=1)&&(Bags>=1))")U("(Undress>=1)")))U("(Dress>=1)")))||(G(X("(Dressed>=1)"))))||("((WaitBag>=1)&&(Bags>=1))"))))
Formula 1 simplified : !F("((WaitBag>=1)&&(Bags>=1))" | X(!("((WaitBag>=1)&&(Bags>=1))" U "(Undress>=1)") U "(Dress>=1)") | GX"(Dressed>=1)")
83 unique states visited
0 strongly connected components in search stack
82 transitions explored
42 items max in DFS search stack
3 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,23.2928,300160,1,0,206,1.49195e+06,43,78,452,1.66077e+06,591
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F("(Dress>=1)"))||((G("((((Entered>=1)&&(Cabins>=1))||((InBath>=1)&&(Cabins>=1)))||(Undress<1))"))&&(X("(Undress>=1)")))))
Formula 2 simplified : !(F"(Dress>=1)" | (G"((((Entered>=1)&&(Cabins>=1))||((InBath>=1)&&(Cabins>=1)))||(Undress<1))" & X"(Undress>=1)"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3340 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,56.7036,716444,1,0,896,3.05931e+06,68,218,478,3.73336e+06,1990
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X((((G("(Dressed>=1)"))U(G("((Entered>=1)&&(Cabins>=1))")))||(X(X("((Entered>=1)&&(Cabins>=1))"))))||("((Entered>=1)&&(Cabins>=1))"))))
Formula 3 simplified : !X("((Entered>=1)&&(Cabins>=1))" | (G"(Dressed>=1)" U G"((Entered>=1)&&(Cabins>=1))") | XX"((Entered>=1)&&(Cabins>=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,56.7081,717356,1,0,896,3.05931e+06,76,218,482,3.73336e+06,1994
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((((F("((Entered>=1)&&(Cabins>=1))"))||("(Entered<1)"))||("(Cabins<1)"))||("(Dressed<1)"))))
Formula 4 simplified : !G("(Cabins<1)" | "(Dressed<1)" | "(Entered<1)" | F"((Entered>=1)&&(Cabins>=1))")
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
11 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,56.8225,721740,1,0,896,3.0717e+06,87,218,488,3.74153e+06,1998
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((("(Out>=1)")U(F(("((Entered<1)||(Cabins<1))")U("((WaitBag>=1)&&(Bags>=1))"))))&&(G(X(G("((Entered>=1)&&(Cabins>=1))"))))))
Formula 5 simplified : !(("(Out>=1)" U F("((Entered<1)||(Cabins<1))" U "((WaitBag>=1)&&(Bags>=1))")) & GXG"((Entered>=1)&&(Cabins>=1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
6638 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,123.203,1721956,1,0,1215,8.02935e+06,100,372,494,9.60759e+06,2880
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((G(("((WaitBag>=1)&&(Bags>=1))")U("(Out>=1)")))&&(G(X("((InBath>=1)&&(Cabins>=1))")))))
Formula 6 simplified : !(G("((WaitBag>=1)&&(Bags>=1))" U "(Out>=1)") & GX"((InBath>=1)&&(Cabins>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8126 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,204.465,2213164,1,0,1400,9.96078e+06,34,483,388,1.21835e+07,456
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((X((G("(Out>=1)"))U((X("((Entered>=1)&&(Cabins>=1))"))||((("(Out>=1)")U("((Entered>=1)&&(Cabins>=1))"))&&("(Out>=1)")))))U(G("(Dress>=1)"))))
Formula 7 simplified : !(X(G"(Out>=1)" U (X"((Entered>=1)&&(Cabins>=1))" | ("(Out>=1)" & ("(Out>=1)" U "((Entered>=1)&&(Cabins>=1))")))) U G"(Dress>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1144 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,215.91,2213164,1,0,1400,9.96078e+06,41,483,413,1.21835e+07,479
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F("(((InBath>=1)&&(Cabins>=1))||(Out>=1))"))&&(X(G("(Out>=1)")))))
Formula 8 simplified : !(F"(((InBath>=1)&&(Cabins>=1))||(Out>=1))" & XG"(Out>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4094 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,256.847,2213164,1,0,1400,9.96078e+06,49,483,415,1.21835e+07,1474
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((G("(((WaitBag>=1)&&(Bags>=1))||((InBath>=1)&&(Cabins>=1)))"))||(X(G("((Entered>=1)&&(Cabins>=1))")))))
Formula 9 simplified : !(G"(((WaitBag>=1)&&(Bags>=1))||((InBath>=1)&&(Cabins>=1)))" | XG"((Entered>=1)&&(Cabins>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
3931 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,296.163,2213236,1,0,1400,9.96078e+06,59,483,420,1.21835e+07,2461
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(!(G((("((InBath>=1)&&(Cabins>=1))")U("(Undress>=1)"))U((!(G(F("(((WaitBag>=1)&&(Bags>=1))&&(Undress>=1))"))))U("((InBath>=1)&&(Cabins>=1))")))))))
Formula 10 simplified : !F!G(("((InBath>=1)&&(Cabins>=1))" U "(Undress>=1)") U (!GF"(((WaitBag>=1)&&(Bags>=1))&&(Undress>=1))" U "((InBath>=1)&&(Cabins>=1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1355 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,309.71,2241572,1,0,1652,1.03169e+07,86,626,432,1.21835e+07,4065
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(X(G(X(G(((!(X(G("((WaitBag>=1)&&(Bags>=1))"))))&&("(InBath>=1)"))&&("(Cabins>=1)"))))))))
Formula 11 simplified : !FXGXG("(Cabins>=1)" & "(InBath>=1)" & !XG"((WaitBag>=1)&&(Bags>=1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
394 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,313.652,2305656,1,0,1654,1.05986e+07,94,626,435,1.23776e+07,4072
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SwimmingPool-PT-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1590499585854
--------------------
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="SwimmingPool-PT-02"
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 SwimmingPool-PT-02, 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-159033388500250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-02.tgz
mv SwimmingPool-PT-02 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 ;