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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 2.9K May 14 04:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 14 04:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K May 13 21:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 196K May 13 21:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 10:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 10:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 14 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 41K May 13 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 137K May 13 10:49 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 46K 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-BN04-00
FORMULA_NAME Sudoku-PT-BN04-01
FORMULA_NAME Sudoku-PT-BN04-02
FORMULA_NAME Sudoku-PT-BN04-03
FORMULA_NAME Sudoku-PT-BN04-04
FORMULA_NAME Sudoku-PT-BN04-05
FORMULA_NAME Sudoku-PT-BN04-06
FORMULA_NAME Sudoku-PT-BN04-07
FORMULA_NAME Sudoku-PT-BN04-08
FORMULA_NAME Sudoku-PT-BN04-09
FORMULA_NAME Sudoku-PT-BN04-10
FORMULA_NAME Sudoku-PT-BN04-11
FORMULA_NAME Sudoku-PT-BN04-12
FORMULA_NAME Sudoku-PT-BN04-13
FORMULA_NAME Sudoku-PT-BN04-14
FORMULA_NAME Sudoku-PT-BN04-15

=== Now, execution of the tool begins

BK_START 1590498396351

[2020-05-26 13:06:38] [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 13:06:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 13:06:38] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-26 13:06:38] [INFO ] Transformed 128 places.
[2020-05-26 13:06:38] [INFO ] Transformed 64 transitions.
[2020-05-26 13:06:38] [INFO ] Parsed PT model containing 128 places and 64 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 7174 resets, run finished after 929 ms. (steps per millisecond=107 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 64 rows 128 cols
[2020-05-26 13:06:39] [INFO ] Computed 64 place invariants in 6 ms
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 13 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 18 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 7 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 16 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 18 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 4 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 28 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 24 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 135 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 13 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 5 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 35 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 3 ms returned unsat
[2020-05-26 13:06:40] [INFO ] [Real]Absence check using 64 positive place invariants in 8 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 21 simplifications.
[2020-05-26 13:06:40] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-26 13:06:40] [INFO ] Flatten gal took : 54 ms
FORMULA Sudoku-PT-BN04-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 13:06:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 13:06:40] [INFO ] Flatten gal took : 12 ms
[2020-05-26 13:06:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-PT-BN04-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 13:06:40] [INFO ] Applying decomposition
[2020-05-26 13:06:40] [INFO ] Flatten gal took : 9 ms
[2020-05-26 13:06:41] [INFO ] Input system was already deterministic with 64 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/graph11665284730474830477.txt, -o, /tmp/graph11665284730474830477.bin, -w, /tmp/graph11665284730474830477.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/graph11665284730474830477.bin, -l, -1, -v, -w, /tmp/graph11665284730474830477.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 13:06:41] [INFO ] Decomposing Gal with order
[2020-05-26 13:06:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 13:06:41] [INFO ] Removed a total of 90 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 64 rows 128 cols
[2020-05-26 13:06:41] [INFO ] Computed 64 place invariants in 2 ms
inv : Board_2_0_1 + Board_2_1_1 + Board_3_0_1 + Board_3_1_1 + Regions_2_1 = 1
inv : Board_0_0_0 + Board_0_1_0 + Board_1_0_0 + Board_1_1_0 + Regions_0_0 = 1
inv : Board_1_1_0 + Board_1_1_1 + Board_1_1_2 + Board_1_1_3 + Cells_1_1 = 1
inv : Rows_2_2 + Board_2_0_2 + Board_2_1_2 + Board_2_2_2 + Board_2_3_2 = 1
inv : Rows_3_1 + Board_3_0_1 + Board_3_1_1 + Board_3_2_1 + Board_3_3_1 = 1
inv : Board_0_2_0 + Board_0_2_1 + Board_0_2_2 + Board_0_2_3 + Cells_0_2 = 1
inv : Board_0_1_1 + Board_1_1_1 + Board_2_1_1 + Board_3_1_1 + Columns_1_1 = 1
inv : Board_0_1_2 + Board_1_1_2 + Board_2_1_2 + Board_3_1_2 + Columns_1_2 = 1
inv : Board_3_1_0 + Board_3_1_1 + Board_3_1_2 + Board_3_1_3 + Cells_3_1 = 1
inv : Board_0_2_3 + Board_1_2_3 + Board_2_2_3 + Board_3_2_3 + Columns_2_3 = 1
inv : Board_2_0_0 + Board_2_1_0 + Board_3_0_0 + Board_3_1_0 + Regions_2_0 = 1
inv : Board_0_0_1 + Board_0_1_1 + Board_1_0_1 + Board_1_1_1 + Regions_0_1 = 1
inv : Rows_3_2 + Board_3_0_2 + Board_3_1_2 + Board_3_2_2 + Board_3_3_2 = 1
inv : Board_2_2_0 + Board_2_2_1 + Board_2_2_2 + Board_2_2_3 + Cells_2_2 = 1
inv : Rows_1_3 + Board_1_0_3 + Board_1_1_3 + Board_1_2_3 + Board_1_3_3 = 1
inv : Board_2_2_0 + Board_2_3_0 + Board_3_2_0 + Board_3_3_0 + Regions_3_0 = 1
inv : Board_2_0_0 + Board_2_0_1 + Board_2_0_2 + Board_2_0_3 + Cells_2_0 = 1
inv : Rows_0_2 + Board_0_0_2 + Board_0_1_2 + Board_0_2_2 + Board_0_3_2 = 1
inv : Board_0_2_2 + Board_1_2_2 + Board_2_2_2 + Board_3_2_2 + Columns_2_2 = 1
inv : Board_0_0_0 + Board_0_0_1 + Board_0_0_2 + Board_0_0_3 + Cells_0_0 = 1
inv : Board_1_3_0 + Board_1_3_1 + Board_1_3_2 + Board_1_3_3 + Cells_1_3 = 1
inv : Board_3_2_0 + Board_3_2_1 + Board_3_2_2 + Board_3_2_3 + Cells_3_2 = 1
inv : Rows_1_1 + Board_1_0_1 + Board_1_1_1 + Board_1_2_1 + Board_1_3_1 = 1
inv : Rows_2_0 + Board_2_0_0 + Board_2_1_0 + Board_2_2_0 + Board_2_3_0 = 1
inv : Board_0_0_0 + Board_1_0_0 + Board_2_0_0 + Board_3_0_0 + Columns_0_0 = 1
inv : Board_0_3_1 + Board_1_3_1 + Board_2_3_1 + Board_3_3_1 + Columns_3_1 = 1
inv : Board_2_0_3 + Board_2_1_3 + Board_3_0_3 + Board_3_1_3 + Regions_2_3 = 1
inv : Rows_2_3 + Board_2_0_3 + Board_2_1_3 + Board_2_2_3 + Board_2_3_3 = 1
inv : Board_2_3_0 + Board_2_3_1 + Board_2_3_2 + Board_2_3_3 + Cells_2_3 = 1
inv : Board_1_0_0 + Board_1_0_1 + Board_1_0_2 + Board_1_0_3 + Cells_1_0 = 1
inv : Board_2_2_1 + Board_2_3_1 + Board_3_2_1 + Board_3_3_1 + Regions_3_1 = 1
inv : Board_0_3_0 + Board_0_3_1 + Board_0_3_2 + Board_0_3_3 + Cells_0_3 = 1
inv : Board_0_2_1 + Board_0_3_1 + Board_1_2_1 + Board_1_3_1 + Regions_1_1 = 1
inv : Board_0_0_3 + Board_1_0_3 + Board_2_0_3 + Board_3_0_3 + Columns_0_3 = 1
inv : Board_0_2_0 + Board_1_2_0 + Board_2_2_0 + Board_3_2_0 + Columns_2_0 = 1
inv : Board_0_0_2 + Board_1_0_2 + Board_2_0_2 + Board_3_0_2 + Columns_0_2 = 1
inv : Board_0_3_3 + Board_1_3_3 + Board_2_3_3 + Board_3_3_3 + Columns_3_3 = 1
inv : Board_0_0_3 + Board_0_1_3 + Board_1_0_3 + Board_1_1_3 + Regions_0_3 = 1
inv : Rows_0_1 + Board_0_0_1 + Board_0_1_1 + Board_0_2_1 + Board_0_3_1 = 1
inv : Board_3_0_0 + Board_3_0_1 + Board_3_0_2 + Board_3_0_3 + Cells_3_0 = 1
inv : Rows_1_0 + Board_1_0_0 + Board_1_1_0 + Board_1_2_0 + Board_1_3_0 = 1
inv : Board_0_2_1 + Board_1_2_1 + Board_2_2_1 + Board_3_2_1 + Columns_2_1 = 1
inv : Board_2_2_3 + Board_2_3_3 + Board_3_2_3 + Board_3_3_3 + Regions_3_3 = 1
inv : Board_1_2_0 + Board_1_2_1 + Board_1_2_2 + Board_1_2_3 + Cells_1_2 = 1
inv : Board_3_3_0 + Board_3_3_1 + Board_3_3_2 + Board_3_3_3 + Cells_3_3 = 1
inv : Board_0_1_0 + Board_0_1_1 + Board_0_1_2 + Board_0_1_3 + Cells_0_1 = 1
inv : Board_0_0_1 + Board_1_0_1 + Board_2_0_1 + Board_3_0_1 + Columns_0_1 = 1
inv : Board_0_3_2 + Board_1_3_2 + Board_2_3_2 + Board_3_3_2 + Columns_3_2 = 1
inv : Board_0_0_2 + Board_0_1_2 + Board_1_0_2 + Board_1_1_2 + Regions_0_2 = 1
inv : Board_0_2_2 + Board_0_3_2 + Board_1_2_2 + Board_1_3_2 + Regions_1_2 = 1
inv : Rows_0_0 + Board_0_0_0 + Board_0_1_0 + Board_0_2_0 + Board_0_3_0 = 1
inv : Board_0_2_3 + Board_0_3_3 + Board_1_2_3 + Board_1_3_3 + Regions_1_3 = 1
inv : Board_0_1_3 + Board_1_1_3 + Board_2_1_3 + Board_3_1_3 + Columns_1_3 = 1
inv : Board_2_2_2 + Board_2_3_2 + Board_3_2_2 + Board_3_3_2 + Regions_3_2 = 1
inv : Rows_3_0 + Board_3_0_0 + Board_3_1_0 + Board_3_2_0 + Board_3_3_0 = 1
inv : Rows_2_1 + Board_2_0_1 + Board_2_1_1 + Board_2_2_1 + Board_2_3_1 = 1
inv : Rows_0_3 + Board_0_0_3 + Board_0_1_3 + Board_0_2_3 + Board_0_3_3 = 1
inv : Rows_1_2 + Board_1_0_2 + Board_1_1_2 + Board_1_2_2 + Board_1_3_2 = 1
inv : Board_2_0_2 + Board_2_1_2 + Board_3_0_2 + Board_3_1_2 + Regions_2_2 = 1
inv : Rows_3_3 + Board_3_0_3 + Board_3_1_3 + Board_3_2_3 + Board_3_3_3 = 1
inv : Board_0_3_0 + Board_1_3_0 + Board_2_3_0 + Board_3_3_0 + Columns_3_0 = 1
inv : Board_2_1_0 + Board_2_1_1 + Board_2_1_2 + Board_2_1_3 + Cells_2_1 = 1
inv : Board_0_1_0 + Board_1_1_0 + Board_2_1_0 + Board_3_1_0 + Columns_1_0 = 1
inv : Board_0_2_0 + Board_0_3_0 + Board_1_2_0 + Board_1_3_0 + Regions_1_0 = 1
Total of 64 invariants.
[2020-05-26 13:06:41] [INFO ] Computed 64 place invariants in 16 ms
[2020-05-26 13:06:41] [INFO ] Flatten gal took : 84 ms
[2020-05-26 13:06:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-26 13:06:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-26 13:06:41] [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 7 LTL properties
Checking formula 0 : !((G(X(F(("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+gu0.Board_0_0_2)+gu0.Board_0_0_3)+gu0.Board_0_1_0)+gu0.Board_0_1_1)+gu0.Board_0_1_2)+gu0.Board_0_1_3)+gu0.Board_0_2_0)+gu0.Board_0_2_1)+gu0.Board_0_2_2)+gu0.Board_0_2_3)+gu0.Board_0_3_0)+gu0.Board_0_3_1)+gu0.Board_0_3_2)+gu0.Board_0_3_3)+gu0.Board_1_0_0)+gu0.Board_1_0_1)+gu0.Board_1_0_2)+gu0.Board_1_0_3)+gu0.Board_1_1_0)+gu0.Board_1_1_1)+gu0.Board_1_1_2)+gu0.Board_1_1_3)+gu0.Board_1_2_0)+gu0.Board_1_2_1)+gu0.Board_1_2_2)+gu0.Board_1_2_3)+gu0.Board_1_3_0)+gu0.Board_1_3_1)+gu0.Board_1_3_2)+gu0.Board_1_3_3)+gu0.Board_2_0_0)+gu0.Board_2_0_1)+gu0.Board_2_0_2)+gu0.Board_2_0_3)+gu0.Board_2_1_0)+gu0.Board_2_1_1)+gu0.Board_2_1_2)+gu0.Board_2_1_3)+gu0.Board_2_2_0)+gu0.Board_2_2_1)+gu0.Board_2_2_2)+gu0.Board_2_2_3)+gu0.Board_2_3_0)+gu0.Board_2_3_1)+gu0.Board_2_3_2)+gu0.Board_2_3_3)+gu0.Board_3_0_0)+gu0.Board_3_0_1)+gu0.Board_3_0_2)+gu0.Board_3_0_3)+gu0.Board_3_1_0)+gu0.Board_3_1_1)+gu0.Board_3_1_2)+gu0.Board_3_1_3)+gu0.Board_3_2_0)+gu0.Board_3_2_1)+gu0.Board_3_2_2)+gu0.Board_3_2_3)+gu0.Board_3_3_0)+gu0.Board_3_3_1)+gu0.Board_3_3_2)+gu0.Board_3_3_3)>=3)")U(!(X("(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+gu0.Board_0_0_2)+gu0.Board_0_0_3)+gu0.Board_0_1_0)+gu0.Board_0_1_1)+gu0.Board_0_1_2)+gu0.Board_0_1_3)+gu0.Board_0_2_0)+gu0.Board_0_2_1)+gu0.Board_0_2_2)+gu0.Board_0_2_3)+gu0.Board_0_3_0)+gu0.Board_0_3_1)+gu0.Board_0_3_2)+gu0.Board_0_3_3)+gu0.Board_1_0_0)+gu0.Board_1_0_1)+gu0.Board_1_0_2)+gu0.Board_1_0_3)+gu0.Board_1_1_0)+gu0.Board_1_1_1)+gu0.Board_1_1_2)+gu0.Board_1_1_3)+gu0.Board_1_2_0)+gu0.Board_1_2_1)+gu0.Board_1_2_2)+gu0.Board_1_2_3)+gu0.Board_1_3_0)+gu0.Board_1_3_1)+gu0.Board_1_3_2)+gu0.Board_1_3_3)+gu0.Board_2_0_0)+gu0.Board_2_0_1)+gu0.Board_2_0_2)+gu0.Board_2_0_3)+gu0.Board_2_1_0)+gu0.Board_2_1_1)+gu0.Board_2_1_2)+gu0.Board_2_1_3)+gu0.Board_2_2_0)+gu0.Board_2_2_1)+gu0.Board_2_2_2)+gu0.Board_2_2_3)+gu0.Board_2_3_0)+gu0.Board_2_3_1)+gu0.Board_2_3_2)+gu0.Board_2_3_3)+gu0.Board_3_0_0)+gu0.Board_3_0_1)+gu0.Board_3_0_2)+gu0.Board_3_0_3)+gu0.Board_3_1_0)+gu0.Board_3_1_1)+gu0.Board_3_1_2)+gu0.Board_3_1_3)+gu0.Board_3_2_0)+gu0.Board_3_2_1)+gu0.Board_3_2_2)+gu0.Board_3_2_3)+gu0.Board_3_3_0)+gu0.Board_3_3_1)+gu0.Board_3_3_2)+gu0.Board_3_3_3)>=3)&&((((((((((((((((gu2.Columns_0_0+gu2.Columns_0_1)+gu2.Columns_0_2)+gu2.Columns_0_3)+gu2.Columns_1_0)+gu2.Columns_1_1)+gu2.Columns_1_2)+gu2.Columns_1_3)+gu2.Columns_2_0)+gu2.Columns_2_1)+gu2.Columns_2_2)+gu2.Columns_2_3)+gu2.Columns_3_0)+gu2.Columns_3_1)+gu2.Columns_3_2)+gu2.Columns_3_3)>=3))"))))))))
Formula 0 simplified : !GXF("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+gu0.Board_0_0_2)+gu0.Board_0_0_3)+gu0.Board_0_1_0)+gu0.Board_0_1_1)+gu0.Board_0_1_2)+gu0.Board_0_1_3)+gu0.Board_0_2_0)+gu0.Board_0_2_1)+gu0.Board_0_2_2)+gu0.Board_0_2_3)+gu0.Board_0_3_0)+gu0.Board_0_3_1)+gu0.Board_0_3_2)+gu0.Board_0_3_3)+gu0.Board_1_0_0)+gu0.Board_1_0_1)+gu0.Board_1_0_2)+gu0.Board_1_0_3)+gu0.Board_1_1_0)+gu0.Board_1_1_1)+gu0.Board_1_1_2)+gu0.Board_1_1_3)+gu0.Board_1_2_0)+gu0.Board_1_2_1)+gu0.Board_1_2_2)+gu0.Board_1_2_3)+gu0.Board_1_3_0)+gu0.Board_1_3_1)+gu0.Board_1_3_2)+gu0.Board_1_3_3)+gu0.Board_2_0_0)+gu0.Board_2_0_1)+gu0.Board_2_0_2)+gu0.Board_2_0_3)+gu0.Board_2_1_0)+gu0.Board_2_1_1)+gu0.Board_2_1_2)+gu0.Board_2_1_3)+gu0.Board_2_2_0)+gu0.Board_2_2_1)+gu0.Board_2_2_2)+gu0.Board_2_2_3)+gu0.Board_2_3_0)+gu0.Board_2_3_1)+gu0.Board_2_3_2)+gu0.Board_2_3_3)+gu0.Board_3_0_0)+gu0.Board_3_0_1)+gu0.Board_3_0_2)+gu0.Board_3_0_3)+gu0.Board_3_1_0)+gu0.Board_3_1_1)+gu0.Board_3_1_2)+gu0.Board_3_1_3)+gu0.Board_3_2_0)+gu0.Board_3_2_1)+gu0.Board_3_2_2)+gu0.Board_3_2_3)+gu0.Board_3_3_0)+gu0.Board_3_3_1)+gu0.Board_3_3_2)+gu0.Board_3_3_3)>=3)" U !X"(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+gu0.Board_0_0_2)+gu0.Board_0_0_3)+gu0.Board_0_1_0)+gu0.Board_0_1_1)+gu0.Board_0_1_2)+gu0.Board_0_1_3)+gu0.Board_0_2_0)+gu0.Board_0_2_1)+gu0.Board_0_2_2)+gu0.Board_0_2_3)+gu0.Board_0_3_0)+gu0.Board_0_3_1)+gu0.Board_0_3_2)+gu0.Board_0_3_3)+gu0.Board_1_0_0)+gu0.Board_1_0_1)+gu0.Board_1_0_2)+gu0.Board_1_0_3)+gu0.Board_1_1_0)+gu0.Board_1_1_1)+gu0.Board_1_1_2)+gu0.Board_1_1_3)+gu0.Board_1_2_0)+gu0.Board_1_2_1)+gu0.Board_1_2_2)+gu0.Board_1_2_3)+gu0.Board_1_3_0)+gu0.Board_1_3_1)+gu0.Board_1_3_2)+gu0.Board_1_3_3)+gu0.Board_2_0_0)+gu0.Board_2_0_1)+gu0.Board_2_0_2)+gu0.Board_2_0_3)+gu0.Board_2_1_0)+gu0.Board_2_1_1)+gu0.Board_2_1_2)+gu0.Board_2_1_3)+gu0.Board_2_2_0)+gu0.Board_2_2_1)+gu0.Board_2_2_2)+gu0.Board_2_2_3)+gu0.Board_2_3_0)+gu0.Board_2_3_1)+gu0.Board_2_3_2)+gu0.Board_2_3_3)+gu0.Board_3_0_0)+gu0.Board_3_0_1)+gu0.Board_3_0_2)+gu0.Board_3_0_3)+gu0.Board_3_1_0)+gu0.Board_3_1_1)+gu0.Board_3_1_2)+gu0.Board_3_1_3)+gu0.Board_3_2_0)+gu0.Board_3_2_1)+gu0.Board_3_2_2)+gu0.Board_3_2_3)+gu0.Board_3_3_0)+gu0.Board_3_3_1)+gu0.Board_3_3_2)+gu0.Board_3_3_3)>=3)&&((((((((((((((((gu2.Columns_0_0+gu2.Columns_0_1)+gu2.Columns_0_2)+gu2.Columns_0_3)+gu2.Columns_1_0)+gu2.Columns_1_1)+gu2.Columns_1_2)+gu2.Columns_1_3)+gu2.Columns_2_0)+gu2.Columns_2_1)+gu2.Columns_2_2)+gu2.Columns_2_3)+gu2.Columns_3_0)+gu2.Columns_3_1)+gu2.Columns_3_2)+gu2.Columns_3_3)>=3))")
[2020-05-26 13:06:41] [INFO ] Proved 128 variables to be positive in 436 ms
[2020-05-26 13:06:41] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2020-05-26 13:06:41] [INFO ] Computation of disable matrix completed :0/64 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:06:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:06:41] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2020-05-26 13:06:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:06:44] [INFO ] Computing symmetric co enabling matrix : 64 transitions.
[2020-05-26 13:06:44] [INFO ] Computation of co-enabling matrix(3/64) took 91 ms. Total solver calls (SAT/UNSAT): 34(34/0)
[2020-05-26 13:06:46] [INFO ] Computation of Finished co-enabling matrix. took 1434 ms. Total solver calls (SAT/UNSAT): 320(320/0)
[2020-05-26 13:06:46] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2020-05-26 13:06:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 13:06:46] [INFO ] Built C files in 5008ms 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]
Compilation finished in 1098 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 50 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X(<>(((LTLAP0==true))U(!( X((LTLAP1==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, --when, --ltl, [](X(<>(((LTLAP0==true))U(!( X((LTLAP1==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, --when, --ltl, [](X(<>(((LTLAP0==true))U(!( X((LTLAP1==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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 186912 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
26917 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,269.203,2986880,1,0,30,1.69529e+07,20,42,195095,1.34347e+07,115
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(G("((((((((((((((((gu1.Cells_0_0+gu1.Cells_0_1)+gu1.Cells_0_2)+gu1.Cells_0_3)+gu1.Cells_1_0)+gu1.Cells_1_1)+gu1.Cells_1_2)+gu1.Cells_1_3)+gu1.Cells_2_0)+gu1.Cells_2_1)+gu1.Cells_2_2)+gu1.Cells_2_3)+gu1.Cells_3_0)+gu1.Cells_3_1)+gu1.Cells_3_2)+gu1.Cells_3_3)>=3)")))))
Formula 1 simplified : !GFG"((((((((((((((((gu1.Cells_0_0+gu1.Cells_0_1)+gu1.Cells_0_2)+gu1.Cells_0_3)+gu1.Cells_1_0)+gu1.Cells_1_1)+gu1.Cells_1_2)+gu1.Cells_1_3)+gu1.Cells_2_0)+gu1.Cells_2_1)+gu1.Cells_2_2)+gu1.Cells_2_3)+gu1.Cells_3_0)+gu1.Cells_3_1)+gu1.Cells_3_2)+gu1.Cells_3_3)>=3)"
Computing Next relation with stutter on 186912 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
25561 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,524.81,4505832,1,0,90,2.87177e+07,17,81,1555,2.28691e+07,46
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X((G(X(X("(gu2.Columns_3_1<=gu2.Rows_0_3)"))))U(X("(gu1.Cells_2_2>=1)"))))))
Formula 2 simplified : X(GXX"(gu2.Columns_3_1<=gu2.Rows_0_3)" U X"(gu1.Cells_2_2>=1)")
Computing Next relation with stutter on 186912 deadlock states
19 unique states visited
5 strongly connected components in search stack
20 transitions explored
17 items max in DFS search stack
30800 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,832.906,5184124,1,0,90,3.2888e+07,21,81,1330,2.74258e+07,116
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((!(X("(gu2.Columns_3_2<=gu1.Cells_3_1)")))&&(F("((gu1.Cells_1_0<2)&&(gu0.Regions_1_3<=gu0.Board_0_3_1))")))))
Formula 3 simplified : !X(!X"(gu2.Columns_3_2<=gu1.Cells_3_1)" & F"((gu1.Cells_1_0<2)&&(gu0.Regions_1_3<=gu0.Board_0_3_1))")
Computing Next relation with stutter on 186912 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
17093 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,1003.83,5814328,1,0,90,3.72943e+07,19,81,1336,3.00082e+07,87
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F("(gu2.Columns_2_3<=gu0.Board_3_3_1)"))))
Formula 4 simplified : !XF"(gu2.Columns_2_3<=gu0.Board_3_3_1)"
Computing Next relation with stutter on 186912 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14428 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,1148.13,6428304,1,0,140,4.087e+07,14,112,1259,3.22322e+07,22
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("(gu0.Board_1_0_3<=gu0.Rows_3_2)")))
Formula 5 simplified : !G"(gu0.Board_1_0_3<=gu0.Rows_3_2)"
Computing Next relation with stutter on 186912 deadlock states
Detected timeout of ITS tools.
[2020-05-26 13:26:41] [INFO ] Flatten gal took : 26 ms
[2020-05-26 13:26:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-26 13:26:41] [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 2 LTL properties
Checking formula 0 : !((G("(Board_1_0_3<=Rows_3_2)")))
Formula 0 simplified : !G"(Board_1_0_3<=Rows_3_2)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 186912 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
38036 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,380.373,5207260,1,0,84,3.26465e+07,19,73,1324,2.73924e+07,143
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((G(F(X("(Board_0_3_3<=Columns_1_1)"))))U(F(G("(Columns_2_0<=Regions_0_3)"))))))
Formula 1 simplified : !G(GFX"(Board_0_3_3<=Columns_1_1)" U FG"(Columns_2_0<=Regions_0_3)")
Computing Next relation with stutter on 186912 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
50658 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,886.969,8600052,1,0,103,5.15568e+07,17,88,1256,4.64661e+07,88
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Sudoku-PT-BN04-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1590500517359

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

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-BN04 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 ;