fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r189-qhx2-152732141000150
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for ResAllocation-PT-R010C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15736.300 7642.00 14984.00 424.70 FFFFFFFFFFFFFFFF normal

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 212K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K 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.6K 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 8.4K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K 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.4K 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 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is ResAllocation-PT-R010C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732141000150
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528325897798

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/graph2218437170766216922.txt, -o, /tmp/graph2218437170766216922.bin, -w, /tmp/graph2218437170766216922.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/graph2218437170766216922.bin, -l, -1, -v, -w, /tmp/graph2218437170766216922.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 : !((X("(((i2.u16.r_1_6>=1)&&(i3.u17.p_1_7>=1))&&(i2.u6.r_0_6>=1))")))
Formula 0 simplified : !X"(((i2.u16.r_1_6>=1)&&(i3.u17.p_1_7>=1))&&(i2.u6.r_0_6>=1))"
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t_1_0, i4.u9.t_0_10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/20/2/22
Computing Next relation with stutter on 9 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.114987,17392,1,0,1576,25,329,2447,49,23,3060
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(G("(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))")))))
Formula 1 simplified : !G"(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))"
Computing Next relation with stutter on 9 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.12275,17668,1,0,1629,25,360,2499,49,23,3202
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((i3.u7.p_0_7>=1)&&(i3.u8.r_0_8>=1))"))
Formula 2 simplified : !"((i3.u7.p_0_7>=1)&&(i3.u8.r_0_8>=1))"
Computing Next relation with stutter on 9 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.124803,17668,1,0,1629,25,370,2499,49,23,3214
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((i5.u13.r_1_3>=1)&&(i5.u14.p_1_4>=1))&&(i5.u3.r_0_3>=1))"))
Formula 3 simplified : !"(((i5.u13.r_1_3>=1)&&(i5.u14.p_1_4>=1))&&(i5.u3.r_0_3>=1))"
Computing Next relation with stutter on 9 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.125438,17668,1,0,1629,25,379,2499,49,23,3216
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(X(("((i5.u4.p_0_4>=1)&&(i2.u5.r_0_5>=1))")U("((i5.u4.p_0_4>=1)&&(i2.u5.r_0_5>=1))"))))))
Formula 4 simplified : !GXX"((i5.u4.p_0_4>=1)&&(i2.u5.r_0_5>=1))"
Computing Next relation with stutter on 9 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.135615,17932,1,0,1727,25,401,2612,49,23,3523
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G(F("((i3.u7.p_0_7>=1)&&(i3.u8.r_0_8>=1))")))U(X(G("((i2.u6.p_0_6>=1)&&(i3.u7.r_0_7>=1))"))))))
Formula 5 simplified : !F(GF"((i3.u7.p_0_7>=1)&&(i3.u8.r_0_8>=1))" U XG"((i2.u6.p_0_6>=1)&&(i3.u7.r_0_7>=1))")
Computing Next relation with stutter on 9 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 22 rows 40 cols
invariant :i5:u13:p_1_3 + i5:u13:r_1_3 = 1
invariant :i5:u14:p_1_4 + i5:u14:r_1_4 = 1
invariant :i5:u4:p_0_4 + i5:u4:r_0_4 + -1'i5:u14:r_1_4 = 0
invariant :i5:u3:p_0_3 + i5:u3:r_0_3 + -1'i5:u13:r_1_3 = 0
invariant :i4:u19:p_1_9 + i4:u19:r_1_9 = 1
invariant :i4:u9:p_0_9 + i4:u9:r_0_9 + -1'i4:u19:r_1_9 = 0
invariant :i1:u11:p_1_1 + i1:u11:r_1_1 = 1
invariant :i2:u16:p_1_6 + i2:u16:r_1_6 = 1
invariant :i3:u18:p_1_8 + i3:u18:r_1_8 = 1
invariant :i1:u2:p_0_2 + i1:u2:r_0_2 + -1'i1:u12:r_1_2 = 0
invariant :i3:u17:p_1_7 + i3:u17:r_1_7 = 1
invariant :i1:u1:p_0_1 + i1:u1:r_0_1 + -1'i1:u11:r_1_1 = 0
invariant :i2:u5:p_0_5 + i2:u5:r_0_5 + -1'i2:u15:r_1_5 = 0
invariant :i2:u6:p_0_6 + i2:u6:r_0_6 + -1'i2:u16:r_1_6 = 0
invariant :i3:u7:p_0_7 + i3:u7:r_0_7 + -1'i3:u17:r_1_7 = 0
invariant :i2:u15:p_1_5 + i2:u15:r_1_5 = 1
invariant :i0:u0:p_0_0 + i0:u0:r_0_0 + -1'i0:u10:r_1_0 = 0
invariant :i3:u8:p_0_8 + i3:u8:r_0_8 + -1'i3:u18:r_1_8 = 0
invariant :i0:u10:p_1_0 + i0:u10:r_1_0 = 1
invariant :i1:u12:p_1_2 + i1:u12:r_1_2 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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.231188,20760,1,0,9029,25,430,9695,49,23,12419
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G("((i4.u19.r_1_9>=1)&&(i4.u9.r_0_9>=1))")))))
Formula 6 simplified : !FXG"((i4.u19.r_1_9>=1)&&(i4.u9.r_0_9>=1))"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.297722,22344,1,0,13386,25,458,13599,49,23,17929
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(G(X(("((i1.u2.p_0_2>=1)&&(i5.u3.r_0_3>=1))")U("(((i2.u15.r_1_5>=1)&&(i2.u16.p_1_6>=1))&&(i2.u5.r_0_5>=1))"))))))
Formula 7 simplified : !GX("((i1.u2.p_0_2>=1)&&(i5.u3.r_0_3>=1))" U "(((i2.u15.r_1_5>=1)&&(i2.u16.p_1_6>=1))&&(i2.u5.r_0_5>=1))")
Computing Next relation with stutter on 9 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 items max in DFS search stack
8 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.377363,24636,1,0,19509,25,498,19047,49,23,28077
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((("(i0.u10.p_1_0>=1)")U(F("(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))")))U((X("(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))"))U("((i0.u0.p_0_0>=1)&&(i1.u1.r_0_1>=1))"))))
Formula 8 simplified : !(("(i0.u10.p_1_0>=1)" U F"(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))") U (X"(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))" U "((i0.u0.p_0_0>=1)&&(i1.u1.r_0_1>=1))"))
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.421715,25788,1,0,22010,25,534,22001,49,23,32893
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(("(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))")U(("((i1.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))")U("((i3.u8.p_0_8>=1)&&(i4.u9.r_0_9>=1))")))))
Formula 9 simplified : !G("(((i1.u11.r_1_1>=1)&&(i1.u12.p_1_2>=1))&&(i1.u1.r_0_1>=1))" U ("((i1.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))" U "((i3.u8.p_0_8>=1)&&(i4.u9.r_0_9>=1))"))
Computing Next relation with stutter on 9 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.435408,26720,1,0,22010,25,584,22001,49,23,32935
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("(i0.u0.r_0_0>=1)")))
Formula 10 simplified : !G"(i0.u0.r_0_0>=1)"
Computing Next relation with stutter on 9 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.44214,26720,1,0,22322,25,609,22339,50,23,33680
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G(G(F("(((i5.u13.r_1_3>=1)&&(i5.u14.p_1_4>=1))&&(i5.u3.r_0_3>=1))"))))))
Formula 11 simplified : !FGF"(((i5.u13.r_1_3>=1)&&(i5.u14.p_1_4>=1))&&(i5.u3.r_0_3>=1))"
Computing Next relation with stutter on 9 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.46035,26972,1,0,23996,25,621,23515,50,23,35984
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(G("(i0.u10.p_1_0>=1)"))))
Formula 12 simplified : !FG"(i0.u10.p_1_0>=1)"
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 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.552378,29076,1,0,29130,25,641,28133,51,23,42624
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(G(F(F("((i4.u19.r_1_9>=1)&&(i4.u9.r_0_9>=1))"))))))
Formula 13 simplified : !XGF"((i4.u19.r_1_9>=1)&&(i4.u9.r_0_9>=1))"
Computing Next relation with stutter on 9 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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,0.611724,31452,1,0,35633,25,652,32621,51,23,51630
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(((i3.u17.r_1_7>=1)&&(i3.u18.p_1_8>=1))&&(i3.u7.r_0_7>=1))"))
Formula 14 simplified : !"(((i3.u17.r_1_7>=1)&&(i3.u18.p_1_8>=1))&&(i3.u7.r_0_7>=1))"
Computing Next relation with stutter on 9 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.614102,31716,1,0,35633,25,660,32621,51,23,51634
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(G(X(F("(((i2.u15.r_1_5>=1)&&(i2.u16.p_1_6>=1))&&(i2.u5.r_0_5>=1))"))))))
Formula 15 simplified : !GXF"(((i2.u15.r_1_5>=1)&&(i2.u16.p_1_6>=1))&&(i2.u5.r_0_5>=1))"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.651362,32240,1,0,38353,25,676,34921,51,23,55149
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ResAllocation-PT-R010C002-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 1528325905440

--------------------
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:58:21 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:58:21 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 10:58:22 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 100 ms
Jun 06, 2018 10:58:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 40 places.
Jun 06, 2018 10:58:22 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 06, 2018 10:58:22 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:58:22 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 10:58:22 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 55 ms
Jun 06, 2018 10:58:22 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Begin: Wed Jun 6 22:58:23 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Wed Jun 6 22:58:23 2018
network size: 40 nodes, 168 links, 44 weight
quality increased from -0.0297865 to 0.375057
end computation: Wed Jun 6 22:58:23 2018
level 1:
start computation: Wed Jun 6 22:58:23 2018
network size: 20 nodes, 112 links, 44 weight
quality increased from 0.375057 to 0.528237
end computation: Wed Jun 6 22:58:23 2018
level 2:
start computation: Wed Jun 6 22:58:23 2018
network size: 10 nodes, 50 links, 44 weight
quality increased from 0.528237 to 0.59068
end computation: Wed Jun 6 22:58:23 2018
level 3:
start computation: Wed Jun 6 22:58:23 2018
network size: 6 nodes, 16 links, 44 weight
quality increased from 0.59068 to 0.59068
end computation: Wed Jun 6 22:58:23 2018
End: Wed Jun 6 22:58:23 2018
Total duration: 0 sec
0.59068
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 10:58:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
Jun 06, 2018 10:58:23 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 22 transitions.
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 13 ms
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 40 variables to be positive in 227 ms
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 22 transitions.
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/22 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 22 transitions.
Jun 06, 2018 10:58:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 10:58:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 06, 2018 10:58:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Jun 06, 2018 10:58:24 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 32) 1) (>= (select s0 35) 1)) (= (store (store (store (store s0 33 (+ (select s0 33) 1)) 32 (- (select s0 32) 1)) 35 (- (select s0 35) 1)) 34 (+ (select s0 34) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 32) 1) (>= (select s0 35) 1)) (= (store (store (store (store s0 33 (+ (select s0 33) 1)) 32 (- (select s0 32) 1)) 35 (- (select s0 35) 1)) 34 (+ (select s0 34) 1)) s1))")
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)
Jun 06, 2018 10:58:24 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 774ms 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-R010C002"
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-R010C002.tgz
mv ResAllocation-PT-R010C002 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-R010C002, 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-152732141000150"
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 ;