fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r181kn-smll-146444110500168
Last Updated
June 30, 2016

About the Execution of ITS-Tools for S_Raft-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2502.640 141078.00 148519.00 680.30 TFFFFFFFFFTFFFFF 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_Raft-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444110500168
=====================================================================


--------------------
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 Raft-PT-05-LTLFireability-0
FORMULA_NAME Raft-PT-05-LTLFireability-1
FORMULA_NAME Raft-PT-05-LTLFireability-10
FORMULA_NAME Raft-PT-05-LTLFireability-11
FORMULA_NAME Raft-PT-05-LTLFireability-12
FORMULA_NAME Raft-PT-05-LTLFireability-13
FORMULA_NAME Raft-PT-05-LTLFireability-14
FORMULA_NAME Raft-PT-05-LTLFireability-15
FORMULA_NAME Raft-PT-05-LTLFireability-2
FORMULA_NAME Raft-PT-05-LTLFireability-3
FORMULA_NAME Raft-PT-05-LTLFireability-4
FORMULA_NAME Raft-PT-05-LTLFireability-5
FORMULA_NAME Raft-PT-05-LTLFireability-6
FORMULA_NAME Raft-PT-05-LTLFireability-7
FORMULA_NAME Raft-PT-05-LTLFireability-8
FORMULA_NAME Raft-PT-05-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464474586811


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(("p120>=1")&&("p99>=1")))U(F(F(X(("p115>=1")&&("p55>=1")))))))
Formula 0 simplified : !(G("p99>=1" & "p120>=1") U FX("p55>=1" & "p115>=1"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
852 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,8.59089,130016,1,0,382,607034,457,159,5084,415730,440
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Raft-PT-05-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(X(F(("p103>=1")U(("p110>=1")&&("p128>=1")))))))
Formula 1 simplified : !FXF("p103>=1" U ("p110>=1" & "p128>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3377 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,42.3644,817248,1,0,471,3.23022e+06,470,206,5089,4.74595e+06,685
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(F((X(("p110>=1")&&("p30>=1")))U(F(("p125>=1")&&("p90>=1")))))))
Formula 2 simplified : !GF(X("p30>=1" & "p110>=1") U F("p90>=1" & "p125>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
503 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,47.3926,898052,1,0,474,3.50264e+06,487,206,5241,5.09851e+06,710
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((F(("p120>=1")&&("p97>=1")))U(("p105>=1")&&("p20>=1"))))
Formula 3 simplified : !(F("p97>=1" & "p120>=1") U ("p20>=1" & "p105>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1739 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,64.7828,1192256,1,0,560,4.73122e+06,514,248,5259,6.85246e+06,942
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(F(F(("p110>=1")&&("p35>=1"))))))
Formula 4 simplified : !F("p35>=1" & "p110>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,64.7847,1192532,1,0,561,4.73122e+06,526,250,5263,6.85247e+06,950
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Raft-PT-05-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((("p125>=1")&&("p85>=1")))
Formula 5 simplified : !("p85>=1" & "p125>=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,64.7865,1192532,1,0,561,4.73125e+06,534,250,5267,6.85252e+06,958
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(("p123>=1")&&("p132>=1"))))
Formula 6 simplified : !X("p123>=1" & "p132>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
25 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.0313,1197248,1,0,561,4.75439e+06,542,250,5272,6.87546e+06,962
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(X(G((("p120>=1")&&("p53>=1"))U("p103>=1"))))))
Formula 7 simplified : !XXG(("p53>=1" & "p120>=1") U "p103>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2236 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,87.3993,1652344,1,0,660,6.58452e+06,565,296,5289,9.78279e+06,1203
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("p105>=1")&&("p15>=1")))
Formula 8 simplified : !("p15>=1" & "p105>=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,87.4003,1652604,1,0,660,6.58452e+06,571,296,5293,9.78279e+06,1205
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("p105>=1")&&("p64>=1")))
Formula 9 simplified : !("p64>=1" & "p105>=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,87.4012,1652608,1,0,660,6.58452e+06,577,296,5297,9.78279e+06,1207
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(X(X(G(("p125>=1")&&("p37>=1")))))))
Formula 10 simplified : !XXXG("p37>=1" & "p125>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1322 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.62,1908236,1,0,784,7.72583e+06,588,338,5302,1.12072e+07,1425
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((((G("p120>=1"))U(X("p130>=1")))U(("p123>=1")&&("p132>=1"))))
Formula 11 simplified : !((G"p120>=1" U X"p130>=1") U ("p123>=1" & "p132>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
230 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,102.919,1954232,1,0,870,7.98551e+06,593,380,5304,1.1658e+07,1653
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X((X(F(("p120>=1")&&("p65>=1"))))U(G(F(("p125>=1")&&("p90>=1")))))))
Formula 12 simplified : !X(XF("p65>=1" & "p120>=1") U GF("p90>=1" & "p125>=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,102.921,1954932,1,0,870,7.98551e+06,593,380,5304,1.1658e+07,1653
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G("p125>=1"))))
Formula 13 simplified : !FG"p125>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
753 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,110.457,2122176,1,0,1124,8.66667e+06,604,474,5304,1.30441e+07,2112
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((("p105>=1")&&("p84>=1")))
Formula 14 simplified : !("p84>=1" & "p105>=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,110.458,2122436,1,0,1124,8.66667e+06,610,474,5308,1.30441e+07,2114
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G((F(X(("p115>=1")&&("p9>=1"))))U((("p120>=1")&&("p75>=1"))U(("p105>=1")&&("p20>=1"))))))
Formula 15 simplified : !G(FX("p9>=1" & "p115>=1") U (("p75>=1" & "p120>=1") U ("p20>=1" & "p105>=1")))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
72 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.184,2138500,1,0,1128,8.73323e+06,618,474,5314,1.31279e+07,2130
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464474727889

--------------------
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
May 28, 2016 10:29:50 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2016 10:29:50 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 73 ms
May 28, 2016 10:29:50 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 133 places.
May 28, 2016 10:29:51 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 238 transitions.
May 28, 2016 10:29:51 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 115 ms
May 28, 2016 10:29:51 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 20 ms
May 28, 2016 10:29:51 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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_Raft-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/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_Raft-PT-05.tgz
mv S_Raft-PT-05 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_Raft-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 r181kn-smll-146444110500168"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;