About the Execution of ITS-Tools for S_SwimmingPool-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
567.710 | 29993.00 | 39087.00 | 274.40 | TFFFFFFFFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
............
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_SwimmingPool-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193kn-qhx2-146444253600573
=====================================================================
--------------------
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-01-LTLFireability-0
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-1
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-15
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-2
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-3
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-4
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-5
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-6
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-7
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-8
FORMULA_NAME SwimmingPool-PT-01-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1464978820072
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((((G("Out>=1"))U(("WaitBag>=1")&&("Bags>=1")))U(F(("Cabins>=1")&&("InBath>=1")))))
Formula 0 simplified : !((G"Out>=1" U ("Bags>=1" & "WaitBag>=1")) U F("Cabins>=1" & "InBath>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.33678,36572,1,0,204,65523,25,42,311,62078,413
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((G("Dressed>=1"))U((("Entered>=1")&&("Cabins>=1"))U(("WaitBag>=1")&&("Bags>=1"))))))
Formula 1 simplified : !G(G"Dressed>=1" U (("Cabins>=1" & "Entered>=1") U ("Bags>=1" & "WaitBag>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
79 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,2.14072,47472,1,0,204,99658,81,42,365,108000,434
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(G("Out>=1"))))
Formula 2 simplified : !G"Out>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
531 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,7.44548,107448,1,0,378,382054,87,135,366,471919,918
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((("Dress>=1")U(X(("WaitBag>=1")&&("Bags>=1"))))U(X(G("Dressed>=1")))))
Formula 3 simplified : !(("Dress>=1" U X("Bags>=1" & "WaitBag>=1")) U XG"Dressed>=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,7.45439,107768,1,0,379,382096,110,135,381,471979,934
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X(X(G(F("Dress>=1")))))))
Formula 4 simplified : !XXXGF"Dress>=1"
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
435 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,11.8021,153176,1,0,542,599339,116,136,381,677659,1348
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(X("Undress>=1"))))
Formula 5 simplified : !XX"Undress>=1"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,11.8034,153180,1,0,542,599339,119,136,382,677661,1350
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((("Cabins>=1")&&("InBath>=1")))
Formula 6 simplified : !("Cabins>=1" & "InBath>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,11.8042,153304,1,0,542,599339,119,136,382,677661,1350
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("Undress>=1"))
Formula 7 simplified : !"Undress>=1"
3 unique states visited
3 strongly connected components in search stack
3 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,11.8046,153444,1,0,542,599339,119,136,382,677662,1352
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("WaitBag>=1")&&("Bags>=1")))
Formula 8 simplified : !("Bags>=1" & "WaitBag>=1")
3 unique states visited
3 strongly connected components in search stack
3 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,11.805,153444,1,0,542,599339,120,136,382,677662,1354
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("Dressed>=1")U(X((("WaitBag>=1")&&("Bags>=1"))U("Out>=1")))))
Formula 9 simplified : !("Dressed>=1" U X(("Bags>=1" & "WaitBag>=1") U "Out>=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,11.8063,153444,1,0,542,599339,134,136,393,677662,1362
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G((G(X("Undress>=1")))U(("Out>=1")U(("WaitBag>=1")&&("Bags>=1"))))))
Formula 10 simplified : !G(GX"Undress>=1" U ("Out>=1" U ("Bags>=1" & "WaitBag>=1")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
200 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,13.8075,175356,1,0,663,695030,140,176,395,816032,1577
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(("Out>=1")U(X(("WaitBag>=1")&&("Bags>=1")))))))
Formula 11 simplified : !GX("Out>=1" U X("Bags>=1" & "WaitBag>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
7 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,13.8773,175956,1,0,667,698151,140,176,395,818472,1589
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F((("Entered>=1")&&("Cabins>=1"))U(G(X("Dressed>=1"))))))
Formula 12 simplified : !F(("Cabins>=1" & "Entered>=1") U GX"Dressed>=1")
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
26 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,14.1433,178904,1,0,671,711315,142,178,395,835604,1603
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((X("Dressed>=1"))U(G(G("Out>=1"))))))
Formula 13 simplified : !X(X"Dressed>=1" U G"Out>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
68 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,14.8297,181476,1,0,678,719988,142,184,395,842982,1638
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G((X("Undress>=1"))U(("WaitBag>=1")&&("Bags>=1")))))
Formula 14 simplified : !G(X"Undress>=1" U ("Bags>=1" & "WaitBag>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,14.8541,181880,1,0,682,721280,142,184,395,844260,1650
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((((F("Dress>=1"))U(X("Dress>=1")))U(G(G(("Cabins>=1")&&("InBath>=1"))))))
Formula 15 simplified : !((F"Dress>=1" U X"Dress>=1") U G("Cabins>=1" & "InBath>=1"))
6 unique states visited
2 strongly connected components in search stack
7 transitions explored
4 items max in DFS search stack
611 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,20.9712,244880,1,0,1076,1.01175e+06,147,274,397,1.20209e+06,2458
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SwimmingPool-PT-01-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1464978850065
--------------------
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
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
Jun 03, 2016 6:33:44 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2016 6:33:44 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 29 ms
Jun 03, 2016 6:33:44 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 9 places.
Jun 03, 2016 6:33:45 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 7 transitions.
Jun 03, 2016 6:33:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
Jun 03, 2016 6:33:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 12 ms
Jun 03, 2016 6:33:45 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
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="S_SwimmingPool-PT-01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/fko/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
tar xzf /home/mcc/BenchKit/INPUTS/S_SwimmingPool-PT-01.tgz
mv S_SwimmingPool-PT-01 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_SwimmingPool-PT-01, 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 r193kn-qhx2-146444253600573"
echo "====================================================================="
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
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 ;