About the Execution of ITS-Tools for Philosophers-COL-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
277.490 | 4229.00 | 6620.00 | 233.30 | FFTFFFTTTFFTTFTF | 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-3254
Executing tool itstools
Input is Philosophers-COL-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-149440871800158
=====================================================================
--------------------
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 Philosophers-COL-000005-LTLCardinality-0
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-1
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-15
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-2
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-3
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-4
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-5
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-6
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-7
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-8
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496345044025
Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G("((((think[0]+think[1])+think[2])+think[3])+think[4])<=((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])")))
Formula 0 simplified : !G"((((think[0]+think[1])+think[2])+think[3])+think[4])<=((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 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,0.04411,23572,1,0,8,1821,23,5,653,1008,21
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])>=2")))
Formula 1 simplified : !F"((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.051054,23676,1,0,19,3027,32,16,666,2887,53
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((((think[0]+think[1])+think[2])+think[3])+think[4])>=2"))
Formula 2 simplified : !"((((think[0]+think[1])+think[2])+think[3])+think[4])>=2"
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,0.051706,23676,1,0,19,3027,35,16,672,2887,55
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(G(("((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])>=3")U("((((think[0]+think[1])+think[2])+think[3])+think[4])<=((((catch1[0]+catch1[1])+catch1[2])+catch1[3])+catch1[4])")))))
Formula 3 simplified : !G("((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])>=3" U "((((think[0]+think[1])+think[2])+think[3])+think[4])<=((((catch1[0]+catch1[1])+catch1[2])+catch1[3])+catch1[4])")
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,0.054997,24516,1,0,19,3027,51,16,709,2887,62
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(X(G("((((catch1[0]+catch1[1])+catch1[2])+catch1[3])+catch1[4])>=3"))))))
Formula 4 simplified : !GXXG"((((catch1[0]+catch1[1])+catch1[2])+catch1[3])+catch1[4])>=3"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,0.058698,24812,1,0,21,3192,57,18,733,3062,75
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])<=((((think[0]+think[1])+think[2])+think[3])+think[4])"))
Formula 5 simplified : !"((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])<=((((think[0]+think[1])+think[2])+think[3])+think[4])"
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,0.059434,24812,1,0,21,3192,60,18,744,3062,77
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((think[0]+think[1])+think[2])+think[3])+think[4])>=3"))
Formula 6 simplified : !"((((think[0]+think[1])+think[2])+think[3])+think[4])>=3"
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,0.060033,24812,1,0,21,3192,63,18,750,3062,79
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((((think[0]+think[1])+think[2])+think[3])+think[4])>=1")))
Formula 7 simplified : !G"((((think[0]+think[1])+think[2])+think[3])+think[4])>=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,0.067358,24812,1,0,23,3440,69,25,779,3589,114
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G("((((eat[0]+eat[1])+eat[2])+eat[3])+eat[4])<=((((think[0]+think[1])+think[2])+think[3])+think[4])"))))
Formula 8 simplified : !XG"((((eat[0]+eat[1])+eat[2])+eat[3])+eat[4])<=((((think[0]+think[1])+think[2])+think[3])+think[4])"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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,0.074201,24832,1,0,24,3501,75,28,912,3863,131
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(G(F("((((fork[0]+fork[1])+fork[2])+fork[3])+fork[4])>=2")))))
Formula 9 simplified : !GF"((((fork[0]+fork[1])+fork[2])+fork[3])+fork[4])>=2"
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,0.0785,24904,1,0,29,3958,84,33,928,4695,153
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("((((think[0]+think[1])+think[2])+think[3])+think[4])>=3")))
Formula 10 simplified : !F"((((think[0]+think[1])+think[2])+think[3])+think[4])>=3"
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,0.079101,25000,1,0,29,3958,90,33,928,4695,155
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(F(F("((((think[0]+think[1])+think[2])+think[3])+think[4])<=((((catch1[0]+catch1[1])+catch1[2])+catch1[3])+catch1[4])"))))))
Formula 11 simplified : !GXF"((((think[0]+think[1])+think[2])+think[3])+think[4])<=((((catch1[0]+catch1[1])+catch1[2])+catch1[3])+catch1[4])"
3 unique states visited
3 strongly connected components in search stack
4 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,0.085177,25068,1,0,31,4346,97,35,1003,5289,168
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("((((eat[0]+eat[1])+eat[2])+eat[3])+eat[4])>=2"))
Formula 12 simplified : !"((((eat[0]+eat[1])+eat[2])+eat[3])+eat[4])>=2"
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,0.086338,25068,1,0,31,4346,100,35,1009,5289,170
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(F("((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])>=2"))))
Formula 13 simplified : !F"((((catch2[0]+catch2[1])+catch2[2])+catch2[3])+catch2[4])>=2"
2 unique states visited
2 strongly connected components in search stack
2 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,0.086744,25196,1,0,31,4346,100,35,1009,5289,170
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((("((((fork[0]+fork[1])+fork[2])+fork[3])+fork[4])<=((((think[0]+think[1])+think[2])+think[3])+think[4])")U("((((eat[0]+eat[1])+eat[2])+eat[3])+eat[4])<=((((fork[0]+fork[1])+fork[2])+fork[3])+fork[4])")))
Formula 14 simplified : !("((((fork[0]+fork[1])+fork[2])+fork[3])+fork[4])<=((((think[0]+think[1])+think[2])+think[3])+think[4])" U "((((eat[0]+eat[1])+eat[2])+eat[3])+eat[4])<=((((fork[0]+fork[1])+fork[2])+fork[3])+fork[4])")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,0.088141,25232,1,0,31,4346,110,35,1026,5289,174
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X("((((think[0]+think[1])+think[2])+think[3])+think[4])>=1")))
Formula 15 simplified : !X"((((think[0]+think[1])+think[2])+think[3])+think[4])>=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,0.088675,25252,1,0,31,4346,110,35,1026,5289,176
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
Exit code :0
invariant : -1'think[1] + 1'fork[1] + -1'catch1[1] + 1'catch1[2] + 1'eat[2]= 0
invariant : 1'think[3] + 1'think[4] + -1'fork[3] + 1'catch1[3] + 1'catch2[4]= 1
invariant : -1'think[4] + 1'fork[4] + 1'catch1[0] + -1'catch1[4] + 1'eat[0]= 0
invariant : 1'think[2] + 1'think[3] + -1'fork[2] + 1'catch1[2] + 1'catch2[3]= 1
invariant : 1'think[0] + 1'think[1] + -1'fork[0] + 1'catch1[0] + 1'catch2[1]= 1
invariant : -1'think[2] + 1'fork[2] + -1'catch1[2] + 1'catch1[3] + 1'eat[3]= 0
invariant : -1'think[3] + 1'fork[3] + -1'catch1[3] + 1'catch1[4] + 1'eat[4]= 0
invariant : -1'think[0] + 1'fork[0] + -1'catch1[0] + 1'catch1[1] + 1'eat[1]= 0
invariant : 1'think[0] + 1'think[4] + -1'fork[4] + 1'catch1[4] + 1'catch2[0]= 1
invariant : 1'think[1] + 1'think[2] + -1'fork[1] + 1'catch1[1] + 1'catch2[2]= 1
BK_STOP 1496345048254
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.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 LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 7:24:06 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 7:24:06 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1253 ms
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 44 ms
Jun 01, 2017 7:24:07 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
Jun 01, 2017 7:24:07 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Jun 01, 2017 7:24:07 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 24 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="Philosophers-COL-000005"
export BK_EXAMINATION="LTLCardinality"
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
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-149440871800158"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;