About the Execution of ITS-Tools for Sudoku-PT-AN02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.070 | 2615.00 | 5535.00 | 45.30 | FTTFTFTTFFFFFTFF | 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-159033546500321.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-PT-AN02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546500321
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.3K May 14 03:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 03:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 13 21:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 13 21:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.5K May 13 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 13 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 10:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 6.0K 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-PT-AN02-00
FORMULA_NAME Sudoku-PT-AN02-01
FORMULA_NAME Sudoku-PT-AN02-02
FORMULA_NAME Sudoku-PT-AN02-03
FORMULA_NAME Sudoku-PT-AN02-04
FORMULA_NAME Sudoku-PT-AN02-05
FORMULA_NAME Sudoku-PT-AN02-06
FORMULA_NAME Sudoku-PT-AN02-07
FORMULA_NAME Sudoku-PT-AN02-08
FORMULA_NAME Sudoku-PT-AN02-09
FORMULA_NAME Sudoku-PT-AN02-10
FORMULA_NAME Sudoku-PT-AN02-11
FORMULA_NAME Sudoku-PT-AN02-12
FORMULA_NAME Sudoku-PT-AN02-13
FORMULA_NAME Sudoku-PT-AN02-14
FORMULA_NAME Sudoku-PT-AN02-15
=== Now, execution of the tool begins
BK_START 1590484594503
[2020-05-26 09:16:36] [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, -timeout, 3600]
[2020-05-26 09:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:16:36] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2020-05-26 09:16:36] [INFO ] Transformed 20 places.
[2020-05-26 09:16:36] [INFO ] Transformed 8 transitions.
[2020-05-26 09:16:36] [INFO ] Parsed PT model containing 20 places and 8 transitions in 48 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 22215 resets, run finished after 148 ms. (steps per millisecond=675 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 8 rows 20 cols
[2020-05-26 09:16:36] [INFO ] Computed 12 place invariants in 3 ms
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2020-05-26 09:16:36] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
[2020-05-26 09:16:36] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 09:16:36] [INFO ] Flatten gal took : 44 ms
FORMULA Sudoku-PT-AN02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:16:36] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:16:36] [INFO ] Applying decomposition
[2020-05-26 09:16:36] [INFO ] Flatten gal took : 7 ms
[2020-05-26 09:16:36] [INFO ] Input system was already deterministic with 8 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 8 rows 20 cols
[2020-05-26 09:16:36] [INFO ] Computed 12 place invariants in 1 ms
inv : Rows_0_0 + Board_0_0_0 + Board_0_1_0 = 1
inv : Board_0_1_0 + Board_0_1_1 + Cells_0_1 = 1
inv : Rows_1_0 + Board_1_0_0 + Board_1_1_0 = 1
inv : Board_0_0_1 + Board_1_0_1 + Columns_0_1 = 1
inv : Rows_0_1 + Board_0_0_1 + Board_0_1_1 = 1
inv : Board_1_1_0 + Board_1_1_1 + Cells_1_1 = 1
inv : Board_1_0_0 + Board_1_0_1 + Cells_1_0 = 1
inv : Board_0_1_1 + Board_1_1_1 + Columns_1_1 = 1
inv : Rows_1_1 + Board_1_0_1 + Board_1_1_1 = 1
inv : Board_0_0_0 + Board_0_0_1 + Cells_0_0 = 1
inv : Board_0_1_0 + Board_1_1_0 + Columns_1_0 = 1
inv : Board_0_0_0 + Board_1_0_0 + Columns_0_0 = 1
Total of 12 invariants.
[2020-05-26 09:16:36] [INFO ] Computed 12 place invariants in 2 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/graph9269736239236133312.txt, -o, /tmp/graph9269736239236133312.bin, -w, /tmp/graph9269736239236133312.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/graph9269736239236133312.bin, -l, -1, -v, -w, /tmp/graph9269736239236133312.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:16:36] [INFO ] Proved 20 variables to be positive in 41 ms
[2020-05-26 09:16:36] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2020-05-26 09:16:36] [INFO ] Computation of disable matrix completed :0/8 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:36] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2020-05-26 09:16:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:36] [INFO ] Decomposing Gal with order
[2020-05-26 09:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:16:36] [INFO ] Removed a total of 12 redundant transitions.
[2020-05-26 09:16:36] [INFO ] Flatten gal took : 26 ms
[2020-05-26 09:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-26 09:16:36] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-26 09:16:36] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((X(G(!(X(F(X("((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)<=(((gi0.gu2.Cells_0_0+gi0.gu2.Cells_0_1)+gi0.gu2.Cells_1_0)+gi0.gu2.Cells_1_1))"))))))))
Formula 0 simplified : !XG!XFX"((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)<=(((gi0.gu2.Cells_0_0+gi0.gu2.Cells_0_1)+gi0.gu2.Cells_1_0)+gi0.gu2.Cells_1_1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.027748,16664,1,0,15,1262,23,12,518,856,38
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("(((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=2)&&((((gi1.gu3.Columns_0_0+gi1.gu3.Columns_0_1)+gi1.gu3.Columns_1_0)+gi1.gu3.Columns_1_1)<=(((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)))")))
Formula 1 simplified : !F"(((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=2)&&((((gi1.gu3.Columns_0_0+gi1.gu3.Columns_0_1)+gi1.gu3.Columns_1_0)+gi1.gu3.Columns_1_1)<=(((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)))"
Computing Next relation with stutter on 6 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.030608,16980,1,0,18,1342,32,16,594,1132,53
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((F(G("((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=1)")))U((!(X("(((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=1)&&((((gi0.gu2.Cells_0_0+gi0.gu2.Cells_0_1)+gi0.gu2.Cells_1_0)+gi0.gu2.Cells_1_1)<=(((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)))")))U("((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=1)")))))
Formula 2 simplified : !G(FG"((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=1)" U (!X"(((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=1)&&((((gi0.gu2.Cells_0_0+gi0.gu2.Cells_0_1)+gi0.gu2.Cells_1_0)+gi0.gu2.Cells_1_1)<=(((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)))" U "((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=1)"))
Computing Next relation with stutter on 6 deadlock states
7 unique states visited
6 strongly connected components in search stack
9 transitions explored
6 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.035777,17796,1,0,20,1495,40,26,614,1668,99
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(!(G(X(!(G(X(!(G(F("((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=3)")))))))))))))
Formula 3 simplified : !XF!GX!GX!GF"((((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1)>=3)"
Computing Next relation with stutter on 6 deadlock states
9 unique states visited
0 strongly connected components in search stack
10 transitions explored
6 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.037886,17992,1,0,20,1553,53,30,636,2167,132
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((X(F("((((gi1.gu3.Columns_0_0+gi1.gu3.Columns_0_1)+gi1.gu3.Columns_1_0)+gi1.gu3.Columns_1_1)<=(((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1))")))||(G(X("((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=3)"))))U("((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=3)")))
Formula 4 simplified : !((XF"((((gi1.gu3.Columns_0_0+gi1.gu3.Columns_0_1)+gi1.gu3.Columns_1_0)+gi1.gu3.Columns_1_1)<=(((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1))" | GX"((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=3)") U "((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=3)")
Computing Next relation with stutter on 6 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.042081,18164,1,0,22,1594,65,37,765,2535,165
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X("((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=2)"))||(F(X("((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)<=(((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1))")))))
Formula 5 simplified : !(X"((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)>=2)" | FX"((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+gi0.gu1.Board_0_1_0)+gi0.gu1.Board_0_1_1)+gi0.gu1.Board_1_0_0)+gi0.gu1.Board_1_0_1)+gi0.gu1.Board_1_1_0)+gi0.gu1.Board_1_1_1)<=(((gi1.gu0.Rows_0_0+gi1.gu0.Rows_0_1)+gi1.gu0.Rows_1_0)+gi1.gu0.Rows_1_1))")
Computing Next relation with stutter on 6 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.043171,18164,1,0,22,1594,72,37,815,2535,167
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(!(G(X(X("(gi0.gu2.Cells_0_1>=1)"))))))))
Formula 6 simplified : !XG!GXX"(gi0.gu2.Cells_0_1>=1)"
Computing Next relation with stutter on 6 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.043921,18164,1,0,23,1600,81,39,816,2556,182
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(!(F("(gi1.gu3.Columns_1_0<=gi1.gu0.Rows_0_1)"))))))
Formula 7 simplified : !GF!F"(gi1.gu3.Columns_1_0<=gi1.gu0.Rows_0_1)"
Computing Next relation with stutter on 6 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.046766,18388,1,0,49,1975,94,73,821,3447,271
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(X("((gi0.gu1.Board_1_0_1<=gi1.gu3.Columns_1_0)&&(gi1.gu0.Rows_0_1<=gi1.gu3.Columns_0_0))")))||(!(G("(gi0.gu2.Cells_0_0<=gi1.gu0.Rows_0_1)")))))
Formula 8 simplified : !(GX"((gi0.gu1.Board_1_0_1<=gi1.gu3.Columns_1_0)&&(gi1.gu0.Rows_0_1<=gi1.gu3.Columns_0_0))" | !G"(gi0.gu2.Cells_0_0<=gi1.gu0.Rows_0_1)")
Computing Next relation with stutter on 6 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.049133,18388,1,0,74,2295,113,98,842,4191,331
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(("(gi1.gu0.Rows_0_1<=gi0.gu1.Board_0_1_1)")U("(gi1.gu0.Rows_1_0<=gi0.gu1.Board_1_0_1)")))))
Formula 9 simplified : !XG("(gi1.gu0.Rows_0_1<=gi0.gu1.Board_0_1_1)" U "(gi1.gu0.Rows_1_0<=gi0.gu1.Board_1_0_1)")
Computing Next relation with stutter on 6 deadlock states
9 unique states visited
4 strongly connected components in search stack
11 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.052768,18536,1,0,98,2585,131,124,859,4831,423
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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: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:16:36] [INFO ] Built C files in 235ms 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 1590484597118
--------------------
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 -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 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 -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-PT-AN02"
export BK_EXAMINATION="LTLCardinality"
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-PT-AN02, 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 r227-oct2-159033546500321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;