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.r063-ebro-155234659500448.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 itstools
Input is DoubleExponent-PT-001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-ebro-155234659500448
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552828870828

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 : !((G((F(G("(p39>=1)")))U(F(F("((p11>=1)&&(p31>=1))"))))))
Formula 0 simplified : !G(FG"(p39>=1)" U F"((p11>=1)&&(p31>=1))")
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t25, t30, t37, t42, t7, t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/8/48
Computing Next relation with stutter on 16 deadlock states
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
109 unique states visited
109 strongly connected components in search stack
110 transitions explored
109 items max in DFS search stack
37 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.406431,25408,1,0,477,33244,126,498,1626,39258,1188
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X("(p44>=1)")))
Formula 1 simplified : !X"(p44>=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
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.412208,25672,1,0,477,33434,131,500,1627,39522,1201
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(F(F(G("(p23>=1)")))))))
Formula 2 simplified : !FGFG"(p23>=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
18 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.592951,29780,1,0,999,51585,144,1114,1628,73007,2735
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(F(X(F(G("(p47>=1)")))))))
Formula 3 simplified : !FXFG"(p47>=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
15 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.745273,32672,1,0,1567,63580,157,1754,1629,98907,4296
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F(G(G("((p13>=1)&&(p34>=1))"))))U(X(G(F("(p7>=1)"))))))
Formula 4 simplified : !(FG"((p13>=1)&&(p34>=1))" U XGF"(p7>=1)")
Computing Next relation with stutter on 16 deadlock states
109 unique states visited
109 strongly connected components in search stack
110 transitions explored
109 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.76067,33312,1,0,1577,64229,166,1764,1630,99859,4529
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(X((F("(p47>=1)"))U("((p40>=1)&&(p8>=1))")))))
Formula 5 simplified : !XX(F"(p47>=1)" U "((p40>=1)&&(p8>=1))")
Computing Next relation with stutter on 16 deadlock states
55 unique states visited
55 strongly connected components in search stack
55 transitions explored
55 items max in DFS search stack
196 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,2.72342,70644,1,0,10386,211672,176,8555,1635,443459,16097
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X((F(G("(p3>=1)")))U(X(X("(p4>=1)"))))))
Formula 6 simplified : !X(FG"(p3>=1)" U XX"(p4>=1)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
0 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,2.72801,71224,1,0,10386,211672,179,8555,1636,443459,16099
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(X(F(("(p35>=1)")U("((p10>=1)&&(p28>=1))"))))))
Formula 7 simplified : !FXF("(p35>=1)" U "((p10>=1)&&(p28>=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
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,2.74467,71488,1,0,10447,213190,188,8619,1639,445385,16292
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("((p43>=1)&&(p9>=1))")U((G("(p26>=1)"))U(X("((p13>=1)&&(p34>=1))")))))
Formula 8 simplified : !("((p43>=1)&&(p9>=1))" U (G"(p26>=1)" U X"((p13>=1)&&(p34>=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,2.75012,72092,1,0,10447,213190,202,8619,1650,445390,16300
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("(p38>=1)"))
Formula 9 simplified : !"(p38>=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
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,2.75221,72092,1,0,10447,213190,205,8619,1651,445391,16303
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(X(G(("(p45>=1)")U("(p23>=1)"))))))
Formula 10 simplified : !GXG("(p45>=1)" U "(p23>=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,2.75454,72336,1,0,10447,213190,219,8619,1659,445393,16310
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((X(F("((p11>=1)&&(p31>=1))")))U((X("(p20>=1)"))U(F("(p47>=1)")))))
Formula 11 simplified : !(XF"((p11>=1)&&(p31>=1))" U (X"(p20>=1)" U F"(p47>=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
7 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,2.81208,73116,1,0,10840,218289,223,8957,1659,457155,17128
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X("(p29>=1)")))
Formula 12 simplified : !X"(p29>=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,2.81333,73380,1,0,10840,218289,226,8957,1660,457155,17130
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((((X("(p7>=1)"))U(G("((p40>=1)&&(p8>=1))")))U(G(("(p23>=1)")U("((p36>=1)&&(p54>=1))")))))
Formula 13 simplified : !((X"(p7>=1)" U G"((p40>=1)&&(p8>=1))") U G("(p23>=1)" U "((p36>=1)&&(p54>=1))"))
Computing Next relation with stutter on 16 deadlock states
103 unique states visited
103 strongly connected components in search stack
103 transitions explored
103 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,2.8677,74452,1,0,11071,221584,240,9124,1672,462860,18014
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((X(X("(p27>=1)")))U(G("(p32>=1)")))))
Formula 14 simplified : !F(XX"(p27>=1)" U G"(p32>=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
15 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,3.01968,78412,1,0,11401,237822,253,9700,1673,495903,19477
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(F("(p21>=1)"))))
Formula 15 simplified : !GF"(p21>=1)"
Computing Next relation with stutter on 16 deadlock states
109 unique states visited
109 strongly connected components in search stack
110 transitions explored
109 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,3.07095,79732,1,0,11575,245659,262,9830,1674,504442,19890
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-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 1552828878404

--------------------
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 17, 2019 1:21:13 PM 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 17, 2019 1:21:13 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 1:21:13 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Mar 17, 2019 1:21:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 57 places.
Mar 17, 2019 1:21:14 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 48 transitions.
Mar 17, 2019 1:21:14 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 21 ms
Mar 17, 2019 1:21:14 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 64 ms
Mar 17, 2019 1:21:14 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
Mar 17, 2019 1:21:14 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 17, 2019 1:21:14 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 48 transitions.
Mar 17, 2019 1:21:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 9 place invariants in 20 ms
Mar 17, 2019 1:21:14 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 57 variables to be positive in 134 ms
Mar 17, 2019 1:21:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 48 transitions.
Mar 17, 2019 1:21:15 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 17, 2019 1:21:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 1:21:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 48 transitions.
Mar 17, 2019 1:21:15 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)
Mar 17, 2019 1:21:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 48 transitions.
Mar 17, 2019 1:21:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(28/48) took 2096 ms. Total solver calls (SAT/UNSAT): 743(718/25)
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 17, 2019 1:21:18 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3502ms 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="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 DoubleExponent-PT-001, 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 r063-ebro-155234659500448"
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 [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;