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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.4K Feb 26 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:46 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.3K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 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 6.5K 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-AN08-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679177133983

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-AN08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 22:05:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 22:05:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:05:35] [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-18 22:05:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 22:05:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2023-03-18 22:05:36] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 22:05:36] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 22:05:36] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 10031 steps, including 151 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 22:05:36] [INFO ] Computed 3 place invariants in 11 ms
[2023-03-18 22:05:36] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 22:05:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:05:36] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 22:05:36] [INFO ] Flatten gal took : 13 ms
[2023-03-18 22:05:36] [INFO ] Flatten gal took : 1 ms
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2023-03-18 22:05:36] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 25 ms.
[2023-03-18 22:05:36] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 704 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2023-03-18 22:05:36] [INFO ] Computed 192 place invariants in 12 ms
[2023-03-18 22:05:37] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-18 22:05:37] [INFO ] Invariant cache hit.
[2023-03-18 22:05:37] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-03-18 22:05:37] [INFO ] Invariant cache hit.
[2023-03-18 22:05:37] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1006 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2023-03-18 22:05:38] [INFO ] Flatten gal took : 69 ms
[2023-03-18 22:05:38] [INFO ] Flatten gal took : 57 ms
[2023-03-18 22:05:38] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 1013 ms. (steps per millisecond=9 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-18 22:05:40] [INFO ] Invariant cache hit.
[2023-03-18 22:05:40] [INFO ] [Real]Absence check using 192 positive place invariants in 36 ms returned sat
[2023-03-18 22:05:40] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 22:05:41] [INFO ] [Nat]Absence check using 192 positive place invariants in 34 ms returned sat
[2023-03-18 22:05:48] [INFO ] After 6969ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-18 22:05:53] [INFO ] After 12630ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 11927 ms.
[2023-03-18 22:06:05] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 10 Parikh solutions to 7 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 7 properties in 5 ms. (steps per millisecond=12 )
Parikh walk visited 7 properties in 6 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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' '!(X(X(F(p0))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 26 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2023-03-18 22:06:06] [INFO ] Computed 23 place invariants in 24 ms
[2023-03-18 22:06:06] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-18 22:06:06] [INFO ] Invariant cache hit.
[2023-03-18 22:06:06] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-18 22:06:06] [INFO ] Invariant cache hit.
[2023-03-18 22:06:06] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 8 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-00 finished in 1025 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(F(p0))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 11 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:06:07] [INFO ] Invariant cache hit.
[2023-03-18 22:06:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-18 22:06:07] [INFO ] Invariant cache hit.
[2023-03-18 22:06:07] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-18 22:06:07] [INFO ] Invariant cache hit.
[2023-03-18 22:06:07] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5771 ms.
Product exploration explored 100000 steps with 33333 reset in 5894 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLCardinality-03 finished in 13758 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(p1)))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2023-03-18 22:06:20] [INFO ] Computed 192 place invariants in 4 ms
[2023-03-18 22:06:21] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-18 22:06:21] [INFO ] Invariant cache hit.
[2023-03-18 22:06:21] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-18 22:06:21] [INFO ] Invariant cache hit.
[2023-03-18 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 861 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-04 finished in 1040 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(F(p0))||(G(!p1)&&F(p0)))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:06:21] [INFO ] Invariant cache hit.
[2023-03-18 22:06:22] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-18 22:06:22] [INFO ] Invariant cache hit.
[2023-03-18 22:06:22] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-18 22:06:22] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-18 22:06:22] [INFO ] Invariant cache hit.
[2023-03-18 22:06:22] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 954 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2941 reset in 5251 ms.
Product exploration explored 100000 steps with 2941 reset in 5425 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 312 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 33 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2023-03-18 22:06:43] [INFO ] Invariant cache hit.
[2023-03-18 22:06:44] [INFO ] [Real]Absence check using 192 positive place invariants in 50 ms returned sat
[2023-03-18 22:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:06:45] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2023-03-18 22:06:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:06:47] [INFO ] [Nat]Absence check using 192 positive place invariants in 845 ms returned sat
[2023-03-18 22:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:06:48] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2023-03-18 22:06:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-18 22:06:48] [INFO ] Added : 0 causal constraints over 0 iterations in 96 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:06:48] [INFO ] Invariant cache hit.
[2023-03-18 22:06:48] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-18 22:06:48] [INFO ] Invariant cache hit.
[2023-03-18 22:06:48] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-18 22:06:48] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 22:06:48] [INFO ] Invariant cache hit.
[2023-03-18 22:06:49] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 961 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 415 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 33 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2023-03-18 22:06:59] [INFO ] Invariant cache hit.
[2023-03-18 22:07:00] [INFO ] [Real]Absence check using 192 positive place invariants in 51 ms returned sat
[2023-03-18 22:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:07:00] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2023-03-18 22:07:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:07:02] [INFO ] [Nat]Absence check using 192 positive place invariants in 826 ms returned sat
[2023-03-18 22:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:07:03] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2023-03-18 22:07:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-18 22:07:03] [INFO ] Added : 0 causal constraints over 0 iterations in 91 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 2941 reset in 5451 ms.
Product exploration explored 100000 steps with 2941 reset in 5508 ms.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:07:14] [INFO ] Invariant cache hit.
[2023-03-18 22:07:15] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-18 22:07:15] [INFO ] Invariant cache hit.
[2023-03-18 22:07:15] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-18 22:07:15] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 22:07:15] [INFO ] Invariant cache hit.
[2023-03-18 22:07:15] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 901 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-07 finished in 54021 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 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:07:15] [INFO ] Invariant cache hit.
[2023-03-18 22:07:16] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-18 22:07:16] [INFO ] Invariant cache hit.
[2023-03-18 22:07:16] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-18 22:07:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 22:07:16] [INFO ] Invariant cache hit.
[2023-03-18 22:07:16] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-09 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 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2941 reset in 5133 ms.
Product exploration explored 100000 steps with 2941 reset in 5253 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
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 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2023-03-18 22:07:30] [INFO ] Invariant cache hit.
[2023-03-18 22:07:32] [INFO ] [Real]Absence check using 192 positive place invariants in 53 ms returned sat
[2023-03-18 22:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:07:32] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-18 22:07:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:07:34] [INFO ] [Nat]Absence check using 192 positive place invariants in 560 ms returned sat
[2023-03-18 22:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:07:34] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2023-03-18 22:07:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-18 22:07:34] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:07:34] [INFO ] Invariant cache hit.
[2023-03-18 22:07:35] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-18 22:07:35] [INFO ] Invariant cache hit.
[2023-03-18 22:07:35] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2023-03-18 22:07:35] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 22:07:35] [INFO ] Invariant cache hit.
[2023-03-18 22:07:35] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=5 )
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 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-18 22:07:39] [INFO ] Invariant cache hit.
[2023-03-18 22:07:40] [INFO ] [Real]Absence check using 192 positive place invariants in 56 ms returned sat
[2023-03-18 22:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:07:41] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-18 22:07:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:07:42] [INFO ] [Nat]Absence check using 192 positive place invariants in 566 ms returned sat
[2023-03-18 22:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:07:43] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2023-03-18 22:07:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-18 22:07:43] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2941 reset in 5168 ms.
Product exploration explored 100000 steps with 2941 reset in 5266 ms.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:07:54] [INFO ] Invariant cache hit.
[2023-03-18 22:07:54] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-18 22:07:54] [INFO ] Invariant cache hit.
[2023-03-18 22:07:54] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2023-03-18 22:07:54] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 22:07:54] [INFO ] Invariant cache hit.
[2023-03-18 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1067 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-09 finished in 39399 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((p0||G(F((p1||G(p2)))))))'
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 3 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2023-03-18 22:07:55] [INFO ] Computed 23 place invariants in 11 ms
[2023-03-18 22:07:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 22:07:55] [INFO ] Invariant cache hit.
[2023-03-18 22:07:55] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-18 22:07:55] [INFO ] Invariant cache hit.
[2023-03-18 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LEQ 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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4519 ms.
Product exploration explored 100000 steps with 50000 reset in 4551 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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 p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 138 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN08-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 11498 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 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.6 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:08:06] [INFO ] Invariant cache hit.
[2023-03-18 22:08:06] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 22:08:06] [INFO ] Invariant cache hit.
[2023-03-18 22:08:07] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-18 22:08:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 22:08:07] [INFO ] Invariant cache hit.
[2023-03-18 22:08:07] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 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 s3...], 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 57 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-12 finished in 751 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(X(G(p0)))))'
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2023-03-18 22:08:07] [INFO ] Computed 192 place invariants in 3 ms
[2023-03-18 22:08:07] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-18 22:08:07] [INFO ] Invariant cache hit.
[2023-03-18 22:08:08] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2023-03-18 22:08:08] [INFO ] Invariant cache hit.
[2023-03-18 22:08:08] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1797 reset in 4501 ms.
Product exploration explored 100000 steps with 1797 reset in 4553 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 22:08:19] [INFO ] Invariant cache hit.
[2023-03-18 22:08:21] [INFO ] [Real]Absence check using 192 positive place invariants in 52 ms returned sat
[2023-03-18 22:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:08:21] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-18 22:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:08:22] [INFO ] [Nat]Absence check using 192 positive place invariants in 66 ms returned sat
[2023-03-18 22:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:08:23] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-18 22:08:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-18 22:08:23] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:08:23] [INFO ] Invariant cache hit.
[2023-03-18 22:08:23] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-18 22:08:23] [INFO ] Invariant cache hit.
[2023-03-18 22:08:24] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-18 22:08:24] [INFO ] Invariant cache hit.
[2023-03-18 22:08:24] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1186 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 22:08:26] [INFO ] Invariant cache hit.
[2023-03-18 22:08:27] [INFO ] [Real]Absence check using 192 positive place invariants in 53 ms returned sat
[2023-03-18 22:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:08:28] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-18 22:08:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:08:29] [INFO ] [Nat]Absence check using 192 positive place invariants in 68 ms returned sat
[2023-03-18 22:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:08:29] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-18 22:08:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-18 22:08:30] [INFO ] Added : 0 causal constraints over 0 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1798 reset in 4708 ms.
Product exploration explored 100000 steps with 1795 reset in 4770 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 51 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:08:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:08:40] [INFO ] Invariant cache hit.
[2023-03-18 22:08:40] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:08:40] [INFO ] Invariant cache hit.
[2023-03-18 22:08:40] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-18 22:08:40] [INFO ] Invariant cache hit.
[2023-03-18 22:08:41] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2023-03-18 22:08:41] [INFO ] Invariant cache hit.
[2023-03-18 22:08:41] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1169 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-14 finished in 34105 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(F(p0))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 6 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2023-03-18 22:08:41] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-18 22:08:41] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-18 22:08:41] [INFO ] Invariant cache hit.
[2023-03-18 22:08:42] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-18 22:08:42] [INFO ] Invariant cache hit.
[2023-03-18 22:08:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-15 finished in 776 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(F(p0))||(G(!p1)&&F(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' '!(G(F(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' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : Sudoku-COL-AN08-LTLCardinality-14
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2023-03-18 22:08:42] [INFO ] Computed 192 place invariants in 2 ms
[2023-03-18 22:08:43] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-18 22:08:43] [INFO ] Invariant cache hit.
[2023-03-18 22:08:43] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-18 22:08:43] [INFO ] Invariant cache hit.
[2023-03-18 22:08:44] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1179 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1795 reset in 4715 ms.
Product exploration explored 100000 steps with 1797 reset in 4775 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 22:08:55] [INFO ] Invariant cache hit.
[2023-03-18 22:08:56] [INFO ] [Real]Absence check using 192 positive place invariants in 51 ms returned sat
[2023-03-18 22:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:08:57] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-18 22:08:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:08:58] [INFO ] [Nat]Absence check using 192 positive place invariants in 68 ms returned sat
[2023-03-18 22:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:08:58] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2023-03-18 22:08:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-18 22:08:58] [INFO ] Added : 0 causal constraints over 0 iterations in 79 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 5 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:08:58] [INFO ] Invariant cache hit.
[2023-03-18 22:08:59] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-18 22:08:59] [INFO ] Invariant cache hit.
[2023-03-18 22:08:59] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-18 22:08:59] [INFO ] Invariant cache hit.
[2023-03-18 22:09:00] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1199 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 22:09:01] [INFO ] Invariant cache hit.
[2023-03-18 22:09:03] [INFO ] [Real]Absence check using 192 positive place invariants in 50 ms returned sat
[2023-03-18 22:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:03] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-18 22:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:09:05] [INFO ] [Nat]Absence check using 192 positive place invariants in 66 ms returned sat
[2023-03-18 22:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:09:05] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2023-03-18 22:09:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-18 22:09:05] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1797 reset in 4692 ms.
Product exploration explored 100000 steps with 1798 reset in 4750 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:09:15] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 22:09:15] [INFO ] Invariant cache hit.
[2023-03-18 22:09:15] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 5 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-18 22:09:15] [INFO ] Invariant cache hit.
[2023-03-18 22:09:16] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-18 22:09:16] [INFO ] Invariant cache hit.
[2023-03-18 22:09:16] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-18 22:09:16] [INFO ] Invariant cache hit.
[2023-03-18 22:09:16] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1157 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-14 finished in 34409 ms.
[2023-03-18 22:09:17] [INFO ] Flatten gal took : 40 ms
[2023-03-18 22:09:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 22:09:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 704 places, 512 transitions and 2048 arcs took 3 ms.
Total runtime 221586 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1691/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 16031228 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086416 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1691/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 16021796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16074112 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1691/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 16011888 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067544 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-AN08"
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-AN08, 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-167912706300059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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