About the Execution of ITS-Tools.M for DoubleExponent-PT-001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
349.200 | 6490.00 | 12460.00 | 209.80 | FTFFFFFFTTFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r193-ebro-155234659500447.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is DoubleExponent-PT-001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-ebro-155234659500447
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K Feb 10 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 10 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 6 19:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 6 19:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 3 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 3 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 00:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 00:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553630997330
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(p24>=2)")))
Formula 0 simplified : !F"(p24>=2)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 48 rows 57 cols
invariant :p24 + -1'p38 + -1'p39 + -1'p40 + -1'p41 + -1'p42 + -1'p43 + -1'p44 + -1'p45 + -1'p46 + -1'p47 + -1'p48 + -1'p49 = 0
invariant :2'p1 + p12 + p13 + 2'p2 + 2'p3 + -1'p34 + p4 + -1'p46 + p5 + p51 + p53 + p6 = 2
invariant :-1'p1 + p14 + p16 + p17 + p18 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p38 + p39 + p40 + p42 + p43 + p45 + p46 + p47 + p49 + p5 + p50 + p51 + p52 + p53 + p54 + p55 + -1'p57 + p6 + p7 + -1'p8 + -1'p9 = -1
invariant :2'p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 = 2
invariant :p20 + -1'p56 + p57 = 0
invariant :p22 + -1'p26 + -1'p27 + -1'p28 + -1'p29 + -1'p30 + -1'p31 + -1'p32 + -1'p33 + -1'p34 + -1'p35 + -1'p37 + p48 + -1'p50 + -1'p51 + -1'p52 + -1'p53 + -1'p54 = 0
invariant :p19 + -1'p55 + p56 = 0
invariant :p36 + p48 + -1'p50 + -1'p51 + -1'p52 + -1'p53 + -1'p54 = 0
invariant :2'p1 + p10 + p11 + p17 + 2'p2 + p29 + p3 + p32 + p4 + p5 = 2
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t17, t23, t30, t36, t45, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/8/48
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
29 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.327344,24276,1,0,498,25236,122,561,1537,34299,1173
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(X("(p30<=p51)")))))
Formula 1 simplified : !GFX"(p30<=p51)"
Computing Next relation with stutter on 16 deadlock states
213 unique states visited
0 strongly connected components in search stack
214 transitions explored
108 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.367422,25224,1,0,500,25411,135,709,1608,37543,1929
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(X("(p54>=3)"))))
Formula 2 simplified : !GX"(p54>=3)"
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.370243,25472,1,0,500,25419,143,710,1610,37548,1942
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("(p36<=p19)")))
Formula 3 simplified : !G"(p36<=p19)"
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.386451,25732,1,0,623,26150,149,901,1615,39459,2297
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(G(("(p24<=p55)")U("(p7>=2)")))))
Formula 4 simplified : !G("(p24<=p55)" U "(p7>=2)")
Computing Next relation with stutter on 16 deadlock states
108 unique states visited
108 strongly connected components in search stack
109 transitions explored
108 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.4333,26868,1,0,623,26246,167,1005,1635,46306,3259
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G("(p52>=2)"))))
Formula 5 simplified : !XG"(p52>=2)"
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.434542,27108,1,0,623,26246,173,1005,1637,46306,3264
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X("(p21>=1)")))
Formula 6 simplified : !X"(p21>=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.435011,27108,1,0,623,26246,176,1005,1638,46307,3266
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((false))
Formula 7 simplified : 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.436197,27108,1,0,623,26246,176,1005,1638,46307,3267
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((("(p1<=p36)")U("(p26>=3)"))U(F(F("(p15>=1)")))))
Formula 8 simplified : !(("(p1<=p36)" U "(p26>=3)") U F"(p15>=1)")
Computing Next relation with stutter on 16 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.440485,27352,1,0,635,26342,185,1013,1639,46337,3324
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(F(("(p32<=p33)")U("(p24<=p27)")))))
Formula 9 simplified : !XF("(p32<=p33)" U "(p24<=p27)")
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.441127,27352,1,0,635,26342,194,1013,1642,46338,3328
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((false))
Formula 10 simplified : 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.441348,27352,1,0,635,26342,194,1013,1642,46338,3328
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(("(p37<=p9)")U(X("(p41>=3)")))))
Formula 11 simplified : !X("(p37<=p9)" U X"(p41>=3)")
Computing Next relation with stutter on 16 deadlock states
107 unique states visited
107 strongly connected components in search stack
107 transitions explored
107 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.46906,27776,1,0,834,26771,208,1303,1655,47684,4371
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((true))
Formula 12 simplified : 0
Computing Next relation with stutter on 16 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.469407,27776,1,0,834,26771,208,1303,1655,47684,4371
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X("(p52<=p25)"))U(X(G("(p57>=1)")))))
Formula 13 simplified : !(X"(p52<=p25)" U XG"(p57>=1)")
Computing Next relation with stutter on 16 deadlock states
282 unique states visited
0 strongly connected components in search stack
398 transitions explored
107 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.600307,30340,1,0,1221,35776,230,1689,1670,69008,6233
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G("(p7<=p13)")))
Formula 14 simplified : !G"(p7<=p13)"
Computing Next relation with stutter on 16 deadlock states
107 unique states visited
0 strongly connected components in search stack
107 transitions explored
107 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.616258,30604,1,0,1221,35784,236,1689,1677,69105,6980
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((("(p36>=1)")U("(p23<=p30)"))U(X(X("(p31<=p20)")))))
Formula 15 simplified : !(("(p36>=1)" U "(p23<=p30)") U XX"(p31<=p20)")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.622443,31824,1,0,1221,35784,270,1689,1706,69112,6999
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLCardinality-15 TRUE 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 1553631003820
--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 26, 2019 8:10:01 PM fr.lip6.move.gal.application.Application start
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]
Mar 26, 2019 8:10:01 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 8:10:01 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 56 ms
Mar 26, 2019 8:10:01 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 57 places.
Mar 26, 2019 8:10:01 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 48 transitions.
Mar 26, 2019 8:10:01 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 28 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 155 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 42 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 48 transitions.
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 57 places.
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 48 transitions.
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 48 transitions.
Mar 26, 2019 8:10:02 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 9 place invariants in 49 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 57 variables to be positive in 192 ms
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 48 transitions.
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/48 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 48 transitions.
Mar 26, 2019 8:10:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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:755)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 26, 2019 8:10:03 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1023ms 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="DoubleExponent-PT-001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsm"
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 itstoolsm"
echo " Input is DoubleExponent-PT-001, 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 r193-ebro-155234659500447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "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 '
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 ;