About the Execution of ITS-Tools for S_DNAwalker-PT-01track12Block1
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
317.960 | 2616.00 | 4532.00 | 124.40 | FFFFFFFFFFFFFFFF | 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 S_DNAwalker-PT-01track12Block1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-blw3-149441614000006
=====================================================================
--------------------
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 DNAwalker-PT-01track12Block1-LTLFireability-0
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-1
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-10
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-11
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-12
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-13
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-14
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-15
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-2
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-3
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-4
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-5
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-6
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-7
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-8
FORMULA_NAME DNAwalker-PT-01track12Block1-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496406496099
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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((F(("A10>=2")&&("A11>=1")))U(("A11>=2")&&("A3>=1"))))
Formula 0 simplified : !(F("A10>=2" & "A11>=1") U ("A3>=1" & "A11>=2"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
// Phase 1: matrix 82 rows 13 cols
15 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.168646,29340,1,0,405,26820,202,253,966,29848,547
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G(F(G(("A11>=2")&&("A9>=1")))))U(X(F(X(("A1>=2")&&("A5>=1")))))))
Formula 1 simplified : !(GFG("A9>=1" & "A11>=2") U XFX("A1>=2" & "A5>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.182448,30916,1,0,432,29144,216,291,971,32782,643
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X(("A3>=2")&&("A1>=1")))))
Formula 2 simplified : !FX("A1>=1" & "A3>=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.184818,31188,1,0,440,29229,230,312,976,32966,716
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(X(F((("A2>=2")&&("A10>=1"))U(("A9>=2")&&("A6>=1")))))))
Formula 3 simplified : !GXF(("A2>=2" & "A10>=1") U ("A6>=1" & "A9>=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.199628,31696,1,0,460,32094,248,335,1004,35858,785
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X(("A2>=2")&&("A3>=1")))U(G(X(G(("A10>=2")&&("A3>=1")))))))
Formula 4 simplified : !(X("A2>=2" & "A3>=1") U GXG("A3>=1" & "A10>=2"))
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.207907,32912,1,0,460,32313,266,338,1017,37226,823
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(X(G(G(F(("A6>=2")&&("A4>=1"))))))))
Formula 5 simplified : !FXGF("A4>=1" & "A6>=2")
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,0.23185,33580,1,0,479,36474,280,357,1022,41243,878
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(X(("A2>=2")&&("A3>=1")))))
Formula 6 simplified : !GX("A2>=2" & "A3>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.251172,34432,1,0,493,39721,287,375,1025,44452,922
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((("A3>=2")&&("A4>=1")))
Formula 7 simplified : !("A3>=2" & "A4>=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.251729,34696,1,0,493,39721,291,375,1028,44452,925
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("A10>=2")&&("A9>=1")))
Formula 8 simplified : !("A9>=1" & "A10>=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.252097,34696,1,0,493,39721,297,375,1032,44452,927
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("A10>=2")&&("A5>=1")))
Formula 9 simplified : !("A5>=1" & "A10>=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.252501,34696,1,0,493,39721,301,375,1035,44453,929
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F((F(G(("A3>=2")&&("A11>=1"))))U((("A7>=2")&&("A6>=1"))U(("A9>=2")&&("A1>=1"))))))
Formula 10 simplified : !F(FG("A3>=2" & "A11>=1") U (("A6>=1" & "A7>=2") U ("A1>=1" & "A9>=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.258247,34968,1,0,502,40010,311,397,1038,45142,1006
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(X(G((("A7>=2")&&("A4>=1"))U(("A7>=2")&&("A8>=1")))))))
Formula 11 simplified : !FXG(("A4>=1" & "A7>=2") U ("A7>=2" & "A8>=1"))
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
4 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.297653,35936,1,0,523,44401,334,426,1056,49869,1142
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((G(X(X(("A1>=2")&&("A2>=1")))))U(("A5>=2")&&("A1>=1"))))
Formula 12 simplified : !(GXX("A1>=2" & "A2>=1") U ("A1>=1" & "A5>=2"))
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 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.301293,36304,1,0,523,44505,342,434,1060,50295,1195
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(("A4>=2")&&("A3>=1")))U(X((("A4>=2")&&("A6>=1"))U("B5>=1")))))
Formula 13 simplified : !(X("A3>=1" & "A4>=2") U X(("A4>=2" & "A6>=1") U "B5>=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,0.32577,36736,1,0,538,46917,368,456,1084,52500,1245
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((("A5>=2")&&("A10>=1")))
Formula 14 simplified : !("A5>=2" & "A10>=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.326286,36996,1,0,538,46917,374,456,1088,52500,1247
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(X((("A11>=2")&&("A4>=1"))U(("A3>=2")&&("A7>=1")))))))
Formula 15 simplified : !GXX(("A4>=1" & "A11>=2") U ("A3>=2" & "A7>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.345379,37148,1,0,548,48913,394,469,1103,54854,1280
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DNAwalker-PT-01track12Block1-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0
BK_STOP 1496406498715
--------------------
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/ -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 LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 12:28:17 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 12:28:17 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 53 ms
Jun 02, 2017 12:28:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 13 places.
Jun 02, 2017 12:28:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 82 transitions.
Jun 02, 2017 12:28:17 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
Jun 02, 2017 12:28:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
Jun 02, 2017 12:28:17 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2017 12:28:18 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 15 ms
Jun 02, 2017 12:28:18 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 13 variables to be positive in 38 ms
Jun 02, 2017 12:28:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 82 transitions.
Jun 02, 2017 12:28:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/82 took 1 ms. Total solver calls (SAT/UNSAT): 3(0/3)
Jun 02, 2017 12:28:18 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions tb5, tAb5, t1_2, t1_3, t1_4, t1_5, t1_9, t2_3, t2_4, t2_5, t2_6, t2_9, t2_10, t3_2, t3_4, t3_5, t3_6, t3_7, t3_9, t3_10, t3_11, t4_2, t4_3, t4_5, t4_6, t4_7, t4_9, t4_10, t4_11, t5_2, t5_3, t5_4, t5_6, t5_7, t5_8, t5_9, t5_10, t5_11, t6_2, t6_3, t6_4, t6_5, t6_8, t6_9, t6_10, t7_3, t7_4, t7_5, t7_9, t9_2, t9_3, t9_4, t9_5, t9_6, t9_7, t9_10, t9_11, t9_12, t10_2, t10_3, t10_4, t10_5, t10_6, t10_9, t10_12, t11_3, t11_4, t11_5, t11_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :5/8/69/82
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
Computing Next relation with stutter on 6 deadlock states
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_DNAwalker-PT-01track12Block1"
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
tar xzf /home/mcc/BenchKit/INPUTS/S_DNAwalker-PT-01track12Block1.tgz
mv S_DNAwalker-PT-01track12Block1 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 S_DNAwalker-PT-01track12Block1, 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 r110-blw3-149441614000006"
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 ;