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.r096-oct2-158940145000385.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 JoinFreeModules-PT-0003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145000385
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.2K Apr 7 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 20:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 6 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 6 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 5 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:37 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 JoinFreeModules-PT-0003-00
FORMULA_NAME JoinFreeModules-PT-0003-01
FORMULA_NAME JoinFreeModules-PT-0003-02
FORMULA_NAME JoinFreeModules-PT-0003-03
FORMULA_NAME JoinFreeModules-PT-0003-04
FORMULA_NAME JoinFreeModules-PT-0003-05
FORMULA_NAME JoinFreeModules-PT-0003-06
FORMULA_NAME JoinFreeModules-PT-0003-07
FORMULA_NAME JoinFreeModules-PT-0003-08
FORMULA_NAME JoinFreeModules-PT-0003-09
FORMULA_NAME JoinFreeModules-PT-0003-10
FORMULA_NAME JoinFreeModules-PT-0003-11
FORMULA_NAME JoinFreeModules-PT-0003-12
FORMULA_NAME JoinFreeModules-PT-0003-13
FORMULA_NAME JoinFreeModules-PT-0003-14
FORMULA_NAME JoinFreeModules-PT-0003-15

=== Now, execution of the tool begins

BK_START 1589574015205

[2020-05-15 20:20:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-15 20:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 20:20:20] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2020-05-15 20:20:20] [INFO ] Transformed 16 places.
[2020-05-15 20:20:20] [INFO ] Transformed 25 transitions.
[2020-05-15 20:20:20] [INFO ] Parsed PT model containing 16 places and 25 transitions in 166 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 264 ms. (steps per millisecond=378 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 25 rows 15 cols
[2020-05-15 20:20:21] [INFO ] Computed 3 place invariants in 12 ms
[2020-05-15 20:20:21] [INFO ] [Real]Absence check using 3 positive place invariants in 37 ms returned unsat
[2020-05-15 20:20:21] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned unsat
[2020-05-15 20:20:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-15 20:20:21] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned unsat
[2020-05-15 20:20:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-15 20:20:21] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-15 20:20:21] [INFO ] Flatten gal took : 42 ms
FORMULA JoinFreeModules-PT-0003-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 20:20:21] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
[2020-05-15 20:20:21] [INFO ] Applying decomposition
[2020-05-15 20:20:21] [INFO ] Flatten gal took : 3 ms
Built C files in :
/home/mcc/execution
[2020-05-15 20:20:22] [INFO ] Input system was already deterministic with 25 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/graph18362708807885062084.txt, -o, /tmp/graph18362708807885062084.bin, -w, /tmp/graph18362708807885062084.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/graph18362708807885062084.bin, -l, -1, -v, -w, /tmp/graph18362708807885062084.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 15 cols
[2020-05-15 20:20:22] [INFO ] Computed 3 place invariants in 1 ms
inv : p6 + p7 + p8 + p9 + p10 = 6
inv : p1 + p2 + p3 + p4 + p5 = 6
inv : p11 + p12 + p13 + p14 + p15 = 6
Total of 3 invariants.
[2020-05-15 20:20:22] [INFO ] Computed 3 place invariants in 2 ms
[2020-05-15 20:20:22] [INFO ] Decomposing Gal with order
[2020-05-15 20:20:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 20:20:22] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-15 20:20:22] [INFO ] Proved 15 variables to be positive in 201 ms
[2020-05-15 20:20:22] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-15 20:20:22] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:20:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:20:22] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-15 20:20:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 20:20:22] [INFO ] Flatten gal took : 144 ms
[2020-05-15 20:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2020-05-15 20:20:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-15 20:20:22] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((G(F(X((("(gi1.gu2.p2>=1)")U(X(F("(gi2.gu3.p10>=2)"))))&&(G(!(X("(gu0.p1<=gu0.p8)")))))))))
Formula 0 simplified : !GFX(("(gi1.gu2.p2>=1)" U XF"(gi2.gu3.p10>=2)") & G!X"(gu0.p1<=gu0.p8)")
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t10, t11, t18, t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/18/6/24
4 unique states visited
4 strongly connected components in search stack
5 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.038353,18024,1,0,56,3110,77,27,714,2629,70
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(X(F((F("((gu0.p3<=gu0.p1)&&(gi2.gu3.p14>=0))"))||("(gu0.p3<=gu0.p1)")))))))
Formula 1 simplified : !X!XF("(gu0.p3<=gu0.p1)" | F"((gu0.p3<=gu0.p1)&&(gi2.gu3.p14>=0))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.070281,18832,1,0,117,6604,92,47,730,7061,186
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((G(F("(gu0.p3>gu0.p5)")))&&(G("(gi2.gu3.p9<=gi2.gu4.p13)")))U(!(G(F(X("(gu0.p3>gu0.p5)")))))))
Formula 2 simplified : !((GF"(gu0.p3>gu0.p5)" & G"(gi2.gu3.p9<=gi2.gu4.p13)") U !GFX"(gu0.p3>gu0.p5)")
2 unique states visited
1 strongly connected components in search stack
3 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.073581,19172,1,0,119,6926,97,48,740,7500,197
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(G((!(X("(gi2.gu3.p9<=gi2.gu3.p11)")))||("(gi1.gu2.p2>gu0.p3)"))))))
Formula 3 simplified : !F!G("(gi1.gu2.p2>gu0.p3)" | !X"(gi2.gu3.p9<=gi2.gu3.p11)")
2 unique states visited
0 strongly connected components in search stack
1 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.074498,19476,1,0,119,6926,111,48,756,7503,206
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0003-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F("(gi2.gu3.p9>=1)"))&&(F(X("(gi2.gu3.p9>=1)")))))
Formula 4 simplified : !(F"(gi2.gu3.p9>=1)" & FX"(gi2.gu3.p9>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.122475,20000,1,0,176,12065,120,77,758,14398,358
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(((F(X(F("(gi2.gu4.p15<=gi2.gu4.p13)"))))||(G("(gi2.gu4.p15<=gi2.gu4.p13)")))||("(gi1.gu1.p6<=gi1.gu1.p7)"))))
Formula 5 simplified : !X("(gi1.gu1.p6<=gi1.gu1.p7)" | FXF"(gi2.gu4.p15<=gi2.gu4.p13)" | G"(gi2.gu4.p15<=gi2.gu4.p13)")
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.128887,20256,1,0,241,13423,132,99,765,16161,478
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((F(G((F(G(F("(gu0.p1<=gi2.gu4.p15)"))))||("(gi1.gu2.p12<=gi1.gu2.p2)"))))&&("(gi1.gu2.p2<=gi2.gu3.p11)"))))
Formula 6 simplified : !F("(gi1.gu2.p2<=gi2.gu3.p11)" & FG("(gi1.gu2.p12<=gi1.gu2.p2)" | FGF"(gu0.p1<=gi2.gu4.p15)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
11 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.241197,22180,1,0,255,22946,160,109,794,32913,530
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X((!((X((G("(gi2.gu3.p14>=3)"))U(F("(gi2.gu3.p11>=1)"))))U(G("(gi2.gu3.p11>=1)"))))||("(gi2.gu4.p15>gi1.gu2.p12)")))))
Formula 7 simplified : !FX("(gi2.gu4.p15>gi1.gu2.p12)" | !(X(G"(gi2.gu3.p14>=3)" U F"(gi2.gu3.p11>=1)") U G"(gi2.gu3.p11>=1)"))
4 unique states visited
4 strongly connected components in search stack
5 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,0.285525,22944,1,0,312,26012,176,136,806,37207,690
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(!(F(!(X(G("(gi1.gu2.p12<=gi1.gu1.p7)"))))))))
Formula 8 simplified : !X!F!XG"(gi1.gu2.p12<=gi1.gu1.p7)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
13 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.423914,24788,1,0,383,35015,182,164,816,51008,844
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(F(G(X("(gi2.gu3.p10>=3)")))))))
Formula 9 simplified : !XXFGX"(gi2.gu3.p10>=3)"
2 unique states visited
1 strongly connected components in search stack
3 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.442756,24788,1,0,383,35015,187,164,818,51008,847
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0003-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-15 20:20:24] [INFO ] Computing symmetric co enabling matrix : 25 transitions.
[2020-05-15 20:20:25] [INFO ] Computation of co-enabling matrix(9/25) took 470 ms. Total solver calls (SAT/UNSAT): 59(34/25)
[2020-05-15 20:20:26] [INFO ] Computation of Finished co-enabling matrix. took 1215 ms. Total solver calls (SAT/UNSAT): 108(66/42)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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-15 20:20:26] [INFO ] Built C files in 4127ms 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 1589574026813

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="LTLCardinality"
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 JoinFreeModules-PT-0003, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-oct2-158940145000385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;