About the Execution of ITS-Tools for Sudoku-PT-AN03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 344.539 | 12551.00 | 21856.00 | 169.80 | FTTTFFTTTFTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545400220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 31K Apr 30 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 199K Apr 30 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 30 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 30 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 21K May 10 09:34 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-AN03-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653092035294
Running Version 202205111006
[2022-05-21 00:13:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 00:13:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 00:13:56] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2022-05-21 00:13:56] [INFO ] Transformed 54 places.
[2022-05-21 00:13:56] [INFO ] Transformed 27 transitions.
[2022-05-21 00:13:56] [INFO ] Parsed PT model containing 54 places and 27 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-AN03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 9 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:56] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-21 00:13:56] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:56] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-21 00:13:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:56] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-21 00:13:57] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
Support contains 27 out of 27 places after structural reductions.
[2022-05-21 00:13:57] [INFO ] Flatten gal took : 20 ms
[2022-05-21 00:13:57] [INFO ] Flatten gal took : 11 ms
[2022-05-21 00:13:57] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 9 steps, including 1 resets, run visited all 9 properties in 11 ms. (steps per millisecond=0 )
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&p0))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:57] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1...], 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 282 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN03-LTLFireability-02 finished in 1065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((X(p1)&&p0))))&&G(X(p1))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:58] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:58] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 00:13:58] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:58] [INFO ] Computed 8 place invariants in 4 ms
[2022-05-21 00:13:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLFireability-04 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(F(p0)) U F(G(p0)))&&X(p0)))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:58] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:58] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 00:13:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-21 00:13:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:58] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-21 00:13:59] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-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:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1...], 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 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLFireability-05 finished in 172 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(G(X((G(!p0) U !p0))))))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:59] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:59] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-21 00:13:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 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 11750 reset in 407 ms.
Product exploration explored 100000 steps with 11754 reset in 344 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN03-LTLFireability-06 finished in 1093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(p0))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:00] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:00] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:00] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-21 00:14:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:00] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-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 (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 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 11748 reset in 275 ms.
Product exploration explored 100000 steps with 11756 reset in 279 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN03-LTLFireability-07 finished in 842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(F(G(p0)) U p1)&&G(p2))))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:01] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-05-21 00:14:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p2) p1), (AND p0 p1), (NOT p2), (AND p0 p1), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 0}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(OR p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1) p2), acceptance={1} source=5 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1) (NOT (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)))), p2:(OR (LT s0 1) (LT s11 1) (LT s24 1) (LT s2 1) (LT s9 1) (LT s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 12540 reset in 255 ms.
Product exploration explored 100000 steps with 12504 reset in 261 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p2), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 897 ms. Reduced automaton from 8 states, 27 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p2) p1), (NOT p2)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p2)), (X p2), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (AND (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 989 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p2) p1), (NOT p2)]
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:04] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:04] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-21 00:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 00:14:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-21 00:14:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 00:14:04] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-21 00:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 00:14:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 00:14:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 00:14:04] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:04] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:04] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:04] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-21 00:14:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:04] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X p2), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p2) p1), (NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X p2), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 399 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p2) p1), (NOT p2)]
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:05] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:05] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-21 00:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 00:14:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 00:14:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 00:14:05] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-21 00:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 00:14:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-21 00:14:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 00:14:05] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p2) p1), (NOT p2)]
Product exploration explored 100000 steps with 11737 reset in 305 ms.
Product exploration explored 100000 steps with 11736 reset in 216 ms.
Built C files in :
/tmp/ltsmin2406228874377628788
[2022-05-21 00:14:06] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2022-05-21 00:14:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:14:06] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2022-05-21 00:14:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:14:06] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2022-05-21 00:14:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:14:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2406228874377628788
Running compilation step : cd /tmp/ltsmin2406228874377628788;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin2406228874377628788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2406228874377628788;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5815941489538802253.hoa' '--buchi-type=spotba'
LTSmin run took 409 ms.
FORMULA Sudoku-PT-AN03-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-PT-AN03-LTLFireability-08 finished in 5800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:06] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:06] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:06] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-21 00:14:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:06] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)), p0:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLFireability-09 finished in 190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(p2))))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:06] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:07] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:07] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:07] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:07] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)), p0:(AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)), p2:(AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLFireability-11 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:07] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:14:07] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:07] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:14:07] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:14:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLFireability-14 finished in 191 ms.
All properties solved by simple procedures.
Total runtime 11021 ms.
BK_STOP 1653092047845
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-AN03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545400220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN03.tgz
mv Sudoku-PT-AN03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;