Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.5K Feb 26 09:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 09:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 09:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 09:20 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.4K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 09:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679173492047

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 21:04:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 21:04:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:04:53] [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 21:04:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 21:04:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2023-03-18 21:04:54] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 11 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 21:04:54] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 21:04:54] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN06-LTLCardinality-07 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 10031 steps, including 263 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 31 ms. (steps per millisecond=323 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 17 ms. (steps per millisecond=590 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 21:04:54] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 21:04:54] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:04:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 21:04:54] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2023-03-18 21:04:54] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 21:04:54] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 2 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:04:54] [INFO ] Flatten gal took : 14 ms
[2023-03-18 21:04:54] [INFO ] Flatten gal took : 1 ms
Domain [N(6), N(6)] of place Rows breaks symmetries in sort N
[2023-03-18 21:04:54] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions 864 arcs in 14 ms.
[2023-03-18 21:04:54] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2023-03-18 21:04:54] [INFO ] Computed 108 place invariants in 7 ms
[2023-03-18 21:04:55] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-18 21:04:55] [INFO ] Invariant cache hit.
[2023-03-18 21:04:55] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-18 21:04:55] [INFO ] Invariant cache hit.
[2023-03-18 21:04:55] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2023-03-18 21:04:55] [INFO ] Flatten gal took : 34 ms
[2023-03-18 21:04:55] [INFO ] Flatten gal took : 31 ms
[2023-03-18 21:04:55] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 21:04:56] [INFO ] Invariant cache hit.
[2023-03-18 21:04:56] [INFO ] [Real]Absence check using 108 positive place invariants in 21 ms returned sat
[2023-03-18 21:04:56] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:04:56] [INFO ] [Nat]Absence check using 108 positive place invariants in 18 ms returned sat
[2023-03-18 21:04:57] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-18 21:04:57] [INFO ] After 1019ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-18 21:04:58] [INFO ] After 1613ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 4 properties in 2 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:04:58] [INFO ] Invariant cache hit.
[2023-03-18 21:04:58] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-18 21:04:58] [INFO ] Invariant cache hit.
[2023-03-18 21:04:58] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-18 21:04:58] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 21:04:58] [INFO ] Invariant cache hit.
[2023-03-18 21:04:59] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5263 reset in 2465 ms.
Product exploration explored 100000 steps with 5263 reset in 2363 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
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 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-18 21:05:05] [INFO ] Invariant cache hit.
[2023-03-18 21:05:05] [INFO ] [Real]Absence check using 108 positive place invariants in 23 ms returned sat
[2023-03-18 21:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:05:05] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-18 21:05:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:05:06] [INFO ] [Nat]Absence check using 108 positive place invariants in 80 ms returned sat
[2023-03-18 21:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:05:06] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-18 21:05:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-18 21:05:06] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:06] [INFO ] Invariant cache hit.
[2023-03-18 21:05:06] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-18 21:05:06] [INFO ] Invariant cache hit.
[2023-03-18 21:05:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-18 21:05:07] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 21:05:07] [INFO ] Invariant cache hit.
[2023-03-18 21:05:07] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
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 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2023-03-18 21:05:08] [INFO ] Invariant cache hit.
[2023-03-18 21:05:08] [INFO ] [Real]Absence check using 108 positive place invariants in 24 ms returned sat
[2023-03-18 21:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:05:08] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-18 21:05:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:05:09] [INFO ] [Nat]Absence check using 108 positive place invariants in 63 ms returned sat
[2023-03-18 21:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:05:09] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2023-03-18 21:05:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 21:05:09] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5263 reset in 2211 ms.
Product exploration explored 100000 steps with 5263 reset in 2340 ms.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:14] [INFO ] Invariant cache hit.
[2023-03-18 21:05:14] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-18 21:05:14] [INFO ] Invariant cache hit.
[2023-03-18 21:05:14] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-18 21:05:14] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 21:05:14] [INFO ] Invariant cache hit.
[2023-03-18 21:05:14] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 324/324 places, 216/216 transitions.
Treatment of property Sudoku-COL-AN06-LTLCardinality-00 finished in 16331 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 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2023-03-18 21:05:14] [INFO ] Computed 17 place invariants in 9 ms
[2023-03-18 21:05:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 21:05:14] [INFO ] Invariant cache hit.
[2023-03-18 21:05:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-18 21:05:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 21:05:15] [INFO ] Invariant cache hit.
[2023-03-18 21:05:15] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s10...], 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 28 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-01 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((!p1&&X(!p0))))))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2023-03-18 21:05:15] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-18 21:05:15] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 21:05:15] [INFO ] Invariant cache hit.
[2023-03-18 21:05:15] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-18 21:05:15] [INFO ] Invariant cache hit.
[2023-03-18 21:05:15] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-03 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2023-03-18 21:05:15] [INFO ] Computed 17 place invariants in 8 ms
[2023-03-18 21:05:15] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 21:05:15] [INFO ] Invariant cache hit.
[2023-03-18 21:05:15] [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 21:05:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:16] [INFO ] Invariant cache hit.
[2023-03-18 21:05:16] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1171 steps with 37 reset in 21 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-04 finished in 420 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 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2023-03-18 21:05:16] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-18 21:05:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 21:05:16] [INFO ] Invariant cache hit.
[2023-03-18 21:05:16] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-18 21:05:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:16] [INFO ] Invariant cache hit.
[2023-03-18 21:05:16] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s6...], 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 1010 steps with 31 reset in 36 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-05 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:16] [INFO ] Invariant cache hit.
[2023-03-18 21:05:16] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 21:05:16] [INFO ] Invariant cache hit.
[2023-03-18 21:05:17] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-18 21:05:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 21:05:17] [INFO ] Invariant cache hit.
[2023-03-18 21:05:17] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 398 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (LEQ 2 (ADD s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5000 reset in 3101 ms.
Product exploration explored 100000 steps with 5000 reset in 3116 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (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 8 factoid took 344 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 320 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:05:24] [INFO ] Invariant cache hit.
[2023-03-18 21:05:25] [INFO ] [Real]Absence check using 108 positive place invariants in 36 ms returned sat
[2023-03-18 21:05:25] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:05:25] [INFO ] [Nat]Absence check using 108 positive place invariants in 26 ms returned sat
[2023-03-18 21:05:25] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:05:25] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-18 21:05:25] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 400 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 39 ms :[true, (AND (NOT p1) (NOT p0))]
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:26] [INFO ] Invariant cache hit.
[2023-03-18 21:05:26] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-18 21:05:26] [INFO ] Invariant cache hit.
[2023-03-18 21:05:26] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-18 21:05:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:26] [INFO ] Invariant cache hit.
[2023-03-18 21:05:26] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (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 8 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 317 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:05:27] [INFO ] Invariant cache hit.
[2023-03-18 21:05:28] [INFO ] [Real]Absence check using 108 positive place invariants in 185 ms returned sat
[2023-03-18 21:05:28] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:05:28] [INFO ] [Nat]Absence check using 108 positive place invariants in 24 ms returned sat
[2023-03-18 21:05:28] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:05:28] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-18 21:05:28] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 40 ms :[true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 55 ms :[true, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5000 reset in 2899 ms.
Product exploration explored 100000 steps with 5000 reset in 2924 ms.
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:35] [INFO ] Invariant cache hit.
[2023-03-18 21:05:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 21:05:35] [INFO ] Invariant cache hit.
[2023-03-18 21:05:35] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-18 21:05:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:35] [INFO ] Invariant cache hit.
[2023-03-18 21:05:35] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 324/324 places, 216/216 transitions.
Treatment of property Sudoku-COL-AN06-LTLCardinality-08 finished in 18725 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 (p1&&F(p2)))))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:35] [INFO ] Invariant cache hit.
[2023-03-18 21:05:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 21:05:35] [INFO ] Invariant cache hit.
[2023-03-18 21:05:35] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-18 21:05:35] [INFO ] Invariant cache hit.
[2023-03-18 21:05:35] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT 3 (ADD s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-09 finished in 583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2023-03-18 21:05:36] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-18 21:05:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 21:05:36] [INFO ] Invariant cache hit.
[2023-03-18 21:05:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-18 21:05:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:36] [INFO ] Invariant cache hit.
[2023-03-18 21:05:36] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 55531 steps with 1769 reset in 714 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-10 finished in 1126 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))))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:37] [INFO ] Invariant cache hit.
[2023-03-18 21:05:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-18 21:05:37] [INFO ] Invariant cache hit.
[2023-03-18 21:05:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-18 21:05:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:37] [INFO ] Invariant cache hit.
[2023-03-18 21:05:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=2, 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 3184 reset in 1485 ms.
Product exploration explored 100000 steps with 3185 reset in 1535 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 476 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 316 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:05:41] [INFO ] Invariant cache hit.
[2023-03-18 21:05:41] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-18 21:05:41] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 21:05:41] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-18 21:05:42] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 21:05:42] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-18 21:05:42] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 12 factoid took 540 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-12 finished in 5669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 4 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:42] [INFO ] Invariant cache hit.
[2023-03-18 21:05:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 21:05:42] [INFO ] Invariant cache hit.
[2023-03-18 21:05:43] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-18 21:05:43] [INFO ] Invariant cache hit.
[2023-03-18 21:05:43] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1631 ms.
Product exploration explored 100000 steps with 50000 reset in 1650 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-14 finished in 3880 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 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:46] [INFO ] Invariant cache hit.
[2023-03-18 21:05:46] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 21:05:46] [INFO ] Invariant cache hit.
[2023-03-18 21:05:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-18 21:05:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 21:05:46] [INFO ] Invariant cache hit.
[2023-03-18 21:05:47] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN06-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:(GT 1 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s10...], 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 3191 reset in 1269 ms.
Product exploration explored 100000 steps with 3186 reset in 1293 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 141 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 32 ms :[p0]
Incomplete random walk after 10000 steps, including 317 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1542629 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :{}
Probabilistic random walk after 1542629 steps, saw 237068 distinct states, run finished after 3004 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:05:53] [INFO ] Invariant cache hit.
[2023-03-18 21:05:53] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-18 21:05:53] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:05:53] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-18 21:05:53] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:05:53] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-18 21:05:53] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
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 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Stuttering acceptance computed with spot in 27 ms :[p0]
Support contains 36 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 21:05:53] [INFO ] Invariant cache hit.
[2023-03-18 21:05:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 21:05:54] [INFO ] Invariant cache hit.
[2023-03-18 21:05:54] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-18 21:05:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 21:05:54] [INFO ] Invariant cache hit.
[2023-03-18 21:05:54] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Incomplete random walk after 10000 steps, including 318 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1577839 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1577839 steps, saw 241620 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:05:57] [INFO ] Invariant cache hit.
[2023-03-18 21:05:57] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-18 21:05:57] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:05:58] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-18 21:05:58] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:05:58] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-18 21:05:58] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
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 211 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Stuttering criterion allowed to conclude after 26629 steps with 847 reset in 336 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-15 finished in 12188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
[2023-03-18 21:05:59] [INFO ] Flatten gal took : 37 ms
[2023-03-18 21:05:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 27 ms.
[2023-03-18 21:05:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 324 places, 216 transitions and 864 arcs took 15 ms.
Total runtime 65763 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1317/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1317/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 16065936 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16114604 kB
Could not compute solution for formula : Sudoku-COL-AN06-LTLCardinality-00
Could not compute solution for formula : Sudoku-COL-AN06-LTLCardinality-08

BK_STOP 1679175911911

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Sudoku-COL-AN06-LTLCardinality-00
ltl formula formula --ltl=/tmp/1317/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 324 places, 216 transitions and 864 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (!prev)
ltl formula name Sudoku-COL-AN06-LTLCardinality-08
ltl formula formula --ltl=/tmp/1317/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 324 places, 216 transitions and 864 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1317/ltl_1_
Killing (15) : 1335 1336 1337 1338 1339
Killing (9) : 1335 1336 1337 1338 1339

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-AN06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912706200043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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