Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706500251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-PT-AN12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706500251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 1.1M Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.9M Feb 26 08:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 453K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 754K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 984K Feb 26 09:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 963K Mar 5 18:23 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-AN12-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679221069126

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 10:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 10:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:17:50] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2023-03-19 10:17:50] [INFO ] Transformed 2160 places.
[2023-03-19 10:17:50] [INFO ] Transformed 1728 transitions.
[2023-03-19 10:17:50] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 188 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 60 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 10:17:51] [INFO ] Computed 432 place invariants in 39 ms
[2023-03-19 10:17:52] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-19 10:17:52] [INFO ] Invariant cache hit.
[2023-03-19 10:17:54] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2023-03-19 10:17:54] [INFO ] Invariant cache hit.
[2023-03-19 10:17:55] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3313 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2023-03-19 10:17:55] [INFO ] Flatten gal took : 213 ms
[2023-03-19 10:17:55] [INFO ] Flatten gal took : 151 ms
[2023-03-19 10:17:56] [INFO ] Input system was already deterministic with 1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2344 ms. (steps per millisecond=4 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 10:17:59] [INFO ] Invariant cache hit.
[2023-03-19 10:18:01] [INFO ] [Real]Absence check using 432 positive place invariants in 125 ms returned sat
[2023-03-19 10:18:01] [INFO ] After 1315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:18:02] [INFO ] [Nat]Absence check using 432 positive place invariants in 117 ms returned sat
[2023-03-19 10:18:10] [INFO ] After 3342ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-19 10:18:11] [INFO ] After 3744ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-19 10:18:11] [INFO ] After 9620ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 15 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G(p1)))||((p0||G(p1))&&G((G(!p0) U !p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 90 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:18:11] [INFO ] Invariant cache hit.
[2023-03-19 10:18:12] [INFO ] Implicit Places using invariants in 817 ms returned []
[2023-03-19 10:18:12] [INFO ] Invariant cache hit.
[2023-03-19 10:18:14] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 3020 ms to find 0 implicit places.
[2023-03-19 10:18:14] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-19 10:18:14] [INFO ] Invariant cache hit.
[2023-03-19 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4295 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), false, p0, (AND (NOT p1) p0), p1, p1]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 (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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-00 finished in 4828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 23 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:18:16] [INFO ] Invariant cache hit.
[2023-03-19 10:18:17] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-19 10:18:17] [INFO ] Invariant cache hit.
[2023-03-19 10:18:19] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2023-03-19 10:18:19] [INFO ] Invariant cache hit.
[2023-03-19 10:18:20] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3969 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 3}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p1:(LEQ 3 (ADD s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 30670 steps with 6134 reset in 10003 ms.
Product exploration timeout after 31560 steps with 6312 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1542 ms. (steps per millisecond=6 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 10:21:09] [INFO ] Invariant cache hit.
[2023-03-19 10:21:10] [INFO ] [Real]Absence check using 432 positive place invariants in 120 ms returned sat
[2023-03-19 10:21:13] [INFO ] After 3343ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 10:21:14] [INFO ] [Nat]Absence check using 432 positive place invariants in 102 ms returned sat
[2023-03-19 10:21:16] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 10:21:16] [INFO ] After 1453ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-19 10:21:16] [INFO ] After 3056ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 13 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:21:17] [INFO ] Invariant cache hit.
[2023-03-19 10:21:18] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-19 10:21:18] [INFO ] Invariant cache hit.
[2023-03-19 10:21:20] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
[2023-03-19 10:21:20] [INFO ] Invariant cache hit.
[2023-03-19 10:21:21] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3820 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1189 ms. (steps per millisecond=8 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-03-19 10:21:42] [INFO ] Invariant cache hit.
[2023-03-19 10:21:42] [INFO ] [Real]Absence check using 432 positive place invariants in 126 ms returned sat
[2023-03-19 10:21:43] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:21:44] [INFO ] [Nat]Absence check using 432 positive place invariants in 107 ms returned sat
[2023-03-19 10:22:08] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.7 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 77 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1166 ms. (steps per millisecond=8 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 211392 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211392 steps, saw 163965 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2023-03-19 10:22:13] [INFO ] Computed 35 place invariants in 104 ms
[2023-03-19 10:22:13] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 29 ms returned sat
[2023-03-19 10:22:13] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:22:14] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2023-03-19 10:22:14] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:22:14] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 10:22:14] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 35090 steps with 7018 reset in 10001 ms.
Product exploration timeout after 34630 steps with 6926 reset in 10003 ms.
Applying partial POR strategy [true, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 172 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:22:36] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 10:22:36] [INFO ] Computed 432 place invariants in 14 ms
[2023-03-19 10:22:37] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1359 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:22:37] [INFO ] Invariant cache hit.
[2023-03-19 10:22:38] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-19 10:22:38] [INFO ] Invariant cache hit.
[2023-03-19 10:22:40] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 2831 ms to find 0 implicit places.
[2023-03-19 10:22:40] [INFO ] Invariant cache hit.
[2023-03-19 10:22:41] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3841 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-PT-AN12-LTLCardinality-01 finished in 265382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X(((X(p0)&&F(p1))||X(G(p0)))))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 19 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:22:41] [INFO ] Invariant cache hit.
[2023-03-19 10:22:42] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-19 10:22:42] [INFO ] Invariant cache hit.
[2023-03-19 10:22:44] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2913 ms to find 0 implicit places.
[2023-03-19 10:22:44] [INFO ] Invariant cache hit.
[2023-03-19 10:22:45] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3959 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 1280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(NOT p0), acceptance={} source=9 dest: 13}, { cond=p0, acceptance={} source=9 dest: 14}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}], [{ cond=true, acceptance={} source=12 dest: 15}], [{ cond=true, acceptance={} source=13 dest: 16}], [{ cond=(NOT p0), acceptance={} source=14 dest: 17}, { cond=p0, acceptance={} source=14 dest: 18}], [{ cond=true, acceptance={} source=15 dest: 19}, { cond=(NOT p1), acceptance={} source=15 dest: 20}], [{ cond=true, acceptance={} source=16 dest: 21}, { cond=(NOT p1), acceptance={} source=16 dest: 22}], [{ cond=true, acceptance={} source=17 dest: 23}, { cond=(NOT p1), acceptance={} source=17 dest: 24}], [{ cond=(NOT p0), acceptance={} source=18 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=18 dest: 26}, { cond=p0, acceptance={} source=18 dest: 27}, { cond=(AND p0 (NOT p1)), acceptance={} source=18 dest: 28}], [{ cond=(NOT p0), acceptance={} source=19 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=19 dest: 7}], [{ cond=(NOT p1), acceptance={} source=20 dest: 7}], [{ cond=(NOT p0), acceptance={} source=21 dest: 19}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=21 dest: 20}], [{ cond=(NOT p1), acceptance={} source=22 dest: 20}], [{ cond=(NOT p0), acceptance={} source=23 dest: 21}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 22}], [{ cond=(NOT p1), acceptance={} source=24 dest: 22}], [{ cond=(NOT p0), acceptance={} source=25 dest: 23}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=25 dest: 24}], [{ cond=(NOT p1), acceptance={} source=26 dest: 24}], [{ cond=(NOT p0), acceptance={} source=27 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=27 dest: 26}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=28 dest: 26}, { cond=(AND p0 (NOT p1)), acceptance={} source=28 dest: 28}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 33720 steps with 856 reset in 10002 ms.
Product exploration timeout after 33350 steps with 839 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 29 states, 47 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 387 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-19 10:25:30] [INFO ] Invariant cache hit.
[2023-03-19 10:25:43] [INFO ] [Real]Absence check using 432 positive place invariants in 212 ms returned sat
[2023-03-19 10:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:25:45] [INFO ] [Real]Absence check using state equation in 1418 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 35 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:25:45] [INFO ] Invariant cache hit.
[2023-03-19 10:25:46] [INFO ] Implicit Places using invariants in 913 ms returned []
[2023-03-19 10:25:46] [INFO ] Invariant cache hit.
[2023-03-19 10:25:48] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2023-03-19 10:25:48] [INFO ] Invariant cache hit.
[2023-03-19 10:25:49] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4165 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 20 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-19 10:26:10] [INFO ] Invariant cache hit.
[2023-03-19 10:26:24] [INFO ] [Real]Absence check using 432 positive place invariants in 214 ms returned sat
[2023-03-19 10:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:26:26] [INFO ] [Real]Absence check using state equation in 1473 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 30200 steps with 788 reset in 10001 ms.
Product exploration timeout after 29790 steps with 750 reset in 10002 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 36 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:26:46] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 10:26:46] [INFO ] Invariant cache hit.
[2023-03-19 10:26:47] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1168 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 14 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:26:47] [INFO ] Invariant cache hit.
[2023-03-19 10:26:48] [INFO ] Implicit Places using invariants in 887 ms returned []
[2023-03-19 10:26:48] [INFO ] Invariant cache hit.
[2023-03-19 10:26:50] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 2940 ms to find 0 implicit places.
[2023-03-19 10:26:50] [INFO ] Invariant cache hit.
[2023-03-19 10:26:51] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3956 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-PT-AN12-LTLCardinality-02 finished in 250261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 67 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:26:52] [INFO ] Invariant cache hit.
[2023-03-19 10:26:53] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-19 10:26:53] [INFO ] Invariant cache hit.
[2023-03-19 10:26:55] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 3385 ms to find 0 implicit places.
[2023-03-19 10:26:55] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 10:26:55] [INFO ] Invariant cache hit.
[2023-03-19 10:26:56] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4500 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 50900 steps with 403 reset in 10001 ms.
Product exploration timeout after 50470 steps with 400 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-19 10:29:39] [INFO ] Invariant cache hit.
[2023-03-19 10:29:53] [INFO ] [Real]Absence check using 432 positive place invariants in 203 ms returned sat
[2023-03-19 10:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 10:29:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 36 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:29:54] [INFO ] Invariant cache hit.
[2023-03-19 10:29:55] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2023-03-19 10:29:55] [INFO ] Invariant cache hit.
[2023-03-19 10:29:57] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 3509 ms to find 0 implicit places.
[2023-03-19 10:29:57] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 10:29:57] [INFO ] Invariant cache hit.
[2023-03-19 10:29:58] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4606 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-19 10:32:22] [INFO ] Invariant cache hit.
[2023-03-19 10:32:36] [INFO ] [Real]Absence check using 432 positive place invariants in 189 ms returned sat
[2023-03-19 10:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:32:37] [INFO ] [Real]Absence check using state equation in 717 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration timeout after 50680 steps with 401 reset in 10003 ms.
Product exploration timeout after 50120 steps with 398 reset in 10003 ms.
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 34 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:32:57] [INFO ] Invariant cache hit.
[2023-03-19 10:32:58] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2023-03-19 10:32:58] [INFO ] Invariant cache hit.
[2023-03-19 10:33:01] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3582 ms to find 0 implicit places.
[2023-03-19 10:33:01] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 10:33:01] [INFO ] Invariant cache hit.
[2023-03-19 10:33:02] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4744 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-PT-AN12-LTLCardinality-03 finished in 370508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(!p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 13 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 10:33:02] [INFO ] Invariant cache hit.
[2023-03-19 10:33:03] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-19 10:33:03] [INFO ] Invariant cache hit.
[2023-03-19 10:33:05] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2023-03-19 10:33:05] [INFO ] Invariant cache hit.
[2023-03-19 10:33:06] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4021 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (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 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-06 finished in 4163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1727 places and 0 transitions.
Iterating post reduction 0 with 1727 rules applied. Total rules applied 1727 place count 433 transition count 1728
Applied a total of 1727 rules in 59 ms. Remains 433 /2160 variables (removed 1727) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 433 cols
[2023-03-19 10:33:06] [INFO ] Computed 35 place invariants in 98 ms
[2023-03-19 10:33:07] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-19 10:33:07] [INFO ] Invariant cache hit.
[2023-03-19 10:33:08] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2023-03-19 10:33:08] [INFO ] Invariant cache hit.
[2023-03-19 10:33:09] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2779 ms. Remains : 433/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s144)], 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][false, false]]
Stuttering criterion allowed to conclude after 5080 steps with 2477 reset in 860 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-09 finished in 3742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 433 are kept as prefixes of interest. Removing 1727 places using SCC suffix rule.5 ms
Discarding 1727 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 433 /2160 variables (removed 1727) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 433 cols
[2023-03-19 10:33:10] [INFO ] Computed 35 place invariants in 97 ms
[2023-03-19 10:33:11] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-19 10:33:11] [INFO ] Invariant cache hit.
[2023-03-19 10:33:12] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
[2023-03-19 10:33:12] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 10:33:12] [INFO ] Invariant cache hit.
[2023-03-19 10:33:13] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3158 ms. Remains : 433/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 s23) (LEQ s332 s144)), p0:(LEQ 1 s178)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 260 steps with 3 reset in 55 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-14 finished in 3352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 427 are kept as prefixes of interest. Removing 1733 places using SCC suffix rule.3 ms
Discarding 1733 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 111 ms. Remains 427 /2160 variables (removed 1733) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 427 cols
[2023-03-19 10:33:13] [INFO ] Computed 31 place invariants in 75 ms
[2023-03-19 10:33:14] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-19 10:33:14] [INFO ] Invariant cache hit.
[2023-03-19 10:33:15] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2023-03-19 10:33:16] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-19 10:33:16] [INFO ] Invariant cache hit.
[2023-03-19 10:33:16] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2808 ms. Remains : 427/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s310 s144)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 378 steps with 2 reset in 55 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-15 finished in 2907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X(((X(p0)&&F(p1))||X(G(p0)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 10:33:17] [INFO ] Flatten gal took : 189 ms
[2023-03-19 10:33:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2023-03-19 10:33:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 25 ms.
Total runtime 926635 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1736/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 16014388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16078540 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1736/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 15990632 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16068344 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1736/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15959088 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16030164 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-AN12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-AN12, 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 r489-tall-167912706500251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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