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.r487-tall-167912702500035.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 lolaxred
Input is Sudoku-COL-AN05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702500035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 09:03 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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679158642160

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 16:57:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 16:57:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 16:57:23] [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 16:57:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 16:57:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 605 ms
[2023-03-18 16:57:24] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 16:57:24] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 16:57:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN05-LTLCardinality-14 TRUE 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 15 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 10016 steps, including 370 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 16:57:24] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 16:57:25] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 16:57:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-18 16:57:25] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 16:57:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 16:57:25] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 16:57:25] [INFO ] Flatten gal took : 1 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2023-03-18 16:57:25] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 9 ms.
[2023-03-18 16:57:25] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2023-03-18 16:57:25] [INFO ] Computed 75 place invariants in 4 ms
[2023-03-18 16:57:25] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 16:57:25] [INFO ] Invariant cache hit.
[2023-03-18 16:57:25] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-18 16:57:25] [INFO ] Invariant cache hit.
[2023-03-18 16:57:25] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2023-03-18 16:57:25] [INFO ] Flatten gal took : 21 ms
[2023-03-18 16:57:25] [INFO ] Flatten gal took : 19 ms
[2023-03-18 16:57:25] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 16:57:26] [INFO ] Invariant cache hit.
[2023-03-18 16:57:26] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 16:57:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-18 16:57:26] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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(G(p0)))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 6 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2023-03-18 16:57:26] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-18 16:57:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 16:57:26] [INFO ] Invariant cache hit.
[2023-03-18 16:57:26] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-18 16:57:26] [INFO ] Invariant cache hit.
[2023-03-18 16:57:26] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-00 finished in 435 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(((p0 U (F(X(p1)) U p2))&&G(p1)))) U p3))'
Support contains 150 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2023-03-18 16:57:27] [INFO ] Computed 75 place invariants in 3 ms
[2023-03-18 16:57:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 16:57:27] [INFO ] Invariant cache hit.
[2023-03-18 16:57:27] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-18 16:57:27] [INFO ] Invariant cache hit.
[2023-03-18 16:57:27] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p3), (OR (NOT p3) (AND p1 p2)), (AND p1 p2), p1]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s2...], 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 28 steps with 1 reset in 3 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-01 finished in 459 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))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.1 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2023-03-18 16:57:27] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-18 16:57:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 16:57:27] [INFO ] Invariant cache hit.
[2023-03-18 16:57:27] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-18 16:57:27] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 16:57:27] [INFO ] Invariant cache hit.
[2023-03-18 16:57:27] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-02 finished in 236 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 U G(p1))&&X((G(F(p0))&&F(p2))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2023-03-18 16:57:27] [INFO ] Computed 75 place invariants in 1 ms
[2023-03-18 16:57:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 16:57:27] [INFO ] Invariant cache hit.
[2023-03-18 16:57:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-18 16:57:27] [INFO ] Invariant cache hit.
[2023-03-18 16:57:28] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=true, acceptance={} source=5 dest: 7}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-03 finished in 546 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))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 17 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:28] [INFO ] Invariant cache hit.
[2023-03-18 16:57:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-18 16:57:28] [INFO ] Invariant cache hit.
[2023-03-18 16:57:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-18 16:57:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 16:57:28] [INFO ] Invariant cache hit.
[2023-03-18 16:57:28] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25000 reset in 1541 ms.
Product exploration explored 100000 steps with 25000 reset in 1523 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-18 16:57:32] [INFO ] Invariant cache hit.
[2023-03-18 16:57:32] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-18 16:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:32] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-18 16:57:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:57:32] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 16:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:33] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-18 16:57:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 16:57:33] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:33] [INFO ] Invariant cache hit.
[2023-03-18 16:57:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 16:57:33] [INFO ] Invariant cache hit.
[2023-03-18 16:57:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-18 16:57:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 16:57:33] [INFO ] Invariant cache hit.
[2023-03-18 16:57:33] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-18 16:57:34] [INFO ] Invariant cache hit.
[2023-03-18 16:57:34] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-18 16:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:34] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-18 16:57:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:57:34] [INFO ] [Nat]Absence check using 75 positive place invariants in 23 ms returned sat
[2023-03-18 16:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:34] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-18 16:57:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 16:57:34] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1458 ms.
Product exploration explored 100000 steps with 25000 reset in 1485 ms.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:37] [INFO ] Invariant cache hit.
[2023-03-18 16:57:37] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 16:57:37] [INFO ] Invariant cache hit.
[2023-03-18 16:57:37] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-18 16:57:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 16:57:37] [INFO ] Invariant cache hit.
[2023-03-18 16:57:38] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-04 finished in 9787 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((X(!(true U p0))||X(!((p1 U p0) U !p1)))))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:38] [INFO ] Invariant cache hit.
[2023-03-18 16:57:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 16:57:38] [INFO ] Invariant cache hit.
[2023-03-18 16:57:38] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-18 16:57:38] [INFO ] Invariant cache hit.
[2023-03-18 16:57:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4543 reset in 1636 ms.
Product exploration explored 100000 steps with 4553 reset in 1634 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 376 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 452 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 16:57:42] [INFO ] Invariant cache hit.
[2023-03-18 16:57:42] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 12 factoid took 490 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 32 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:43] [INFO ] Invariant cache hit.
[2023-03-18 16:57:43] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 16:57:43] [INFO ] Invariant cache hit.
[2023-03-18 16:57:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-18 16:57:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:43] [INFO ] Invariant cache hit.
[2023-03-18 16:57:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 348 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 30 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 31 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 4548 reset in 1808 ms.
Product exploration explored 100000 steps with 4554 reset in 1825 ms.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:48] [INFO ] Invariant cache hit.
[2023-03-18 16:57:48] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 16:57:48] [INFO ] Invariant cache hit.
[2023-03-18 16:57:48] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-18 16:57:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:48] [INFO ] Invariant cache hit.
[2023-03-18 16:57:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 10476 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 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:48] [INFO ] Invariant cache hit.
[2023-03-18 16:57:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 16:57:48] [INFO ] Invariant cache hit.
[2023-03-18 16:57:48] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-18 16:57:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:48] [INFO ] Invariant cache hit.
[2023-03-18 16:57:48] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-06 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 (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) (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 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 4546 reset in 1250 ms.
Product exploration explored 100000 steps with 4550 reset in 1257 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 121 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 24 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 187 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)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-18 16:57:51] [INFO ] Invariant cache hit.
[2023-03-18 16:57:52] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-18 16:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:52] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-18 16:57:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:57:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2023-03-18 16:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:52] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-18 16:57:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 16:57:52] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:52] [INFO ] Invariant cache hit.
[2023-03-18 16:57:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 16:57:52] [INFO ] Invariant cache hit.
[2023-03-18 16:57:52] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-18 16:57:52] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 16:57:52] [INFO ] Invariant cache hit.
[2023-03-18 16:57:52] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 168 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)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
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 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-18 16:57:53] [INFO ] Invariant cache hit.
[2023-03-18 16:57:53] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-18 16:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-18 16:57:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:57:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 34 ms returned sat
[2023-03-18 16:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:53] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-18 16:57:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 16:57:53] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4549 reset in 1227 ms.
Product exploration explored 100000 steps with 4549 reset in 1262 ms.
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:56] [INFO ] Invariant cache hit.
[2023-03-18 16:57:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-18 16:57:56] [INFO ] Invariant cache hit.
[2023-03-18 16:57:56] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-18 16:57:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:57:56] [INFO ] Invariant cache hit.
[2023-03-18 16:57:56] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-06 finished in 8026 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&&X(G(p1)))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:56] [INFO ] Invariant cache hit.
[2023-03-18 16:57:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 16:57:56] [INFO ] Invariant cache hit.
[2023-03-18 16:57:56] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 16:57:56] [INFO ] Invariant cache hit.
[2023-03-18 16:57:56] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s2...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-09 finished in 375 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 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:57:57] [INFO ] Invariant cache hit.
[2023-03-18 16:57:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 16:57:57] [INFO ] Invariant cache hit.
[2023-03-18 16:57:57] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-18 16:57:57] [INFO ] Invariant cache hit.
[2023-03-18 16:57:57] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10 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 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], 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 25000 reset in 1386 ms.
Product exploration explored 100000 steps with 25000 reset in 1429 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:58:00] [INFO ] Invariant cache hit.
[2023-03-18 16:58:01] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-18 16:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:01] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-18 16:58:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:58:01] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 16:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:01] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2023-03-18 16:58:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 16:58:01] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:01] [INFO ] Invariant cache hit.
[2023-03-18 16:58:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 16:58:01] [INFO ] Invariant cache hit.
[2023-03-18 16:58:01] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-18 16:58:01] [INFO ] Invariant cache hit.
[2023-03-18 16:58:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:58:02] [INFO ] Invariant cache hit.
[2023-03-18 16:58:02] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-18 16:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:02] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-18 16:58:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:58:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 16:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:03] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-18 16:58:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-18 16:58:03] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1399 ms.
Product exploration explored 100000 steps with 25000 reset in 1428 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:58:06] [INFO ] Invariant cache hit.
[2023-03-18 16:58:06] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:06] [INFO ] Invariant cache hit.
[2023-03-18 16:58:06] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 16:58:06] [INFO ] Invariant cache hit.
[2023-03-18 16:58:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-18 16:58:06] [INFO ] Invariant cache hit.
[2023-03-18 16:58:07] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 10047 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(p2)))))))'
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:07] [INFO ] Invariant cache hit.
[2023-03-18 16:58:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 16:58:07] [INFO ] Invariant cache hit.
[2023-03-18 16:58:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 16:58:07] [INFO ] Invariant cache hit.
[2023-03-18 16:58:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174)) (LEQ (A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5889 reset in 1783 ms.
Product exploration explored 100000 steps with 5888 reset in 1757 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 595 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 16:58:12] [INFO ] Invariant cache hit.
[2023-03-18 16:58:13] [INFO ] [Real]Absence check using 75 positive place invariants in 10 ms returned sat
[2023-03-18 16:58:13] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 16:58:13] [INFO ] [Nat]Absence check using 75 positive place invariants in 10 ms returned sat
[2023-03-18 16:58:13] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 17 factoid took 749 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-11 finished in 6823 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))||G(p1)))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:13] [INFO ] Invariant cache hit.
[2023-03-18 16:58:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 16:58:13] [INFO ] Invariant cache hit.
[2023-03-18 16:58:14] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 16:58:14] [INFO ] Invariant cache hit.
[2023-03-18 16:58:14] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ 1 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s5...], 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 4547 reset in 1049 ms.
Product exploration explored 100000 steps with 4546 reset in 1094 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 526 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 15 factoid took 574 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 16:58:18] [INFO ] Invariant cache hit.
[2023-03-18 16:58:18] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 16:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-18 16:58:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 16:58:18] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:18] [INFO ] Invariant cache hit.
[2023-03-18 16:58:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 16:58:18] [INFO ] Invariant cache hit.
[2023-03-18 16:58:18] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-18 16:58:18] [INFO ] Invariant cache hit.
[2023-03-18 16:58:18] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 16:58:19] [INFO ] Invariant cache hit.
[2023-03-18 16:58:19] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 16:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:19] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-18 16:58:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 16:58:19] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4548 reset in 1074 ms.
Product exploration explored 100000 steps with 4552 reset in 1110 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 8549 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 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-18 16:58:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:58:22] [INFO ] Invariant cache hit.
[2023-03-18 16:58:22] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], 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 23 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-15 finished in 356 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))'
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((X(!(true U p0))||X(!((p1 U p0) U !p1)))))'
Found a Shortening insensitive property : Sudoku-COL-AN05-LTLCardinality-05
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:23] [INFO ] Invariant cache hit.
[2023-03-18 16:58:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 16:58:23] [INFO ] Invariant cache hit.
[2023-03-18 16:58:23] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-18 16:58:23] [INFO ] Invariant cache hit.
[2023-03-18 16:58:23] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 299 ms. Remains : 200/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4547 reset in 1761 ms.
Product exploration explored 100000 steps with 4544 reset in 1783 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 434 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 454 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 16:58:27] [INFO ] Invariant cache hit.
[2023-03-18 16:58:27] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 12 factoid took 556 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 42 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:28] [INFO ] Invariant cache hit.
[2023-03-18 16:58:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 16:58:28] [INFO ] Invariant cache hit.
[2023-03-18 16:58:28] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-18 16:58:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:58:28] [INFO ] Invariant cache hit.
[2023-03-18 16:58:28] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 29 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 42 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 4538 reset in 1814 ms.
Product exploration explored 100000 steps with 4546 reset in 1870 ms.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:33] [INFO ] Invariant cache hit.
[2023-03-18 16:58:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-18 16:58:33] [INFO ] Invariant cache hit.
[2023-03-18 16:58:33] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-18 16:58:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:58:33] [INFO ] Invariant cache hit.
[2023-03-18 16:58:33] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 11077 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)))'
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))))'
Found a Shortening insensitive property : Sudoku-COL-AN05-LTLCardinality-10
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:34] [INFO ] Invariant cache hit.
[2023-03-18 16:58:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 16:58:34] [INFO ] Invariant cache hit.
[2023-03-18 16:58:34] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-18 16:58:34] [INFO ] Invariant cache hit.
[2023-03-18 16:58:34] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 294 ms. Remains : 200/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10 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 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1390 ms.
Product exploration explored 100000 steps with 25000 reset in 1417 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:58:37] [INFO ] Invariant cache hit.
[2023-03-18 16:58:38] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 16:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:38] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-18 16:58:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:58:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 16:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:38] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-18 16:58:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 16:58:38] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:38] [INFO ] Invariant cache hit.
[2023-03-18 16:58:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 16:58:38] [INFO ] Invariant cache hit.
[2023-03-18 16:58:38] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-18 16:58:38] [INFO ] Invariant cache hit.
[2023-03-18 16:58:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 16:58:39] [INFO ] Invariant cache hit.
[2023-03-18 16:58:39] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 16:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:39] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-18 16:58:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:58:39] [INFO ] [Nat]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-18 16:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:40] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2023-03-18 16:58:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 16:58:40] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1396 ms.
Product exploration explored 100000 steps with 25000 reset in 1426 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:58:43] [INFO ] Invariant cache hit.
[2023-03-18 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:43] [INFO ] Invariant cache hit.
[2023-03-18 16:58:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 16:58:43] [INFO ] Invariant cache hit.
[2023-03-18 16:58:43] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-18 16:58:43] [INFO ] Invariant cache hit.
[2023-03-18 16:58:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 9868 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))||G(p1)))'
Found a Lengthening insensitive property : Sudoku-COL-AN05-LTLCardinality-12
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:44] [INFO ] Invariant cache hit.
[2023-03-18 16:58:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 16:58:44] [INFO ] Invariant cache hit.
[2023-03-18 16:58:44] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-18 16:58:44] [INFO ] Invariant cache hit.
[2023-03-18 16:58:44] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 244 ms. Remains : 200/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ 1 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s5...], 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 4547 reset in 1083 ms.
Product exploration explored 100000 steps with 4544 reset in 1116 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 680 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 15 factoid took 473 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 16:58:48] [INFO ] Invariant cache hit.
[2023-03-18 16:58:48] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 16:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:48] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-18 16:58:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 16:58:48] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:48] [INFO ] Invariant cache hit.
[2023-03-18 16:58:48] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 16:58:48] [INFO ] Invariant cache hit.
[2023-03-18 16:58:48] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-18 16:58:48] [INFO ] Invariant cache hit.
[2023-03-18 16:58:48] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 16:58:49] [INFO ] Invariant cache hit.
[2023-03-18 16:58:49] [INFO ] [Real]Absence check using 75 positive place invariants in 12 ms returned sat
[2023-03-18 16:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:58:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-18 16:58:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 16:58:49] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4544 reset in 1079 ms.
Product exploration explored 100000 steps with 4543 reset in 1106 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:58:52] [INFO ] Invariant cache hit.
[2023-03-18 16:58:52] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 16:58:52] [INFO ] Invariant cache hit.
[2023-03-18 16:58:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 16:58:52] [INFO ] Invariant cache hit.
[2023-03-18 16:58:52] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-18 16:58:52] [INFO ] Invariant cache hit.
[2023-03-18 16:58:52] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 8631 ms.
[2023-03-18 16:58:52] [INFO ] Flatten gal took : 11 ms
[2023-03-18 16:58:52] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 16:58:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 125 transitions and 500 arcs took 1 ms.
Total runtime 88956 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN05
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA Sudoku-COL-AN05-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-AN05-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-COL-AN05-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679158859471

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:168
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:527
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: RELEASE
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: RELEASE
lola: RELEASE
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 15 (type SKEL/SRCH) for 12 Sudoku-COL-AN05-LTLCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type SKEL/SRCH) for Sudoku-COL-AN05-LTLCardinality-12
lola: result : true
lola: markings : 51
lola: fired transitions : 52
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 Sudoku-COL-AN05-LTLCardinality-06
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: planning for Sudoku-COL-AN05-LTLCardinality-12 stopped (result already fixed).
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/900 5/32 Sudoku-COL-AN05-LTLCardinality-06 641892 m, 128378 m/sec, 4278619 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/900 9/32 Sudoku-COL-AN05-LTLCardinality-06 1205228 m, 112667 m/sec, 8345120 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/900 12/32 Sudoku-COL-AN05-LTLCardinality-06 1672037 m, 93361 m/sec, 12231873 t fired, .

Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/900 16/32 Sudoku-COL-AN05-LTLCardinality-06 2161190 m, 97830 m/sec, 16265274 t fired, .

Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/900 20/32 Sudoku-COL-AN05-LTLCardinality-06 2749231 m, 117608 m/sec, 20342868 t fired, .

Time elapsed: 25 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/900 24/32 Sudoku-COL-AN05-LTLCardinality-06 3301102 m, 110374 m/sec, 24489295 t fired, .

Time elapsed: 30 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/900 27/32 Sudoku-COL-AN05-LTLCardinality-06 3738844 m, 87548 m/sec, 28254171 t fired, .

Time elapsed: 35 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/900 31/32 Sudoku-COL-AN05-LTLCardinality-06 4259315 m, 104094 m/sec, 32365701 t fired, .

Time elapsed: 40 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for Sudoku-COL-AN05-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN05-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 10 (type EXCL) for 9 Sudoku-COL-AN05-LTLCardinality-10
lola: time limit : 1185 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for Sudoku-COL-AN05-LTLCardinality-10
lola: result : true
lola: markings : 240126
lola: fired transitions : 713125
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-AN05-LTLCardinality-05
lola: time limit : 1777 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1777 3/32 Sudoku-COL-AN05-LTLCardinality-05 315816 m, 63163 m/sec, 3711075 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1777 5/32 Sudoku-COL-AN05-LTLCardinality-05 656331 m, 68103 m/sec, 8383846 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1777 7/32 Sudoku-COL-AN05-LTLCardinality-05 1009834 m, 70700 m/sec, 13115028 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1777 9/32 Sudoku-COL-AN05-LTLCardinality-05 1337334 m, 65500 m/sec, 17837585 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1777 12/32 Sudoku-COL-AN05-LTLCardinality-05 1671684 m, 66870 m/sec, 22371138 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1777 13/32 Sudoku-COL-AN05-LTLCardinality-05 1950334 m, 55730 m/sec, 26914756 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1777 16/32 Sudoku-COL-AN05-LTLCardinality-05 2288397 m, 67612 m/sec, 31485072 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1777 18/32 Sudoku-COL-AN05-LTLCardinality-05 2588188 m, 59958 m/sec, 35966176 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1777 19/32 Sudoku-COL-AN05-LTLCardinality-05 2852561 m, 52874 m/sec, 40519890 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1777 21/32 Sudoku-COL-AN05-LTLCardinality-05 3122060 m, 53899 m/sec, 44911968 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/1777 23/32 Sudoku-COL-AN05-LTLCardinality-05 3380418 m, 51671 m/sec, 49277268 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/1777 25/32 Sudoku-COL-AN05-LTLCardinality-05 3621422 m, 48200 m/sec, 53649028 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/1777 26/32 Sudoku-COL-AN05-LTLCardinality-05 3842521 m, 44219 m/sec, 58124004 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/1777 29/32 Sudoku-COL-AN05-LTLCardinality-05 4220272 m, 75550 m/sec, 62786074 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 74/1777 31/32 Sudoku-COL-AN05-LTLCardinality-05 4542008 m, 64347 m/sec, 67395771 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for Sudoku-COL-AN05-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN05-LTLCardinality-04: F 0 1 0 0 1 0 0 0
Sudoku-COL-AN05-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 16 (type EXCL) for 0 Sudoku-COL-AN05-LTLCardinality-04
lola: time limit : 3475 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for Sudoku-COL-AN05-LTLCardinality-04
lola: result : false
lola: markings : 7126
lola: fired transitions : 14125
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN05-LTLCardinality-04: F true state space / EG
Sudoku-COL-AN05-LTLCardinality-05: LTL unknown AGGR
Sudoku-COL-AN05-LTLCardinality-06: LTL unknown AGGR
Sudoku-COL-AN05-LTLCardinality-10: LTL true LTL model checker
Sudoku-COL-AN05-LTLCardinality-12: LTL true skeleton: LTL model checker


Time elapsed: 125 secs. Pages in use: 32

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-AN05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Sudoku-COL-AN05, 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 r487-tall-167912702500035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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