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-167912698900076.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-AN10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698900076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 09:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 09:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 09:49 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-AN10-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679157358074

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-AN10
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-18 16:35:59] [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 16:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 16:35:59] [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 16:35:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 16:36:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 717 ms
[2023-03-18 16:36:00] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 16:36:00] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 16:36:00] [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(10), N(10)] of place Rows breaks symmetries in sort N
[2023-03-18 16:36:00] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 32 ms.
[2023-03-18 16:36:00] [INFO ] Unfolded 16 HLPN properties in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 31 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2023-03-18 16:36:01] [INFO ] Computed 29 place invariants in 68 ms
[2023-03-18 16:36:02] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-18 16:36:02] [INFO ] Invariant cache hit.
[2023-03-18 16:36:02] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-18 16:36:02] [INFO ] Invariant cache hit.
[2023-03-18 16:36:02] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 300/1300 places, 1000/1000 transitions.
Support contains 300 out of 300 places after structural reductions.
[2023-03-18 16:36:03] [INFO ] Flatten gal took : 263 ms
[2023-03-18 16:36:05] [INFO ] Flatten gal took : 285 ms
[2023-03-18 16:36:07] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 88 steps, including 0 resets, run visited all 2 properties in 58 ms. (steps per millisecond=1 )
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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(p0)))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:36:08] [INFO ] Invariant cache hit.
[2023-03-18 16:36:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 16:36:08] [INFO ] Invariant cache hit.
[2023-03-18 16:36:08] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-18 16:36:08] [INFO ] Invariant cache hit.
[2023-03-18 16:36:08] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 8915 ms.
Product exploration explored 100000 steps with 50000 reset in 9010 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-00 finished in 23364 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:36:31] [INFO ] Invariant cache hit.
[2023-03-18 16:36:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 16:36:31] [INFO ] Invariant cache hit.
[2023-03-18 16:36:31] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-18 16:36:31] [INFO ] Invariant cache hit.
[2023-03-18 16:36:31] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-01 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:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], 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 8882 ms.
Product exploration explored 100000 steps with 50000 reset in 8939 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 83 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-AN10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-01 finished in 22924 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)&&F(!p0))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:36:54] [INFO ] Invariant cache hit.
[2023-03-18 16:36:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 16:36:54] [INFO ] Invariant cache hit.
[2023-03-18 16:36:54] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-18 16:36:54] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-18 16:36:54] [INFO ] Invariant cache hit.
[2023-03-18 16:36:55] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1147 reset in 5793 ms.
Product exploration explored 100000 steps with 1145 reset in 5846 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:37:11] [INFO ] Invariant cache hit.
[2023-03-18 16:37:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 16:37:11] [INFO ] Invariant cache hit.
[2023-03-18 16:37:11] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-18 16:37:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-18 16:37:12] [INFO ] Invariant cache hit.
[2023-03-18 16:37:12] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 300/300 places, 1000/1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 9 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-02 finished in 23005 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:37:17] [INFO ] Invariant cache hit.
[2023-03-18 16:37:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 16:37:17] [INFO ] Invariant cache hit.
[2023-03-18 16:37:17] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-18 16:37:17] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 16:37:17] [INFO ] Invariant cache hit.
[2023-03-18 16:37:17] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-03 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:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-03 finished in 706 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:37:18] [INFO ] Invariant cache hit.
[2023-03-18 16:37:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 16:37:18] [INFO ] Invariant cache hit.
[2023-03-18 16:37:18] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-18 16:37:18] [INFO ] Invariant cache hit.
[2023-03-18 16:37:18] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-04 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 (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 85 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-04 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(p1 U !p0)) U X(G(!p0))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:37:18] [INFO ] Invariant cache hit.
[2023-03-18 16:37:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 16:37:18] [INFO ] Invariant cache hit.
[2023-03-18 16:37:19] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-18 16:37:19] [INFO ] Invariant cache hit.
[2023-03-18 16:37:19] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 170 ms :[p0, true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1147 reset in 6570 ms.
Product exploration explored 100000 steps with 1146 reset in 6622 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 375 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0, true]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 8731 steps, including 2 resets, run timeout after 5483 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-18 16:37:44] [INFO ] Invariant cache hit.
[2023-03-18 16:37:49] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 433 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, true]
[2023-03-18 16:37:51] [INFO ] Invariant cache hit.
Could not prove EG p0
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:38:06] [INFO ] Invariant cache hit.
[2023-03-18 16:38:06] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-18 16:38:06] [INFO ] Invariant cache hit.
[2023-03-18 16:38:06] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-18 16:38:06] [INFO ] Invariant cache hit.
[2023-03-18 16:38:06] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 300/300 places, 1000/1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0, true]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0, true]
[2023-03-18 16:38:13] [INFO ] Invariant cache hit.
Could not prove EG p0
Stuttering acceptance computed with spot in 138 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1146 reset in 6086 ms.
Product exploration explored 100000 steps with 1148 reset in 6088 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0, true]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:38:40] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 16:38:40] [INFO ] Invariant cache hit.
[2023-03-18 16:38:41] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin7233322032321902863
[2023-03-18 16:38:41] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7233322032321902863
Running compilation step : cd /tmp/ltsmin7233322032321902863;'/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 2052 ms.
Running link step : cd /tmp/ltsmin7233322032321902863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin7233322032321902863;'/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/stateBased9512309042124550990.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:38:56] [INFO ] Invariant cache hit.
[2023-03-18 16:38:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 16:38:56] [INFO ] Invariant cache hit.
[2023-03-18 16:38:56] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 16:38:56] [INFO ] Invariant cache hit.
[2023-03-18 16:38:57] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin14310430486015786807
[2023-03-18 16:38:57] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14310430486015786807
Running compilation step : cd /tmp/ltsmin14310430486015786807;'/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 1950 ms.
Running link step : cd /tmp/ltsmin14310430486015786807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14310430486015786807;'/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/stateBased7180914180728996274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 16:39:12] [INFO ] Flatten gal took : 49 ms
[2023-03-18 16:39:12] [INFO ] Flatten gal took : 44 ms
[2023-03-18 16:39:12] [INFO ] Time to serialize gal into /tmp/LTL6706587617695643569.gal : 11 ms
[2023-03-18 16:39:12] [INFO ] Time to serialize properties into /tmp/LTL16310311990464546913.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6706587617695643569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4345730802613181656.hoa' '-atoms' '/tmp/LTL16310311990464546913.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16310311990464546913.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4345730802613181656.hoa
Detected timeout of ITS tools.
[2023-03-18 16:39:28] [INFO ] Flatten gal took : 83 ms
[2023-03-18 16:39:28] [INFO ] Flatten gal took : 82 ms
[2023-03-18 16:39:28] [INFO ] Time to serialize gal into /tmp/LTL12743005532018334994.gal : 6 ms
[2023-03-18 16:39:28] [INFO ] Time to serialize properties into /tmp/LTL18056120800083260877.ltl : 45 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12743005532018334994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18056120800083260877.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)...258546
Formula 0 simplified : (!"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)&&(...258532
Detected timeout of ITS tools.
[2023-03-18 16:39:43] [INFO ] Flatten gal took : 79 ms
[2023-03-18 16:39:43] [INFO ] Applying decomposition
[2023-03-18 16:39:43] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12414416559933377654.txt' '-o' '/tmp/graph12414416559933377654.bin' '-w' '/tmp/graph12414416559933377654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12414416559933377654.bin' '-l' '-1' '-v' '-w' '/tmp/graph12414416559933377654.weights' '-q' '0' '-e' '0.001'
[2023-03-18 16:39:43] [INFO ] Decomposing Gal with order
[2023-03-18 16:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 16:39:43] [INFO ] Removed a total of 2700 redundant transitions.
[2023-03-18 16:39:44] [INFO ] Flatten gal took : 191 ms
[2023-03-18 16:39:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-18 16:39:44] [INFO ] Time to serialize gal into /tmp/LTL16079166621132925090.gal : 19 ms
[2023-03-18 16:39:44] [INFO ] Time to serialize properties into /tmp/LTL5358453884111155285.ltl : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16079166621132925090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5358453884111155285.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Colum...328046
Formula 0 simplified : (!"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Columns_...328032
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1319508629068296236
[2023-03-18 16:39:59] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1319508629068296236
Running compilation step : cd /tmp/ltsmin1319508629068296236;'/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 2615 ms.
Running link step : cd /tmp/ltsmin1319508629068296236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1319508629068296236;'/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' '--ltl' '((((LTLAPp0==true) U !(LTLAPp1==true))&&(LTLAPp1==true)) U X([](!(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLFireability-05 finished in 175680 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&&F(G(p0)))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:14] [INFO ] Invariant cache hit.
[2023-03-18 16:40:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 16:40:14] [INFO ] Invariant cache hit.
[2023-03-18 16:40:14] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-18 16:40:14] [INFO ] Invariant cache hit.
[2023-03-18 16:40:15] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 9 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-06 finished in 845 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:15] [INFO ] Invariant cache hit.
[2023-03-18 16:40:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 16:40:15] [INFO ] Invariant cache hit.
[2023-03-18 16:40:15] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-18 16:40:15] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 16:40:15] [INFO ] Invariant cache hit.
[2023-03-18 16:40:15] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 615 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-07 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 s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 1146 reset in 5868 ms.
Product exploration explored 100000 steps with 1145 reset in 6011 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 106 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-AN10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-07 finished in 16924 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:32] [INFO ] Invariant cache hit.
[2023-03-18 16:40:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-18 16:40:32] [INFO ] Invariant cache hit.
[2023-03-18 16:40:32] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-18 16:40:32] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 16:40:32] [INFO ] Invariant cache hit.
[2023-03-18 16:40:32] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 608 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], 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 1147 reset in 5653 ms.
Product exploration explored 100000 steps with 1146 reset in 5721 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 94 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-AN10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-08 finished in 16445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:48] [INFO ] Invariant cache hit.
[2023-03-18 16:40:48] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 16:40:48] [INFO ] Invariant cache hit.
[2023-03-18 16:40:48] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-18 16:40:48] [INFO ] Invariant cache hit.
[2023-03-18 16:40:49] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-09 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 (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 9 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-09 finished in 709 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))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:49] [INFO ] Invariant cache hit.
[2023-03-18 16:40:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 16:40:49] [INFO ] Invariant cache hit.
[2023-03-18 16:40:49] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-18 16:40:49] [INFO ] Invariant cache hit.
[2023-03-18 16:40:49] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-10 finished in 730 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:50] [INFO ] Invariant cache hit.
[2023-03-18 16:40:50] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 16:40:50] [INFO ] Invariant cache hit.
[2023-03-18 16:40:50] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-18 16:40:50] [INFO ] Invariant cache hit.
[2023-03-18 16:40:50] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-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 (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 87 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-12 finished in 707 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 1 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:50] [INFO ] Invariant cache hit.
[2023-03-18 16:40:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 16:40:50] [INFO ] Invariant cache hit.
[2023-03-18 16:40:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-18 16:40:51] [INFO ] Invariant cache hit.
[2023-03-18 16:40:51] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-14 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:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-14 finished in 666 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 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:40:51] [INFO ] Invariant cache hit.
[2023-03-18 16:40:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 16:40:51] [INFO ] Invariant cache hit.
[2023-03-18 16:40:51] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-18 16:40:51] [INFO ] Invariant cache hit.
[2023-03-18 16:40:52] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-15 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:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], 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 8686 ms.
Product exploration explored 100000 steps with 50000 reset in 8775 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X 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-AN10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-15 finished in 22342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(p1 U !p0)) U X(G(!p0))))'
Found a Lengthening insensitive property : Sudoku-COL-AN10-LTLFireability-05
Stuttering acceptance computed with spot in 130 ms :[p0, true, p0, p0]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:41:14] [INFO ] Invariant cache hit.
[2023-03-18 16:41:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 16:41:14] [INFO ] Invariant cache hit.
[2023-03-18 16:41:14] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-18 16:41:14] [INFO ] Invariant cache hit.
[2023-03-18 16:41:14] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 587 ms. Remains : 300/300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1148 reset in 6605 ms.
Product exploration explored 100000 steps with 1147 reset in 6654 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 310 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0, true]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 7758 steps, including 2 resets, run timeout after 5404 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-18 16:41:39] [INFO ] Invariant cache hit.
[2023-03-18 16:41:44] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 367 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0, true]
[2023-03-18 16:41:46] [INFO ] Invariant cache hit.
Could not prove EG p0
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:42:01] [INFO ] Invariant cache hit.
[2023-03-18 16:42:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 16:42:01] [INFO ] Invariant cache hit.
[2023-03-18 16:42:01] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-18 16:42:01] [INFO ] Invariant cache hit.
[2023-03-18 16:42:01] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 300/300 places, 1000/1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0, true]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0, true]
[2023-03-18 16:42:08] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 16:42:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1150 reset in 5951 ms.
Product exploration explored 100000 steps with 1147 reset in 6015 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0, true]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:42:35] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-18 16:42:35] [INFO ] Invariant cache hit.
[2023-03-18 16:42:35] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin18062967217830025152
[2023-03-18 16:42:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18062967217830025152
Running compilation step : cd /tmp/ltsmin18062967217830025152;'/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 2011 ms.
Running link step : cd /tmp/ltsmin18062967217830025152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18062967217830025152;'/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/stateBased12243728175567618846.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 16:42:50] [INFO ] Invariant cache hit.
[2023-03-18 16:42:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 16:42:51] [INFO ] Invariant cache hit.
[2023-03-18 16:42:51] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-18 16:42:51] [INFO ] Invariant cache hit.
[2023-03-18 16:42:51] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin18037386379449293620
[2023-03-18 16:42:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18037386379449293620
Running compilation step : cd /tmp/ltsmin18037386379449293620;'/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 1957 ms.
Running link step : cd /tmp/ltsmin18037386379449293620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18037386379449293620;'/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/stateBased16529029885670358986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 16:43:06] [INFO ] Flatten gal took : 35 ms
[2023-03-18 16:43:06] [INFO ] Flatten gal took : 35 ms
[2023-03-18 16:43:06] [INFO ] Time to serialize gal into /tmp/LTL13516727955797219151.gal : 4 ms
[2023-03-18 16:43:06] [INFO ] Time to serialize properties into /tmp/LTL148205483695610177.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13516727955797219151.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9688354495984506543.hoa' '-atoms' '/tmp/LTL148205483695610177.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL148205483695610177.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9688354495984506543.hoa
Detected timeout of ITS tools.
[2023-03-18 16:43:22] [INFO ] Flatten gal took : 72 ms
[2023-03-18 16:43:22] [INFO ] Flatten gal took : 75 ms
[2023-03-18 16:43:22] [INFO ] Time to serialize gal into /tmp/LTL9450132304642718484.gal : 5 ms
[2023-03-18 16:43:22] [INFO ] Time to serialize properties into /tmp/LTL18271060531513650553.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9450132304642718484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18271060531513650553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)...258546
Formula 0 simplified : (!"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)&&(...258532
Detected timeout of ITS tools.
[2023-03-18 16:43:37] [INFO ] Flatten gal took : 72 ms
[2023-03-18 16:43:37] [INFO ] Applying decomposition
[2023-03-18 16:43:37] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1697373606495707569.txt' '-o' '/tmp/graph1697373606495707569.bin' '-w' '/tmp/graph1697373606495707569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1697373606495707569.bin' '-l' '-1' '-v' '-w' '/tmp/graph1697373606495707569.weights' '-q' '0' '-e' '0.001'
[2023-03-18 16:43:37] [INFO ] Decomposing Gal with order
[2023-03-18 16:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 16:43:38] [INFO ] Removed a total of 2700 redundant transitions.
[2023-03-18 16:43:38] [INFO ] Flatten gal took : 127 ms
[2023-03-18 16:43:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-18 16:43:38] [INFO ] Time to serialize gal into /tmp/LTL5141163904882272474.gal : 5 ms
[2023-03-18 16:43:38] [INFO ] Time to serialize properties into /tmp/LTL17969897715955134789.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5141163904882272474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17969897715955134789.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Colum...328046
Formula 0 simplified : (!"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Columns_...328032
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6744176947166258391
[2023-03-18 16:43:53] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6744176947166258391
Running compilation step : cd /tmp/ltsmin6744176947166258391;'/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 2756 ms.
Running link step : cd /tmp/ltsmin6744176947166258391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6744176947166258391;'/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' '--ltl' '((((LTLAPp0==true) U !(LTLAPp1==true))&&(LTLAPp1==true)) U X([](!(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLFireability-05 finished in 174541 ms.
[2023-03-18 16:44:08] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9454939507512637221
[2023-03-18 16:44:08] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-18 16:44:08] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 16:44:08] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-18 16:44:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 16:44:08] [INFO ] Applying decomposition
[2023-03-18 16:44:08] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7941319089279915350.txt' '-o' '/tmp/graph7941319089279915350.bin' '-w' '/tmp/graph7941319089279915350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7941319089279915350.bin' '-l' '-1' '-v' '-w' '/tmp/graph7941319089279915350.weights' '-q' '0' '-e' '0.001'
[2023-03-18 16:44:08] [INFO ] Decomposing Gal with order
[2023-03-18 16:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 16:44:08] [INFO ] Removed a total of 2700 redundant transitions.
[2023-03-18 16:44:09] [INFO ] Flatten gal took : 159 ms
[2023-03-18 16:44:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-18 16:44:09] [INFO ] Time to serialize gal into /tmp/LTLFireability12000035769893350801.gal : 5 ms
[2023-03-18 16:44:09] [INFO ] Time to serialize properties into /tmp/LTLFireability9781334579042743844.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12000035769893350801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9781334579042743844.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2023-03-18 16:44:09] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
Checking formula 0 : !(((("(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Columns...328046
[2023-03-18 16:44:09] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 16:44:09] [INFO ] Built C files in 792ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9454939507512637221
Running compilation step : cd /tmp/ltsmin9454939507512637221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
Formula 0 simplified : (!"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Columns_...328032
Compilation finished in 3941 ms.
Running link step : cd /tmp/ltsmin9454939507512637221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9454939507512637221;'/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' '--ltl' '(((LTLAPp0==true)&&((LTLAPp1==true) U !(LTLAPp0==true))) U X([](!(LTLAPp0==true))))' '--buchi-type=spotba'

BK_STOP 1679158101183

--------------------
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-AN10"
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-AN10, 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-167912698900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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