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 240K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is ResAllocation-PT-R003C010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140900138
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528325053064

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/graph3881844429204063092.txt, -o, /tmp/graph3881844429204063092.bin, -w, /tmp/graph3881844429204063092.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/graph3881844429204063092.bin, -l, -1, -v, -w, /tmp/graph3881844429204063092.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(F(X(G("(((i4.u12.p_6_1>=1)&&(i4.u12.r_6_2>=1))&&(i4.u12.r_5_2>=1))")))))))
Formula 0 simplified : !FXFXG"(((i4.u12.p_6_1>=1)&&(i4.u12.r_6_2>=1))&&(i4.u12.r_5_2>=1))"
built 20 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, t_2_3, t_3_0, t_4_3, t_5_0, t_7_0, t_8_3, t_9_0, i1.u2.t_0_3, i4.u12.t_6_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/10/40
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
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.263436,21168,1,0,9861,788,787,13188,294,1947,15660
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(G(G("((i0.u6.r_2_0>=1)&&(i0.u3.r_1_0>=1))"))))))
Formula 1 simplified : !FG"((i0.u6.r_2_0>=1)&&(i0.u3.r_1_0>=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
10 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.36254,23520,1,0,17482,812,871,20019,295,2083,25085
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("(((u10.r_3_1>=1)&&(i3.u8.p_3_2>=1))&&(i0.u7.r_2_1>=1))"))
Formula 2 simplified : !"(((u10.r_3_1>=1)&&(i3.u8.p_3_2>=1))&&(i0.u7.r_2_1>=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.369377,23784,1,0,17680,812,893,20258,295,2095,25718
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(("(((i5.u13.p_6_0>=1)&&(i4.u12.r_6_1>=1))&&(i4.u12.r_5_1>=1))")U("((i6.u21.r_9_2>=1)&&(i6.u18.r_8_2>=1))")))U(F(G("(((u10.r_3_0>=1)&&(i0.u7.p_3_1>=1))&&(i0.u6.r_2_0>=1))")))))
Formula 3 simplified : !(X("(((i5.u13.p_6_0>=1)&&(i4.u12.r_6_1>=1))&&(i4.u12.r_5_1>=1))" U "((i6.u21.r_9_2>=1)&&(i6.u18.r_8_2>=1))") U FG"(((u10.r_3_0>=1)&&(i0.u7.p_3_1>=1))&&(i0.u6.r_2_0>=1))")
Computing Next relation with stutter on 16 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 60 cols
invariant :i5:u13:p_6_0 + i5:u13:r_6_0 + -1'i5:u14:r_7_0 + i5:u17:r_8_0 + -1'i5:u19:r_9_0 = 0
invariant :i3:u9:p_4_2 + i4:u11:r_4_2 + -1'i4:u12:r_5_2 + i4:u12:r_6_2 + -1'i6:u16:r_7_2 + i6:u18:r_8_2 + -1'i6:u21:r_9_2 = 0
invariant :i6:u21:p_9_2 + i6:u21:r_9_2 = 1
invariant :u10:p_4_0 + u10:r_4_0 + -1'i5:u13:r_5_0 + i5:u13:r_6_0 + -1'i5:u14:r_7_0 + i5:u17:r_8_0 + -1'i5:u19:r_9_0 = 0
invariant :i6:u20:p_9_1 + i6:u20:r_9_1 = 1
invariant :u10:r_3_1 + -1'u10:r_4_1 + i0:u7:p_3_1 + i4:u12:r_5_1 + -1'i4:u12:r_6_1 + i6:u15:r_7_1 + -1'i6:u20:r_8_1 + i6:u20:r_9_1 = 1
invariant :i6:u15:p_7_1 + i6:u15:r_7_1 + -1'i6:u20:r_8_1 + i6:u20:r_9_1 = 1
invariant :i3:u8:p_3_2 + i3:u9:r_3_2 + -1'i4:u11:r_4_2 + i4:u12:r_5_2 + -1'i4:u12:r_6_2 + i6:u16:r_7_2 + -1'i6:u18:r_8_2 + i6:u21:r_9_2 = 1
invariant :i4:u12:p_6_2 + i4:u12:r_6_2 + -1'i6:u16:r_7_2 + i6:u18:r_8_2 + -1'i6:u21:r_9_2 = 0
invariant :i0:u4:p_1_1 + i0:u4:r_1_1 + -1'i0:u7:r_2_1 + -1'i0:u7:p_3_1 = 0
invariant :u10:r_3_0 + -1'u10:r_4_0 + i0:u6:p_3_0 + i5:u13:r_5_0 + -1'i5:u13:r_6_0 + i5:u14:r_7_0 + -1'i5:u17:r_8_0 + i5:u19:r_9_0 = 1
invariant :u10:p_4_1 + u10:r_4_1 + -1'i4:u12:r_5_1 + i4:u12:r_6_1 + -1'i6:u15:r_7_1 + i6:u20:r_8_1 + -1'i6:u20:r_9_1 = 0
invariant :i0:u0:p_0_0 + i0:u0:r_0_0 + -1'i0:u3:r_1_0 + i0:u6:r_2_0 + i0:u6:p_3_0 = 1
invariant :i6:u16:p_7_2 + i6:u16:r_7_2 + -1'i6:u18:r_8_2 + i6:u21:r_9_2 = 1
invariant :i4:u11:p_5_2 + i4:u12:r_5_2 + -1'i4:u12:r_6_2 + i6:u16:r_7_2 + -1'i6:u18:r_8_2 + i6:u21:r_9_2 = 1
invariant :i6:u15:p_8_1 + i6:u20:r_8_1 + -1'i6:u20:r_9_1 = 0
invariant :i1:u5:p_1_2 + i1:u5:r_1_2 + -1'i3:u8:r_2_2 + i3:u9:r_3_2 + -1'i4:u11:r_4_2 + i4:u12:r_5_2 + -1'i4:u12:r_6_2 + i6:u16:r_7_2 + -1'i6:u18:r_8_2 + i6:u21:r_9_2 = 1
invariant :u10:p_5_0 + i5:u13:r_5_0 + -1'i5:u13:r_6_0 + i5:u14:r_7_0 + -1'i5:u17:r_8_0 + i5:u19:r_9_0 = 1
invariant :i4:u12:p_6_1 + i4:u12:r_6_1 + -1'i6:u15:r_7_1 + i6:u20:r_8_1 + -1'i6:u20:r_9_1 = 0
invariant :i6:u18:p_8_2 + i6:u18:r_8_2 + -1'i6:u21:r_9_2 = 0
invariant :i0:u3:p_2_0 + i0:u6:r_2_0 + i0:u6:p_3_0 = 1
invariant :u10:p_5_1 + i4:u12:r_5_1 + -1'i4:u12:r_6_1 + i6:u15:r_7_1 + -1'i6:u20:r_8_1 + i6:u20:r_9_1 = 1
invariant :i0:u3:p_1_0 + i0:u3:r_1_0 + -1'i0:u6:r_2_0 + -1'i0:u6:p_3_0 = 0
invariant :i1:u5:p_2_2 + i3:u8:r_2_2 + -1'i3:u9:r_3_2 + i4:u11:r_4_2 + -1'i4:u12:r_5_2 + i4:u12:r_6_2 + -1'i6:u16:r_7_2 + i6:u18:r_8_2 + -1'i6:u21:r_9_2 = 0
invariant :i1:u2:p_0_2 + i1:u2:r_0_2 + -1'i1:u5:r_1_2 + i3:u8:r_2_2 + -1'i3:u9:r_3_2 + i4:u11:r_4_2 + -1'i4:u12:r_5_2 + i4:u12:r_6_2 + -1'i6:u16:r_7_2 + i6:u18:r_8_2 + -1'i6:u21:r_9_2 = 0
invariant :i0:u4:p_2_1 + i0:u7:r_2_1 + i0:u7:p_3_1 = 1
invariant :i5:u19:p_9_0 + i5:u19:r_9_0 = 1
invariant :i0:u1:p_0_1 + i0:u1:r_0_1 + -1'i0:u4:r_1_1 + i0:u7:r_2_1 + i0:u7:p_3_1 = 1
invariant :i5:u14:p_7_0 + i5:u14:r_7_0 + -1'i5:u17:r_8_0 + i5:u19:r_9_0 = 1
invariant :i5:u17:p_8_0 + i5:u17:r_8_0 + -1'i5:u19:r_9_0 = 0
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 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.58839,30264,1,0,35369,820,928,33681,295,2298,41107
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X("(((u10.p_4_0>=1)&&(u10.r_4_1>=1))&&(u10.r_3_1>=1))")))
Formula 4 simplified : !X"(((u10.p_4_0>=1)&&(u10.r_4_1>=1))&&(u10.r_3_1>=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.596903,30528,1,0,35459,820,942,33784,303,2298,41409
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G((X("(i5.u19.p_9_0>=1)"))U(F("((i1.u5.r_1_2>=1)&&(i1.u2.r_0_2>=1))"))))))
Formula 5 simplified : !G(X"(i5.u19.p_9_0>=1)" U F"((i1.u5.r_1_2>=1)&&(i1.u2.r_0_2>=1))")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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,0.608801,30748,1,0,36185,820,979,34448,303,2298,42298
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F((X("((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))"))U(G("((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))"))))))
Formula 6 simplified : !XF(X"((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))" U G"((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=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.7605,34404,1,0,47385,824,1003,45965,303,2359,55323
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(("((i1.u5.r_1_2>=1)&&(i1.u2.r_0_2>=1))")U("((i1.u5.r_1_2>=1)&&(i1.u2.r_0_2>=1))")))U(X(X("(i5.u19.p_9_0>=1)")))))
Formula 7 simplified : !(F"((i1.u5.r_1_2>=1)&&(i1.u2.r_0_2>=1))" U XX"(i5.u19.p_9_0>=1)")
Computing Next relation with stutter on 16 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.793775,35260,1,0,49171,825,1022,47680,303,2461,58310
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G("((i4.u12.r_5_2>=1)&&(i4.u11.r_4_2>=1))")))U(F(G(X("((i5.u13.r_6_0>=1)&&(i5.u13.r_5_0>=1))"))))))
Formula 8 simplified : !(XG"((i4.u12.r_5_2>=1)&&(i4.u11.r_4_2>=1))" U FGX"((i5.u13.r_6_0>=1)&&(i5.u13.r_5_0>=1))")
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.803468,35436,1,0,49290,825,1043,47975,307,2466,58621
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X("(((i0.u3.r_1_0>=1)&&(i0.u4.p_1_1>=1))&&(i0.u0.r_0_0>=1))"))))
Formula 9 simplified : !XX"(((i0.u3.r_1_0>=1)&&(i0.u4.p_1_1>=1))&&(i0.u0.r_0_0>=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
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.809245,35700,1,0,49450,825,1057,48130,307,2466,59045
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(((i6.u15.r_7_1>=1)&&(i6.u16.p_7_2>=1))&&(i4.u12.r_6_1>=1))"))
Formula 10 simplified : !"(((i6.u15.r_7_1>=1)&&(i6.u16.p_7_2>=1))&&(i4.u12.r_6_1>=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.813293,35700,1,0,49450,825,1069,48130,307,2466,59054
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((X("(((i4.u12.r_5_1>=1)&&(i4.u11.p_5_2>=1))&&(u10.r_4_1>=1))"))U(G("(((i5.u17.p_8_0>=1)&&(i6.u20.r_8_1>=1))&&(i6.u15.r_7_1>=1))")))U(G(F(X("((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))"))))))
Formula 11 simplified : !((X"(((i4.u12.r_5_1>=1)&&(i4.u11.p_5_2>=1))&&(u10.r_4_1>=1))" U G"(((i5.u17.p_8_0>=1)&&(i6.u20.r_8_1>=1))&&(i6.u15.r_7_1>=1))") U GFX"((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))")
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.834924,36684,1,0,50105,825,1098,48846,307,2468,59968
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((F("(((i6.u15.p_8_1>=1)&&(i6.u18.r_8_2>=1))&&(i6.u16.r_7_2>=1))"))U("(((u10.p_4_1>=1)&&(i4.u11.r_4_2>=1))&&(i3.u9.r_3_2>=1))"))))
Formula 12 simplified : !X(F"(((i6.u15.p_8_1>=1)&&(i6.u18.r_8_2>=1))&&(i6.u16.r_7_2>=1))" U "(((u10.p_4_1>=1)&&(i4.u11.r_4_2>=1))&&(i3.u9.r_3_2>=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
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.965464,39292,1,0,56594,826,1150,52859,307,2481,68375
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(("((i5.u17.r_8_0>=1)&&(i5.u14.r_7_0>=1))")U(X(X("(((i0.u3.p_2_0>=1)&&(i0.u7.r_2_1>=1))&&(i0.u4.r_1_1>=1))"))))))
Formula 13 simplified : !G("((i5.u17.r_8_0>=1)&&(i5.u14.r_7_0>=1))" U XX"(((i0.u3.p_2_0>=1)&&(i0.u7.r_2_1>=1))&&(i0.u4.r_1_1>=1))")
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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.976627,39292,1,0,57139,826,1175,53306,307,2481,69147
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(((u10.p_4_0>=1)&&(u10.r_4_1>=1))&&(u10.r_3_1>=1))"))
Formula 14 simplified : !"(((u10.p_4_0>=1)&&(u10.r_4_1>=1))&&(u10.r_3_1>=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.977383,39292,1,0,57139,826,1175,53306,307,2481,69149
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X("(i1.u5.p_2_2>=1)"))U(X(X(F("(((u10.r_3_0>=1)&&(i0.u7.p_3_1>=1))&&(i0.u6.r_2_0>=1))"))))))
Formula 15 simplified : !(X"(i1.u5.p_2_2>=1)" U XXF"(((u10.r_3_0>=1)&&(i0.u7.p_3_1>=1))&&(i0.u6.r_2_0>=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
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,1.03472,41096,1,0,63618,830,1191,57790,307,2490,78313
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1528325063108

--------------------
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 06, 2018 10:44:19 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/, -louvain, -smt]
Jun 06, 2018 10:44:19 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 10:44:19 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 108 ms
Jun 06, 2018 10:44:19 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 60 places.
Jun 06, 2018 10:44:19 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 transitions.
Jun 06, 2018 10:44:19 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
Jun 06, 2018 10:44:19 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 10:44:19 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Jun 06, 2018 10:44:20 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 85 ms
Begin: Wed Jun 6 22:44:20 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Wed Jun 6 22:44:20 2018
network size: 60 nodes, 266 links, 80 weight
quality increased from -0.0180729 to 0.446892
end computation: Wed Jun 6 22:44:20 2018
level 1:
start computation: Wed Jun 6 22:44:20 2018
network size: 22 nodes, 126 links, 80 weight
quality increased from 0.446892 to 0.592378
end computation: Wed Jun 6 22:44:20 2018
level 2:
start computation: Wed Jun 6 22:44:20 2018
network size: 9 nodes, 39 links, 80 weight
quality increased from 0.592378 to 0.597292
end computation: Wed Jun 6 22:44:20 2018
level 3:
start computation: Wed Jun 6 22:44:20 2018
network size: 7 nodes, 29 links, 80 weight
quality increased from 0.597292 to 0.597292
end computation: Wed Jun 6 22:44:20 2018
End: Wed Jun 6 22:44:20 2018
Total duration: 0 sec
0.597292
Jun 06, 2018 10:44:20 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 10:44:20 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 19 ms
Jun 06, 2018 10:44:20 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 10:44:20 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
Jun 06, 2018 10:44:20 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 06, 2018 10:44:20 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 40 transitions.
Jun 06, 2018 10:44:20 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 20 ms
Jun 06, 2018 10:44:21 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 60 variables to be positive in 405 ms
Jun 06, 2018 10:44:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 40 transitions.
Jun 06, 2018 10:44:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/40 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:44:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:44:21 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 40 transitions.
Jun 06, 2018 10:44:21 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)
Jun 06, 2018 10:44:21 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 06, 2018 10:44:21 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error
Jun 06, 2018 10:44:21 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (not (>= (select s0 46) 1))) with error
Jun 06, 2018 10:44:21 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (>= (select s1 46) 1)) with error
Jun 06, 2018 10:44:21 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 46) 1) (= (store (store (store s0 45 (+ (select s0 45) 1)) 46 (- (select s0 46) 1)) 47 (+ (select s0 47) 1)) s1))) with error
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.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
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)
Jun 06, 2018 10:44:21 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1354ms 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="ResAllocation-PT-R003C010"
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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ResAllocation-PT-R003C010, 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 r189-qhx2-152732140900138"
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 ;