Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545600315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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-AN15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 554K Apr 30 12:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 30 12:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Apr 30 11:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M Apr 30 11:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 547K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.8M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 118K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 286K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.9M May 10 09:34 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-AN15-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653115022584

Running Version 202205111006
[2022-05-21 06:37:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2022-05-21 06:37:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:37:04] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2022-05-21 06:37:04] [INFO ] Transformed 4050 places.
[2022-05-21 06:37:04] [INFO ] Transformed 3375 transitions.
[2022-05-21 06:37:04] [INFO ] Parsed PT model containing 4050 places and 3375 transitions in 379 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 509 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN15-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 41 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:37:04] [INFO ] Computed 675 place invariants in 55 ms
[2022-05-21 06:37:05] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:37:05] [INFO ] Computed 675 place invariants in 24 ms
[2022-05-21 06:37:07] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 2700 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:37:07] [INFO ] Computed 675 place invariants in 34 ms
[2022-05-21 06:37:09] [INFO ] Dead Transitions using invariants and state equation in 2084 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2022-05-21 06:37:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 06:37:10] [INFO ] Flatten gal took : 339 ms
FORMULA Sudoku-PT-AN15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 06:37:10] [INFO ] Flatten gal took : 215 ms
[2022-05-21 06:37:11] [INFO ] Input system was already deterministic with 3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 5028 ms. (steps per millisecond=1 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:37:19] [INFO ] Computed 675 place invariants in 16 ms
[2022-05-21 06:37:21] [INFO ] [Real]Absence check using 675 positive place invariants in 202 ms returned sat
[2022-05-21 06:37:45] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-21 06:37:46] [INFO ] [Nat]Absence check using 675 positive place invariants in 193 ms returned sat
[2022-05-21 06:38:10] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 57 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4050/4050 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 4215 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Probabilistic random walk after 138567 steps, saw 138520 distinct states, run finished after 21145 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:38:38] [INFO ] Computed 675 place invariants in 11 ms
[2022-05-21 06:38:40] [INFO ] [Real]Absence check using 675 positive place invariants in 193 ms returned sat
[2022-05-21 06:39:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 06:39:04] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 44 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 36 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:39:04] [INFO ] Computed 675 place invariants in 12 ms
[2022-05-21 06:39:05] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:39:05] [INFO ] Computed 675 place invariants in 31 ms
[2022-05-21 06:39:06] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2022-05-21 06:39:06] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:39:06] [INFO ] Computed 675 place invariants in 17 ms
[2022-05-21 06:39:08] [INFO ] Dead Transitions using invariants and state equation in 2101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4050/4050 places, 3375/3375 transitions.
FORMULA Sudoku-PT-AN15-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(F(p0)) U (X(p2)||p1)))))'
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.30 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 110 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:39:08] [INFO ] Computed 44 place invariants in 187 ms
[2022-05-21 06:39:08] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:39:09] [INFO ] Computed 44 place invariants in 160 ms
[2022-05-21 06:39:09] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2022-05-21 06:39:10] [INFO ] Redundant transitions in 111 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:39:10] [INFO ] Computed 44 place invariants in 75 ms
[2022-05-21 06:39:11] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 49440 steps with 249 reset in 10001 ms.
Product exploration timeout after 49510 steps with 249 reset in 10003 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 1913 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 344709 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 344709 steps, saw 344465 distinct states, run finished after 6005 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:39:40] [INFO ] Computed 44 place invariants in 69 ms
[2022-05-21 06:39:41] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 06:39:41] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 46 ms returned sat
[2022-05-21 06:39:41] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-02 finished in 32836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(((p0 U p1) U X(G(p2))))))||F(p1)))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 162 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:39:41] [INFO ] Computed 675 place invariants in 16 ms
[2022-05-21 06:39:42] [INFO ] Implicit Places using invariants in 875 ms returned []
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:39:42] [INFO ] Computed 675 place invariants in 14 ms
[2022-05-21 06:39:43] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2022-05-21 06:39:43] [INFO ] Redundant transitions in 135 ms returned []
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:39:43] [INFO ] Computed 675 place invariants in 17 ms
[2022-05-21 06:39:45] [INFO ] Dead Transitions using invariants and state equation in 1941 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (LEQ (ADD s3825 s3826 s3827 s3828 s3829 s3830 s3831 s3832 s3833 s3834 s3835 s3836 s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 19910 steps with 174 reset in 10003 ms.
Product exploration timeout after 18830 steps with 165 reset in 10007 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND p2 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 465 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2747 ms. (steps per millisecond=3 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:40:11] [INFO ] Computed 675 place invariants in 12 ms
[2022-05-21 06:40:12] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 06:40:12] [INFO ] [Nat]Absence check using 675 positive place invariants in 193 ms returned sat
[2022-05-21 06:40:12] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-03 finished in 31542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(G(p0)))||(F(p1) U !p0)))))'
Support contains 450 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 55 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:13] [INFO ] Computed 44 place invariants in 66 ms
[2022-05-21 06:40:13] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:13] [INFO ] Computed 44 place invariants in 69 ms
[2022-05-21 06:40:18] [INFO ] Implicit Places using invariants and state equation in 5244 ms returned []
Implicit Place search using SMT with State Equation took 5615 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:18] [INFO ] Computed 44 place invariants in 67 ms
[2022-05-21 06:40:19] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 97 ms :[false, false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 48410 steps with 244 reset in 10002 ms.
Product exploration timeout after 47930 steps with 241 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2390 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Probabilistic random walk after 130470 steps, saw 130423 distinct states, run finished after 6042 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:49] [INFO ] Computed 44 place invariants in 70 ms
[2022-05-21 06:40:49] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 06:40:50] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 41 ms returned sat
[2022-05-21 06:40:53] [INFO ] After 3080ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-21 06:40:53] [INFO ] After 3216ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-21 06:40:53] [INFO ] After 3447ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 224 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 26 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-04 finished in 40603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G((G(G(p1))||G(p2)))||!p0))))'
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.5 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 57 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:53] [INFO ] Computed 44 place invariants in 66 ms
[2022-05-21 06:40:53] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:53] [INFO ] Computed 44 place invariants in 69 ms
[2022-05-21 06:40:54] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2022-05-21 06:40:54] [INFO ] Redundant transitions in 141 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:40:54] [INFO ] Computed 44 place invariants in 70 ms
[2022-05-21 06:40:56] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 554 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 46 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-05 finished in 3150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0)||p1)) U X(p1))||G(p2)))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 18 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:40:56] [INFO ] Computed 675 place invariants in 14 ms
[2022-05-21 06:40:57] [INFO ] Implicit Places using invariants in 631 ms returned []
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:40:57] [INFO ] Computed 675 place invariants in 9 ms
[2022-05-21 06:40:58] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 4050 cols
[2022-05-21 06:40:58] [INFO ] Computed 675 place invariants in 13 ms
[2022-05-21 06:41:00] [INFO ] Dead Transitions using invariants and state equation in 1944 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 30890 steps with 15445 reset in 10002 ms.
Product exploration timeout after 30070 steps with 15035 reset in 10003 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND p1 p0 (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-07 finished in 24983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(X(X(p0)))))&&F(p1))))'
Support contains 3 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 94 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:41:21] [INFO ] Computed 44 place invariants in 165 ms
[2022-05-21 06:41:22] [INFO ] Implicit Places using invariants in 833 ms returned []
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:41:22] [INFO ] Computed 44 place invariants in 138 ms
[2022-05-21 06:41:26] [INFO ] Implicit Places using invariants and state equation in 3858 ms returned []
Implicit Place search using SMT with State Equation took 4703 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:41:26] [INFO ] Computed 44 place invariants in 165 ms
[2022-05-21 06:41:27] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s77 s225), p0:(GT 2 s224)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1475 steps with 9 reset in 320 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-08 finished in 6621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 662 are kept as prefixes of interest. Removing 3388 places using SCC suffix rule.10 ms
Discarding 3388 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 188 ms. Remains 662 /4050 variables (removed 3388) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 662 cols
[2022-05-21 06:41:28] [INFO ] Computed 36 place invariants in 115 ms
[2022-05-21 06:41:29] [INFO ] Implicit Places using invariants in 738 ms returned []
// Phase 1: matrix 3375 rows 662 cols
[2022-05-21 06:41:29] [INFO ] Computed 36 place invariants in 119 ms
[2022-05-21 06:41:34] [INFO ] Implicit Places using invariants and state equation in 4934 ms returned []
Implicit Place search using SMT with State Equation took 5673 ms to find 0 implicit places.
[2022-05-21 06:41:34] [INFO ] Redundant transitions in 168 ms returned []
// Phase 1: matrix 3375 rows 662 cols
[2022-05-21 06:41:34] [INFO ] Computed 36 place invariants in 111 ms
[2022-05-21 06:41:35] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 662/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 662/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s225 s322)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 38 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-12 finished in 7189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(!(F(X(X(p0))) U p1)))))'
Support contains 1 out of 4050 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 105 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:41:35] [INFO ] Computed 44 place invariants in 76 ms
[2022-05-21 06:41:36] [INFO ] Implicit Places using invariants in 775 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:41:36] [INFO ] Computed 44 place invariants in 65 ms
[2022-05-21 06:41:40] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 4963 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:41:40] [INFO ] Computed 44 place invariants in 68 ms
[2022-05-21 06:41:41] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, p1, p1]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 s441)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 54660 steps with 275 reset in 10001 ms.
Product exploration timeout after 54010 steps with 272 reset in 10004 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 1876 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Probabilistic random walk after 218370 steps, saw 218289 distinct states, run finished after 3006 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:42:07] [INFO ] Computed 44 place invariants in 71 ms
[2022-05-21 06:42:07] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 44 ms returned sat
[2022-05-21 06:42:08] [INFO ] After 970ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (G (NOT p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-13 finished in 33418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))&&p1)))'
Support contains 4 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 93 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:42:09] [INFO ] Computed 44 place invariants in 161 ms
[2022-05-21 06:42:09] [INFO ] Implicit Places using invariants in 876 ms returned []
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:42:09] [INFO ] Computed 44 place invariants in 125 ms
[2022-05-21 06:42:13] [INFO ] Implicit Places using invariants and state equation in 3406 ms returned []
Implicit Place search using SMT with State Equation took 4286 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:42:13] [INFO ] Computed 44 place invariants in 130 ms
[2022-05-21 06:42:14] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT s210 s530), p1:(LEQ s225 s419)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 321 steps with 1 reset in 75 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-14 finished in 5839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U (p1 U p2))&&(p3 U p0))))'
Support contains 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 676 are kept as prefixes of interest. Removing 3374 places using SCC suffix rule.5 ms
Discarding 3374 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 112 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:42:14] [INFO ] Computed 44 place invariants in 119 ms
[2022-05-21 06:42:15] [INFO ] Implicit Places using invariants in 804 ms returned []
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:42:15] [INFO ] Computed 44 place invariants in 105 ms
[2022-05-21 06:42:19] [INFO ] Implicit Places using invariants and state equation in 3987 ms returned []
Implicit Place search using SMT with State Equation took 4795 ms to find 0 implicit places.
[2022-05-21 06:42:19] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 3375 rows 676 cols
[2022-05-21 06:42:19] [INFO ] Computed 44 place invariants in 100 ms
[2022-05-21 06:42:20] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) p3), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s406), p3:(OR (LEQ s225 s90) (LEQ 3 s406)), p2:(LEQ s478 s304), p1:(LEQ s225 s90)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 43 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-15 finished in 6345 ms.
All properties solved by simple procedures.
Total runtime 317371 ms.

BK_STOP 1653115341426

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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-AN15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-AN15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545600315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN15.tgz
mv Sudoku-PT-AN15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;