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-167912706400147.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-COL-BN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706400147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:08 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 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 146K 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-COL-BN09-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679199226478

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-COL-BN09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 04:13:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 04:13:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:13:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-19 04:13:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 04:13:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 492 ms
[2023-03-19 04:13:48] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 04:13:48] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 5 ms.
[2023-03-19 04:13:48] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-BN09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10042 steps, including 120 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 22 ms. (steps per millisecond=456 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 13 ms. (steps per millisecond=772 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-19 04:13:49] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 04:13:49] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 04:13:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 04:13:49] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-19 04:13:49] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 04:13:49] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-BN09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 04:13:49] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-19 04:13:49] [INFO ] Flatten gal took : 18 ms
FORMULA Sudoku-COL-BN09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 04:13:49] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2023-03-19 04:13:49] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 43 ms.
[2023-03-19 04:13:49] [INFO ] Unfolded 7 HLPN properties in 2 ms.
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-19 04:13:49] [INFO ] Computed 324 place invariants in 26 ms
[2023-03-19 04:13:49] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-19 04:13:49] [INFO ] Invariant cache hit.
[2023-03-19 04:13:50] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2023-03-19 04:13:50] [INFO ] Invariant cache hit.
[2023-03-19 04:13:50] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2023-03-19 04:13:50] [INFO ] Flatten gal took : 118 ms
[2023-03-19 04:13:51] [INFO ] Flatten gal took : 82 ms
[2023-03-19 04:13:51] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 1253 ms. (steps per millisecond=7 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 04:13:53] [INFO ] Invariant cache hit.
[2023-03-19 04:13:54] [INFO ] [Real]Absence check using 324 positive place invariants in 76 ms returned sat
[2023-03-19 04:14:17] [INFO ] After 23908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 04:14:17] [INFO ] [Nat]Absence check using 324 positive place invariants in 65 ms returned sat
[2023-03-19 04:14:42] [INFO ] After 23359ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-19 04:14:42] [INFO ] After 23365ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-19 04:14:42] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=10 )
Parikh walk visited 6 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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' '!((G(p0) U p1))'
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 71 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:14:42] [INFO ] Invariant cache hit.
[2023-03-19 04:14:43] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-19 04:14:43] [INFO ] Invariant cache hit.
[2023-03-19 04:14:44] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2023-03-19 04:14:44] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 04:14:44] [INFO ] Invariant cache hit.
[2023-03-19 04:14:44] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2007 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 1 (ADD s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 s917...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1947 reset in 5592 ms.
Product exploration explored 100000 steps with 1968 reset in 5610 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) 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 10 factoid took 488 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 04:15:17] [INFO ] Invariant cache hit.
[2023-03-19 04:15:17] [INFO ] [Real]Absence check using 324 positive place invariants in 66 ms returned sat
[2023-03-19 04:15:17] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:15:17] [INFO ] [Nat]Absence check using 324 positive place invariants in 64 ms returned sat
[2023-03-19 04:15:29] [INFO ] After 10847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:15:40] [INFO ] After 21926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2414 ms.
[2023-03-19 04:15:42] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 588 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p0)]
[2023-03-19 04:15:43] [INFO ] Invariant cache hit.
[2023-03-19 04:15:46] [INFO ] [Real]Absence check using 324 positive place invariants in 113 ms returned sat
[2023-03-19 04:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:15:47] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2023-03-19 04:15:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:15:50] [INFO ] [Nat]Absence check using 324 positive place invariants in 170 ms returned sat
[2023-03-19 04:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:15:51] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2023-03-19 04:15:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-19 04:15:51] [INFO ] Added : 0 causal constraints over 0 iterations in 115 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:15:51] [INFO ] Invariant cache hit.
[2023-03-19 04:15:52] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 04:15:52] [INFO ] Invariant cache hit.
[2023-03-19 04:15:52] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-03-19 04:15:52] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 04:15:52] [INFO ] Invariant cache hit.
[2023-03-19 04:15:53] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1817 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) 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 10 factoid took 397 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 04:16:14] [INFO ] Invariant cache hit.
[2023-03-19 04:16:15] [INFO ] [Real]Absence check using 324 positive place invariants in 58 ms returned sat
[2023-03-19 04:16:15] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 04:16:15] [INFO ] [Nat]Absence check using 324 positive place invariants in 71 ms returned sat
[2023-03-19 04:16:26] [INFO ] After 10938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 04:16:37] [INFO ] After 21850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2485 ms.
[2023-03-19 04:16:40] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 449 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p0)]
[2023-03-19 04:16:40] [INFO ] Invariant cache hit.
[2023-03-19 04:16:44] [INFO ] [Real]Absence check using 324 positive place invariants in 115 ms returned sat
[2023-03-19 04:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 04:16:44] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-19 04:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 04:16:47] [INFO ] [Nat]Absence check using 324 positive place invariants in 169 ms returned sat
[2023-03-19 04:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 04:16:49] [INFO ] [Nat]Absence check using state equation in 1305 ms returned sat
[2023-03-19 04:16:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-19 04:16:49] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 1997 reset in 5670 ms.
Product exploration explored 100000 steps with 1953 reset in 5702 ms.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:17:00] [INFO ] Invariant cache hit.
[2023-03-19 04:17:01] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 04:17:01] [INFO ] Invariant cache hit.
[2023-03-19 04:17:01] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2023-03-19 04:17:01] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 04:17:01] [INFO ] Invariant cache hit.
[2023-03-19 04:17:02] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1738 ms. Remains : 1053/1053 places, 729/729 transitions.
Treatment of property Sudoku-COL-BN09-LTLCardinality-00 finished in 139819 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((G(p0)||(p1&&F((!p1&&G(!p0))))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:17:02] [INFO ] Invariant cache hit.
[2023-03-19 04:17:02] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-19 04:17:02] [INFO ] Invariant cache hit.
[2023-03-19 04:17:03] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2023-03-19 04:17:03] [INFO ] Invariant cache hit.
[2023-03-19 04:17:04] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1600 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) p1), false, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GT (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 12 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-01 finished in 1787 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((p0 U (G(p0)||(p0&&(F(G(p1))||G(!p2)||(G(F(p3))&&(!p2||F(G(p1))))))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:17:04] [INFO ] Invariant cache hit.
[2023-03-19 04:17:04] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-19 04:17:04] [INFO ] Invariant cache hit.
[2023-03-19 04:17:05] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2023-03-19 04:17:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 04:17:05] [INFO ] Invariant cache hit.
[2023-03-19 04:17:05] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1490 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) (NOT p0))), acceptance={} source=5 dest: 4}, { cond=(OR p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 12 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-03 finished in 1842 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(p0)&&X(G(p1))))'
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:17:06] [INFO ] Invariant cache hit.
[2023-03-19 04:17:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-19 04:17:06] [INFO ] Invariant cache hit.
[2023-03-19 04:17:06] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-19 04:17:06] [INFO ] Invariant cache hit.
[2023-03-19 04:17:07] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1032 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-04 finished in 1176 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' '!(G(F(p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 40 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2023-03-19 04:17:07] [INFO ] Computed 75 place invariants in 41 ms
[2023-03-19 04:17:07] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-19 04:17:07] [INFO ] Invariant cache hit.
[2023-03-19 04:17:08] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-19 04:17:08] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 04:17:08] [INFO ] Invariant cache hit.
[2023-03-19 04:17:08] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1321 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-08 finished in 1419 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 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.5 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:17:08] [INFO ] Invariant cache hit.
[2023-03-19 04:17:09] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 04:17:09] [INFO ] Invariant cache hit.
[2023-03-19 04:17:09] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2023-03-19 04:17:09] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 04:17:09] [INFO ] Invariant cache hit.
[2023-03-19 04:17:10] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1185 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-13 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 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1510 reset in 5196 ms.
Product exploration explored 100000 steps with 1508 reset in 5304 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 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 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 505388 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505388 steps, saw 108936 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 04:17:27] [INFO ] Invariant cache hit.
[2023-03-19 04:17:27] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 31 ms returned sat
[2023-03-19 04:17:35] [INFO ] After 8238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:17:36] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-19 04:17:38] [INFO ] After 2785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:17:41] [INFO ] After 5066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7073 ms.
[2023-03-19 04:17:48] [INFO ] After 12222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:17:48] [INFO ] Invariant cache hit.
[2023-03-19 04:17:48] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-19 04:17:48] [INFO ] Invariant cache hit.
[2023-03-19 04:17:49] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-19 04:17:49] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 04:17:49] [INFO ] Invariant cache hit.
[2023-03-19 04:17:49] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1156 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 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 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 540872 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 540872 steps, saw 114470 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 04:17:56] [INFO ] Invariant cache hit.
[2023-03-19 04:17:56] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-19 04:18:04] [INFO ] After 8346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 04:18:04] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 22 ms returned sat
[2023-03-19 04:18:07] [INFO ] After 2955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 04:18:10] [INFO ] After 5330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7479 ms.
[2023-03-19 04:18:17] [INFO ] After 12885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1509 reset in 5282 ms.
Product exploration explored 100000 steps with 1508 reset in 5292 ms.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 04:18:28] [INFO ] Invariant cache hit.
[2023-03-19 04:18:28] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-19 04:18:28] [INFO ] Invariant cache hit.
[2023-03-19 04:18:29] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-19 04:18:29] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 04:18:29] [INFO ] Invariant cache hit.
[2023-03-19 04:18:29] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1212 ms. Remains : 324/324 places, 729/729 transitions.
Treatment of property Sudoku-COL-BN09-LTLCardinality-13 finished in 81162 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)&&(G(!p1)||X(X(F(p1)))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-19 04:18:30] [INFO ] Computed 324 place invariants in 6 ms
[2023-03-19 04:18:30] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-19 04:18:30] [INFO ] Invariant cache hit.
[2023-03-19 04:18:31] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-03-19 04:18:31] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 04:18:31] [INFO ] Invariant cache hit.
[2023-03-19 04:18:31] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1667 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 11 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-14 finished in 1860 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' '!((G(p0) U 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' '!(F(G(p0)))'
[2023-03-19 04:18:32] [INFO ] Flatten gal took : 58 ms
[2023-03-19 04:18:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 04:18:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 7 ms.
Total runtime 283998 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1107/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 16016236 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16078320 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1107/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 16003156 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067840 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-COL-BN09"
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-COL-BN09, 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-167912706400147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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