fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r285-csrt-152749176100311
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for NQueens-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.980 4694.00 9825.00 162.90 TFFFFFFFTFFFFFFT 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 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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749176100311
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527991704000

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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(cX_4>=1)"))
Formula 0 simplified : !"(cX_4>=1)"
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
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.211163,23376,1,0,7,31017,14,2,822,8827,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("(R_6<=P_4_1)"))
Formula 1 simplified : !"(R_6<=P_4_1)"
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.279691,25608,1,0,14,37031,23,12,1005,19023,34
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((F("(cX_3<=P_1_2)"))U("(L_4<=cY_2)"))))
Formula 2 simplified : !X(F"(cX_3<=P_1_2)" U "(L_4<=cY_2)")
Computing Next relation with stutter on 58 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.319697,27012,1,0,60,42518,36,56,1017,32365,141
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(cY_4<=P_4_1)"))
Formula 3 simplified : !"(cY_4<=P_4_1)"
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.320172,27276,1,0,60,42518,39,56,1021,32365,143
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(("(P_3_2<=L_2)")U(F("(R_5>=2)")))))
Formula 4 simplified : !X("(P_3_2<=L_2)" U F"(R_5>=2)")
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.352875,28328,1,0,68,45473,48,67,1023,40596,179
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X("(P_1_2>=1)")))U(X(F("(P_3_2<=P_2_0)")))))
Formula 5 simplified : !(GX"(P_1_2>=1)" U XF"(P_3_2<=P_2_0)")
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.369181,28688,1,0,92,46269,57,87,1028,41976,232
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("(P_2_1>=1)")U(X("(P_1_4>=2)"))))
Formula 6 simplified : !("(P_2_1>=1)" U X"(P_1_4>=2)")
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.374389,29196,1,0,92,46269,64,87,1032,42553,243
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(("(P_1_4<=P_2_0)")U(F("(P_0_3>=1)")))))
Formula 7 simplified : !G("(P_1_4<=P_2_0)" U F"(P_0_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
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.39656,30064,1,0,99,47590,73,101,1034,46529,294
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(P_2_0<=P_1_0)"))
Formula 8 simplified : !"(P_2_0<=P_1_0)"
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.397113,30064,1,0,99,47590,76,101,1037,46529,296
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F(("(P_4_2>=1)")U("(P_1_1>=1)")))))
Formula 9 simplified : !GF("(P_4_2>=1)" U "(P_1_1>=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
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.417665,30844,1,0,107,49315,85,112,1039,49967,332
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(P_4_1>=2)"))
Formula 10 simplified : !"(P_4_1>=2)"
Computing Next relation with stutter on 58 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.418107,30844,1,0,107,49315,88,112,1041,49968,334
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F(X(X("(P_1_3>=1)"))))))
Formula 11 simplified : !FXX"(P_1_3>=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
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.478097,31900,1,0,120,51162,97,128,1043,57143,377
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G(F("(P_1_1<=P_0_4)")))U(("(R_4<=L_6)")U("(L_5<=P_4_0)"))))
Formula 12 simplified : !(GF"(P_1_1<=P_0_4)" U ("(R_4<=L_6)" U "(L_5<=P_4_0)"))
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
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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.536453,33848,1,0,152,54428,112,158,1064,64527,473
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(P_1_0>=1)"))
Formula 13 simplified : !"(P_1_0>=1)"
invariant :P_4_0 + L_8 = 1
invariant :P_4_1 + P_4_2 + P_4_3 + cX_4 + -1'L_8 + -1'R_9 = -1
invariant :P_2_1 + -1'P_3_3 + -1'P_4_2 + -1'cX_3 + -2'cX_4 + -1'cY_2 + -2'cY_3 + -3'cY_4 + 2'L_0 + L_1 + L_2 + L_8 + R_4 + R_5 + 2'R_6 + 2'R_7 + 4'R_8 + 5'R_9 = 11
invariant :P_0_4 + L_0 = 1
invariant :P_2_2 + -1'cX_3 + -2'cX_4 + -1'cY_3 + -2'cY_4 + L_0 + L_1 + L_7 + L_8 + R_5 + R_6 + 2'R_7 + 3'R_8 + 4'R_9 = 9
invariant :P_0_2 + P_3_2 + -1'cX_4 + -1'cY_3 + -2'cY_4 + 2'L_0 + L_1 + L_2 + L_8 + R_6 + R_7 + 2'R_8 + 3'R_9 = 8
invariant :P_4_4 + R_9 = 1
invariant :P_2_0 + -1'P_3_2 + -1'P_3_3 + -1'cX_3 + -1'cX_4 + L_6 + L_7 + L_8 + R_8 + R_9 = 3
invariant :cX_0 + cX_3 + 3'cX_4 + cY_2 + 3'cY_3 + 6'cY_4 + -6'L_0 + -3'L_1 + -2'L_2 + L_5 + -2'L_8 + -1'R_1 + -1'R_2 + -1'R_4 + -1'R_5 + -3'R_6 + -4'R_7 + -7'R_8 + -9'R_9 = -24
invariant :L_1 + L_3 + L_5 + L_7 + -1'R_2 + -1'R_4 + -1'R_6 + -1'R_8 = 0
invariant :P_1_0 + P_3_2 + P_3_3 + P_4_2 + P_4_3 + cX_3 + 2'cX_4 + cY_2 + 2'cY_3 + 3'cY_4 + -2'L_0 + -1'L_1 + -1'L_2 + L_5 + -1'L_8 + -1'R_4 + -1'R_5 + -2'R_6 + -2'R_7 + -4'R_8 + -5'R_9 = -10
invariant :P_0_3 + P_3_3 + P_4_2 + P_4_3 + -1'cY_4 + L_0 + L_1 + R_7 + R_8 + R_9 = 4
invariant :P_3_4 + P_4_3 + R_8 = 1
invariant :P_1_3 + -1'P_3_2 + -1'P_3_3 + -1'P_4_2 + cX_4 + cY_3 + 2'cY_4 + -2'L_0 + -1'L_1 + -1'L_8 + -1'R_6 + -2'R_7 + -2'R_8 + -3'R_9 = -8
invariant :cY_0 + -1'cY_2 + -2'cY_3 + -3'cY_4 + 2'L_0 + L_1 + L_2 + -1'L_5 + -1'L_6 + -2'L_7 + -2'L_8 + -1'R_1 + R_4 + R_5 + 2'R_6 + 2'R_7 + 3'R_8 + 3'R_9 = 4
invariant :P_3_0 + -1'P_4_2 + -1'P_4_3 + -1'cX_4 + L_7 + L_8 + R_9 = 2
invariant :P_3_1 + P_3_2 + P_3_3 + P_4_2 + cX_3 + cX_4 + -1'L_7 + -1'L_8 + -1'R_8 + -1'R_9 = -2
invariant :cY_1 + 2'cY_2 + 3'cY_3 + 4'cY_4 + -2'L_0 + -1'L_1 + -1'L_2 + L_5 + L_6 + 2'L_7 + 2'L_8 + -1'R_2 + -1'R_3 + -2'R_4 + -2'R_5 + -3'R_6 + -3'R_7 + -4'R_8 + -4'R_9 = -8
invariant :P_1_2 + P_4_2 + cX_3 + 3'cX_4 + cY_2 + 2'cY_3 + 4'cY_4 + -3'L_0 + -2'L_1 + -1'L_2 + -1'L_7 + -2'L_8 + -1'R_5 + -2'R_6 + -3'R_7 + -5'R_8 + -7'R_9 = -16
invariant :L_0 + L_2 + L_4 + L_6 + L_8 + -1'R_1 + -1'R_3 + -1'R_5 + -1'R_7 + -1'R_9 = 0
invariant :P_1_4 + -1'P_3_3 + -1'P_4_2 + -1'P_4_3 + cY_4 + -1'L_0 + -1'R_7 + -1'R_8 + -1'R_9 = -3
invariant :P_1_1 + P_3_3 + cX_3 + 2'cX_4 + cY_3 + 2'cY_4 + -2'L_0 + -1'L_1 + -1'L_2 + -1'L_6 + -1'L_7 + -2'L_8 + R_3 + -1'R_6 + -1'R_7 + -3'R_8 + -4'R_9 = -10
invariant :cX_2 + 3'cX_3 + 6'cX_4 + cY_2 + 3'cY_3 + 6'cY_4 + -4'L_0 + -2'L_1 + -1'L_2 + -1'L_6 + -2'L_7 + -4'L_8 + -1'R_4 + -2'R_5 + -4'R_6 + -6'R_7 + -9'R_8 + -12'R_9 = -28
invariant :cX_1 + -3'cX_3 + -8'cX_4 + -2'cY_2 + -6'cY_3 + -12'cY_4 + 10'L_0 + 5'L_1 + 3'L_2 + -1'L_5 + L_6 + 2'L_7 + 6'L_8 + -1'R_3 + R_4 + 2'R_5 + 6'R_6 + 9'R_7 + 15'R_8 + 20'R_9 = 48
invariant :P_0_0 + R_1 = 1
invariant :P_0_1 + -1'P_3_2 + -1'P_3_3 + -1'P_4_2 + -1'P_4_3 + -1'cX_3 + -2'cX_4 + -1'cY_2 + -2'cY_3 + -3'cY_4 + 2'L_0 + L_1 + L_2 + -1'L_5 + L_8 + R_2 + R_4 + R_5 + 2'R_6 + 2'R_7 + 4'R_8 + 5'R_9 = 11
invariant :P_2_3 + P_3_2 + P_3_3 + -1'cX_4 + -1'cY_4 + L_0 + L_8 + R_6 + R_7 + R_8 + 2'R_9 = 5
invariant :P_2_4 + P_3_3 + P_4_2 + R_7 = 1
Computing Next relation with stutter on 58 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.550886,33848,1,0,152,54428,115,158,1066,64527,475
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((G("(cX_4<=P_4_4)"))U(F(X("(R_7>=2)")))))
Formula 14 simplified : !(G"(cX_4<=P_4_4)" U FX"(R_7>=2)")
Computing Next relation with stutter on 58 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.552236,34096,1,0,152,54434,124,158,1068,64559,499
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X("(P_0_3<=L_6)")))
Formula 15 simplified : !X"(P_0_3<=L_6)"
Computing Next relation with stutter on 58 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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.553228,34096,1,0,152,54434,127,158,1074,64559,501
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-15 TRUE 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 1527991708694

--------------------
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 LTLCardinality -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 LTLCardinality -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:27 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:27 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 34 ms
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 places.
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Jun 03, 2018 2:08:27 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Jun 03, 2018 2:08:27 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:27 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:27 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: L_9,R_0,
Jun 03, 2018 2:08:27 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:27 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:27 AM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: L_9,R_0,
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 2 constant variables :L_9=1, R_0=1
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 1 expressions due to constant valuations.
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 90 ms
Jun 03, 2018 2:08:27 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Jun 03, 2018 2:08:27 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 03, 2018 2:08:27 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Jun 03, 2018 2:08:28 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 28 place invariants in 36 ms
Jun 03, 2018 2:08:28 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:28 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 700ms 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="LTLCardinality"
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 LTLCardinality"
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-152749176100311"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;