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 GPPP-PT-C0001N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217su-smll-146468018500447
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464761103624


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(G(X(("DHAP>=1")U("GAP>=1"))))))
Formula 0 simplified : !GX("DHAP>=1" U "GAP>=1")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
384 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,3.87586,85876,1,0,49,283365,77,26,1221,323655,77
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(((("E4P>=1")&&("Xu5P>=1"))U("FBP>=1"))U("DHAP>=1"))))
Formula 1 simplified : !G((("E4P>=1" & "Xu5P>=1") U "FBP>=1") U "DHAP>=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,3.88118,88344,1,0,50,283403,125,26,1265,323712,91
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F(F((("S7P>=1")&&("GAP>=1"))&&("c1>=7"))))U(("GAP>=1")U(G("GSH>=2")))))
Formula 2 simplified : !(F("GAP>=1" & "S7P>=1" & "c1>=7") U ("GAP>=1" U G"GSH>=2"))
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
13 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,4.00422,91488,1,0,54,298459,134,26,1268,342539,116
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(X((("E4P>=1")&&("Xu5P>=1"))U(F(("PEP>=1")&&("ADP>=1")))))))
Formula 3 simplified : !GX(("E4P>=1" & "Xu5P>=1") U F("ADP>=1" & "PEP>=1"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
57 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,4.5761,104792,1,0,223,368711,148,27,1273,416177,547
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((((("G6P>=1")&&("b1>=3"))U(F(("Xu5P>=1")&&("R5P>=1"))))U(F(X("_3PG>=1")))))
Formula 4 simplified : !((("G6P>=1" & "b1>=3") U F("R5P>=1" & "Xu5P>=1")) U FX"_3PG>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
78 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.36244,120400,1,0,387,438018,157,71,1274,520030,895
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G((X(G(("ADP>=1")&&("_1_3_BPG>=1"))))U(G(X(((("GAP>=1")&&("NADplus>=1"))&&("Pi>=1"))&&("c2>=1")))))))
Formula 5 simplified : !G(XG("ADP>=1" & "_1_3_BPG>=1") U GX("GAP>=1" & "NADplus>=1" & "Pi>=1" & "c2>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
17 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.54216,126340,1,0,409,462773,203,78,1321,556774,940
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(("Ru5P>=1")&&("a2>=1"))))
Formula 6 simplified : !X("Ru5P>=1" & "a2>=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,5.54488,126608,1,0,409,462883,211,78,1326,556949,944
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("FBP>=1"))
Formula 7 simplified : !"FBP>=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,5.54518,126608,1,0,409,462883,212,78,1326,556949,946
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("DHAP>=1"))
Formula 8 simplified : !"DHAP>=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,5.54547,126636,1,0,409,462883,213,78,1326,556949,948
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F("start>=1")))
Formula 9 simplified : !F"start>=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,5.54578,126640,1,0,409,462883,222,78,1327,556949,952
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(X(G(F(("ATP>=1")&&("Gluc>=1")))))))
Formula 10 simplified : !FXGF("ATP>=1" & "Gluc>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5 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.59254,127616,1,0,552,470184,236,79,1332,564518,1318
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((F(G(F("FBP>=1"))))U((F("GAP>=1"))U(F("FBP>=1")))))
Formula 11 simplified : !(FGF"FBP>=1" U (F"GAP>=1" U F"FBP>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.67989,130436,1,0,696,483173,242,114,1332,583108,1618
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(G(F(F(X(("Xu5P>=1")&&("R5P>=1"))))))))
Formula 12 simplified : !FGFX("R5P>=1" & "Xu5P>=1")
3 unique states visited
3 strongly connected components in search stack
4 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,5.69213,130868,1,0,698,484155,254,115,1336,584274,1631
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((("Ru5P>=1")&&("a2>=1")))
Formula 13 simplified : !("Ru5P>=1" & "a2>=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,5.69311,131136,1,0,698,484155,254,115,1336,584274,1633
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((F(F((("S7P>=1")&&("GAP>=1"))&&("c1>=7"))))U(("F6P>=1")&&("ATP>=1")))))
Formula 14 simplified : !F(F("GAP>=1" & "S7P>=1" & "c1>=7") U ("ATP>=1" & "F6P>=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,5.69564,131144,1,0,716,484320,266,119,1340,584413,1685
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((F("_2PG>=1"))U((X(("ATP>=7")&&("Lac>=7")))U(("GSSG>=1")&&("NADPH>=1")))))
Formula 15 simplified : !(F"_2PG>=1" U (X("ATP>=7" & "Lac>=7") U ("GSSG>=1" & "NADPH>=1")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,6.41238,149260,1,0,896,568897,295,175,1355,710537,2097
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464761115707

--------------------
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 01, 2016 6:05:07 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 6:05:07 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 44 ms
Jun 01, 2016 6:05:07 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 01, 2016 6:05:07 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2016 6:05:08 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Jun 01, 2016 6:05:08 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 16 ms
Jun 01, 2016 6:05:08 AM 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="GPPP-PT-C0001N0000000010"
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/GPPP-PT-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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 GPPP-PT-C0001N0000000010, 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 r217su-smll-146468018500447"
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 ;