Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476400922.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-001A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476400922
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.4K May 14 02:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 02:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 13 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:27 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 3.7K 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 ShieldRVt-PT-001A-00
FORMULA_NAME ShieldRVt-PT-001A-01
FORMULA_NAME ShieldRVt-PT-001A-02
FORMULA_NAME ShieldRVt-PT-001A-03
FORMULA_NAME ShieldRVt-PT-001A-04
FORMULA_NAME ShieldRVt-PT-001A-05
FORMULA_NAME ShieldRVt-PT-001A-06
FORMULA_NAME ShieldRVt-PT-001A-07
FORMULA_NAME ShieldRVt-PT-001A-08
FORMULA_NAME ShieldRVt-PT-001A-09
FORMULA_NAME ShieldRVt-PT-001A-10
FORMULA_NAME ShieldRVt-PT-001A-11
FORMULA_NAME ShieldRVt-PT-001A-12
FORMULA_NAME ShieldRVt-PT-001A-13
FORMULA_NAME ShieldRVt-PT-001A-14
FORMULA_NAME ShieldRVt-PT-001A-15

=== Now, execution of the tool begins

BK_START 1590630108992

[2020-05-28 01:41:50] [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-28 01:41:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:41:50] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2020-05-28 01:41:50] [INFO ] Transformed 11 places.
[2020-05-28 01:41:50] [INFO ] Transformed 11 transitions.
[2020-05-28 01:41:50] [INFO ] Found NUPN structural information;
[2020-05-28 01:41:50] [INFO ] Parsed PT model containing 11 places and 11 transitions in 57 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 113 ms. (steps per millisecond=884 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 10 rows 11 cols
[2020-05-28 01:41:50] [INFO ] Computed 5 place invariants in 3 ms
[2020-05-28 01:41:50] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-28 01:41:50] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-28 01:41:51] [INFO ] Flatten gal took : 21 ms
FORMULA ShieldRVt-PT-001A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:41:51] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:41:51] [INFO ] Applying decomposition
[2020-05-28 01:41:51] [INFO ] Flatten gal took : 4 ms
[2020-05-28 01:41:51] [INFO ] Input system was already deterministic with 10 transitions.
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/graph16298184992190372585.txt, -o, /tmp/graph16298184992190372585.bin, -w, /tmp/graph16298184992190372585.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16298184992190372585.bin, -l, -1, -v, -w, /tmp/graph16298184992190372585.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 10 rows 11 cols
[2020-05-28 01:41:51] [INFO ] Computed 5 place invariants in 1 ms
inv : p0 + p9 + p10 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p7 + p8 = 1
Total of 5 invariants.
[2020-05-28 01:41:51] [INFO ] Computed 5 place invariants in 3 ms
[2020-05-28 01:41:51] [INFO ] Decomposing Gal with order
[2020-05-28 01:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:41:51] [INFO ] Removed a total of 3 redundant transitions.
[2020-05-28 01:41:51] [INFO ] Flatten gal took : 29 ms
[2020-05-28 01:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 01:41:51] [INFO ] Proved 11 variables to be positive in 62 ms
[2020-05-28 01:41:51] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2020-05-28 01:41:51] [INFO ] Computation of disable matrix completed :0/10 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:41:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:41:51] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2020-05-28 01:41:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:41:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-28 01:41:51] [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 12 LTL properties
Checking formula 0 : !((F((X(((!(X("(((u1.p4==1)&&(u2.p5==1))&&(i2.u3.p8==1))")))&&("(((i2.u0.p2!=1)||(u1.p4!=1))||(u4.p10!=1))"))&&("(u2.p5!=1)")))||(G(X(X("((i2.u0.p1==1)&&(i2.u3.p7==1))")))))))
Formula 0 simplified : !F(X("(((i2.u0.p2!=1)||(u1.p4!=1))||(u4.p10!=1))" & "(u2.p5!=1)" & !X"(((u1.p4==1)&&(u2.p5==1))&&(i2.u3.p8==1))") | GXX"((i2.u0.p1==1)&&(i2.u3.p7==1))")
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
0 strongly connected components in search stack
6 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.025342,18652,1,0,144,38,245,146,70,43,239
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((X(!(F("(i2.u0.p0!=1)"))))||("(u1.p3==1)"))U(("(i2.u0.p0==1)")U("(u1.p3==1)"))))
Formula 1 simplified : !(("(u1.p3==1)" | X!F"(i2.u0.p0!=1)") U ("(i2.u0.p0==1)" U "(u1.p3==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.027458,18652,1,0,149,39,305,146,71,43,488
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("(((u1.p4==1)&&(u2.p5==1))&&(i2.u3.p8==1))"))))
Formula 2 simplified : !FG"(((u1.p4==1)&&(u2.p5==1))&&(i2.u3.p8==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.029109,18652,1,0,325,39,333,359,71,44,1074
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(("((((i2.u0.p1==1)&&(i2.u3.p7==1))&&(u2.p6==1))&&(u4.p9==1))")&&((F(!(G("((u2.p6==1)&&(u4.p9==1))"))))||(F(X("((i2.u0.p1==1)&&(i2.u3.p7==1))")))))))
Formula 3 simplified : !X("((((i2.u0.p1==1)&&(i2.u3.p7==1))&&(u2.p6==1))&&(u4.p9==1))" & (F!G"((u2.p6==1)&&(u4.p9==1))" | FX"((i2.u0.p1==1)&&(i2.u3.p7==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.030265,18652,1,0,363,39,374,421,71,47,1270
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X((X(G(X("(i2.u3.p7==1)"))))&&(("((i2.u0.p1==1)&&(i2.u3.p7==1))")U(X("((u2.p6==1)&&(u4.p9==1))")))))))
Formula 4 simplified : !XX(XGX"(i2.u3.p7==1)" & ("((i2.u0.p1==1)&&(i2.u3.p7==1))" U X"((u2.p6==1)&&(u4.p9==1))"))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.031582,18652,1,0,405,39,378,462,71,47,1408
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(("(u1.p3!=1)")U("((u1.p3==1)||((i2.u0.p1==1)&&(i2.u3.p7==1)))"))))
Formula 5 simplified : !G("(u1.p3!=1)" U "((u1.p3==1)||((i2.u0.p1==1)&&(i2.u3.p7==1)))")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.033668,18652,1,0,543,39,413,674,71,47,2032
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(!(("(((i2.u3.p8==1)&&(u4.p10==1))||(i2.u0.p0==1))")U(X("(i2.u0.p0!=1)")))))))
Formula 6 simplified : G!("(((i2.u3.p8==1)&&(u4.p10==1))||(i2.u0.p0==1))" U X"(i2.u0.p0!=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.033949,18652,1,0,543,39,417,674,71,47,2042
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(X((G((G("(((u1.p4==1)&&(u2.p5==1))&&(i2.u3.p8==1))"))&&("(u1.p3==1)")))||("(u1.p3==1)"))))))
Formula 7 simplified : !XGX("(u1.p3==1)" | G("(u1.p3==1)" & G"(((u1.p4==1)&&(u2.p5==1))&&(i2.u3.p8==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.034539,18652,1,0,543,39,425,674,71,47,2052
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(!(X((!(F((X("(u1.p3==1)"))&&("(u4.p9==1)"))))U((F("(i2.u3.p7==1)"))&&("(u1.p3==1)"))))))))
Formula 8 simplified : X!X(!F("(u4.p9==1)" & X"(u1.p3==1)") U ("(u1.p3==1)" & F"(i2.u3.p7==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.036033,19080,1,0,549,39,430,686,71,47,2090
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X("(i2.u3.p7==1)"))))
Formula 9 simplified : !GX"(i2.u3.p7==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.036407,19080,1,0,549,39,438,686,71,47,2103
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(!(G(F(X((X(X(!(F("((u2.p6==1)&&(u4.p9==1))")))))&&(X("(u2.p5==1)")))))))))
Formula 10 simplified : !F!GFX(XX!F"((u2.p6==1)&&(u4.p9==1))" & X"(u2.p5==1)")
6 unique states visited
6 strongly connected components in search stack
7 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.037895,19080,1,0,570,39,461,726,71,47,2237
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldRVt-PT-001A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(!((X("(u4.p9==1)"))U((!(F("((i2.u3.p8==1)&&(u4.p10==1))")))&&("(u1.p3==1)"))))))
Formula 11 simplified : !F!(X"(u4.p9==1)" U ("(u1.p3==1)" & !F"((i2.u3.p8==1)&&(u4.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.038795,19080,1,0,570,39,481,726,71,47,2259
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-001A-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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-28 01:41:51] [INFO ] Built C files in 235ms 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 1590630111457

--------------------
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="ShieldRVt-PT-001A"
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 ShieldRVt-PT-001A, 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 r210-tajo-159033476400922"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001A.tgz
mv ShieldRVt-PT-001A 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 ;