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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 09:33 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.6K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679203178858

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 05:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 05:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:19:40] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 05:19:40] [INFO ] Transformed 4 places.
[2023-03-19 05:19:40] [INFO ] Transformed 1 transitions.
[2023-03-19 05:19:40] [INFO ] Found NUPN structural information;
[2023-03-19 05:19:40] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2023-03-19 05:19:40] [INFO ] Parsed PT model containing 4 places and 1 transitions and 4 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 7 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2023-03-19 05:19:40] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-19 05:19:40] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-19 05:19:40] [INFO ] Invariant cache hit.
[2023-03-19 05:19:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-19 05:19:40] [INFO ] Invariant cache hit.
[2023-03-19 05:19:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 4/4 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-19 05:19:41] [INFO ] Flatten gal took : 10 ms
[2023-03-19 05:19:41] [INFO ] Flatten gal took : 2 ms
[2023-03-19 05:19:41] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 05:19:41] [INFO ] Invariant cache hit.
[2023-03-19 05:19:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 05:19:41] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-19 05:19:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 05:19:41] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
FORMULA Sudoku-PT-AN01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-19 05:19:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 05:19:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 05:19:42] [INFO ] Invariant cache hit.
[2023-03-19 05:19:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-19 05:19:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:42] [INFO ] Invariant cache hit.
[2023-03-19 05:19:42] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-07 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 (NEQ s0 0) (NEQ s1 1))], 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 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 266 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 55 ms :[(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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 05:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:19:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-19 05:19:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 05:19:43] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:43] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 05:19:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 05:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:19:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-19 05:19:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 05:19:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-19 05:19:43] [INFO ] Invariant cache hit.
[2023-03-19 05:19:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-19 05:19:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:44] [INFO ] Invariant cache hit.
[2023-03-19 05:19:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property Sudoku-PT-AN01-LTLCardinality-07 finished in 2007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (X((p1&&F(p2))) U G(p2))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-19 05:19:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 05:19:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 05:19:44] [INFO ] Invariant cache hit.
[2023-03-19 05:19:44] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 05:19:44] [INFO ] Invariant cache hit.
[2023-03-19 05:19:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 3/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s0 0) (EQ s1 1)), p0:(OR (EQ s2 0) (EQ s1 1)), p1:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1708 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (OR (AND p2 (NOT p1)) (AND (NOT p2) p1)), (NOT p2), true, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 05:19:47] [INFO ] Invariant cache hit.
[2023-03-19 05:19:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 05:19:47] [INFO ] After 30ms SMT Verify possible using all constraints in real 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 (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) p0))), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (OR (AND p2 p0) (AND p1 p0))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 1631 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-19 05:19:49] [INFO ] Invariant cache hit.
[2023-03-19 05:19:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 05:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:19:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-19 05:19:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 05:19:49] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-19 05:19:49] [INFO ] Invariant cache hit.
[2023-03-19 05:19:49] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-19 05:19:49] [INFO ] Invariant cache hit.
[2023-03-19 05:19:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-19 05:19:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:49] [INFO ] Invariant cache hit.
[2023-03-19 05:19:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 3/3 places, 1/1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 348 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter insensitive) to 6 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:19:50] [INFO ] Invariant cache hit.
[2023-03-19 05:19:50] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:19:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 05:19:50] [INFO ] After 22ms SMT Verify possible using all constraints in natural 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 p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 371 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter insensitive) to 6 states, 12 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[p1, true, p1, true, p1, p1]
Stuttering acceptance computed with spot in 155 ms :[p1, true, p1, true, p1, p1]
[2023-03-19 05:19:51] [INFO ] Invariant cache hit.
[2023-03-19 05:19:51] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 05:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:19:51] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-19 05:19:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 05:19:51] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 175 ms :[p1, true, p1, true, p1, p1]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-19 05:19:51] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 05:19:51] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 05:19:51] [INFO ] Invariant cache hit.
[2023-03-19 05:19:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-19 05:19:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:51] [INFO ] Invariant cache hit.
[2023-03-19 05:19:51] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 2/3 places, 1/1 transitions.
Treatment of property Sudoku-PT-AN01-LTLCardinality-08 finished in 7745 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' '!((!p0 U (X((p1&&F(p2))) U G(p2))))'
Found a Lengthening insensitive property : Sudoku-PT-AN01-LTLCardinality-08
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p2) p1)]
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-19 05:19:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 05:19:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 05:19:52] [INFO ] Invariant cache hit.
[2023-03-19 05:19:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-19 05:19:52] [INFO ] Invariant cache hit.
[2023-03-19 05:19:52] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 59 ms. Remains : 3/4 places, 1/1 transitions.
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s0 0) (EQ s1 1)), p0:(OR (EQ s2 0) (EQ s1 1)), p1:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1707 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (AND p2 (NOT p1)) (AND (NOT p2) p1)), (NOT p2), true, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 05:19:54] [INFO ] Invariant cache hit.
[2023-03-19 05:19:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 05:19:54] [INFO ] After 18ms SMT Verify possible using all constraints in real 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 (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) p0))), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (OR (AND p2 p0) (AND p1 p0))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 1376 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-19 05:19:56] [INFO ] Invariant cache hit.
[2023-03-19 05:19:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 05:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:19:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-19 05:19:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 05:19:56] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-19 05:19:56] [INFO ] Invariant cache hit.
[2023-03-19 05:19:56] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-19 05:19:56] [INFO ] Invariant cache hit.
[2023-03-19 05:19:56] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-19 05:19:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:56] [INFO ] Invariant cache hit.
[2023-03-19 05:19:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 3/3 places, 1/1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
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) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 311 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter insensitive) to 6 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:19:57] [INFO ] Invariant cache hit.
[2023-03-19 05:19:57] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:19:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 05:19:57] [INFO ] After 17ms SMT Verify possible using all constraints in natural 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 p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 491 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter insensitive) to 6 states, 12 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[p1, true, p1, true, p1, p1]
Stuttering acceptance computed with spot in 172 ms :[p1, true, p1, true, p1, p1]
[2023-03-19 05:19:58] [INFO ] Invariant cache hit.
[2023-03-19 05:19:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 05:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 05:19:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-19 05:19:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-19 05:19:58] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 172 ms :[p1, true, p1, true, p1, p1]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-19 05:19:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 05:19:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 05:19:58] [INFO ] Invariant cache hit.
[2023-03-19 05:19:58] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-19 05:19:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:19:58] [INFO ] Invariant cache hit.
[2023-03-19 05:19:58] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 2/3 places, 1/1 transitions.
Treatment of property Sudoku-PT-AN01-LTLCardinality-08 finished in 6767 ms.
[2023-03-19 05:19:58] [INFO ] Flatten gal took : 6 ms
[2023-03-19 05:19:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 05:19:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 1 transitions and 4 arcs took 0 ms.
Total runtime 18376 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1613/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1613/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Sudoku-PT-AN01-LTLCardinality-07
Could not compute solution for formula : Sudoku-PT-AN01-LTLCardinality-08

BK_STOP 1679203200143

--------------------
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-PT-AN01-LTLCardinality-07
ltl formula formula --ltl=/tmp/1613/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 4 places, 1 transitions and 4 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1613/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1613/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1613/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1613/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Sudoku-PT-AN01-LTLCardinality-08
ltl formula formula --ltl=/tmp/1613/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: =============================================================================
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
pnml2lts-mc( 0/ 4): Petri net has 4 places, 1 transitions and 4 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1613/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1613/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1613/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1613/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-AN01, 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-167912706400163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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