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-159033546500329.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-AN03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546500329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 3.0K May 14 03:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 14 03:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 13 21:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 13 21:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K May 13 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 13 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 18K 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-AN03-00
FORMULA_NAME Sudoku-PT-AN03-01
FORMULA_NAME Sudoku-PT-AN03-02
FORMULA_NAME Sudoku-PT-AN03-03
FORMULA_NAME Sudoku-PT-AN03-04
FORMULA_NAME Sudoku-PT-AN03-05
FORMULA_NAME Sudoku-PT-AN03-06
FORMULA_NAME Sudoku-PT-AN03-07
FORMULA_NAME Sudoku-PT-AN03-08
FORMULA_NAME Sudoku-PT-AN03-09
FORMULA_NAME Sudoku-PT-AN03-10
FORMULA_NAME Sudoku-PT-AN03-11
FORMULA_NAME Sudoku-PT-AN03-12
FORMULA_NAME Sudoku-PT-AN03-13
FORMULA_NAME Sudoku-PT-AN03-14
FORMULA_NAME Sudoku-PT-AN03-15

=== Now, execution of the tool begins

BK_START 1590484606384

[2020-05-26 09:16:48] [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:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:16:49] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-05-26 09:16:49] [INFO ] Transformed 54 places.
[2020-05-26 09:16:49] [INFO ] Transformed 27 transitions.
[2020-05-26 09:16:49] [INFO ] Parsed PT model containing 54 places and 27 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11767 resets, run finished after 455 ms. (steps per millisecond=219 ) properties seen :[1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 27 rows 54 cols
[2020-05-26 09:16:49] [INFO ] Computed 27 place invariants in 3 ms
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 26 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned unsat
[2020-05-26 09:16:49] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned unsat
[2020-05-26 09:16:50] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned unsat
[2020-05-26 09:16:50] [INFO ] [Real]Absence check using 27 positive place invariants in 2 ms returned unsat
[2020-05-26 09:16:50] [INFO ] [Real]Absence check using 27 positive place invariants in 1 ms returned unsat
[2020-05-26 09:16:50] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 25 simplifications.
[2020-05-26 09:16:50] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-26 09:16:50] [INFO ] Flatten gal took : 22 ms
FORMULA Sudoku-PT-AN03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:16:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-26 09:16:50] [INFO ] Flatten gal took : 7 ms
[2020-05-26 09:16:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-PT-AN03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:16:50] [INFO ] Applying decomposition
[2020-05-26 09:16:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:16:50] [INFO ] Flatten gal took : 12 ms
[2020-05-26 09:16:50] [INFO ] Input system was already deterministic with 27 transitions.
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/graph8590976739336620513.txt, -o, /tmp/graph8590976739336620513.bin, -w, /tmp/graph8590976739336620513.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/graph8590976739336620513.bin, -l, -1, -v, -w, /tmp/graph8590976739336620513.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 27 rows 54 cols
[2020-05-26 09:16:50] [INFO ] Computed 27 place invariants in 1 ms
inv : Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Cells_0_2 = 1
inv : Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Cells_2_0 = 1
inv : Board_0_1_2 + Board_1_1_2 + Board_2_1_2 + Columns_1_2 = 1
inv : Board_0_1_0 + Board_1_1_0 + Board_2_1_0 + Columns_1_0 = 1
inv : Rows_2_2 + Board_2_0_2 + Board_2_1_2 + Board_2_2_2 = 1
inv : Rows_1_1 + Board_1_0_1 + Board_1_1_1 + Board_1_2_1 = 1
inv : Board_0_2_2 + Board_1_2_2 + Board_2_2_2 + Columns_2_2 = 1
inv : Board_0_2_1 + Board_1_2_1 + Board_2_2_1 + Columns_2_1 = 1
inv : Rows_0_2 + Board_0_0_2 + Board_0_1_2 + Board_0_2_2 = 1
inv : Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Cells_1_0 = 1
inv : Rows_0_0 + Board_0_0_0 + Board_0_1_0 + Board_0_2_0 = 1
inv : Rows_1_0 + Board_1_0_0 + Board_1_1_0 + Board_1_2_0 = 1
inv : Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Cells_0_1 = 1
inv : Rows_2_0 + Board_2_0_0 + Board_2_1_0 + Board_2_2_0 = 1
inv : Board_0_0_1 + Board_1_0_1 + Board_2_0_1 + Columns_0_1 = 1
inv : Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Cells_1_1 = 1
inv : Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Cells_2_2 = 1
inv : Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Cells_0_0 = 1
inv : Board_0_1_1 + Board_1_1_1 + Board_2_1_1 + Columns_1_1 = 1
inv : Rows_0_1 + Board_0_0_1 + Board_0_1_1 + Board_0_2_1 = 1
inv : Board_0_2_0 + Board_1_2_0 + Board_2_2_0 + Columns_2_0 = 1
inv : Rows_1_2 + Board_1_0_2 + Board_1_1_2 + Board_1_2_2 = 1
inv : Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Cells_1_2 = 1
inv : Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Cells_2_1 = 1
inv : Rows_2_1 + Board_2_0_1 + Board_2_1_1 + Board_2_2_1 = 1
inv : Board_0_0_2 + Board_1_0_2 + Board_2_0_2 + Columns_0_2 = 1
inv : Board_0_0_0 + Board_1_0_0 + Board_2_0_0 + Columns_0_0 = 1
Total of 27 invariants.
[2020-05-26 09:16:50] [INFO ] Computed 27 place invariants in 2 ms
[2020-05-26 09:16:50] [INFO ] Decomposing Gal with order
[2020-05-26 09:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:16:50] [INFO ] Removed a total of 14 redundant transitions.
[2020-05-26 09:16:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:16:50] [INFO ] Flatten gal took : 41 ms
[2020-05-26 09:16:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2020-05-26 09:16:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-26 09:16:50] [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 5 LTL properties
Checking formula 0 : !((false))
Formula 0 simplified : 1
[2020-05-26 09:16:50] [INFO ] Proved 54 variables to be positive in 269 ms
[2020-05-26 09:16:50] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2020-05-26 09:16:50] [INFO ] Computation of disable matrix completed :0/27 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:50] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2020-05-26 09:16:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 390 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
89 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.909347,50912,1,0,19,193240,17,21,925,115483,42
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Sudoku-PT-AN03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((((F("(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=2)"))U("(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=3)"))U(F("(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=3)")))&&("(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=2)"))))
Formula 1 simplified : !X("(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=2)" & ((F"(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=2)" U "(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=3)") U F"(((((((((((((((((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+gu1.Board_0_0_2)+gu1.Board_0_1_0)+gu1.Board_0_1_1)+gu1.Board_0_1_2)+gu1.Board_0_2_0)+gu1.Board_0_2_1)+gu1.Board_0_2_2)+gu1.Board_1_0_0)+gu1.Board_1_0_1)+gu1.Board_1_0_2)+gu1.Board_1_1_0)+gu1.Board_1_1_1)+gu1.Board_1_1_2)+gu1.Board_1_2_0)+gu1.Board_1_2_1)+gu1.Board_1_2_2)+gu1.Board_2_0_0)+gu1.Board_2_0_1)+gu1.Board_2_0_2)+gu1.Board_2_1_0)+gu1.Board_2_1_1)+gu1.Board_2_1_2)+gu1.Board_2_2_0)+gu1.Board_2_2_1)+gu1.Board_2_2_2)>=3)"))
Computing Next relation with stutter on 390 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.99097,53396,1,0,21,199409,25,23,1495,124719,57
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Sudoku-PT-AN03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("(gu2.Cells_0_0<=gu2.Columns_0_1)"))U(F((G("((gu3.Rows_0_1<=gu3.Cells_1_2)&&(gu0.Rows_1_0<=gu0.Cells_1_0))"))&&(F(X(G("((gu2.Cells_0_0<=gu2.Columns_0_1)||(gu0.Rows_1_0<=gu0.Cells_1_0))"))))))))
Formula 2 simplified : !(F"(gu2.Cells_0_0<=gu2.Columns_0_1)" U F(G"((gu3.Rows_0_1<=gu3.Cells_1_2)&&(gu0.Rows_1_0<=gu0.Cells_1_0))" & FXG"((gu2.Cells_0_0<=gu2.Columns_0_1)||(gu0.Rows_1_0<=gu0.Cells_1_0))"))
Computing Next relation with stutter on 390 deadlock states
[2020-05-26 09:16:51] [INFO ] Computing symmetric co enabling matrix : 27 transitions.
[2020-05-26 09:16:52] [INFO ] Computation of Finished co-enabling matrix. took 973 ms. Total solver calls (SAT/UNSAT): 81(81/0)
[2020-05-26 09:16:52] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2020-05-26 09:16:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:52] [INFO ] Built C files in 2568ms 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]
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 items max in DFS search stack
144 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,2.44561,93372,1,0,117,398170,38,121,1514,407797,284
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Sudoku-PT-AN03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G((!(("((gu2.Columns_0_1<=gu1.Board_0_2_1)&&(gu4.Columns_1_1<=gu4.Rows_1_2))")U("(gu3.Columns_1_0>gu3.Cells_1_2)")))U(F(G("(gu3.Columns_1_0<=gu3.Cells_1_2)")))))))
Formula 3 simplified : G(!("((gu2.Columns_0_1<=gu1.Board_0_2_1)&&(gu4.Columns_1_1<=gu4.Rows_1_2))" U "(gu3.Columns_1_0>gu3.Cells_1_2)") U FG"(gu3.Columns_1_0<=gu3.Cells_1_2)")
Computing Next relation with stutter on 390 deadlock states
Compilation finished in 627 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, !( []((!( ((LTLAP5==true))U((LTLAP6==true))) )U(<>([]((LTLAP7==true)))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, !( []((!( ((LTLAP5==true))U((LTLAP6==true))) )U(<>([]((LTLAP7==true)))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, !( []((!( ((LTLAP5==true))U((LTLAP6==true))) )U(<>([]((LTLAP7==true)))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
65 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,3.09184,102896,1,0,130,429749,47,143,1519,462374,362
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Sudoku-PT-AN03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F("(gu1.Rows_1_1>gu1.Board_2_0_0)"))))
Formula 4 simplified : !GF"(gu1.Rows_1_1>gu1.Board_2_0_0)"
Computing Next relation with stutter on 390 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
20 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,3.29205,109756,1,0,142,462479,56,160,1525,494890,415
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Sudoku-PT-AN03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590484614955

--------------------
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-AN03"
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-AN03, 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-159033546500329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN03.tgz
mv Sudoku-PT-AN03 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;