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 180K
-rw-r--r-- 1 mcc users 3.3K May 30 21:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 21:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 28 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 27 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 27K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is NQueens-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749176100312
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527991715405

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/graph4329382202898410299.txt, -o, /tmp/graph4329382202898410299.bin, -w, /tmp/graph4329382202898410299.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/graph4329382202898410299.bin, -l, -1, -v, -w, /tmp/graph4329382202898410299.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("((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))"))U("((((i4.u6.cY_3>=1)&&(i2.u13.L_1>=1))&&(i0.u21.R_4>=1))&&(i2.u2.cX_0>=1))"))U("((((i4.u6.cY_3>=1)&&(i4.u14.L_3>=1))&&(i6.u22.R_6>=1))&&(i1.u16.cX_2>=1))")))
Formula 0 simplified : !((F"((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))" U "((((i4.u6.cY_3>=1)&&(i2.u13.L_1>=1))&&(i0.u21.R_4>=1))&&(i2.u2.cX_0>=1))") U "((((i4.u6.cY_3>=1)&&(i4.u14.L_3>=1))&&(i6.u22.R_6>=1))&&(i1.u16.cX_2>=1))")
built 22 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.105949,19352,1,0,5562,68,487,6196,64,179,14696
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))"))
Formula 1 simplified : !"((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))"
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.106581,19352,1,0,5562,68,489,6196,64,179,14717
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((((i4.u6.cY_3>=1)&&(i2.u20.L_2>=1))&&(i1.u7.R_5>=1))&&(i0.u4.cX_1>=1))"))
Formula 2 simplified : !"((((i4.u6.cY_3>=1)&&(i2.u20.L_2>=1))&&(i1.u7.R_5>=1))&&(i0.u4.cX_1>=1))"
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.108223,19352,1,0,5562,68,502,6196,64,179,14734
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((((i1.u1.cY_2>=1)&&(i0.u15.L_5>=1))&&(i6.u22.R_6>=1))&&(i6.u9.cX_3>=1))")U(X("((((i6.u0.cY_1>=1)&&(i0.u15.L_5>=1))&&(i0.u21.R_4>=1))&&(i1.u16.cX_2>=1))")))U(G(F("((((i5.u10.cY_0>=1)&&(i3.u5.L_4>=1))&&(i5.u18.R_1>=1))&&(i2.u2.cX_0>=1))")))))
Formula 3 simplified : !(("((((i1.u1.cY_2>=1)&&(i0.u15.L_5>=1))&&(i6.u22.R_6>=1))&&(i6.u9.cX_3>=1))" U X"((((i6.u0.cY_1>=1)&&(i0.u15.L_5>=1))&&(i0.u21.R_4>=1))&&(i1.u16.cX_2>=1))") U GF"((((i5.u10.cY_0>=1)&&(i3.u5.L_4>=1))&&(i5.u18.R_1>=1))&&(i2.u2.cX_0>=1))")
Computing Next relation with stutter on 58 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 53 cols
invariant :i2:u13:L_1 + -1'i4:u6:P_1_3 + -1'i4:u6:cY_3 + -2'i4:u14:P_2_3 + 2'i4:u24:P_3_4 + i4:u24:R_8 + i6:u9:P_3_1 + i6:u9:cX_3 + 2'i6:u17:P_3_0 + i6:u17:L_7 + -1'i6:u22:R_6 = 2
invariant :i1:u1:cY_2 + -1'i2:u20:R_3 + -2'i3:u5:P_1_1 + -1'i3:u5:L_4 + 2'i3:u11:R_9 + -1'i4:u12:cX_4 + -1'i4:u14:P_2_3 + -1'i4:u14:L_3 + -2'i4:u19:P_0_1 + -1'i4:u19:R_2 + i4:u24:P_3_4 + i4:u24:R_8 + i5:u10:cY_0 + i6:u9:P_3_1 + i6:u9:cX_3 + 3'i6:u17:P_3_0 + i6:u17:L_7 + 2'i6:u22:P_3_2 = 2
invariant :i2:u2:cX_0 + -1'i2:u8:cY_4 + -1'i2:u20:R_3 + -1'i3:u5:P_1_1 + 2'i3:u11:R_9 + i3:u23:R_7 + -1'i4:u6:P_1_3 + -1'i4:u6:cY_3 + -1'i4:u12:cX_4 + -1'i4:u19:R_2 + i4:u24:P_3_4 + 2'i4:u24:R_8 + i5:u10:cY_0 + -2'i5:u18:R_1 + i6:u17:P_3_0 + i6:u22:P_3_2 + i6:u22:R_6 = 1
invariant :i0:u4:P_1_0 + i4:u19:P_0_1 + i4:u19:R_2 = 1
invariant :i0:u21:R_4 + -1'i3:u5:P_1_1 + -1'i4:u6:P_1_3 + -1'i4:u6:cY_3 + -2'i4:u14:P_2_3 + -1'i4:u14:L_3 + -2'i4:u19:P_0_1 + i4:u24:P_3_4 + i4:u24:R_8 + -1'i6:u0:cY_1 + i6:u9:cX_3 + 3'i6:u17:P_3_0 + i6:u17:L_7 + i6:u22:P_3_2 = 1
invariant :i2:u20:L_2 + -1'i2:u20:R_3 + -1'i3:u5:P_1_1 + -1'i3:u11:R_9 + -1'i3:u23:R_7 + i4:u6:P_1_3 + i4:u12:cX_4 + -1'i4:u19:P_0_1 + -1'i4:u19:R_2 + -1'i4:u24:R_8 + i5:u10:cY_0 + -2'i5:u10:L_8 + -1'i5:u18:R_1 + i6:u9:P_3_1 + i6:u9:cX_3 + i6:u17:P_3_0 + -1'i6:u17:L_7 + i6:u22:P_3_2 = -5
invariant :i1:u16:cX_2 + -2'i3:u5:P_1_1 + -1'i3:u5:L_4 + -1'i3:u23:R_7 + i4:u12:cX_4 + i4:u14:P_2_3 + i4:u19:R_2 + i4:u24:P_3_4 + -1'i4:u24:R_8 + -1'i5:u10:cY_0 + 2'i5:u18:R_1 + -1'i6:u0:cY_1 + i6:u9:P_3_1 + 2'i6:u9:cX_3 + i6:u17:P_3_0 + 2'i6:u22:P_3_2 = 2
invariant :i3:u23:P_3_3 + i4:u24:P_3_4 + i6:u9:P_3_1 + i6:u9:cX_3 + i6:u17:P_3_0 + i6:u22:P_3_2 = 1
invariant :i1:u16:P_2_0 + -1'i4:u19:P_0_1 + -1'i4:u19:R_2 + i5:u10:cY_0 + -1'i5:u10:L_8 + -1'i5:u18:R_1 + i6:u17:P_3_0 = -2
invariant :i5:u18:P_0_0 + i5:u18:R_1 = 1
invariant :i0:u15:P_2_1 + i3:u5:P_1_1 + i4:u19:P_0_1 + i6:u0:cY_1 + i6:u9:P_3_1 + -1'i6:u17:P_3_0 + -1'i6:u17:L_7 = 0
invariant :i2:u13:P_1_4 + i4:u14:P_2_3 + -1'i6:u17:P_3_0 + -1'i6:u17:L_7 + i6:u22:P_3_2 + i6:u22:R_6 = 0
invariant :i1:u16:L_6 + i3:u11:R_9 + -1'i4:u12:cX_4 + i4:u19:P_0_1 + i4:u19:R_2 + i4:u24:P_3_4 + i4:u24:R_8 + -1'i5:u10:cY_0 + 2'i5:u10:L_8 + i5:u18:R_1 + i6:u9:P_3_1 + i6:u17:L_7 = 6
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.154881,22616,1,0,10244,69,593,8745,65,183,38207
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))"))
Formula 4 simplified : !"((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))"
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.155561,22880,1,0,10244,69,593,8745,65,183,38207
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((F(G("((((i6.u0.cY_1>=1)&&(i4.u14.L_3>=1))&&(i4.u19.R_2>=1))&&(i2.u2.cX_0>=1))")))U(("((((i2.u8.cY_4>=1)&&(i2.u13.L_1>=1))&&(i6.u22.R_6>=1))&&(i0.u4.cX_1>=1))")U("((((i4.u6.cY_3>=1)&&(i4.u14.L_3>=1))&&(i6.u22.R_6>=1))&&(i1.u16.cX_2>=1))")))))
Formula 5 simplified : !G(FG"((((i6.u0.cY_1>=1)&&(i4.u14.L_3>=1))&&(i4.u19.R_2>=1))&&(i2.u2.cX_0>=1))" U ("((((i2.u8.cY_4>=1)&&(i2.u13.L_1>=1))&&(i6.u22.R_6>=1))&&(i0.u4.cX_1>=1))" U "((((i4.u6.cY_3>=1)&&(i4.u14.L_3>=1))&&(i6.u22.R_6>=1))&&(i1.u16.cX_2>=1))"))
Computing Next relation with stutter on 58 deadlock states
invariant :i0:u15:L_5 + -1'i3:u5:P_1_1 + -2'i4:u19:P_0_1 + -1'i4:u19:R_2 + -1'i4:u24:P_3_4 + -1'i4:u24:R_8 + -1'i6:u0:cY_1 + -1'i6:u9:P_3_1 + i6:u17:P_3_0 + i6:u17:L_7 + i6:u22:P_3_2 = -1
invariant :i1:u1:P_4_2 + -1'i3:u11:R_9 + i4:u12:cX_4 + -1'i4:u24:P_3_4 + -1'i4:u24:R_8 + -1'i5:u10:L_8 + -1'i6:u17:P_3_0 + -1'i6:u17:L_7 = -3
invariant :i1:u7:P_2_2 + i3:u5:P_1_1 + i3:u5:L_4 + -1'i3:u11:R_9 + -1'i4:u24:P_3_4 + -1'i5:u18:R_1 + -1'i6:u9:P_3_1 + -1'i6:u9:cX_3 + -1'i6:u17:P_3_0 + -1'i6:u22:P_3_2 = -2
invariant :i5:u10:P_4_0 + i5:u10:L_8 = 1
invariant :i2:u2:P_0_3 + i4:u6:P_1_3 + i4:u6:cY_3 + i4:u14:P_2_3 + -2'i4:u24:P_3_4 + -1'i4:u24:R_8 + -1'i6:u9:P_3_1 + -1'i6:u9:cX_3 + -1'i6:u17:P_3_0 + -1'i6:u22:P_3_2 = -1
invariant :i6:u0:P_4_1 + i6:u17:P_3_0 + i6:u17:L_7 = 1
invariant :i0:u21:P_1_2 + i4:u14:P_2_3 + i4:u14:L_3 + i4:u19:P_0_1 + i4:u24:P_3_4 = 1
invariant :i2:u8:P_2_4 + i3:u11:R_9 + i3:u23:R_7 + -1'i4:u12:cX_4 + i4:u24:R_8 + i5:u10:L_8 + -1'i6:u9:P_3_1 + -1'i6:u9:cX_3 + i6:u17:L_7 + -1'i6:u22:P_3_2 = 3
invariant :i4:u12:P_4_3 + i4:u24:P_3_4 + i4:u24:R_8 = 1
invariant :i0:u4:cX_1 + i3:u5:P_1_1 + i4:u6:P_1_3 + -2'i4:u14:P_2_3 + -1'i4:u14:L_3 + -2'i4:u19:P_0_1 + -1'i4:u19:R_2 + -1'i4:u24:P_3_4 + i6:u17:P_3_0 + i6:u17:L_7 + -1'i6:u22:P_3_2 + -1'i6:u22:R_6 = -1
invariant :i2:u3:L_0 + -1'i2:u8:cY_4 + 2'i3:u11:R_9 + i3:u23:R_7 + -1'i4:u12:cX_4 + i4:u14:P_2_3 + -1'i4:u24:P_3_4 + i4:u24:R_8 + i5:u10:L_8 + -1'i6:u9:P_3_1 + -1'i6:u9:cX_3 + -1'i6:u17:P_3_0 + i6:u22:R_6 = 4
invariant :i1:u7:R_5 + -1'i2:u8:cY_4 + -1'i3:u5:P_1_1 + -1'i3:u5:L_4 + 3'i3:u11:R_9 + i3:u23:R_7 + i4:u6:P_1_3 + -1'i4:u12:cX_4 + i4:u14:P_2_3 + i4:u24:R_8 + i5:u18:R_1 + i6:u9:P_3_1 + i6:u22:P_3_2 + i6:u22:R_6 = 5
invariant :i2:u3:P_0_4 + i2:u8:cY_4 + -2'i3:u11:R_9 + -1'i3:u23:R_7 + i4:u12:cX_4 + -1'i4:u14:P_2_3 + i4:u24:P_3_4 + -1'i4:u24:R_8 + -1'i5:u10:L_8 + i6:u9:P_3_1 + i6:u9:cX_3 + i6:u17:P_3_0 + -1'i6:u22:R_6 = -3
invariant :i2:u20:P_0_2 + i2:u20:R_3 + i3:u5:P_1_1 + i4:u19:P_0_1 + i4:u19:R_2 + -1'i5:u10:cY_0 + i5:u10:L_8 + i5:u18:R_1 + -1'i6:u17:P_3_0 = 3
invariant :i3:u11:P_4_4 + i3:u11:R_9 = 1
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.168158,23688,1,0,11276,69,651,9481,65,183,42719
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(G("((((i2.u8.cY_4>=1)&&(i2.u20.L_2>=1))&&(i3.u23.R_7>=1))&&(i1.u16.cX_2>=1))")))))
Formula 6 simplified : !GFG"((((i2.u8.cY_4>=1)&&(i2.u20.L_2>=1))&&(i3.u23.R_7>=1))&&(i1.u16.cX_2>=1))"
Computing Next relation with stutter on 58 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.202317,24732,1,0,13511,69,697,11378,65,183,55159
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G((G(F("((((i6.u0.cY_1>=1)&&(i3.u5.L_4>=1))&&(i2.u20.R_3>=1))&&(i0.u4.cX_1>=1))")))U(X(F("((((i1.u1.cY_2>=1)&&(i2.u20.L_2>=1))&&(i2.u20.R_3>=1))&&(i2.u2.cX_0>=1))"))))))
Formula 7 simplified : !G(GF"((((i6.u0.cY_1>=1)&&(i3.u5.L_4>=1))&&(i2.u20.R_3>=1))&&(i0.u4.cX_1>=1))" U XF"((((i1.u1.cY_2>=1)&&(i2.u20.L_2>=1))&&(i2.u20.R_3>=1))&&(i2.u2.cX_0>=1))")
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.204142,25128,1,0,13511,69,732,11378,67,183,55694
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((((i6.u0.cY_1>=1)&&(i4.u14.L_3>=1))&&(i4.u19.R_2>=1))&&(i2.u2.cX_0>=1))")))
Formula 8 simplified : !F"((((i6.u0.cY_1>=1)&&(i4.u14.L_3>=1))&&(i4.u19.R_2>=1))&&(i2.u2.cX_0>=1))"
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.204742,25128,1,0,13511,69,743,11378,67,183,55710
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((((i6.u0.cY_1>=1)&&(i1.u16.L_6>=1))&&(i1.u7.R_5>=1))&&(i6.u9.cX_3>=1))"))
Formula 9 simplified : !"((((i6.u0.cY_1>=1)&&(i1.u16.L_6>=1))&&(i1.u7.R_5>=1))&&(i6.u9.cX_3>=1))"
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.205178,25128,1,0,13511,69,758,11378,67,183,55726
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F((F("((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))"))U(X("((((i5.u10.cY_0>=1)&&(i1.u16.L_6>=1))&&(i2.u20.R_3>=1))&&(i1.u16.cX_2>=1))"))))))
Formula 10 simplified : !XF(F"((((i5.u10.cY_0>=1)&&(i5.u10.L_8>=1))&&(i1.u7.R_5>=1))&&(i4.u12.cX_4>=1))" U X"((((i5.u10.cY_0>=1)&&(i1.u16.L_6>=1))&&(i2.u20.R_3>=1))&&(i1.u16.cX_2>=1))")
Computing Next relation with stutter on 58 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.216182,25128,1,0,14566,69,787,12390,69,183,60019
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G(X(F("((((i1.u1.cY_2>=1)&&(i3.u5.L_4>=1))&&(i1.u7.R_5>=1))&&(i1.u16.cX_2>=1))"))))))
Formula 11 simplified : !XGXF"((((i1.u1.cY_2>=1)&&(i3.u5.L_4>=1))&&(i1.u7.R_5>=1))&&(i1.u16.cX_2>=1))"
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.218915,25392,1,0,14639,69,822,12483,69,183,60778
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(G(X(F("((((i5.u10.cY_0>=1)&&(i6.u17.L_7>=1))&&(i0.u21.R_4>=1))&&(i6.u9.cX_3>=1))")))))))
Formula 12 simplified : !GFGXF"((((i5.u10.cY_0>=1)&&(i6.u17.L_7>=1))&&(i0.u21.R_4>=1))&&(i6.u9.cX_3>=1))"
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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.22022,25644,1,0,14641,69,851,12484,69,183,60955
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((((i1.u1.cY_2>=1)&&(i2.u20.L_2>=1))&&(i2.u20.R_3>=1))&&(i2.u2.cX_0>=1))"))
Formula 13 simplified : !"((((i1.u1.cY_2>=1)&&(i2.u20.L_2>=1))&&(i2.u20.R_3>=1))&&(i2.u2.cX_0>=1))"
Computing Next relation with stutter on 58 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.220693,25644,1,0,14641,69,851,12484,69,183,60966
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(("((((i2.u8.cY_4>=1)&&(i4.u14.L_3>=1))&&(i4.u24.R_8>=1))&&(i6.u9.cX_3>=1))")U(G("((((i6.u0.cY_1>=1)&&(i4.u14.L_3>=1))&&(i4.u19.R_2>=1))&&(i2.u2.cX_0>=1))")))))
Formula 14 simplified : !X("((((i2.u8.cY_4>=1)&&(i4.u14.L_3>=1))&&(i4.u24.R_8>=1))&&(i6.u9.cX_3>=1))" U G"((((i6.u0.cY_1>=1)&&(i4.u14.L_3>=1))&&(i4.u19.R_2>=1))&&(i2.u2.cX_0>=1))")
Computing Next relation with stutter on 58 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.237201,26144,1,0,16062,69,926,13541,71,183,66627
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X("((((i1.u1.cY_2>=1)&&(i2.u20.L_2>=1))&&(i2.u20.R_3>=1))&&(i2.u2.cX_0>=1))")))
Formula 15 simplified : !X"((((i1.u1.cY_2>=1)&&(i2.u20.L_2>=1))&&(i2.u20.R_3>=1))&&(i2.u2.cX_0>=1))"
Computing Next relation with stutter on 58 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.24287,26144,1,0,16493,69,926,14049,71,183,68420
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NQueens-PT-05-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 1527991718219

--------------------
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 2:08:37 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 2:08:37 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 35 ms
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 places.
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Jun 03, 2018 2:08:37 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 2 fixed domain variables (out of 55 variables) in GAL type NQueens_PT_05
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 2 constant array cells/variables (out of 55 variables) in type NQueens_PT_05
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: L_9,R_0,
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 2 fixed domain variables (out of 55 variables) in GAL type NQueens_PT_05
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 2 constant array cells/variables (out of 55 variables) in type NQueens_PT_05
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: L_9,R_0,
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 2 constant variables :L_9=1, R_0=1
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 46 ms
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
Begin: Sun Jun 3 02:08:37 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 02:08:37 2018
network size: 53 nodes, 200 links, 50 weight
quality increased from -0.0205 to 0.23805
end computation: Sun Jun 3 02:08:37 2018
level 1:
start computation: Sun Jun 3 02:08:37 2018
network size: 25 nodes, 169 links, 50 weight
quality increased from 0.23805 to 0.3735
end computation: Sun Jun 3 02:08:37 2018
level 2:
start computation: Sun Jun 3 02:08:37 2018
network size: 8 nodes, 60 links, 50 weight
quality increased from 0.3735 to 0.3755
end computation: Sun Jun 3 02:08:37 2018
level 3:
start computation: Sun Jun 3 02:08:37 2018
network size: 7 nodes, 49 links, 50 weight
quality increased from 0.3755 to 0.3755
end computation: Sun Jun 3 02:08:37 2018
End: Sun Jun 3 02:08:37 2018
Total duration: 0 sec
0.3755
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 48 redundant transitions.
Jun 03, 2018 2:08:37 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 03, 2018 2:08:37 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Jun 03, 2018 2:08:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 28 place invariants in 15 ms
Jun 03, 2018 2:08:38 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 2:08:38 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 242ms 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="NQueens-PT-05"
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/NQueens-PT-05.tgz
mv NQueens-PT-05 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 NQueens-PT-05, 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-152749176100312"
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 ;