Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171100050.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is GPUForwardProgress-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.7K May 11 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 6.1K May 12 08:13 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 GPUForwardProgress-PT-04a-00
FORMULA_NAME GPUForwardProgress-PT-04a-01
FORMULA_NAME GPUForwardProgress-PT-04a-02
FORMULA_NAME GPUForwardProgress-PT-04a-03
FORMULA_NAME GPUForwardProgress-PT-04a-04
FORMULA_NAME GPUForwardProgress-PT-04a-05
FORMULA_NAME GPUForwardProgress-PT-04a-06
FORMULA_NAME GPUForwardProgress-PT-04a-07
FORMULA_NAME GPUForwardProgress-PT-04a-08
FORMULA_NAME GPUForwardProgress-PT-04a-09
FORMULA_NAME GPUForwardProgress-PT-04a-10
FORMULA_NAME GPUForwardProgress-PT-04a-11
FORMULA_NAME GPUForwardProgress-PT-04a-12
FORMULA_NAME GPUForwardProgress-PT-04a-13
FORMULA_NAME GPUForwardProgress-PT-04a-14
FORMULA_NAME GPUForwardProgress-PT-04a-15

=== Now, execution of the tool begins

BK_START 1621335342061

[2021-05-18 10:55:43] [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]
[2021-05-18 10:55:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:55:43] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-18 10:55:43] [INFO ] Transformed 24 places.
[2021-05-18 10:55:43] [INFO ] Transformed 29 transitions.
[2021-05-18 10:55:43] [INFO ] Found NUPN structural information;
[2021-05-18 10:55:43] [INFO ] Parsed PT model containing 24 places and 29 transitions in 67 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 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 517 steps, including 8 resets, run visited all 27 properties in 10 ms. (steps per millisecond=51 )
[2021-05-18 10:55:44] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-18 10:55:44] [INFO ] Flatten gal took : 28 ms
FORMULA GPUForwardProgress-PT-04a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:55:44] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:55:44] [INFO ] Applying decomposition
[2021-05-18 10:55:44] [INFO ] Flatten gal took : 4 ms
[2021-05-18 10:55:44] [INFO ] Input system was already deterministic with 23 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/graph12630309766625479805.txt, -o, /tmp/graph12630309766625479805.bin, -w, /tmp/graph12630309766625479805.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/graph12630309766625479805.bin, -l, -1, -v, -w, /tmp/graph12630309766625479805.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:55:44] [INFO ] Decomposing Gal with order
[2021-05-18 10:55:44] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 23 rows 24 cols
[2021-05-18 10:55:44] [INFO ] Computed 6 place invariants in 3 ms
inv : p18 + p19 - p21 - p22 - p23 = 0
inv : p13 + p14 + p15 + p16 - p20 - p21 - p22 - p23 = 0
inv : p5 + p6 + p7 + p8 - p20 - p21 - p22 - p23 = 0
inv : p9 + p10 + p11 + p12 - p20 - p21 - p22 - p23 = 0
inv : p1 + p2 + p3 + p4 - p20 - p21 - p22 - p23 = 0
inv : p17 - p20 = 0
Total of 6 invariants.
[2021-05-18 10:55:44] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-18 10:55:44] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-18 10:55:44] [INFO ] Flatten gal took : 37 ms
[2021-05-18 10:55:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-18 10:55:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2021-05-18 10:55:44] [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 11 LTL properties
Checking formula 0 : !((F((X("(u1.p7!=1)"))&&(X((X((F("(u1.p7==1)"))&&("(u1.p7==1)")))U(X(G("(u1.p7==1)"))))))))
Formula 0 simplified : !F(X"(u1.p7!=1)" & X(X("(u1.p7==1)" & F"(u1.p7==1)") U XG"(u1.p7==1)"))
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t19, i4.u4.t6, i4.u5.t2, i4.u5.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/19/4/23
Computing Next relation with stutter on 16 deadlock states
[2021-05-18 10:55:44] [INFO ] Proved 24 variables to be positive in 103 ms
[2021-05-18 10:55:44] [INFO ] Computing symmetric may disable matrix : 23 transitions.
[2021-05-18 10:55:44] [INFO ] Computation of disable matrix completed :0/23 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:55:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:55:44] [INFO ] Computing symmetric may enable matrix : 23 transitions.
[2021-05-18 10:55:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.032742,17456,1,0,1061,217,427,1397,170,493,2491
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((((!(F("(i4.u4.p18==1)")))&&(F("(((u1.p6!=1)||(i4.u4.p19!=1))||(i4.u5.p23!=1))")))&&(!(X("(((u2.p12==1)&&(i4.u4.p19==1))&&(i4.u5.p23==1))"))))&&(X("(i4.u4.p18==1)")))))
Formula 1 simplified : !X(!F"(i4.u4.p18==1)" & F"(((u1.p6!=1)||(i4.u4.p19!=1))||(i4.u5.p23!=1))" & !X"(((u2.p12==1)&&(i4.u4.p19==1))&&(i4.u5.p23==1))" & X"(i4.u4.p18==1)")
Computing Next relation with stutter on 16 deadlock states
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.036724,18276,1,0,1149,217,451,1552,170,507,2847
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(X(F("(u1.p7==1)"))))))
Formula 2 simplified : XXF"(u1.p7==1)"
Computing Next relation with stutter on 16 deadlock states
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.038562,18276,1,0,1248,217,458,1687,170,508,3132
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G((X(F(X((G("(u0.p0==1)"))||(X("(u0.p0==1)"))))))&&("(u0.p3==1)")))))
Formula 3 simplified : !XG("(u0.p3==1)" & XFX(G"(u0.p0==1)" | X"(u0.p0==1)"))
Computing Next relation with stutter on 16 deadlock states
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.040132,18608,1,0,1253,217,476,1695,172,508,3175
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(F("((u0.p3!=1)&&(u0.p0!=1))")))))
Formula 4 simplified : GF"((u0.p3!=1)&&(u0.p0!=1))"
Computing Next relation with stutter on 16 deadlock states
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.057065,19076,1,0,3531,219,517,3892,177,574,6365
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(("(((u2.p12!=1)||(i4.u4.p19!=1))||(i4.u5.p23!=1))")U("(u0.p2!=1)"))))
Formula 5 simplified : !X("(((u2.p12!=1)||(i4.u4.p19!=1))||(i4.u5.p23!=1))" U "(u0.p2!=1)")
Computing Next relation with stutter on 16 deadlock states
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.058022,19332,1,0,3531,219,536,3892,178,574,6388
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!((X((!(X("(i4.u4.p18==1)")))||("(i4.u4.p18==1)")))U(G(X("(u2.p10==1)")))))))
Formula 6 simplified : !X!(X("(i4.u4.p18==1)" | !X"(i4.u4.p18==1)") U GX"(u2.p10==1)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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.062392,19700,1,0,3769,219,597,4144,180,575,7049
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(X(X((F(X(("(i4.u4.p18==1)")U("((i4.u4.p19==1)&&(i4.u5.p21==1))"))))||("(((u2.p10==1)&&(i4.u4.p19==1))&&(i4.u5.p23==1))")))))))
Formula 7 simplified : !FXXX("(((u2.p10==1)&&(i4.u4.p19==1))&&(i4.u5.p23==1))" | FX("(i4.u4.p18==1)" U "((i4.u4.p19==1)&&(i4.u5.p21==1))"))
Computing Next relation with stutter on 16 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 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.065574,19896,1,0,4271,219,639,4550,180,576,8026
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("((u1.p7!=1)||(i4.u5.p22!=1))")))
Formula 8 simplified : !G"((u1.p7!=1)||(i4.u5.p22!=1))"
Computing Next relation with stutter on 16 deadlock states
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.068835,20156,1,0,4658,219,655,4972,180,579,8902
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(!(X((X("(u2.p10==1)"))||((F("(u2.p10==1)"))&&("((u2.p10!=1)||(u3.p15==1))")))))))
Formula 9 simplified : !F!X(X"(u2.p10==1)" | ("((u2.p10!=1)||(u3.p15==1))" & F"(u2.p10==1)"))
Computing Next relation with stutter on 16 deadlock states
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.074166,20368,1,0,5167,220,697,5532,180,584,10050
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F((G("((i4.u4.p19==1)&&(i4.u5.p21==1))"))||("(u0.p0==1)")))))
Formula 10 simplified : !GF("(u0.p0==1)" | G"((i4.u4.p19==1)&&(i4.u5.p21==1))")
Computing Next relation with stutter on 16 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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.07593,20368,1,0,5252,220,725,5630,180,585,10305
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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)
[2021-05-18 10:55:44] [INFO ] Built C files in 293ms 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 1621335345728

--------------------
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="GPUForwardProgress-PT-04a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is GPUForwardProgress-PT-04a, 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 r303-tall-162124171100050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-04a.tgz
mv GPUForwardProgress-PT-04a 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 ;