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.r485-tall-167912698800036.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 itstools
Input is Sudoku-COL-AN05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698800036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679146454016

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-18 13:34:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 13:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:34:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 13:34:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 13:34:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2023-03-18 13:34:16] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 13:34:16] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 13:34:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2023-03-18 13:34:16] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 11 ms.
[2023-03-18 13:34:16] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 9 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2023-03-18 13:34:16] [INFO ] Computed 14 place invariants in 17 ms
[2023-03-18 13:34:16] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-18 13:34:16] [INFO ] Invariant cache hit.
[2023-03-18 13:34:16] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-18 13:34:16] [INFO ] Invariant cache hit.
[2023-03-18 13:34:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 75/200 places, 125/125 transitions.
Support contains 75 out of 75 places after structural reductions.
[2023-03-18 13:34:16] [INFO ] Flatten gal took : 45 ms
[2023-03-18 13:34:17] [INFO ] Flatten gal took : 45 ms
[2023-03-18 13:34:17] [INFO ] Input system was already deterministic with 125 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=1 )
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:17] [INFO ] Invariant cache hit.
[2023-03-18 13:34:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 13:34:17] [INFO ] Invariant cache hit.
[2023-03-18 13:34:17] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 13:34:17] [INFO ] Invariant cache hit.
[2023-03-18 13:34:17] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 952 ms.
Product exploration explored 100000 steps with 50000 reset in 872 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-00 finished in 2654 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 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:20] [INFO ] Invariant cache hit.
[2023-03-18 13:34:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 13:34:20] [INFO ] Invariant cache hit.
[2023-03-18 13:34:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-18 13:34:20] [INFO ] Invariant cache hit.
[2023-03-18 13:34:20] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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 21 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-01 finished in 275 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 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:20] [INFO ] Invariant cache hit.
[2023-03-18 13:34:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 13:34:20] [INFO ] Invariant cache hit.
[2023-03-18 13:34:20] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 13:34:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 13:34:20] [INFO ] Invariant cache hit.
[2023-03-18 13:34:20] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-02 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 s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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 4548 reset in 924 ms.
Product exploration explored 100000 steps with 4552 reset in 930 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 185 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-COL-AN05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-02 finished in 2356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:22] [INFO ] Invariant cache hit.
[2023-03-18 13:34:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 13:34:22] [INFO ] Invariant cache hit.
[2023-03-18 13:34:22] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-18 13:34:22] [INFO ] Invariant cache hit.
[2023-03-18 13:34:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-03 finished in 261 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(F(!p0)))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:23] [INFO ] Invariant cache hit.
[2023-03-18 13:34:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 13:34:23] [INFO ] Invariant cache hit.
[2023-03-18 13:34:23] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-18 13:34:23] [INFO ] Invariant cache hit.
[2023-03-18 13:34:23] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=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:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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]]
Product exploration explored 100000 steps with 25000 reset in 1235 ms.
Product exploration explored 100000 steps with 25000 reset in 1265 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, p0]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0]
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:26] [INFO ] Invariant cache hit.
[2023-03-18 13:34:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 13:34:26] [INFO ] Invariant cache hit.
[2023-03-18 13:34:26] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 13:34:26] [INFO ] Invariant cache hit.
[2023-03-18 13:34:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, p0]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 25000 reset in 1300 ms.
Product exploration explored 100000 steps with 25000 reset in 1347 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, p0]
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 13:34:30] [INFO ] Invariant cache hit.
[2023-03-18 13:34:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10014953354867597959
[2023-03-18 13:34:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10014953354867597959
Running compilation step : cd /tmp/ltsmin10014953354867597959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 364 ms.
Running link step : cd /tmp/ltsmin10014953354867597959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10014953354867597959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7992691316736184874.hoa' '--buchi-type=spotba'
LTSmin run took 3154 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN05-LTLFireability-04 finished in 11571 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)&&G(F(p0))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:34] [INFO ] Invariant cache hit.
[2023-03-18 13:34:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 13:34:34] [INFO ] Invariant cache hit.
[2023-03-18 13:34:34] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 13:34:34] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 13:34:34] [INFO ] Invariant cache hit.
[2023-03-18 13:34:34] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4546 reset in 804 ms.
Product exploration explored 100000 steps with 4549 reset in 832 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (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 5 factoid took 131 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-07 finished in 2191 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 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:36] [INFO ] Invariant cache hit.
[2023-03-18 13:34:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 13:34:36] [INFO ] Invariant cache hit.
[2023-03-18 13:34:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-18 13:34:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 13:34:36] [INFO ] Invariant cache hit.
[2023-03-18 13:34:36] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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 4552 reset in 800 ms.
Product exploration explored 100000 steps with 4545 reset in 823 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 210 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-COL-AN05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-09 finished in 2122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:38] [INFO ] Invariant cache hit.
[2023-03-18 13:34:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 13:34:38] [INFO ] Invariant cache hit.
[2023-03-18 13:34:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-18 13:34:39] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 13:34:39] [INFO ] Invariant cache hit.
[2023-03-18 13:34:39] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4547 reset in 804 ms.
Product exploration explored 100000 steps with 4546 reset in 823 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-10 finished in 2076 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((G(!p0)||G(F(p0))))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:41] [INFO ] Invariant cache hit.
[2023-03-18 13:34:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 13:34:41] [INFO ] Invariant cache hit.
[2023-03-18 13:34:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-18 13:34:41] [INFO ] Invariant cache hit.
[2023-03-18 13:34:41] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 211 ms :[false, false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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]]
Product exploration explored 100000 steps with 4552 reset in 934 ms.
Product exploration explored 100000 steps with 4544 reset in 898 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-11 finished in 2355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!p0))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:43] [INFO ] Invariant cache hit.
[2023-03-18 13:34:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 13:34:43] [INFO ] Invariant cache hit.
[2023-03-18 13:34:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-18 13:34:43] [INFO ] Invariant cache hit.
[2023-03-18 13:34:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 914 ms.
Product exploration explored 100000 steps with 50000 reset in 942 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLFireability-12 finished in 2266 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 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:34:45] [INFO ] Invariant cache hit.
[2023-03-18 13:34:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 13:34:45] [INFO ] Invariant cache hit.
[2023-03-18 13:34:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-18 13:34:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:34:45] [INFO ] Invariant cache hit.
[2023-03-18 13:34:45] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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 19 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLFireability-13 finished in 189 ms.
All properties solved by simple procedures.
Total runtime 30349 ms.

BK_STOP 1679146487135

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN05"
export BK_EXAMINATION="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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN05, 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 r485-tall-167912698800036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN05.tgz
mv Sudoku-COL-AN05 execution
cd execution
if [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;