About the Execution of ITS-Tools for Sudoku-PT-AN03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 443.184 | 13858.00 | 23741.00 | 298.10 | TTTFTTFFFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746200573.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746200573
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 50K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 21K May 5 16:52 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 1621232271497
Running Version 0
[2021-05-17 06:17:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 06:17:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:17:53] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-17 06:17:53] [INFO ] Transformed 54 places.
[2021-05-17 06:17:53] [INFO ] Transformed 27 transitions.
[2021-05-17 06:17:53] [INFO ] Parsed PT model containing 54 places and 27 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:17:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA Sudoku-PT-AN03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 33 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:53] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-17 06:17:53] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:53] [INFO ] Computed 8 place invariants in 10 ms
[2021-05-17 06:17:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:53] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-17 06:17:54] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
[2021-05-17 06:17:54] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 06:17:54] [INFO ] Flatten gal took : 30 ms
FORMULA Sudoku-PT-AN03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:17:54] [INFO ] Flatten gal took : 8 ms
[2021-05-17 06:17:54] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 8 steps, including 1 resets, run visited all 12 properties in 2 ms. (steps per millisecond=4 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:54] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-17 06:17:54] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:54] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 06:17:54] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:17:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 27 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-17 06:17:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:17:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
[2021-05-17 06:17:56] [INFO ] Flatten gal took : 4 ms
[2021-05-17 06:17:56] [INFO ] Flatten gal took : 13 ms
[2021-05-17 06:17:56] [INFO ] Time to serialize gal into /tmp/LTL8579799395058779325.gal : 1 ms
[2021-05-17 06:17:56] [INFO ] Time to serialize properties into /tmp/LTL2177569286269038324.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8579799395058779325.gal, -t, CGAL, -LTL, /tmp/LTL2177569286269038324.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8579799395058779325.gal -t CGAL -LTL /tmp/LTL2177569286269038324.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((((((((((((((((((((Rows_2_2>=1)&&(Cells_2_1>=1))&&(Columns_1_2>=1))||(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_0>=1))&&(Columns_0_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_2>=1))&&(Columns_2_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_2>=1))&&(Columns_2_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_2>=1))&&(Columns_2_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_1>=1))&&(Columns_1_2>=1)))||(((Rows_2_2>=1)&&(Cells_2_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_2>=1)&&(Cells_1_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_2>=1))&&(Columns_2_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_2>=1))&&(Columns_2_1>=1)))||(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_1>=1)&&(Cells_2_0>=1))&&(Columns_0_1>=1)))||(((Rows_0_2>=1)&&(Cells_0_1>=1))&&(Columns_1_2>=1)))||(((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_0>=1)&&(Cells_0_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1)))||(((Rows_2_2>=1)&&(Cells_2_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_0>=1)&&(Cells_2_1>=1))&&(Columns_1_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1)))"))))
Formula 0 simplified : !XF"(((((((((((((((((((((((((((((Rows_2_2>=1)&&(Cells_2_1>=1))&&(Columns_1_2>=1))||(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_0>=1))&&(Columns_0_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_2>=1))&&(Columns_2_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_2>=1))&&(Columns_2_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_2>=1))&&(Columns_2_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_1>=1))&&(Columns_1_2>=1)))||(((Rows_2_2>=1)&&(Cells_2_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_2>=1)&&(Cells_1_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_2>=1))&&(Columns_2_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_2>=1))&&(Columns_2_1>=1)))||(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_1>=1)&&(Cells_2_0>=1))&&(Columns_0_1>=1)))||(((Rows_0_2>=1)&&(Cells_0_1>=1))&&(Columns_1_2>=1)))||(((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_0>=1)&&(Cells_0_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1)))||(((Rows_2_2>=1)&&(Cells_2_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_0>=1)&&(Cells_2_1>=1))&&(Columns_1_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/27/27
Computing Next relation with stutter on 136 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
46 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.482188,33068,1,0,91,120096,75,31,838,91304,64
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN03-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-PT-AN03-01 finished in 2916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&G(F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:17:57] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:17:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:17:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, true, true, (NOT p0), p0, p0]
Running random walk in product with property : Sudoku-PT-AN03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11751 reset in 309 ms.
Product exploration explored 100000 steps with 11758 reset in 329 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 143 ms :[true, true, true, (NOT p0), p0, p0]
Product exploration explored 100000 steps with 11742 reset in 277 ms.
Product exploration explored 100000 steps with 11746 reset in 259 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[true, true, true, (NOT p0), p0, p0]
Support contains 27 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-17 06:17:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:17:59] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 06:17:59] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Product exploration explored 100000 steps with 11733 reset in 311 ms.
Product exploration explored 100000 steps with 11756 reset in 274 ms.
[2021-05-17 06:17:59] [INFO ] Flatten gal took : 3 ms
[2021-05-17 06:17:59] [INFO ] Flatten gal took : 3 ms
[2021-05-17 06:17:59] [INFO ] Time to serialize gal into /tmp/LTL1928328566247815972.gal : 12 ms
[2021-05-17 06:17:59] [INFO ] Time to serialize properties into /tmp/LTL6016521011259183995.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1928328566247815972.gal, -t, CGAL, -LTL, /tmp/LTL6016521011259183995.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1928328566247815972.gal -t CGAL -LTL /tmp/LTL6016521011259183995.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((((((((((((((((((((((((((((Rows_2_2>=1)&&(Cells_2_1>=1))&&(Columns_1_2>=1))||(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_0>=1))&&(Columns_0_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_2>=1))&&(Columns_2_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_2>=1))&&(Columns_2_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_2>=1))&&(Columns_2_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_1>=1))&&(Columns_1_2>=1)))||(((Rows_2_2>=1)&&(Cells_2_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_2>=1)&&(Cells_1_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_2>=1))&&(Columns_2_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_2>=1))&&(Columns_2_1>=1)))||(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_1>=1)&&(Cells_2_0>=1))&&(Columns_0_1>=1)))||(((Rows_0_2>=1)&&(Cells_0_1>=1))&&(Columns_1_2>=1)))||(((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_0>=1)&&(Cells_0_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1)))||(((Rows_2_2>=1)&&(Cells_2_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_0>=1)&&(Cells_2_1>=1))&&(Columns_1_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1)))"))&&(G(F("(((((((((((((((((((((((((((((Rows_2_2<1)||(Cells_2_1<1))||(Columns_1_2<1))&&(((Rows_0_0<1)||(Cells_0_0<1))||(Columns_0_0<1)))&&(((Rows_0_2<1)||(Cells_0_0<1))||(Columns_0_2<1)))&&(((Rows_1_1<1)||(Cells_1_0<1))||(Columns_0_1<1)))&&(((Rows_2_0<1)||(Cells_2_2<1))||(Columns_2_0<1)))&&(((Rows_0_1<1)||(Cells_0_2<1))||(Columns_2_1<1)))&&(((Rows_1_1<1)||(Cells_1_2<1))||(Columns_2_1<1)))&&(((Rows_2_0<1)||(Cells_2_0<1))||(Columns_0_0<1)))&&(((Rows_0_1<1)||(Cells_0_1<1))||(Columns_1_1<1)))&&(((Rows_1_0<1)||(Cells_1_2<1))||(Columns_2_0<1)))&&(((Rows_1_2<1)||(Cells_1_1<1))||(Columns_1_2<1)))&&(((Rows_2_2<1)||(Cells_2_2<1))||(Columns_2_2<1)))&&(((Rows_1_2<1)||(Cells_1_0<1))||(Columns_0_2<1)))&&(((Rows_2_1<1)||(Cells_2_1<1))||(Columns_1_1<1)))&&(((Rows_1_0<1)||(Cells_1_1<1))||(Columns_1_0<1)))&&(((Rows_0_2<1)||(Cells_0_2<1))||(Columns_2_2<1)))&&(((Rows_2_1<1)||(Cells_2_2<1))||(Columns_2_1<1)))&&(((Rows_0_1<1)||(Cells_0_0<1))||(Columns_0_1<1)))&&(((Rows_2_1<1)||(Cells_2_0<1))||(Columns_0_1<1)))&&(((Rows_0_2<1)||(Cells_0_1<1))||(Columns_1_2<1)))&&(((Rows_0_0<1)||(Cells_0_1<1))||(Columns_1_0<1)))&&(((Rows_0_0<1)||(Cells_0_2<1))||(Columns_2_0<1)))&&(((Rows_1_0<1)||(Cells_1_0<1))||(Columns_0_0<1)))&&(((Rows_2_2<1)||(Cells_2_0<1))||(Columns_0_2<1)))&&(((Rows_2_0<1)||(Cells_2_1<1))||(Columns_1_0<1)))&&(((Rows_1_2<1)||(Cells_1_2<1))||(Columns_2_2<1)))&&(((Rows_1_1<1)||(Cells_1_1<1))||(Columns_1_1<1)))")))))))
Formula 0 simplified : !XX(F"(((((((((((((((((((((((((((((Rows_2_2>=1)&&(Cells_2_1>=1))&&(Columns_1_2>=1))||(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_0>=1))&&(Columns_0_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_2>=1))&&(Columns_2_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_2>=1))&&(Columns_2_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_2>=1))&&(Columns_2_1>=1)))||(((Rows_2_0>=1)&&(Cells_2_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_1>=1))&&(Columns_1_2>=1)))||(((Rows_2_2>=1)&&(Cells_2_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_2>=1)&&(Cells_1_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_2>=1)&&(Cells_0_2>=1))&&(Columns_2_2>=1)))||(((Rows_2_1>=1)&&(Cells_2_2>=1))&&(Columns_2_1>=1)))||(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1)))||(((Rows_2_1>=1)&&(Cells_2_0>=1))&&(Columns_0_1>=1)))||(((Rows_0_2>=1)&&(Cells_0_1>=1))&&(Columns_1_2>=1)))||(((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_0>=1)&&(Cells_0_2>=1))&&(Columns_2_0>=1)))||(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1)))||(((Rows_2_2>=1)&&(Cells_2_0>=1))&&(Columns_0_2>=1)))||(((Rows_2_0>=1)&&(Cells_2_1>=1))&&(Columns_1_0>=1)))||(((Rows_1_2>=1)&&(Cells_1_2>=1))&&(Columns_2_2>=1)))||(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1)))" & GF"(((((((((((((((((((((((((((((Rows_2_2<1)||(Cells_2_1<1))||(Columns_1_2<1))&&(((Rows_0_0<1)||(Cells_0_0<1))||(Columns_0_0<1)))&&(((Rows_0_2<1)||(Cells_0_0<1))||(Columns_0_2<1)))&&(((Rows_1_1<1)||(Cells_1_0<1))||(Columns_0_1<1)))&&(((Rows_2_0<1)||(Cells_2_2<1))||(Columns_2_0<1)))&&(((Rows_0_1<1)||(Cells_0_2<1))||(Columns_2_1<1)))&&(((Rows_1_1<1)||(Cells_1_2<1))||(Columns_2_1<1)))&&(((Rows_2_0<1)||(Cells_2_0<1))||(Columns_0_0<1)))&&(((Rows_0_1<1)||(Cells_0_1<1))||(Columns_1_1<1)))&&(((Rows_1_0<1)||(Cells_1_2<1))||(Columns_2_0<1)))&&(((Rows_1_2<1)||(Cells_1_1<1))||(Columns_1_2<1)))&&(((Rows_2_2<1)||(Cells_2_2<1))||(Columns_2_2<1)))&&(((Rows_1_2<1)||(Cells_1_0<1))||(Columns_0_2<1)))&&(((Rows_2_1<1)||(Cells_2_1<1))||(Columns_1_1<1)))&&(((Rows_1_0<1)||(Cells_1_1<1))||(Columns_1_0<1)))&&(((Rows_0_2<1)||(Cells_0_2<1))||(Columns_2_2<1)))&&(((Rows_2_1<1)||(Cells_2_2<1))||(Columns_2_1<1)))&&(((Rows_0_1<1)||(Cells_0_0<1))||(Columns_0_1<1)))&&(((Rows_2_1<1)||(Cells_2_0<1))||(Columns_0_1<1)))&&(((Rows_0_2<1)||(Cells_0_1<1))||(Columns_1_2<1)))&&(((Rows_0_0<1)||(Cells_0_1<1))||(Columns_1_0<1)))&&(((Rows_0_0<1)||(Cells_0_2<1))||(Columns_2_0<1)))&&(((Rows_1_0<1)||(Cells_1_0<1))||(Columns_0_0<1)))&&(((Rows_2_2<1)||(Cells_2_0<1))||(Columns_0_2<1)))&&(((Rows_2_0<1)||(Cells_2_1<1))||(Columns_1_0<1)))&&(((Rows_1_2<1)||(Cells_1_2<1))||(Columns_2_2<1)))&&(((Rows_1_1<1)||(Cells_1_1<1))||(Columns_1_1<1)))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/27/27
Computing Next relation with stutter on 136 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
10 items max in DFS search stack
150 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,1.51222,64524,1,0,122,243849,80,72,919,280964,194
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-PT-AN03-02 finished in 4360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 41 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:01] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 06:18:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:01] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN03-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1))), p1:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)) (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-03 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:01] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:01] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:01] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 68 ms :[false, (NOT p0), false]
Running random walk in product with property : Sudoku-PT-AN03-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-07 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 06:18:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)), p1:(AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-08 finished in 189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 3 reset in 1 ms.
FORMULA Sudoku-PT-AN03-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-09 finished in 167 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-17 06:18:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 06:18:02] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-10 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((F(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2021-05-17 06:18:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN03-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)), p1:(AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)), p2:(OR (LT s1 1) (LT s9 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-11 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:02] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-17 06:18:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:02] [INFO ] Computed 8 place invariants in 15 ms
[2021-05-17 06:18:03] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN03-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11750 reset in 211 ms.
Product exploration explored 100000 steps with 11739 reset in 227 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Sudoku-PT-AN03-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-PT-AN03-13 finished in 639 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||(F(p1) U (X(!p0)&&p2))))], workingDir=/home/mcc/execution]
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:03] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 186 ms :[p0, (NOT p1), (OR (NOT p2) p0), p0, (AND (NOT p1) p0 p2), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-PT-AN03-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s9 1) (LT s19 1)), p2:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)), p1:(AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 6 reset in 0 ms.
FORMULA Sudoku-PT-AN03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-14 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:03] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-17 06:18:03] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:03] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 06:18:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-17 06:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 06:18:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-15 finished in 133 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621232285355
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 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 r254-tall-162106746200573"
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 [ "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 '
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 ;