About the Execution of ITS-Tools for DNAwalker-PT-02track12Block2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
317.770 | 3096.00 | 6716.00 | 127.10 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r052-oct2-155234410200610.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
Input is DNAwalker-PT-02track12Block2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-oct2-155234410200610
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Feb 10 20:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 20:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 6 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 115 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 353 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 3 06:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 06:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 30 22:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 30 22:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 16 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 37K Mar 10 17:31 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 DNAwalker-PT-02track12Block2-LTLFireability-00
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-01
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-02
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-03
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-04
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-05
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-06
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-07
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-08
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-09
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-10
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-11
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-12
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-13
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-14
FORMULA_NAME DNAwalker-PT-02track12Block2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1552645099191
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 : !((("((A9>=2)&&(A11>=1))")U(F(("((A9>=2)&&(A4>=1))")U("((A4>=2)&&(A6>=1))")))))
Formula 0 simplified : !("((A9>=2)&&(A11>=1))" U F("((A9>=2)&&(A4>=1))" U "((A4>=2)&&(A6>=1))"))
Reverse transition relation is NOT exact ! Due to transitions tb5, tAb5, tb6, tAb6, t1_2, t1_3, t1_4, t1_5, t1_9, t2_3, t2_4, t2_5, t2_6, t2_9, t2_10, t3_2, t3_4, t3_5, t3_6, t3_7, t3_9, t3_10, t3_11, t4_2, t4_3, t4_5, t4_6, t4_7, t4_9, t4_10, t4_11, t5_2, t5_3, t5_4, t5_6, t5_7, t5_8, t5_9, t5_10, t5_11, t6_2, t6_3, t6_4, t6_5, t6_7, t6_8, t6_9, t6_10, t7_3, t7_4, t7_5, t7_9, t9_2, t9_3, t9_4, t9_5, t9_6, t9_7, t9_10, t9_11, t9_12, t10_3, t10_4, t10_5, t10_6, t10_9, t10_12, t11_3, t11_4, t11_5, t11_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :5/8/71/84
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.134759,20852,1,0,294,24410,187,131,978,24638,288
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G((X("((A3>=2)&&(A6>=1))"))U(X("((A4>=2)&&(A9>=1))"))))))
Formula 1 simplified : !XG(X"((A3>=2)&&(A6>=1))" U X"((A4>=2)&&(A9>=1))")
Computing Next relation with stutter on 6 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 items max in DFS search stack
6 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.185799,22056,1,0,309,25941,200,158,1009,29062,366
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((("(A12>=2)")U("((A2>=2)&&(A6>=1))"))U(X(("((A9>=2)&&(A11>=1))")U("((A2>=2)&&(A3>=1))")))))
Formula 2 simplified : !(("(A12>=2)" U "((A2>=2)&&(A6>=1))") U X("((A9>=2)&&(A11>=1))" U "((A2>=2)&&(A3>=1))"))
Computing Next relation with stutter on 6 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
6 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.250215,24212,1,0,343,31929,225,195,1029,35040,470
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("((A2>=2)&&(A6>=1))"))
Formula 3 simplified : !"((A2>=2)&&(A6>=1))"
Computing Next relation with stutter on 6 deadlock states
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.250652,24212,1,0,343,31929,226,195,1029,35040,473
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F((F("((A4>=2)&&(A1>=1))"))U(G("((A2>=2)&&(A3>=1))"))))))
Formula 4 simplified : !XF(F"((A4>=2)&&(A1>=1))" U G"((A2>=2)&&(A3>=1))")
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 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.313676,26248,1,0,426,40832,237,268,1029,48507,689
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G("((A6>=2)&&(A8>=1))")))
Formula 5 simplified : !G"((A6>=2)&&(A8>=1))"
Computing Next relation with stutter on 6 deadlock states
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.314292,26512,1,0,426,40832,243,268,1032,48507,694
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(F(X("((A9>=2)&&(A10>=1))"))))))
Formula 6 simplified : !FXFX"((A9>=2)&&(A10>=1))"
Computing Next relation with stutter on 6 deadlock states
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,0.362748,27304,1,0,472,45617,252,309,1034,55072,798
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((G("((A10>=2)&&(A6>=1))"))U(X("((A9>=2)&&(A12>=1))")))U(F(("((A5>=2)&&(A2>=1))")U("((A6>=2)&&(A8>=1))")))))
Formula 7 simplified : !((G"((A10>=2)&&(A6>=1))" U X"((A9>=2)&&(A12>=1))") U F("((A5>=2)&&(A2>=1))" U "((A6>=2)&&(A8>=1))"))
Computing Next relation with stutter on 6 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 83
// Phase 1: matrix 83 rows 14 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.400684,27980,1,0,521,50105,258,352,1034,59420,908
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("((A4>=2)&&(A3>=1))"))
Formula 8 simplified : !"((A4>=2)&&(A3>=1))"
Computing Next relation with stutter on 6 deadlock states
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.401056,28244,1,0,521,50105,261,352,1035,59420,910
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((((F("((A5>=2)&&(A6>=1))"))U(G("((A6>=2)&&(A8>=1))")))U("(A12>=2)")))
Formula 9 simplified : !((F"((A5>=2)&&(A6>=1))" U G"((A6>=2)&&(A8>=1))") U "(A12>=2)")
Computing Next relation with stutter on 6 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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.419234,28876,1,0,585,52360,271,424,1042,63842,1090
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F("((A9>=2)&&(A4>=1))")))
Formula 10 simplified : !F"((A9>=2)&&(A4>=1))"
Computing Next relation with stutter on 6 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.473737,29932,1,0,638,57418,280,470,1044,69323,1208
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(F("((A9>=2)&&(A1>=1))"))))
Formula 11 simplified : !F"((A9>=2)&&(A1>=1))"
Computing Next relation with stutter on 6 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.476968,30196,1,0,644,57585,289,488,1046,69714,1284
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("((A5>=2)&&(A7>=1))")))
Formula 12 simplified : !G"((A5>=2)&&(A7>=1))"
Computing Next relation with stutter on 6 deadlock states
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.477527,30460,1,0,644,57585,295,488,1048,69714,1289
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((G(F(G("((A9>=2)&&(A1>=1))"))))U(F(X(G("((A4>=2)&&(A7>=1))"))))))
Formula 13 simplified : !(GFG"((A9>=2)&&(A1>=1))" U FXG"((A4>=2)&&(A7>=1))")
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 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.548642,32224,1,0,726,66794,308,565,1049,84966,1505
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X("((A4>=2)&&(A3>=1))")))
Formula 14 simplified : !X"((A4>=2)&&(A3>=1))"
Computing Next relation with stutter on 6 deadlock states
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.575658,32752,1,0,742,68604,308,589,1049,87915,1553
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(G(("((A6>=2)&&(A5>=1))")U(X("(B5>=1)"))))))
Formula 15 simplified : !G("((A6>=2)&&(A5>=1))" U X"(B5>=1)")
Computing Next relation with stutter on 6 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 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.602583,33272,1,0,756,69657,314,605,1052,89567,1627
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DNAwalker-PT-02track12Block2-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552645102287
--------------------
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
+ [[ -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 15, 2019 10:18:20 AM fr.lip6.move.gal.application.Application start
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/, -smt]
Mar 15, 2019 10:18:20 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 15, 2019 10:18:21 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
Mar 15, 2019 10:18:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
Mar 15, 2019 10:18:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
Mar 15, 2019 10:18:21 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Mar 15, 2019 10:18:21 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 60 ms
Mar 15, 2019 10:18:21 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 15, 2019 10:18:21 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 15, 2019 10:18:21 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
Mar 15, 2019 10:18:21 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 0 place invariants in 4 ms
Mar 15, 2019 10:18:22 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
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.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 15, 2019 10:18:22 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 598ms conformant to PINS in folder :/home/mcc/execution
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="DNAwalker-PT-02track12Block2"
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-3954"
echo " Executing tool itstools"
echo " Input is DNAwalker-PT-02track12Block2, 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 r052-oct2-155234410200610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-02track12Block2.tgz
mv DNAwalker-PT-02track12Block2 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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 '
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 ;