Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546000010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546000010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K May 14 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 27K May 12 20:42 model.pnml

--------------------
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 SmartHome-PT-02-00
FORMULA_NAME SmartHome-PT-02-01
FORMULA_NAME SmartHome-PT-02-02
FORMULA_NAME SmartHome-PT-02-03
FORMULA_NAME SmartHome-PT-02-04
FORMULA_NAME SmartHome-PT-02-05
FORMULA_NAME SmartHome-PT-02-06
FORMULA_NAME SmartHome-PT-02-07
FORMULA_NAME SmartHome-PT-02-08
FORMULA_NAME SmartHome-PT-02-09
FORMULA_NAME SmartHome-PT-02-10
FORMULA_NAME SmartHome-PT-02-11
FORMULA_NAME SmartHome-PT-02-12
FORMULA_NAME SmartHome-PT-02-13
FORMULA_NAME SmartHome-PT-02-14
FORMULA_NAME SmartHome-PT-02-15

=== Now, execution of the tool begins

BK_START 1590483637417

[2020-05-26 09:00:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 09:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:00:39] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-05-26 09:00:39] [INFO ] Transformed 41 places.
[2020-05-26 09:00:39] [INFO ] Transformed 127 transitions.
[2020-05-26 09:00:39] [INFO ] Found NUPN structural information;
[2020-05-26 09:00:39] [INFO ] Parsed PT model containing 41 places and 127 transitions in 85 ms.
Ensure Unique test removed 66 transitions
Reduce redundant transitions removed 66 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 122 steps, including 0 resets, run visited all 43 properties in 3 ms. (steps per millisecond=40 )
[2020-05-26 09:00:39] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 27 ms
FORMULA SmartHome-PT-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:00:39] [INFO ] Applying decomposition
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16053766058487208997.txt, -o, /tmp/graph16053766058487208997.bin, -w, /tmp/graph16053766058487208997.weights], workingDir=null]
[2020-05-26 09:00:39] [INFO ] Input system was already deterministic with 61 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16053766058487208997.bin, -l, -1, -v, -w, /tmp/graph16053766058487208997.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:00:39] [INFO ] Decomposing Gal with order
[2020-05-26 09:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:00:39] [INFO ] Removed a total of 24 redundant transitions.
[2020-05-26 09:00:39] [INFO ] Flatten gal took : 25 ms
[2020-05-26 09:00:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2020-05-26 09:00:39] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-26 09:00:39] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 10 LTL properties
Checking formula 0 : !((F(X(!(("((i7.u6.p18==1)&&(u0.p27==1))")U((((!(G("(i7.u6.p18==1)")))&&("(i1.u1.p4!=1)"))&&("(i1.u3.p9!=1)"))||(!(G("(i1.u3.p9==1)")))))))))
Formula 0 simplified : !FX!("((i7.u6.p18==1)&&(u0.p27==1))" U (("(i1.u1.p4!=1)" & "(i1.u3.p9!=1)" & !G"(i7.u6.p18==1)") | !G"(i1.u3.p9==1)"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
Normalized transition count is 36 out of 61 initially.
// Phase 1: matrix 36 rows 41 cols
Reverse transition relation is NOT exact ! Due to transitions t87, t91, i6.u12.t85, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/57/3/60
[2020-05-26 09:00:39] [INFO ] Computed 17 place invariants in 9 ms
inv : p0 + p25 + p26 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p19 + p20 + p21 = 1
inv : p0 + p27 = 1
inv : p0 + p5 = 1
inv : p0 + p1 = 1
inv : p0 + p11 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p22 + p23 + p24 = 1
inv : p0 + p2 = 1
inv : p0 + p14 = 1
inv : p0 + p8 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p6 + p7 = 1
inv : p37 + p38 - p39 - p40 = 0
Total of 17 invariants.
[2020-05-26 09:00:39] [INFO ] Computed 17 place invariants in 10 ms
4 unique states visited
3 strongly connected components in search stack
5 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.052392,19628,1,0,2533,125,754,2621,186,247,7403
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-02-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(((!(G("(i4.u9.p26==1)")))&&("((i1.u1.p1!=1)||(i1.u1.p4!=1))"))U(((!(F("(i4.u9.p26==1)")))&&("(i1.u1.p1==1)"))&&("(i1.u1.p4==1)"))))))
Formula 1 simplified : !FG(("((i1.u1.p1!=1)||(i1.u1.p4!=1))" & !G"(i4.u9.p26==1)") U ("(i1.u1.p1==1)" & "(i1.u1.p4==1)" & !F"(i4.u9.p26==1)"))
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.058688,19628,1,0,2823,135,927,2892,204,273,8625
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(((X("(u0.p11==1)"))U("(i8.u8.p22!=1)"))||(G((G("(i5.u4.p13==1)"))||("(u0.p11==1)"))))))
Formula 2 simplified : !G((X"(u0.p11==1)" U "(i8.u8.p22!=1)") | G("(u0.p11==1)" | G"(i5.u4.p13==1)"))
3 unique states visited
0 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.061742,19976,1,0,2847,135,966,2954,206,277,8958
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SmartHome-PT-02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(F((X(X("((i8.u8.p24==1)&&(i4.u10.p29==1))")))&&(!(G(X("(i8.u8.p23==1)")))))))&&(!(X("(u7.p20==1)")))))
Formula 3 simplified : !(!F(XX"((i8.u8.p24==1)&&(i4.u10.p29==1))" & !GX"(i8.u8.p23==1)") & !X"(u7.p20==1)")
6 unique states visited
5 strongly connected components in search stack
9 transitions explored
6 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.067371,19976,1,0,3121,137,1043,3300,212,282,9889
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X(X((G(X("(i1.u3.p10!=1)")))U("((i8.u8.p23==1)||((i6.u5.p16==1)&&(u0.p27==1)))"))))U("((i7.u6.p18==1)&&(i7.u14.p37==1))"))))
Formula 4 simplified : !F(XX(GX"(i1.u3.p10!=1)" U "((i8.u8.p23==1)||((i6.u5.p16==1)&&(u0.p27==1)))") U "((i7.u6.p18==1)&&(i7.u14.p37==1))")
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.068477,19976,1,0,3177,137,1070,3368,212,283,10162
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(("((i6.u12.p14==1)&&(i5.u11.p32==1))")&&((F((F("(i6.u5.p15==1)"))U("(i8.u8.p22==1)")))||(!(G("((i5.u4.p12==1)||((i5.u4.p13==1)&&(i5.u11.p31==1)))"))))))))
Formula 5 simplified : !XX("((i6.u12.p14==1)&&(i5.u11.p32==1))" & (F(F"(i6.u5.p15==1)" U "(i8.u8.p22==1)") | !G"((i5.u4.p12==1)||((i5.u4.p13==1)&&(i5.u11.p31==1)))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.069635,20240,1,0,3201,137,1100,3411,212,283,10336
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(!(X(F(X("(i4.u9.p25==1)")))))))
Formula 6 simplified : !G!XFX"(i4.u9.p25==1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.072466,20240,1,0,3476,137,1114,3712,212,288,11241
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((!(X(X("(u7.p21==1)"))))&&(X(X((G("((i1.u1.p1!=1)||(u7.p21!=1))"))||(X("((i1.u1.p1==1)&&(u7.p21==1))"))))))))
Formula 7 simplified : !F(!XX"(u7.p21==1)" & XX(G"((i1.u1.p1!=1)||(u7.p21!=1))" | X"((i1.u1.p1==1)&&(u7.p21==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.077974,20240,1,0,3732,137,1152,3998,212,294,12064
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(F(X(X(G((((F("((i1.u1.p1==1)&&(i4.u9.p26==1))"))&&("(i8.u8.p24==1)"))&&("(i8.u15.p39==1)"))U("(i1.u1.p4==1)")))))))))
Formula 8 simplified : !FGFXXG(("(i8.u8.p24==1)" & "(i8.u15.p39==1)" & F"((i1.u1.p1==1)&&(i4.u9.p26==1))") U "(i1.u1.p4==1)")
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.081832,20504,1,0,3920,137,1204,4174,212,294,12622
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(("(u0.p8==1)")||((X("((i1.u1.p1==1)&&(u2.p7==1))"))&&(F("(i1.u3.p10==1)")))))))
Formula 9 simplified : !XF("(u0.p8==1)" | (X"((i1.u1.p1==1)&&(u2.p7==1))" & F"(i1.u3.p10==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.082473,20504,1,0,3920,137,1213,4174,212,294,12640
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SmartHome-PT-02-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:00:39] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-26 09:00:39] [INFO ] Built C files in 220ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590483639978

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="SmartHome-PT-02"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-02, 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 r227-oct2-159033546000010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-02.tgz
mv SmartHome-PT-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;