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-3253
Executing tool itstools
Input is S_Dekker-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-ebro-149488457500204
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496501349673


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 : !((G((("flag_1_0>=1")&&("flag_1_6>=1"))&&("p1_6>=1"))))
Formula 0 simplified : !G("flag_1_0>=1" & "flag_1_6>=1" & "p1_6>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
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.212008,26416,1,0,260,15790,281,123,2723,12041,264
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((("flag_1_4>=1")&&("flag_1_8>=1"))&&("p1_8>=1")))
Formula 1 simplified : !("flag_1_4>=1" & "flag_1_8>=1" & "p1_8>=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.213162,26664,1,0,260,15790,294,123,2732,12042,266
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((G(X(G((("flag_1_4>=1")&&("flag_1_8>=1"))&&("p1_8>=1")))))U((("flag_1_1>=1")&&("flag_1_2>=1"))&&("p1_1>=1"))))
Formula 2 simplified : !(GXG("flag_1_4>=1" & "flag_1_8>=1" & "p1_8>=1") U ("flag_1_1>=1" & "flag_1_2>=1" & "p1_1>=1"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 120 rows 50 cols
invariant : 1'flag_0_2 + 1'flag_1_2= 1
invariant : 1'flag_0_7 + 1'flag_1_7= 1
invariant : 1'flag_0_3 + 1'p1_3 + 1'p3_3= 1
invariant : 1'flag_0_9 + 1'flag_1_9= 1
invariant : 1'flag_0_5 + 1'p1_5 + 1'p3_5= 1
invariant : 1'flag_0_5 + 1'flag_1_5= 1
invariant : 1'flag_0_6 + 1'p1_6 + 1'p3_6= 1
invariant : -1'flag_0_0 + 1'p0_0= 0
invariant : 1'flag_0_7 + 1'p1_7 + 1'p3_7= 1
invariant : -1'flag_0_2 + 1'p0_2= 0
invariant : -1'flag_0_3 + 1'p0_3= 0
invariant : 1'flag_0_0 + 1'p1_0 + 1'p3_0= 1
invariant : 1'flag_0_3 + 1'flag_1_3= 1
invariant : 1'flag_0_0 + 1'flag_1_0= 1
invariant : 1'flag_0_1 + 1'p1_1 + 1'p3_1= 1
invariant : -1'flag_0_8 + 1'p0_8= 0
invariant : 1'flag_0_8 + 1'flag_1_8= 1
invariant : 1'flag_0_6 + 1'flag_1_6= 1
invariant : -1'flag_0_5 + 1'p0_5= 0
invariant : -1'flag_0_6 + 1'p0_6= 0
invariant : 1'flag_0_4 + 1'p1_4 + 1'p34= 1
invariant : 1'flag_0_1 + 1'flag_1_1= 1
invariant : 1'flag_0_4 + 1'flag_1_4= 1
invariant : -1'flag_0_1 + 1'p0_1= 0
invariant : -1'flag_0_7 + 1'p0_7= 0
invariant : -1'flag_0_4 + 1'p0_4= 0
invariant : 1'flag_0_2 + 1'p1_2 + 1'p3_2= 1
invariant : 1'flag_0_8 + 1'p1_8 + 1'p3_8= 1
invariant : -1'flag_0_9 + 1'p0_9= 0
invariant : 1'flag_0_9 + 1'p1_9 + 1'p3_9= 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
12 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.346435,32224,1,0,281,30434,316,134,2745,25131,334
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((("flag_1_3>=1")&&("flag_1_4>=1"))&&("p1_3>=1")))
Formula 3 simplified : !("flag_1_3>=1" & "flag_1_4>=1" & "p1_3>=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.349178,32224,1,0,281,30434,327,134,2753,25131,336
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((("flag_1_3>=1")&&("flag_1_5>=1"))&&("p1_5>=1")))
Formula 4 simplified : !("flag_1_3>=1" & "flag_1_5>=1" & "p1_5>=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.349997,32468,1,0,281,30434,338,134,2761,25131,338
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(F(F((("flag_1_1>=1")&&("flag_1_5>=1"))&&("p1_1>=1")))))U((("flag_1_2>=1")&&("flag_1_9>=1"))&&("p1_2>=1"))))
Formula 5 simplified : !(F("flag_1_1>=1" & "flag_1_5>=1" & "p1_1>=1") U ("flag_1_2>=1" & "flag_1_9>=1" & "p1_2>=1"))
2 unique states visited
2 strongly connected components in search stack
2 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,0.622621,38036,1,0,303,58296,373,135,2787,46931,457
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(F(G(X((("flag_1_0>=1")&&("flag_1_5>=1"))&&("p1_0>=1")))))))
Formula 6 simplified : !FGX("flag_1_0>=1" & "flag_1_5>=1" & "p1_0>=1")
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 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.642037,38592,1,0,304,60256,384,135,2794,48575,465
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X(G(G(((("flag_1_0>=1")&&("flag_1_5>=1"))&&("p1_5>=1"))U((("flag_1_3>=1")&&("flag_1_8>=1"))&&("p1_3>=1")))))))
Formula 7 simplified : !XG(("flag_1_0>=1" & "flag_1_5>=1" & "p1_5>=1") U ("flag_1_3>=1" & "flag_1_8>=1" & "p1_3>=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,0.651971,39056,1,0,304,60307,430,135,2839,48627,474
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((("flag_1_4>=1")&&("flag_1_5>=1"))&&("p1_5>=1")))
Formula 8 simplified : !("flag_1_4>=1" & "flag_1_5>=1" & "p1_5>=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.652825,39056,1,0,304,60307,434,135,2842,48627,476
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((("flag_1_3>=1")&&("flag_1_5>=1"))&&("p1_3>=1")))
Formula 9 simplified : !("flag_1_3>=1" & "flag_1_5>=1" & "p1_3>=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.653598,39088,1,0,304,60307,441,135,2848,48627,478
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((("flag_1_0>=1")&&("flag_1_7>=1"))&&("p1_7>=1")))
Formula 10 simplified : !("flag_1_0>=1" & "flag_1_7>=1" & "p1_7>=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.654292,39092,1,0,304,60307,452,135,2856,48627,480
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(G(F(X(X(((((((((("flag_0_0>=1")&&("flag_0_1>=1"))&&("flag_0_2>=1"))&&("flag_0_3>=1"))&&("flag_0_4>=1"))&&("flag_0_5>=1"))&&("flag_0_6>=1"))&&("flag_0_7>=1"))&&("flag_0_8>=1"))&&("p1_9>=1"))))))))
Formula 11 simplified : !FGFXX("flag_0_0>=1" & "flag_0_1>=1" & "flag_0_2>=1" & "flag_0_3>=1" & "flag_0_4>=1" & "flag_0_5>=1" & "flag_0_6>=1" & "flag_0_7>=1" & "flag_0_8>=1" & "p1_9>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.725788,39204,1,0,305,61468,506,135,2893,49669,489
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((G(((("flag_1_5>=1")&&("flag_1_8>=1"))&&("p1_5>=1"))U((("flag_1_2>=1")&&("flag_1_6>=1"))&&("p1_6>=1"))))U((("flag_1_5>=1")&&("flag_1_6>=1"))&&("p1_6>=1"))))
Formula 12 simplified : !(G(("flag_1_5>=1" & "flag_1_8>=1" & "p1_5>=1") U ("flag_1_2>=1" & "flag_1_6>=1" & "p1_6>=1")) U ("flag_1_5>=1" & "flag_1_6>=1" & "p1_6>=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.734774,39204,1,0,305,61468,536,135,2924,49669,495
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G(G(F(G((("flag_1_3>=1")&&("flag_1_8>=1"))&&("p1_3>=1"))))))))
Formula 13 simplified : !FGFG("flag_1_3>=1" & "flag_1_8>=1" & "p1_3>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.974831,43120,1,0,345,83004,547,156,2924,72186,613
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(X((G((("flag_1_1>=1")&&("flag_1_5>=1"))&&("p1_1>=1")))U(X((("flag_1_7>=1")&&("flag_1_8>=1"))&&("p1_7>=1")))))))
Formula 14 simplified : !FX(G("flag_1_1>=1" & "flag_1_5>=1" & "p1_1>=1") U X("flag_1_7>=1" & "flag_1_8>=1" & "p1_7>=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,1.02979,44000,1,0,356,87794,560,157,2930,75575,668
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((("flag_1_3>=1")&&("flag_1_9>=1"))&&("p1_3>=1")))
Formula 15 simplified : !("flag_1_3>=1" & "flag_1_9>=1" & "p1_3>=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,1.03136,44264,1,0,356,87794,567,157,2936,75575,670
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496501355017

--------------------
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 03, 2017 2:49:12 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2017 2:49:12 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 136 ms
Jun 03, 2017 2:49:12 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Jun 03, 2017 2:49:12 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
Jun 03, 2017 2:49:13 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 120 ms
Jun 03, 2017 2:49:13 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 28 ms
Jun 03, 2017 2:49:13 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 03, 2017 2:49:13 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 25 ms
Jun 03, 2017 2:49:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 146 ms
Jun 03, 2017 2:49:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 120 transitions.
Jun 03, 2017 2:49:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/120 took 5 ms. Total solver calls (SAT/UNSAT): 12(1/11)
Jun 03, 2017 2:49:14 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 exit_0, exit_1, exit_2, exit_3, exit_4, exit_5, exit_6, exit_7, exit_8, exit_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/110/10/120

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_Dekker-PT-010"
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_Dekker-PT-010.tgz
mv S_Dekker-PT-010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool itstools"
echo " Input is S_Dekker-PT-010, 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 r100-ebro-149488457500204"
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 ;