Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.3K May 30 21:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 30 21:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 28 09:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 28 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 17K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
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 r285-csrt-152749175900186
=====================================================================

--------------------
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 1527986715063

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph2137776301816446847.txt, -o, /tmp/graph2137776301816446847.bin, -w, /tmp/graph2137776301816446847.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph2137776301816446847.bin, -l, -1, -v, -w, /tmp/graph2137776301816446847.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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 : !((F((X(G("(i6.u16.p4>=1)")))U(G(X("(i5.u22.p15>=1)"))))))
Formula 0 simplified : !F(XG"(i6.u16.p4>=1)" U GX"(i5.u22.p15>=1)")
built 22 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t25, t37, t9, i3.u10.t30, i4.u14.t42, i5.u20.t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/8/48
Computing Next relation with stutter on 16 deadlock states
108 unique states visited
107 strongly connected components in search stack
109 transitions explored
108 items max in DFS search stack
17 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.204402,21436,1,0,7735,191,772,10725,117,565,32226
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 USE_NUPN
Checking formula 1 : !(((F(X(F("((i6.u18.p12>=1)&&(i6.u17.p52>=1))"))))U("(i1.u5.p21>=1)")))
Formula 1 simplified : !(FXF"((i6.u18.p12>=1)&&(i6.u17.p52>=1))" U "(i1.u5.p21>=1)")
Computing Next relation with stutter on 16 deadlock states
17 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 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.234914,22988,1,0,9552,191,823,13025,118,565,41649
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 USE_NUPN
Checking formula 2 : !((F(X(G(("(i6.u0.p3>=1)")U("(i5.u22.p15>=1)"))))))
Formula 2 simplified : !FXG("(i6.u0.p3>=1)" U "(i5.u22.p15>=1)")
Computing Next relation with stutter on 16 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
104 unique states visited
104 strongly connected components in search stack
104 transitions explored
104 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.258089,23568,1,0,9922,191,847,13710,118,565,44561
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 USE_NUPN
Checking formula 3 : !(("(i2.u6.p23>=1)"))
Formula 3 simplified : !"(i2.u6.p23>=1)"
Computing Next relation with stutter on 16 deadlock states
// Phase 1: matrix 48 rows 57 cols
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.262617,23568,1,0,9984,191,854,13885,118,565,44911
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 USE_NUPN
Checking formula 4 : !(("((i4.u13.p40>=1)&&(i5.u21.p8>=1))"))
Formula 4 simplified : !"((i4.u13.p40>=1)&&(i5.u21.p8>=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,0.263017,23832,1,0,9984,191,862,13885,118,565,44918
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 USE_NUPN
Checking formula 5 : !((G((G(G("(i5.u21.p41>=1)")))U("(i3.u10.p35>=1)"))))
Formula 5 simplified : !G(G"(i5.u21.p41>=1)" U "(i3.u10.p35>=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,0.264557,24136,1,0,9984,191,895,13885,119,565,44949
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 USE_NUPN
Checking formula 6 : !((((G("((i4.u13.p40>=1)&&(i5.u21.p8>=1))"))U(G("(i4.u13.p39>=1)")))U("((i4.u15.p46>=1)&&(i6.u0.p13>=1))")))
Formula 6 simplified : !((G"((i4.u13.p40>=1)&&(i5.u21.p8>=1))" U G"(i4.u13.p39>=1)") U "((i4.u15.p46>=1)&&(i6.u0.p13>=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,0.267752,25064,1,0,9984,191,941,13885,121,565,44997
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((("((i4.u13.p40>=1)&&(i5.u21.p8>=1))")U(X(X(G("(i1.u4.p20>=1)"))))))
Formula 7 simplified : !("((i4.u13.p40>=1)&&(i5.u21.p8>=1))" U XXG"(i1.u4.p20>=1)")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
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.272373,25196,1,0,10053,191,954,14072,121,565,45429
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 USE_NUPN
Checking formula 8 : !(("(i3.u8.p27>=1)"))
Formula 8 simplified : !"(i3.u8.p27>=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,0.272657,25196,1,0,10053,191,957,14072,121,565,45435
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 USE_NUPN
Checking formula 9 : !(((("((i6.u18.p12>=1)&&(i6.u17.p50>=1))")U(G("(i4.u13.p39>=1)")))U(F(F(G("(i1.u3.p19>=1)"))))))
Formula 9 simplified : !(("((i6.u18.p12>=1)&&(i6.u17.p50>=1))" U G"(i4.u13.p39>=1)") U FG"(i1.u3.p19>=1)")
Computing Next relation with stutter on 16 deadlock states
invariant :i0:u1:p29 + i0:u9:p30 + i0:u11:p32 + i0:u11:p33 + i0:u11:p34 + -1'i1:u5:p22 + -1'i2:u7:p48 + i2:u12:p37 + i2:u12:p54 + i3:u8:p26 + i3:u8:p27 + i3:u8:p28 + i3:u10:p31 + i3:u10:p35 + i6:u17:p50 + i6:u17:p51 + i6:u17:p52 + i6:u18:p53 = 0
invariant :i4:u15:p44 + 2'i5:u21:p1 + i5:u21:p41 + i5:u21:p8 + i5:u22:p15 + i5:u22:p9 + i6:u0:p2 + i6:u0:p3 + i6:u16:p4 = 2
invariant :i2:u6:p24 + -1'i2:u7:p48 + -1'i2:u7:p49 + -1'i4:u13:p38 + -1'i4:u13:p39 + -1'i4:u13:p40 + -1'i4:u14:p43 + -1'i4:u14:p47 + -1'i4:u15:p45 + -1'i4:u15:p46 + -1'i5:u20:p42 + 2'i5:u21:p1 + i5:u21:p8 + i5:u22:p15 + i5:u22:p9 + i6:u0:p2 + i6:u0:p3 + i6:u16:p4 = 2
invariant :i1:u3:p19 + -1'i1:u19:p55 + i1:u4:p20 + i1:u4:p57 = 0
invariant :i1:u3:p56 + -1'i1:u4:p20 + -1'i1:u4:p57 = 0
invariant :i2:u7:p48 + i2:u12:p36 + -1'i2:u12:p54 + -1'i6:u17:p50 + -1'i6:u17:p51 + -1'i6:u17:p52 + -1'i6:u18:p53 = 0
invariant :i0:u1:p10 + i0:u2:p11 + i0:u2:p17 + -1'i0:u9:p30 + -1'i0:u11:p33 + -1'i0:u11:p34 + i1:u5:p22 + i2:u7:p48 + -1'i2:u12:p37 + -1'i2:u12:p54 + -1'i3:u8:p26 + -1'i3:u8:p27 + -1'i3:u8:p28 + -1'i3:u10:p31 + -1'i3:u10:p35 + 2'i5:u21:p1 + 2'i6:u0:p2 + i6:u0:p3 + i6:u16:p4 + i6:u16:p5 + -1'i6:u17:p50 + -1'i6:u17:p51 + -1'i6:u17:p52 + -1'i6:u18:p53 = 2
invariant :i0:u2:p17 + i0:u9:p16 + i1:u19:p18 + i1:u19:p55 + -1'i1:u4:p57 + i1:u5:p21 + i1:u5:p22 + i2:u6:p23 + i2:u7:p25 + i2:u7:p48 + i2:u7:p49 + i4:u13:p38 + i4:u13:p39 + i4:u13:p40 + i4:u14:p43 + i4:u14:p47 + i4:u15:p45 + i4:u15:p46 + i5:u20:p14 + i5:u20:p42 + i5:u20:p7 + -1'i5:u21:p1 + -1'i5:u21:p8 + -1'i5:u22:p9 + i6:u16:p5 + i6:u16:p6 = -1
invariant :-1'i0:u11:p34 + -1'i4:u15:p46 + 2'i5:u21:p1 + i6:u0:p13 + 2'i6:u0:p2 + 2'i6:u0:p3 + i6:u16:p4 + i6:u16:p5 + i6:u16:p6 + i6:u17:p51 + i6:u18:p12 + i6:u18:p53 = 2
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,0.338414,27448,1,0,14534,191,975,18174,121,566,60053
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 USE_NUPN
Checking formula 10 : !((X(F((G("(i2.u6.p23>=1)"))U("(i5.u21.p41>=1)")))))
Formula 10 simplified : !XF(G"(i2.u6.p23>=1)" U "(i5.u21.p41>=1)")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.350126,27980,1,0,15548,191,987,18978,121,566,63176
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 USE_NUPN
Checking formula 11 : !((X(F(F(X("(i6.u18.p53>=1)"))))))
Formula 11 simplified : !XFX"(i6.u18.p53>=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.356437,28244,1,0,15783,191,1003,19330,121,566,64612
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 USE_NUPN
Checking formula 12 : !((X(G("((i4.u14.p43>=1)&&(i5.u22.p9>=1))"))))
Formula 12 simplified : !XG"((i4.u14.p43>=1)&&(i5.u22.p9>=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.357635,28508,1,0,15783,191,1024,19330,121,566,64625
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 USE_NUPN
Checking formula 13 : !(((X(("(i3.u8.p27>=1)")U("((i4.u14.p43>=1)&&(i5.u22.p9>=1))")))U(G("(i3.u10.p35>=1)"))))
Formula 13 simplified : !(X("(i3.u8.p27>=1)" U "((i4.u14.p43>=1)&&(i5.u22.p9>=1))") U G"(i3.u10.p35>=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
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.3939,29264,1,0,16776,191,1037,20691,121,566,70017
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 USE_NUPN
Checking formula 14 : !(("(i3.u8.p27>=1)"))
Formula 14 simplified : !"(i3.u8.p27>=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,0.394415,29264,1,0,16776,191,1037,20691,121,566,70017
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 USE_NUPN
Checking formula 15 : !((X(X(F("(i3.u10.p35>=1)")))))
Formula 15 simplified : !XXF"(i3.u10.p35>=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.39915,29528,1,0,17044,191,1056,21054,121,566,71381
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 USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527986719775

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 03, 2018 12:45:18 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/, -louvain, -smt]
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 32 ms
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 57 places.
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 48 transitions.
Jun 03, 2018 12:45:18 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 18 ms
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 85 ms
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 21 ms
Begin: Sun Jun 3 00:45:18 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:45:18 2018
network size: 57 nodes, 170 links, 96 weight
quality increased from -0.0202908 to 0.400174
end computation: Sun Jun 3 00:45:18 2018
level 1:
start computation: Sun Jun 3 00:45:18 2018
network size: 23 nodes, 117 links, 96 weight
quality increased from 0.400174 to 0.560655
end computation: Sun Jun 3 00:45:18 2018
level 2:
start computation: Sun Jun 3 00:45:18 2018
network size: 9 nodes, 49 links, 96 weight
quality increased from 0.560655 to 0.568197
end computation: Sun Jun 3 00:45:18 2018
level 3:
start computation: Sun Jun 3 00:45:18 2018
network size: 7 nodes, 35 links, 96 weight
quality increased from 0.568197 to 0.568197
end computation: Sun Jun 3 00:45:18 2018
End: Sun Jun 3 00:45:18 2018
Total duration: 0 sec
0.568197
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 13 ms
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:45:18 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 10 redundant transitions.
Jun 03, 2018 12:45:18 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 03, 2018 12:45:18 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 03, 2018 12:45:19 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 48 transitions.
Jun 03, 2018 12:45:19 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 9 place invariants in 36 ms
Jun 03, 2018 12:45:19 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 exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
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)
Jun 03, 2018 12:45:19 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 393ms 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="itstoolsl"
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

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
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 r285-csrt-152749175900186"
echo "====================================================================="
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 ;