About the Execution of 2023-gold for Sudoku-COL-AN12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 840641.00 | 0.00 | 0.00 | FFFTTTFTFFF?T?TT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556200313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-COL-AN12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556200313
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 11:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 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-AN12-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717137309785
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN12
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 06:35:11] [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]
[2024-05-31 06:35:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:35:11] [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.
[2024-05-31 06:35:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:35:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 361 ms
[2024-05-31 06:35:11] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.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
[2024-05-31 06:35:11] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-31 06:35:11] [INFO ] Skeletonized 16 HLPN properties in 2 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).
Remains 1 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2024-05-31 06:35:11] [INFO ] Flatten gal took : 11 ms
[2024-05-31 06:35:11] [INFO ] Flatten gal took : 1 ms
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2024-05-31 06:35:11] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 43 ms.
[2024-05-31 06:35:11] [INFO ] Unfolded 15 HLPN properties in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 432 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 48 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:35:14] [INFO ] Computed 35 invariants in 111 ms
[2024-05-31 06:35:14] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-31 06:35:14] [INFO ] Invariant cache hit.
[2024-05-31 06:35:15] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2024-05-31 06:35:15] [INFO ] Invariant cache hit.
[2024-05-31 06:35:15] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1413 ms. Remains : 432/2160 places, 1728/1728 transitions.
Support contains 432 out of 432 places after structural reductions.
[2024-05-31 06:35:16] [INFO ] Flatten gal took : 513 ms
[2024-05-31 06:35:20] [INFO ] Flatten gal took : 541 ms
[2024-05-31 06:35:24] [INFO ] Input system was already deterministic with 1728 transitions.
Finished random walk after 124 steps, including 0 resets, run visited all 6 properties in 57 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN12-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G(p0))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:35:26] [INFO ] Invariant cache hit.
[2024-05-31 06:35:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 06:35:26] [INFO ] Invariant cache hit.
[2024-05-31 06:35:26] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-31 06:35:26] [INFO ] Invariant cache hit.
[2024-05-31 06:35:27] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1092 ms. Remains : 432/432 places, 1728/1728 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 126 steps with 0 reset in 24 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLFireability-00 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&F(G((X(!p0)||p1))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 8 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:35:27] [INFO ] Invariant cache hit.
[2024-05-31 06:35:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 06:35:27] [INFO ] Invariant cache hit.
[2024-05-31 06:35:28] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-31 06:35:28] [INFO ] Invariant cache hit.
[2024-05-31 06:35:28] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 221 ms :[p0, p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 95670 steps with 758 reset in 10001 ms.
Product exploration timeout after 94850 steps with 753 reset in 10003 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p1), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-03 finished in 39558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 5 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:36:07] [INFO ] Invariant cache hit.
[2024-05-31 06:36:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 06:36:07] [INFO ] Invariant cache hit.
[2024-05-31 06:36:07] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-31 06:36:07] [INFO ] Invariant cache hit.
[2024-05-31 06:36:08] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1034 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 62500 steps with 31250 reset in 10001 ms.
Product exploration timeout after 61950 steps with 30975 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-04 finished in 37483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(p0))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 19 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:36:44] [INFO ] Invariant cache hit.
[2024-05-31 06:36:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 06:36:44] [INFO ] Invariant cache hit.
[2024-05-31 06:36:45] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-31 06:36:45] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-31 06:36:45] [INFO ] Invariant cache hit.
[2024-05-31 06:36:46] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1178 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], 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 timeout after 97760 steps with 776 reset in 10002 ms.
Product exploration timeout after 96750 steps with 768 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 138 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 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 123 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-06 finished in 37953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)||p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:37:22] [INFO ] Invariant cache hit.
[2024-05-31 06:37:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 06:37:22] [INFO ] Invariant cache hit.
[2024-05-31 06:37:23] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-31 06:37:23] [INFO ] Invariant cache hit.
[2024-05-31 06:37:23] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1058 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], 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, null][false, false, false, false]]
Product exploration timeout after 65100 steps with 32550 reset in 10001 ms.
Product exploration timeout after 64380 steps with 32190 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p0), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-07 finished in 38151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 16 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:38:00] [INFO ] Invariant cache hit.
[2024-05-31 06:38:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 06:38:01] [INFO ] Invariant cache hit.
[2024-05-31 06:38:01] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-31 06:38:01] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-31 06:38:01] [INFO ] Invariant cache hit.
[2024-05-31 06:38:02] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1110 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s72 1) (LT s220 1) (LT s336 1)) (OR (LT s61 1) (LT s207 1) (LT s325 1)) (OR (LT s82 1) (LT s226 1) (LT s418 1)) (OR (LT s103 1) (LT s240 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 899 steps with 6 reset in 93 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLFireability-09 finished in 1374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:38:02] [INFO ] Invariant cache hit.
[2024-05-31 06:38:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 06:38:02] [INFO ] Invariant cache hit.
[2024-05-31 06:38:02] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-31 06:38:02] [INFO ] Redundant transitions in 96 ms returned []
[2024-05-31 06:38:03] [INFO ] Invariant cache hit.
[2024-05-31 06:38:03] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1176 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 19 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLFireability-10 finished in 1276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(!p2)&&p1)||p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 5 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:38:03] [INFO ] Invariant cache hit.
[2024-05-31 06:38:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 06:38:03] [INFO ] Invariant cache hit.
[2024-05-31 06:38:04] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-31 06:38:04] [INFO ] Invariant cache hit.
[2024-05-31 06:38:04] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1033 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 88780 steps with 704 reset in 10002 ms.
Product exploration timeout after 87250 steps with 691 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 332 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1265 ms. (steps per millisecond=7 ) properties (out of 6) seen :4
Interrupted Best-First random walk after 6155 steps, including 1 resets, run timeout after 5544 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6155 steps, including 1 resets, run timeout after 5404 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 2 properties.
[2024-05-31 06:38:58] [INFO ] Invariant cache hit.
[2024-05-31 06:39:08] [INFO ] After 940ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 841 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:39:09] [INFO ] Invariant cache hit.
[2024-05-31 06:39:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 06:39:09] [INFO ] Invariant cache hit.
[2024-05-31 06:39:09] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-31 06:39:09] [INFO ] Invariant cache hit.
[2024-05-31 06:39:10] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1057 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p2), (X p2), (X p0), (X (X p2)), true, (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) p2), p2]
Finished random walk after 128 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), true, (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) p2), p2]
Product exploration timeout after 95190 steps with 756 reset in 10003 ms.
Product exploration timeout after 94200 steps with 747 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 14 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:39:49] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-31 06:39:49] [INFO ] Invariant cache hit.
[2024-05-31 06:39:50] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin3034368344480725183
[2024-05-31 06:39:50] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3034368344480725183
Running compilation step : cd /tmp/ltsmin3034368344480725183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3034368344480725183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3034368344480725183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:39:53] [INFO ] Invariant cache hit.
[2024-05-31 06:39:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 06:39:53] [INFO ] Invariant cache hit.
[2024-05-31 06:39:53] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-31 06:39:53] [INFO ] Invariant cache hit.
[2024-05-31 06:39:54] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin15487252730501887181
[2024-05-31 06:39:54] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15487252730501887181
Running compilation step : cd /tmp/ltsmin15487252730501887181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15487252730501887181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15487252730501887181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:39:57] [INFO ] Flatten gal took : 125 ms
[2024-05-31 06:39:58] [INFO ] Flatten gal took : 77 ms
[2024-05-31 06:39:58] [INFO ] Time to serialize gal into /tmp/LTL2884071572133829582.gal : 17 ms
[2024-05-31 06:39:58] [INFO ] Time to serialize properties into /tmp/LTL4546669245367472605.prop : 18 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2884071572133829582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2431929651074483481.hoa' '-atoms' '/tmp/LTL4546669245367472605.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4546669245367472605.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2431929651074483481.hoa
Detected timeout of ITS tools.
[2024-05-31 06:40:14] [INFO ] Flatten gal took : 107 ms
[2024-05-31 06:40:14] [INFO ] Flatten gal took : 110 ms
[2024-05-31 06:40:14] [INFO ] Time to serialize gal into /tmp/LTL10291754007101057617.gal : 8 ms
[2024-05-31 06:40:14] [INFO ] Time to serialize properties into /tmp/LTL17219915740512497194.ltl : 46 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10291754007101057617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17219915740512497194.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((((((((Rows_72>=1)&&(Cells_76>=1))&&(Columns_48>=1))||(((Rows_61>=1)&&(Cells_63>=1))&&(Columns_37>=1)))||((((Rows_82>=1)&...262962
Formula 0 simplified : F(!"(((((((((((((Rows_72>=1)&&(Cells_76>=1))&&(Columns_48>=1))||(((Rows_61>=1)&&(Cells_63>=1))&&(Columns_37>=1)))||((((Rows_82>=1)&&...262930
Detected timeout of ITS tools.
[2024-05-31 06:40:29] [INFO ] Flatten gal took : 103 ms
[2024-05-31 06:40:29] [INFO ] Applying decomposition
[2024-05-31 06:40:29] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10990625053478185228.txt' '-o' '/tmp/graph10990625053478185228.bin' '-w' '/tmp/graph10990625053478185228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10990625053478185228.bin' '-l' '-1' '-v' '-w' '/tmp/graph10990625053478185228.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:40:30] [INFO ] Decomposing Gal with order
[2024-05-31 06:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:40:30] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 06:40:30] [INFO ] Flatten gal took : 250 ms
[2024-05-31 06:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2024-05-31 06:40:30] [INFO ] Time to serialize gal into /tmp/LTL1479508432877190767.gal : 17 ms
[2024-05-31 06:40:30] [INFO ] Time to serialize properties into /tmp/LTL15414211727099794507.ltl : 25 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1479508432877190767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15414211727099794507.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Column...336762
Formula 0 simplified : F(!"(((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Columns...336730
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17586710586088769976
[2024-05-31 06:40:45] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17586710586088769976
Running compilation step : cd /tmp/ltsmin17586710586088769976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17586710586088769976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17586710586088769976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN12-LTLFireability-11 finished in 165267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:40:48] [INFO ] Invariant cache hit.
[2024-05-31 06:40:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 06:40:48] [INFO ] Invariant cache hit.
[2024-05-31 06:40:49] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-31 06:40:49] [INFO ] Invariant cache hit.
[2024-05-31 06:40:49] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-12 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 s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], 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 timeout after 64310 steps with 32155 reset in 10002 ms.
Product exploration timeout after 64090 steps with 32045 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 (Minato strategy)
Knowledge based reduction with 4 factoid took 19 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-AN12-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-12 finished in 36894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p0))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 6 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:41:25] [INFO ] Invariant cache hit.
[2024-05-31 06:41:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 06:41:25] [INFO ] Invariant cache hit.
[2024-05-31 06:41:26] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-31 06:41:26] [INFO ] Invariant cache hit.
[2024-05-31 06:41:26] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1022 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 44950 steps with 11237 reset in 10003 ms.
Product exploration timeout after 44620 steps with 11155 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 : []
Knowledge based reduction with 4 factoid took 330 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 122 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 5 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:42:03] [INFO ] Invariant cache hit.
[2024-05-31 06:42:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 06:42:03] [INFO ] Invariant cache hit.
[2024-05-31 06:42:04] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-31 06:42:04] [INFO ] Invariant cache hit.
[2024-05-31 06:42:04] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 126 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 44960 steps with 11240 reset in 10001 ms.
Product exploration timeout after 44650 steps with 11162 reset in 10003 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:42:41] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-31 06:42:41] [INFO ] Invariant cache hit.
[2024-05-31 06:42:42] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 535 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin2340277994798641376
[2024-05-31 06:42:42] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2340277994798641376
Running compilation step : cd /tmp/ltsmin2340277994798641376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2340277994798641376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2340277994798641376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 2 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:42:45] [INFO ] Invariant cache hit.
[2024-05-31 06:42:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 06:42:45] [INFO ] Invariant cache hit.
[2024-05-31 06:42:45] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-31 06:42:45] [INFO ] Invariant cache hit.
[2024-05-31 06:42:46] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin9286635870996849935
[2024-05-31 06:42:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9286635870996849935
Running compilation step : cd /tmp/ltsmin9286635870996849935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9286635870996849935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9286635870996849935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:42:49] [INFO ] Flatten gal took : 102 ms
[2024-05-31 06:42:49] [INFO ] Flatten gal took : 56 ms
[2024-05-31 06:42:49] [INFO ] Time to serialize gal into /tmp/LTL11735215348374054169.gal : 7 ms
[2024-05-31 06:42:50] [INFO ] Time to serialize properties into /tmp/LTL15142155717207490385.prop : 8 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11735215348374054169.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5159748222322925941.hoa' '-atoms' '/tmp/LTL15142155717207490385.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15142155717207490385.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5159748222322925941.hoa
Detected timeout of ITS tools.
[2024-05-31 06:43:06] [INFO ] Flatten gal took : 80 ms
[2024-05-31 06:43:06] [INFO ] Flatten gal took : 81 ms
[2024-05-31 06:43:06] [INFO ] Time to serialize gal into /tmp/LTL7271441814015809213.gal : 8 ms
[2024-05-31 06:43:06] [INFO ] Time to serialize properties into /tmp/LTL9234614776548242735.ltl : 71 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7271441814015809213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9234614776548242735.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("((((((((((((((Rows_72>=1)&&(Cells_76>=1))&&(Columns_48>=1))||(((Rows_61>=1)&&(Cells_63>=1))&&(Columns_37>=1)))||((((Rows_...182200
Formula 0 simplified : X(!"((((((((((((((Rows_72>=1)&&(Cells_76>=1))&&(Columns_48>=1))||(((Rows_61>=1)&&(Cells_63>=1))&&(Columns_37>=1)))||((((Rows_82>=1)&...182190
Detected timeout of ITS tools.
[2024-05-31 06:43:21] [INFO ] Flatten gal took : 79 ms
[2024-05-31 06:43:21] [INFO ] Applying decomposition
[2024-05-31 06:43:21] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7111062663658031894.txt' '-o' '/tmp/graph7111062663658031894.bin' '-w' '/tmp/graph7111062663658031894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7111062663658031894.bin' '-l' '-1' '-v' '-w' '/tmp/graph7111062663658031894.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:43:21] [INFO ] Decomposing Gal with order
[2024-05-31 06:43:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:43:21] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 06:43:21] [INFO ] Flatten gal took : 123 ms
[2024-05-31 06:43:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-31 06:43:21] [INFO ] Time to serialize gal into /tmp/LTL16776606765423318057.gal : 9 ms
[2024-05-31 06:43:22] [INFO ] Time to serialize properties into /tmp/LTL14904608709946668770.ltl : 103 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16776606765423318057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14904608709946668770.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("((((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325...231400
Formula 0 simplified : X(!"((((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Column...231390
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1589045184985365898
[2024-05-31 06:43:37] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1589045184985365898
Running compilation step : cd /tmp/ltsmin1589045184985365898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1589045184985365898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1589045184985365898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN12-LTLFireability-13 finished in 134493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(!p0)&&X((G(p0)||(p0&&G(F(!p0))))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:43:40] [INFO ] Invariant cache hit.
[2024-05-31 06:43:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 06:43:40] [INFO ] Invariant cache hit.
[2024-05-31 06:43:40] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-31 06:43:40] [INFO ] Invariant cache hit.
[2024-05-31 06:43:41] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1013 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), p0, (NOT p0), true, false, false, p0]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 97820 steps with 776 reset in 10003 ms.
Product exploration timeout after 97570 steps with 773 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 ms. Reduced automaton from 8 states, 15 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-14 finished in 37397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:44:17] [INFO ] Invariant cache hit.
[2024-05-31 06:44:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 06:44:17] [INFO ] Invariant cache hit.
[2024-05-31 06:44:18] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-31 06:44:18] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-31 06:44:18] [INFO ] Invariant cache hit.
[2024-05-31 06:44:18] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1055 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-15 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 s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 96070 steps with 762 reset in 10001 ms.
Product exploration timeout after 95180 steps with 754 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 (Minato strategy)
Knowledge based reduction with 4 factoid took 21 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-AN12-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-15 finished in 37247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(!p2)&&p1)||p0)))'
Found a Lengthening insensitive property : Sudoku-COL-AN12-LTLFireability-11
Stuttering acceptance computed with spot in 115 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 11 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:44:55] [INFO ] Invariant cache hit.
[2024-05-31 06:44:55] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 06:44:55] [INFO ] Invariant cache hit.
[2024-05-31 06:44:55] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-31 06:44:55] [INFO ] Invariant cache hit.
[2024-05-31 06:44:56] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1016 ms. Remains : 432/432 places, 1728/1728 transitions.
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s72 1) (GEQ s220 1) (GEQ s336 1)) (AND (GEQ s61 1) (GEQ s207 1) (GEQ s325 1)) (AND (GEQ s82 1) (GEQ s226 1) (GEQ s418 1)) (AND (GEQ s103 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 89540 steps with 710 reset in 10001 ms.
Product exploration timeout after 88430 steps with 702 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 308 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1166 ms. (steps per millisecond=8 ) properties (out of 6) seen :4
Interrupted Best-First random walk after 6155 steps, including 1 resets, run timeout after 5530 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6155 steps, including 1 resets, run timeout after 5408 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 2 properties.
[2024-05-31 06:45:49] [INFO ] Invariant cache hit.
[2024-05-31 06:45:59] [INFO ] After 969ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 823 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 6 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:46:00] [INFO ] Invariant cache hit.
[2024-05-31 06:46:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 06:46:00] [INFO ] Invariant cache hit.
[2024-05-31 06:46:00] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-31 06:46:00] [INFO ] Invariant cache hit.
[2024-05-31 06:46:01] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p2), (X p2), (X p0), (X (X p2)), true, (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) p2), p2]
Finished random walk after 127 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), true, (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p0) p2), p2]
Product exploration timeout after 95130 steps with 754 reset in 10001 ms.
Product exploration timeout after 94390 steps with 748 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 10 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:46:39] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-31 06:46:39] [INFO ] Invariant cache hit.
[2024-05-31 06:46:40] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin13735297107340973502
[2024-05-31 06:46:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13735297107340973502
Running compilation step : cd /tmp/ltsmin13735297107340973502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13735297107340973502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13735297107340973502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 2 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:46:43] [INFO ] Invariant cache hit.
[2024-05-31 06:46:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 06:46:43] [INFO ] Invariant cache hit.
[2024-05-31 06:46:43] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-31 06:46:43] [INFO ] Invariant cache hit.
[2024-05-31 06:46:44] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 978 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin2642165109959103274
[2024-05-31 06:46:44] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2642165109959103274
Running compilation step : cd /tmp/ltsmin2642165109959103274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2642165109959103274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2642165109959103274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:46:47] [INFO ] Flatten gal took : 60 ms
[2024-05-31 06:46:47] [INFO ] Flatten gal took : 60 ms
[2024-05-31 06:46:47] [INFO ] Time to serialize gal into /tmp/LTL12626438678648220321.gal : 7 ms
[2024-05-31 06:46:47] [INFO ] Time to serialize properties into /tmp/LTL8503702541064135653.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12626438678648220321.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3441357893961423379.hoa' '-atoms' '/tmp/LTL8503702541064135653.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8503702541064135653.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3441357893961423379.hoa
Detected timeout of ITS tools.
[2024-05-31 06:47:04] [INFO ] Flatten gal took : 150 ms
[2024-05-31 06:47:04] [INFO ] Flatten gal took : 102 ms
[2024-05-31 06:47:04] [INFO ] Time to serialize gal into /tmp/LTL14919110530469528703.gal : 8 ms
[2024-05-31 06:47:04] [INFO ] Time to serialize properties into /tmp/LTL11182390011834410452.ltl : 27 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14919110530469528703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11182390011834410452.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((((((((Rows_72>=1)&&(Cells_76>=1))&&(Columns_48>=1))||(((Rows_61>=1)&&(Cells_63>=1))&&(Columns_37>=1)))||((((Rows_82>=1)&...262962
Formula 0 simplified : F(!"(((((((((((((Rows_72>=1)&&(Cells_76>=1))&&(Columns_48>=1))||(((Rows_61>=1)&&(Cells_63>=1))&&(Columns_37>=1)))||((((Rows_82>=1)&&...262930
Detected timeout of ITS tools.
[2024-05-31 06:47:20] [INFO ] Flatten gal took : 97 ms
[2024-05-31 06:47:20] [INFO ] Applying decomposition
[2024-05-31 06:47:20] [INFO ] Flatten gal took : 104 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13433202288581387621.txt' '-o' '/tmp/graph13433202288581387621.bin' '-w' '/tmp/graph13433202288581387621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13433202288581387621.bin' '-l' '-1' '-v' '-w' '/tmp/graph13433202288581387621.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:47:20] [INFO ] Decomposing Gal with order
[2024-05-31 06:47:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:47:20] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 06:47:20] [INFO ] Flatten gal took : 159 ms
[2024-05-31 06:47:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-31 06:47:20] [INFO ] Time to serialize gal into /tmp/LTL15144840759475672031.gal : 9 ms
[2024-05-31 06:47:20] [INFO ] Time to serialize properties into /tmp/LTL6645743682162504576.ltl : 25 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15144840759475672031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6645743682162504576.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Column...336762
Formula 0 simplified : F(!"(((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Columns...336730
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16541672136334489249
[2024-05-31 06:47:37] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16541672136334489249
Running compilation step : cd /tmp/ltsmin16541672136334489249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16541672136334489249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16541672136334489249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN12-LTLFireability-11 finished in 165180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p0))))))'
[2024-05-31 06:47:40] [INFO ] Flatten gal took : 124 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10377038091821884486
[2024-05-31 06:47:40] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2024-05-31 06:47:40] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10377038091821884486
Running compilation step : cd /tmp/ltsmin10377038091821884486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 06:47:42] [INFO ] Applying decomposition
[2024-05-31 06:47:42] [INFO ] Flatten gal took : 127 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6612717514072536913.txt' '-o' '/tmp/graph6612717514072536913.bin' '-w' '/tmp/graph6612717514072536913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6612717514072536913.bin' '-l' '-1' '-v' '-w' '/tmp/graph6612717514072536913.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:47:43] [INFO ] Decomposing Gal with order
[2024-05-31 06:47:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:47:43] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 06:47:43] [INFO ] Flatten gal took : 184 ms
[2024-05-31 06:47:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-31 06:47:43] [INFO ] Time to serialize gal into /tmp/LTLFireability5506947959404683651.gal : 8 ms
[2024-05-31 06:47:43] [INFO ] Time to serialize properties into /tmp/LTLFireability10652502151619786544.ltl : 56 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5506947959404683651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10652502151619786544.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(("(((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Column...341921
Formula 0 simplified : F(!"(((((((((((((u72.Rows_72>=1)&&(u220.Cells_76>=1))&&(u336.Columns_48>=1))||(((u61.Rows_61>=1)&&(u207.Cells_63>=1))&&(u325.Columns...341899
Compilation finished in 7628 ms.
Running link step : cd /tmp/ltsmin10377038091821884486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10377038091821884486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((X(!(LTLAPp2==true))&&(LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
BK_STOP 1717138150426
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-AN12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-COL-AN12, 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 r417-tall-171690556200313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN12.tgz
mv Sudoku-COL-AN12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;