About the Execution of ITS-Tools.M for NQueens-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
331.040 | 2550.00 | 4838.00 | 95.70 | FTFFFFFFFTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r197-oct2-155272230000006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
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 r197-oct2-155272230000006
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.2K Feb 11 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 11 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 7 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 23:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 27K Mar 10 17:31 model.pnml
--------------------
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 1553627675791
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G("(P_3_2>=3)")))
Formula 0 simplified : !G"(P_3_2>=3)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 53 cols
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
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
22 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.238399,26712,1,0,14,31904,23,12,974,19732,35
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((true))
Formula 1 simplified : 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.238544,26712,1,0,14,31904,23,12,974,19732,35
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(("(cX_3<=cX_2)")U("(cY_2>=3)")))))
Formula 2 simplified : !FG("(cX_3<=cX_2)" U "(cY_2>=3)")
Computing Next relation with stutter on 58 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.301699,29936,1,0,48,37741,39,57,988,34511,159
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
Checking formula 3 : !(((G(X("(cY_3>=1)")))U(X(X("(P_3_1<=P_2_3)")))))
Formula 3 simplified : !(GX"(cY_3>=1)" U XX"(P_3_1<=P_2_3)")
Computing Next relation with stutter on 58 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.311811,31836,1,0,58,38684,46,66,995,35630,193
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
Checking formula 4 : !((F(F(X("(P_3_1>=1)")))))
Formula 4 simplified : !FX"(P_3_1>=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
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.327375,32364,1,0,73,39857,55,85,997,38307,246
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
Checking formula 5 : !((F(X(G("(P_1_3<=cX_4)")))))
Formula 5 simplified : !FXG"(P_1_3<=cX_4)"
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.35045,33448,1,0,91,41336,68,113,1003,43400,331
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
Checking formula 6 : !((G((X("(P_4_2>=2)"))U(G("(P_1_4<=L_3)")))))
Formula 6 simplified : !G(X"(P_4_2>=2)" U G"(P_1_4<=L_3)")
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.359614,33888,1,0,104,41903,74,130,1008,44672,400
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
Checking formula 7 : !(((X(F(true)))U(G(F("(L_2<=P_1_1)")))))
Formula 7 simplified : !(1 U GF"(L_2<=P_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
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.393903,35208,1,0,117,44575,83,144,1013,51185,453
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
Checking formula 8 : !((X(G(F(X("(L_2>=2)"))))))
Formula 8 simplified : !XGFX"(L_2>=2)"
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.395732,35208,1,0,117,44575,92,144,1015,51185,459
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((("(P_0_4>=1)")U(("(P_4_4<=P_2_2)")U("(P_3_2<=P_1_2)"))))
Formula 9 simplified : !("(P_0_4>=1)" U ("(P_4_4<=P_2_2)" U "(P_3_2<=P_1_2)"))
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.396782,35424,1,0,117,44575,111,144,1036,51186,465
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F((G("(R_3<=P_4_3)"))U(G("(P_4_4>=2)")))))
Formula 10 simplified : !F(G"(R_3<=P_4_3)" U G"(P_4_4>=2)")
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
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.408424,35940,1,0,118,44593,124,148,1038,51317,531
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
Checking formula 11 : !((F(F(("(P_3_3>=2)")U("(P_0_2<=R_6)")))))
Formula 11 simplified : !F("(P_3_3>=2)" U "(P_0_2<=R_6)")
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.408907,35940,1,0,118,44593,133,148,1042,51317,535
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(X(G(G("(P_3_4>=3)"))))))
Formula 12 simplified : !GXG"(P_3_4>=3)"
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
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.412115,36204,1,0,118,44612,139,148,1044,51581,543
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
Checking formula 13 : !((F(X(("(P_3_1<=R_6)")U("(R_5<=cY_4)")))))
Formula 13 simplified : !FX("(P_3_1<=R_6)" U "(R_5<=cY_4)")
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.480408,36996,1,0,140,47227,148,166,1049,57448,593
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
Checking formula 14 : !((X(X(F(F("(cY_2<=R_4)"))))))
Formula 14 simplified : !XXF"(cY_2<=R_4)"
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.491967,36996,1,0,157,48585,157,180,1054,60993,633
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
Checking formula 15 : !((false))
Formula 15 simplified : 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
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.492198,36996,1,0,157,48585,157,180,1054,60993,634
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NQueens-PT-05-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1553627678341
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 26, 2019 7:14:37 PM 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 26 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 places.
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Mar 26, 2019 7:14:37 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 26, 2019 7:14:37 PM 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
Mar 26, 2019 7:14:37 PM 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
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: R_0,L_9,
Mar 26, 2019 7:14:37 PM 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
Mar 26, 2019 7:14:37 PM 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
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: R_0,L_9,
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 2 constant variables :R_0=1, L_9=1
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 1 expressions due to constant valuations.
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 45 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 8 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 53 places.
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 25 transitions.
Mar 26, 2019 7:14:37 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 25 transitions.
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 28 place invariants in 9 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 53 variables to be positive in 114 ms
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 25 transitions.
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 7:14:37 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)
Mar 26, 2019 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 25 transitions.
Mar 26, 2019 7:14:37 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)
Mar 26, 2019 7:14:38 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Mar 26, 2019 7:14:38 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")
Mar 26, 2019 7:14:38 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (and (and (>= (select s0 33) 1) (>= (select s0 36) 1)) (>= (select s0 47) 1)) (>= (select s0 25) 1)) (= (store (store (store (store (store s0 36 (- (select s0 36) 1)) 33 (- (select s0 33) 1)) 3 (+ (select s0 3) 1)) 25 (- (select s0 25) 1)) 47 (- (select s0 47) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (and (>= (select s0 33) 1) (>= (select s0 36) 1)) (>= (select s0 47) 1)) (>= (select s0 25) 1)) (= (store (store (store (store (store s0 36 (- (select s0 36) 1)) 33 (- (select s0 33) 1)) 3 (+ (select s0 3) 1)) 25 (- (select s0 25) 1)) 47 (- (select s0 47) 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)
Mar 26, 2019 7:14:38 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 568ms 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="itstoolsm"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
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 r197-oct2-155272230000006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-05.tgz
mv NQueens-PT-05 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 '
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 ;