About the Execution of LTSMin+red for Sudoku-PT-AN02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 464.235 | 11485.00 | 17832.00 | 384.00 | FTTFTTTFFFFFFTTT | normal |
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-167912706400172.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-AN02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706400172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 12K Feb 26 09:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 09:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:02 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 6.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 26 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 26 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:16 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 7.4K 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-AN02-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679203300806
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 05:21:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 05:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:21:42] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-19 05:21:42] [INFO ] Transformed 20 places.
[2023-03-19 05:21:42] [INFO ] Transformed 8 transitions.
[2023-03-19 05:21:42] [INFO ] Parsed PT model containing 20 places and 8 transitions and 32 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 9 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-19 05:21:42] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-19 05:21:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-19 05:21:42] [INFO ] Invariant cache hit.
[2023-03-19 05:21:42] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-19 05:21:42] [INFO ] Invariant cache hit.
[2023-03-19 05:21:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 12/20 places, 8/8 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-19 05:21:43] [INFO ] Flatten gal took : 15 ms
[2023-03-19 05:21:43] [INFO ] Flatten gal took : 5 ms
[2023-03-19 05:21:43] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 18 steps, including 4 resets, run visited all 10 properties in 18 ms. (steps per millisecond=1 )
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:43] [INFO ] Invariant cache hit.
[2023-03-19 05:21:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 05:21:43] [INFO ] Invariant cache hit.
[2023-03-19 05:21:43] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-19 05:21:43] [INFO ] Invariant cache hit.
[2023-03-19 05:21:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 6 reset in 4 ms.
FORMULA Sudoku-PT-AN02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLFireability-00 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&X(F(!p0)))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:43] [INFO ] Invariant cache hit.
[2023-03-19 05:21:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 05:21:43] [INFO ] Invariant cache hit.
[2023-03-19 05:21:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-19 05:21:43] [INFO ] Invariant cache hit.
[2023-03-19 05:21:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, true, true]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22246 reset in 260 ms.
Product exploration explored 100000 steps with 22242 reset in 147 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN02-LTLFireability-01 finished in 989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:44] [INFO ] Invariant cache hit.
[2023-03-19 05:21:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:21:44] [INFO ] Invariant cache hit.
[2023-03-19 05:21:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 05:21:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:21:44] [INFO ] Invariant cache hit.
[2023-03-19 05:21:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-02 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 s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 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 22254 reset in 137 ms.
Product exploration explored 100000 steps with 22186 reset in 140 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN02-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN02-LTLFireability-02 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:45] [INFO ] Invariant cache hit.
[2023-03-19 05:21:45] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 05:21:45] [INFO ] Invariant cache hit.
[2023-03-19 05:21:45] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-19 05:21:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:21:45] [INFO ] Invariant cache hit.
[2023-03-19 05:21:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22211 reset in 83 ms.
Product exploration explored 100000 steps with 22234 reset in 87 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN02-LTLFireability-06 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&G(F(p0)))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:45] [INFO ] Invariant cache hit.
[2023-03-19 05:21:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 05:21:45] [INFO ] Invariant cache hit.
[2023-03-19 05:21:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 05:21:45] [INFO ] Invariant cache hit.
[2023-03-19 05:21:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLFireability-07 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U G((p0 U p1)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:46] [INFO ] Invariant cache hit.
[2023-03-19 05:21:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 05:21:46] [INFO ] Invariant cache hit.
[2023-03-19 05:21:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-19 05:21:46] [INFO ] Invariant cache hit.
[2023-03-19 05:21:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 516 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(OR p1 p0), acceptance={} source=5 dest: 9}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=p0, acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)), p0:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLFireability-08 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:46] [INFO ] Invariant cache hit.
[2023-03-19 05:21:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 05:21:46] [INFO ] Invariant cache hit.
[2023-03-19 05:21:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 05:21:46] [INFO ] Invariant cache hit.
[2023-03-19 05:21:46] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s6 1) (GEQ s9 1) (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)), p0:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLFireability-09 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((!p1&&X(p2)))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1)), p1:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)), p2:(OR (LT s3 1) (LT s7 1) (LT s11 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLFireability-11 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-12 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:(OR (LT s0 1) (LT s5 1) (LT s10 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 6 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLFireability-12 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-19 05:21:47] [INFO ] Invariant cache hit.
[2023-03-19 05:21:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-13 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 (LT s0 1) (LT s5 1) (LT s10 1) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s11 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 42626 reset in 104 ms.
Product exploration explored 100000 steps with 42765 reset in 81 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN02-LTLFireability-13 finished in 540 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((F(p0)&&(p1 U p2)))||G(p3)))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:48] [INFO ] Invariant cache hit.
[2023-03-19 05:21:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 05:21:48] [INFO ] Invariant cache hit.
[2023-03-19 05:21:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-19 05:21:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:21:48] [INFO ] Invariant cache hit.
[2023-03-19 05:21:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=5 dest: 5}]], initial=5, aps=[p2:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)), p1:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)), p0:(OR (LT s0 1) (LT s5 1) (LT s10 1)), p3:(AND (GEQ s1 1) (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 36033 reset in 143 ms.
Product exploration explored 100000 steps with 35931 reset in 147 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p1) p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p1) p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND (NOT p0) p3)), (X (NOT (AND (NOT p0) p3))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) p1 (NOT p3))), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) p1 (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 18 factoid took 1604 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN02-LTLFireability-14 finished in 2346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-19 05:21:50] [INFO ] Invariant cache hit.
[2023-03-19 05:21:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 05:21:50] [INFO ] Invariant cache hit.
[2023-03-19 05:21:50] [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.
[2023-03-19 05:21:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 05:21:50] [INFO ] Invariant cache hit.
[2023-03-19 05:21:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLFireability-15 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 (LT s0 1) (LT s4 1) (LT s8 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 22230 reset in 104 ms.
Product exploration explored 100000 steps with 22261 reset in 112 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN02-LTLFireability-15 finished in 533 ms.
All properties solved by simple procedures.
Total runtime 8730 ms.
ITS solved all properties within timeout
BK_STOP 1679203312291
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
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-AN02"
export BK_EXAMINATION="LTLFireability"
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-AN02, 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 r489-tall-167912706400172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 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 ;