fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r227-oct2-159033546300210
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Sudoku-COL-AN08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.040 2824.00 7602.00 66.80 TTFFTFTTTTFTFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546300210.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546300210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.5K May 14 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 5 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 6.5K May 12 20:42 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 Sudoku-COL-AN08-00
FORMULA_NAME Sudoku-COL-AN08-01
FORMULA_NAME Sudoku-COL-AN08-02
FORMULA_NAME Sudoku-COL-AN08-03
FORMULA_NAME Sudoku-COL-AN08-04
FORMULA_NAME Sudoku-COL-AN08-05
FORMULA_NAME Sudoku-COL-AN08-06
FORMULA_NAME Sudoku-COL-AN08-07
FORMULA_NAME Sudoku-COL-AN08-08
FORMULA_NAME Sudoku-COL-AN08-09
FORMULA_NAME Sudoku-COL-AN08-10
FORMULA_NAME Sudoku-COL-AN08-11
FORMULA_NAME Sudoku-COL-AN08-12
FORMULA_NAME Sudoku-COL-AN08-13
FORMULA_NAME Sudoku-COL-AN08-14
FORMULA_NAME Sudoku-COL-AN08-15

=== Now, execution of the tool begins

BK_START 1590484394524

[2020-05-26 09:13:16] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 09:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:13:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-26 09:13:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2020-05-26 09:13:16] [INFO ] sort/places :
N2->Rows,Cells,Columns,
N3->Board,

[2020-05-26 09:13:16] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-05-26 09:13:16] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-05-26 09:13:16] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2020-05-26 09:13:16] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 12 ms.
[2020-05-26 09:13:16] [INFO ] Computed order based on color domains.
[2020-05-26 09:13:16] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions in 21 ms.
[2020-05-26 09:13:16] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 486 places in 1 ms
Reduce places removed 486 places and 342 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 88 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2 steps, including 1 resets, run visited all 7 properties in 1 ms. (steps per millisecond=2 )
[2020-05-26 09:13:17] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 09:13:17] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-COL-AN08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:13:17] [INFO ] Flatten gal took : 1 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:13:17] [INFO ] Applying decomposition
[2020-05-26 09:13:17] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph434722283462679566.txt, -o, /tmp/graph434722283462679566.bin, -w, /tmp/graph434722283462679566.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph434722283462679566.bin, -l, -1, -v, -w, /tmp/graph434722283462679566.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:13:17] [INFO ] Decomposing Gal with order
[2020-05-26 09:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:13:17] [INFO ] Flatten gal took : 1 ms
[2020-05-26 09:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-26 09:13:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 0 ms
[2020-05-26 09:13:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 :

[2020-05-26 09:13:17] [INFO ] Input system was already deterministic with 1 transitions.
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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 10 LTL properties
Checking formula 0 : !((G((F((!(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))&&(G(X("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))")))))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))
Formula 0 simplified : !G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | F(!G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" & GX"(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))"))
built 0 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
7 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
// Phase 1: matrix 1 rows 4 cols
STATS,0,0.020687,17204,1,0,6,27,36,5,74,16,26
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN08-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))U(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))
Formula 1 simplified : !(X"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 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.021451,17404,1,0,6,27,42,5,75,16,31
[2020-05-26 09:13:17] [INFO ] Computed 3 place invariants in 5 ms
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
inv : Board_0 + Cells_0 = 1
inv : Rows_0 + Board_0 = 1
inv : Board_0 + Columns_0 = 1
Total of 3 invariants.
FORMULA Sudoku-COL-AN08-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")U(("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))")U("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))U(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))
Formula 2 simplified : !X(("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U ("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))" U "(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")) U G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
[2020-05-26 09:13:17] [INFO ] Computed 3 place invariants in 9 ms
Computing Next relation with stutter on 1 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.022372,17404,1,0,6,27,52,5,80,16,38
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Sudoku-COL-AN08-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(!(X((X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))U((G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))U(("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")U(F(!(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))))))))
Formula 3 simplified : !X!X(X"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U (G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U ("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U F!G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))
Computing Next relation with stutter on 1 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.023349,17536,1,0,6,27,52,5,80,16,38
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Sudoku-COL-AN08-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(F(G(!(F("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))))
Formula 4 simplified : !XXFG!F"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"
Computing Next relation with stutter on 1 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.023823,17536,1,0,6,27,59,5,80,16,42
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN08-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(F((!(F(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))||((!(G("((((((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))&&(u0.Rows_0>=1))&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))&&("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))")))))))
Formula 5 simplified : !GXF(!FG"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | ("(((u0.Rows_0<1)||(u0.Cells_0<1))||(u0.Columns_0<1))" & !G"((((((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))&&(u0.Rows_0>=1))&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 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.027185,18196,1,0,6,27,71,6,93,17,53
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN08-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))U(G(!(F(X(F("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))))
Formula 6 simplified : !(XX"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U G!FXF"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 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.029596,18460,1,0,6,27,71,6,93,17,53
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN08-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(((F(X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))U((X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))U("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))&&((X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))
Formula 7 simplified : !FX((FX"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U (X"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U "(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")) & ("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | X"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))
Computing Next relation with stutter on 1 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.029943,18460,1,0,6,27,75,6,93,17,56
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Sudoku-COL-AN08-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(!(X(!(("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")U(!(G("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))))))
Formula 8 simplified : !F!X!("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U !G"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")
Computing Next relation with stutter on 1 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.030207,18460,1,0,6,27,79,6,93,17,57
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN08-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X((X((("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")U("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))U(G(F(X(X(F("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))))))))||("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))")))))
Formula 9 simplified : !FX("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" | X("(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))" U GFXXF"(((u0.Rows_0>=1)&&(u0.Cells_0>=1))&&(u0.Columns_0>=1))"))
Computing Next relation with stutter on 1 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.031153,18460,1,0,6,27,79,6,93,17,57
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Sudoku-COL-AN08-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-26 09:13:17] [INFO ] Built C files in 75ms conformant to PINS in folder :/home/mcc/execution
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 1590484397348

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 LTLFireability -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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Sudoku-COL-AN08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN08, 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 r227-oct2-159033546300210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN08.tgz
mv Sudoku-COL-AN08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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 [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;