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-159033546500322.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546500322
=====================================================================

--------------------
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 1590484595317

[2020-05-26 09:16:37] [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:16:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:16:37] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2020-05-26 09:16:37] [INFO ] Transformed 20 places.
[2020-05-26 09:16:37] [INFO ] Transformed 8 transitions.
[2020-05-26 09:16:37] [INFO ] Parsed PT model containing 20 places and 8 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 8 steps, including 2 resets, run visited all 17 properties in 1 ms. (steps per millisecond=8 )
[2020-05-26 09:16:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-26 09:16:37] [INFO ] Flatten gal took : 50 ms
FORMULA Sudoku-PT-AN02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:16:37] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:16:37] [INFO ] Applying decomposition
[2020-05-26 09:16:37] [INFO ] Flatten gal took : 4 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/graph7258855168081624687.txt, -o, /tmp/graph7258855168081624687.bin, -w, /tmp/graph7258855168081624687.weights], workingDir=null]
[2020-05-26 09:16:38] [INFO ] Input system was already deterministic with 8 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7258855168081624687.bin, -l, -1, -v, -w, /tmp/graph7258855168081624687.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:16:38] [INFO ] Decomposing Gal with order
[2020-05-26 09:16:38] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 8 rows 20 cols
[2020-05-26 09:16:38] [INFO ] Computed 12 place invariants in 3 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:38] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-26 09:16:38] [INFO ] Flatten gal took : 67 ms
[2020-05-26 09:16:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-05-26 09:16:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-26 09:16:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 :

/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 12 LTL properties
Checking formula 0 : !((X(G(X((!(G("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))&&(F(G(X((F("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))&&("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))))))))))
Formula 0 simplified : !XGX(!G"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" & FGX("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" & F"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.029087,16816,1,0,465,48,139,358,42,109,1342
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(G(((((((((((G(F("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))||(G(X(X("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))))||(X("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))||("(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))"))||("(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1))"))||("(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))"))||("(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))"))||("(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))"))||("(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1))")))))
Formula 1 simplified : !FG("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))" | "(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1))" | "(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))" | "(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))" | "(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))" | "(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))" | "(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1))" | "(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))" | GF"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" | X"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" | GXX"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")
[2020-05-26 09:16:38] [INFO ] Proved 20 variables to be positive in 213 ms
Computing Next relation with stutter on 6 deadlock states
[2020-05-26 09:16:38] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2020-05-26 09:16:38] [INFO ] Computation of disable matrix completed :0/8 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:16:38] [INFO ] Computing symmetric may enable matrix : 8 transitions.
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.075421,19156,1,0,522,48,309,426,46,109,2082
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(G(F(X("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))))))
Formula 2 simplified : XGFX"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"
Computing Next relation with stutter on 6 deadlock states
13 unique states visited
0 strongly connected components in search stack
22 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.077343,19156,1,0,601,49,312,515,46,111,2725
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(((!(F("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))U("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))&&(F("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))))
Formula 3 simplified : !X(F"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" & (!F"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" U "((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_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.078715,19156,1,0,632,49,313,533,46,111,2915
no accepting run found
[2020-05-26 09:16:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Formula 3 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((((((((((((F("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))||("(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))"))||("(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1))"))||("(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))"))||("(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))"))||("(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))"))||("(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1))"))U(F("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")))&&(G("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))))
Formula 4 simplified : !((("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))" | "(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1))" | "(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))" | "(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))" | "(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))" | "(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))" | "(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1))" | "(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))" | F"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))") U F"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))") & G"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")
Computing Next relation with stutter on 6 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.081219,19156,1,0,724,49,313,631,46,113,3308
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(X((("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")U("((((((((((u2.Rows_0_0<1)||(u7.Cells_0_1<1))||(u7.Columns_1_0<1))&&(((u2.Rows_0_0<1)||(u2.Cells_0_0<1))||(u5.Columns_0_0<1)))&&(((u0.Rows_1_0<1)||(u0.Cells_1_1<1))||(u7.Columns_1_0<1)))&&(((i3.u4.Rows_0_1<1)||(u7.Cells_0_1<1))||(i1.u6.Columns_1_1<1)))&&(((u0.Rows_1_0<1)||(u5.Cells_1_0<1))||(u5.Columns_0_0<1)))&&(((i3.u4.Rows_0_1<1)||(u2.Cells_0_0<1))||(i3.u3.Columns_0_1<1)))&&(((i1.u1.Rows_1_1<1)||(u0.Cells_1_1<1))||(i1.u6.Columns_1_1<1)))&&(((i1.u1.Rows_1_1<1)||(u5.Cells_1_0<1))||(i3.u3.Columns_0_1<1)))"))&&(G("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))))))
Formula 5 simplified : !XX(("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))" U "((((((((((u2.Rows_0_0<1)||(u7.Cells_0_1<1))||(u7.Columns_1_0<1))&&(((u2.Rows_0_0<1)||(u2.Cells_0_0<1))||(u5.Columns_0_0<1)))&&(((u0.Rows_1_0<1)||(u0.Cells_1_1<1))||(u7.Columns_1_0<1)))&&(((i3.u4.Rows_0_1<1)||(u7.Cells_0_1<1))||(i1.u6.Columns_1_1<1)))&&(((u0.Rows_1_0<1)||(u5.Cells_1_0<1))||(u5.Columns_0_0<1)))&&(((i3.u4.Rows_0_1<1)||(u2.Cells_0_0<1))||(i3.u3.Columns_0_1<1)))&&(((i1.u1.Rows_1_1<1)||(u0.Cells_1_1<1))||(i1.u6.Columns_1_1<1)))&&(((i1.u1.Rows_1_1<1)||(u5.Cells_1_0<1))||(i3.u3.Columns_0_1<1)))") & G"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))")
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.086232,19156,1,0,811,49,394,726,49,113,4136
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(!(X(F("((((((((((u2.Rows_0_0<1)||(u7.Cells_0_1<1))||(u7.Columns_1_0<1))&&(((u2.Rows_0_0<1)||(u2.Cells_0_0<1))||(u5.Columns_0_0<1)))&&(((u0.Rows_1_0<1)||(u0.Cells_1_1<1))||(u7.Columns_1_0<1)))&&(((i3.u4.Rows_0_1<1)||(u7.Cells_0_1<1))||(i1.u6.Columns_1_1<1)))&&(((u0.Rows_1_0<1)||(u5.Cells_1_0<1))||(u5.Columns_0_0<1)))&&(((i3.u4.Rows_0_1<1)||(u2.Cells_0_0<1))||(i3.u3.Columns_0_1<1)))&&(((i1.u1.Rows_1_1<1)||(u0.Cells_1_1<1))||(i1.u6.Columns_1_1<1)))&&(((i1.u1.Rows_1_1<1)||(u5.Cells_1_0<1))||(i3.u3.Columns_0_1<1)))")))))&&(F(((((((((G("((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))||("(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))"))||("(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1))"))||("(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))"))||("(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))"))||("(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))"))||("(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1))")))))
Formula 6 simplified : !(F!XF"((((((((((u2.Rows_0_0<1)||(u7.Cells_0_1<1))||(u7.Columns_1_0<1))&&(((u2.Rows_0_0<1)||(u2.Cells_0_0<1))||(u5.Columns_0_0<1)))&&(((u0.Rows_1_0<1)||(u0.Cells_1_1<1))||(u7.Columns_1_0<1)))&&(((i3.u4.Rows_0_1<1)||(u7.Cells_0_1<1))||(i1.u6.Columns_1_1<1)))&&(((u0.Rows_1_0<1)||(u5.Cells_1_0<1))||(u5.Columns_0_0<1)))&&(((i3.u4.Rows_0_1<1)||(u2.Cells_0_0<1))||(i3.u3.Columns_0_1<1)))&&(((i1.u1.Rows_1_1<1)||(u0.Cells_1_1<1))||(i1.u6.Columns_1_1<1)))&&(((i1.u1.Rows_1_1<1)||(u5.Cells_1_0<1))||(i3.u3.Columns_0_1<1)))" & F("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))" | "(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1))" | "(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))" | "(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))" | "(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))" | "(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))" | "(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1))" | "(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))" | G"((((((((((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))||(((u2.Rows_0_0>=1)&&(u2.Cells_0_0>=1))&&(u5.Columns_0_0>=1)))||(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1)))||(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1)))||(((i1.u1.Rows_1_1>=1)&&(u5.Cells_1_0>=1))&&(i3.u3.Columns_0_1>=1)))"))
Computing Next relation with stutter on 6 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.096054,19156,1,0,919,49,412,883,49,113,4691
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F((G(!(F(G(X("(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))"))))))||("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))")))))
Formula 7 simplified : !XF("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))" | G!FGX"(((u0.Rows_1_0>=1)&&(u0.Cells_1_1>=1))&&(u7.Columns_1_0>=1))")
Computing Next relation with stutter on 6 deadlock states
8 unique states visited
0 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.09775,19156,1,0,1008,51,450,1022,49,116,5102
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(G(X(("(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))")U((((G("(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))"))&&("(i3.u4.Rows_0_1>=1)"))&&("(u2.Cells_0_0>=1)"))&&("(i3.u3.Columns_0_1>=1)"))))))))
Formula 8 simplified : !GFGX("(((i3.u4.Rows_0_1>=1)&&(u2.Cells_0_0>=1))&&(i3.u3.Columns_0_1>=1))" U ("(i3.u3.Columns_0_1>=1)" & "(i3.u4.Rows_0_1>=1)" & "(u2.Cells_0_0>=1)" & G"(((i3.u4.Rows_0_1>=1)&&(u7.Cells_0_1>=1))&&(i1.u6.Columns_1_1>=1))"))
Computing Next relation with stutter on 6 deadlock states
6 unique states visited
5 strongly connected components in search stack
7 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.100995,19156,1,0,1094,52,480,1153,49,118,5644
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((G(!(("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))")U("(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))"))))||(G(X("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))"))))))
Formula 9 simplified : !X(G!("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))" U "(((u0.Rows_1_0>=1)&&(u5.Cells_1_0>=1))&&(u5.Columns_0_0>=1))") | GX"(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))")
Computing Next relation with stutter on 6 deadlock states
11 unique states visited
5 strongly connected components in search stack
14 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.104128,19156,1,0,1171,52,544,1284,49,118,6366
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F("((((u2.Rows_0_0<1)||(u2.Cells_0_0<1))||(u5.Columns_0_0<1))||(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1)))"))))
Formula 10 simplified : !XF"((((u2.Rows_0_0<1)||(u2.Cells_0_0<1))||(u5.Columns_0_0<1))||(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=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.105576,19360,1,0,1201,52,561,1334,49,120,6559
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G((F("(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))"))||("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))"))))
Formula 11 simplified : !G("(((i1.u1.Rows_1_1>=1)&&(u0.Cells_1_1>=1))&&(i1.u6.Columns_1_1>=1))" | F"(((u2.Rows_0_0>=1)&&(u7.Cells_0_1>=1))&&(u7.Columns_1_0>=1))")
Computing Next relation with stutter on 6 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.106522,19360,1,0,1218,52,578,1353,49,120,6644
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Sudoku-PT-AN02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-26 09:16:38] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-26 09:16:38] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-26 09:16:38] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 0) 1) (>= (select s0 12) 1)) (>= (select s0 16) 1)) (= (store (store (store (store s0 16 (- (select s0 16) 1)) 0 (- (select s0 0) 1)) 4 (+ (select s0 4) 1)) 12 (- (select s0 12) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (and (>= (select s0 0) 1) (>= (select s0 12) 1)) (>= (select s0 16) 1)) (= (store (store (store (store s0 16 (- (select s0 16) 1)) 0 (- (select s0 0) 1)) 4 (+ (select s0 4) 1)) 12 (- (select s0 12) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
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:38] [INFO ] Built C files in 356ms 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 1590484598730

--------------------
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-PT-AN02"
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-PT-AN02, 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-159033546500322"
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 [ "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 ;