About the Execution of 2023-gold for Sudoku-PT-AN09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.487 | 3600000.00 | 3257577.00 | 622942.00 | ?TT??TFTTFTTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556400397.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-PT-AN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400397
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 237K Apr 12 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 769K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 10:07 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 205K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 691K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 367K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 549K Apr 12 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 70K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 416K 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-PT-AN09-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717150658974
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 10:17:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 10:17:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 10:17:40] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-31 10:17:40] [INFO ] Transformed 972 places.
[2024-05-31 10:17:40] [INFO ] Transformed 729 transitions.
[2024-05-31 10:17:40] [INFO ] Found NUPN structural information;
[2024-05-31 10:17:40] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 94 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 895 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 10:17:41] [INFO ] Computed 243 invariants in 22 ms
[2024-05-31 10:17:41] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-31 10:17:41] [INFO ] Invariant cache hit.
[2024-05-31 10:17:42] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2024-05-31 10:17:42] [INFO ] Invariant cache hit.
[2024-05-31 10:17:42] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1772 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 895 out of 972 places after structural reductions.
[2024-05-31 10:17:43] [INFO ] Flatten gal took : 100 ms
[2024-05-31 10:17:43] [INFO ] Flatten gal took : 65 ms
[2024-05-31 10:17:43] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 932 ms. (steps per millisecond=10 ) properties (out of 18) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 10:17:44] [INFO ] Invariant cache hit.
[2024-05-31 10:17:45] [INFO ] [Real]Absence check using 243 positive place invariants in 54 ms returned sat
[2024-05-31 10:17:45] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 10:17:46] [INFO ] [Nat]Absence check using 243 positive place invariants in 52 ms returned sat
[2024-05-31 10:18:04] [INFO ] After 8903ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-31 10:18:09] [INFO ] After 14354ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 1131 ms.
[2024-05-31 10:18:10] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 6 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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(G(p0)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 28 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 10:18:11] [INFO ] Computed 26 invariants in 41 ms
[2024-05-31 10:18:11] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-31 10:18:11] [INFO ] Invariant cache hit.
[2024-05-31 10:18:12] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-31 10:18:12] [INFO ] Invariant cache hit.
[2024-05-31 10:18:12] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1543 ms. Remains : 243/972 places, 729/729 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 311 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1417 reset in 4504 ms.
Product exploration explored 100000 steps with 1420 reset in 4439 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 142 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 690580 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 690580 steps, saw 139640 distinct states, run finished after 3002 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:18:28] [INFO ] Invariant cache hit.
[2024-05-31 10:18:28] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:18:37] [INFO ] After 9248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 243/243 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 691899 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :{}
Probabilistic random walk after 691899 steps, saw 139824 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:18:41] [INFO ] Invariant cache hit.
[2024-05-31 10:18:41] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:18:50] [INFO ] After 9260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:18:50] [INFO ] Invariant cache hit.
[2024-05-31 10:18:50] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-31 10:18:50] [INFO ] Invariant cache hit.
[2024-05-31 10:18:51] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
[2024-05-31 10:18:51] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-31 10:18:51] [INFO ] Invariant cache hit.
[2024-05-31 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1568 ms. Remains : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:18:52] [INFO ] Invariant cache hit.
[2024-05-31 10:18:52] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:19:01] [INFO ] After 9257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:19:01] [INFO ] Invariant cache hit.
[2024-05-31 10:19:01] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-31 10:19:01] [INFO ] Invariant cache hit.
[2024-05-31 10:19:02] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2024-05-31 10:19:02] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 10:19:02] [INFO ] Invariant cache hit.
[2024-05-31 10:19:03] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1483 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 708770 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 708770 steps, saw 141797 distinct states, run finished after 3002 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:19:09] [INFO ] Invariant cache hit.
[2024-05-31 10:19:09] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:19:18] [INFO ] After 9246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 243/243 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 683655 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683655 steps, saw 138575 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:19:22] [INFO ] Invariant cache hit.
[2024-05-31 10:19:22] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:19:31] [INFO ] After 9260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:19:31] [INFO ] Invariant cache hit.
[2024-05-31 10:19:31] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 10:19:31] [INFO ] Invariant cache hit.
[2024-05-31 10:19:32] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2024-05-31 10:19:32] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 10:19:32] [INFO ] Invariant cache hit.
[2024-05-31 10:19:33] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1441 ms. Remains : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:19:33] [INFO ] Invariant cache hit.
[2024-05-31 10:19:33] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-31 10:19:42] [INFO ] After 9248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1420 reset in 4364 ms.
Product exploration explored 100000 steps with 1419 reset in 4471 ms.
Built C files in :
/tmp/ltsmin11411097805683265353
[2024-05-31 10:19:51] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:19:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:19:51] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:19:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:19:51] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:19:51] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:19:51] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11411097805683265353
Running compilation step : cd /tmp/ltsmin11411097805683265353;'/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'
Compilation finished in 1876 ms.
Running link step : cd /tmp/ltsmin11411097805683265353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin11411097805683265353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7055969841143718196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:20:06] [INFO ] Invariant cache hit.
[2024-05-31 10:20:06] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-31 10:20:06] [INFO ] Invariant cache hit.
[2024-05-31 10:20:07] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2024-05-31 10:20:07] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 10:20:07] [INFO ] Invariant cache hit.
[2024-05-31 10:20:07] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1488 ms. Remains : 243/243 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin5014205151856670723
[2024-05-31 10:20:07] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:20:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:20:07] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:20:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:20:08] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:20:08] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:20:08] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5014205151856670723
Running compilation step : cd /tmp/ltsmin5014205151856670723;'/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'
Compilation finished in 1783 ms.
Running link step : cd /tmp/ltsmin5014205151856670723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5014205151856670723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17314739811612596918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 10:20:23] [INFO ] Flatten gal took : 40 ms
[2024-05-31 10:20:23] [INFO ] Flatten gal took : 30 ms
[2024-05-31 10:20:23] [INFO ] Time to serialize gal into /tmp/LTL1862974880861844589.gal : 6 ms
[2024-05-31 10:20:23] [INFO ] Time to serialize properties into /tmp/LTL14425831868734718076.prop : 0 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/LTL1862974880861844589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7488521660353360081.hoa' '-atoms' '/tmp/LTL14425831868734718076.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/LTL14425831868734718076.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7488521660353360081.hoa
Detected timeout of ITS tools.
[2024-05-31 10:20:38] [INFO ] Flatten gal took : 62 ms
[2024-05-31 10:20:38] [INFO ] Flatten gal took : 68 ms
[2024-05-31 10:20:38] [INFO ] Time to serialize gal into /tmp/LTL4784082524185049388.gal : 17 ms
[2024-05-31 10:20:38] [INFO ] Time to serialize properties into /tmp/LTL7144438622557091141.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4784082524185049388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7144438622557091141.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(G("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...1170
Formula 0 simplified : XF!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0_...1164
Detected timeout of ITS tools.
[2024-05-31 10:20:53] [INFO ] Flatten gal took : 28 ms
[2024-05-31 10:20:53] [INFO ] Applying decomposition
[2024-05-31 10:20:53] [INFO ] Flatten gal took : 27 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/graph17756276705808198745.txt' '-o' '/tmp/graph17756276705808198745.bin' '-w' '/tmp/graph17756276705808198745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17756276705808198745.bin' '-l' '-1' '-v' '-w' '/tmp/graph17756276705808198745.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:20:53] [INFO ] Decomposing Gal with order
[2024-05-31 10:20:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:20:54] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-31 10:20:54] [INFO ] Flatten gal took : 390 ms
[2024-05-31 10:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-31 10:20:54] [INFO ] Time to serialize gal into /tmp/LTL16397710054387985431.gal : 8 ms
[2024-05-31 10:20:54] [INFO ] Time to serialize properties into /tmp/LTL10471904471374051994.ltl : 0 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/LTL16397710054387985431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10471904471374051994.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 : !((X(G("((((((((gu162.Columns_0_0+gu162.Columns_0_1)+(gu162.Columns_0_2+gu162.Columns_0_3))+((gu162.Columns_0_4+gu162.Columns_0_5)+(gu...1656
Formula 0 simplified : XF!"((((((((gu162.Columns_0_0+gu162.Columns_0_1)+(gu162.Columns_0_2+gu162.Columns_0_3))+((gu162.Columns_0_4+gu162.Columns_0_5)+(gu16...1650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3209934508721941423
[2024-05-31 10:21:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3209934508721941423
Running compilation step : cd /tmp/ltsmin3209934508721941423;'/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'
Compilation finished in 1163 ms.
Running link step : cd /tmp/ltsmin3209934508721941423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3209934508721941423;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN09-LTLCardinality-00 finished in 193486 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((p0&&X(p0))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 27 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 10:21:24] [INFO ] Computed 243 invariants in 6 ms
[2024-05-31 10:21:25] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-31 10:21:25] [INFO ] Invariant cache hit.
[2024-05-31 10:21:26] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2024-05-31 10:21:26] [INFO ] Invariant cache hit.
[2024-05-31 10:21:26] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1943 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 8818 ms.
Product exploration explored 100000 steps with 50000 reset in 8880 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-01 finished in 28797 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(p0)) U X(!p1)))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:21:53] [INFO ] Invariant cache hit.
[2024-05-31 10:21:53] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-31 10:21:53] [INFO ] Invariant cache hit.
[2024-05-31 10:21:54] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2024-05-31 10:21:54] [INFO ] Invariant cache hit.
[2024-05-31 10:21:54] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1443 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 194 ms :[p1, (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (OR (LEQ 1 (ADD s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7737 ms.
Product exploration explored 100000 steps with 50000 reset in 7830 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-02 finished in 33926 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((p0&&F(p1))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:22:27] [INFO ] Invariant cache hit.
[2024-05-31 10:22:27] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 10:22:27] [INFO ] Invariant cache hit.
[2024-05-31 10:22:28] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2024-05-31 10:22:28] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 10:22:28] [INFO ] Invariant cache hit.
[2024-05-31 10:22:28] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1475 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GT (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2380 reset in 8070 ms.
Product exploration explored 100000 steps with 2380 reset in 8177 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2024-05-31 10:23:03] [INFO ] Invariant cache hit.
[2024-05-31 10:23:05] [INFO ] [Real]Absence check using 243 positive place invariants in 148 ms returned sat
[2024-05-31 10:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:23:08] [INFO ] [Real]Absence check using state equation in 3406 ms returned sat
[2024-05-31 10:23:08] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p1)
Support contains 810 out of 972 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:23:15] [INFO ] Invariant cache hit.
[2024-05-31 10:23:16] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-31 10:23:16] [INFO ] Invariant cache hit.
[2024-05-31 10:23:16] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2024-05-31 10:23:16] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 10:23:16] [INFO ] Invariant cache hit.
[2024-05-31 10:23:17] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1498 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2024-05-31 10:23:26] [INFO ] Invariant cache hit.
[2024-05-31 10:23:28] [INFO ] [Real]Absence check using 243 positive place invariants in 139 ms returned sat
[2024-05-31 10:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:23:32] [INFO ] [Real]Absence check using state equation in 3225 ms returned sat
[2024-05-31 10:23:32] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2380 reset in 8046 ms.
Product exploration explored 100000 steps with 2380 reset in 8154 ms.
Built C files in :
/tmp/ltsmin114500920392071593
[2024-05-31 10:23:55] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:23:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:23:55] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:23:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:23:55] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:23:55] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:23:55] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin114500920392071593
Running compilation step : cd /tmp/ltsmin114500920392071593;'/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'
Compilation finished in 2065 ms.
Running link step : cd /tmp/ltsmin114500920392071593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin114500920392071593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16492556735652364525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:24:10] [INFO ] Invariant cache hit.
[2024-05-31 10:24:10] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-31 10:24:10] [INFO ] Invariant cache hit.
[2024-05-31 10:24:11] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2024-05-31 10:24:11] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 10:24:11] [INFO ] Invariant cache hit.
[2024-05-31 10:24:12] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1897 ms. Remains : 972/972 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin14919016466387777089
[2024-05-31 10:24:12] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:24:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:24:12] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:24:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:24:12] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:24:12] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:24:12] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14919016466387777089
Running compilation step : cd /tmp/ltsmin14919016466387777089;'/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'
Compilation finished in 2078 ms.
Running link step : cd /tmp/ltsmin14919016466387777089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14919016466387777089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16079297244368134644.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 10:24:27] [INFO ] Flatten gal took : 46 ms
[2024-05-31 10:24:27] [INFO ] Flatten gal took : 45 ms
[2024-05-31 10:24:27] [INFO ] Time to serialize gal into /tmp/LTL16431723456011737423.gal : 6 ms
[2024-05-31 10:24:27] [INFO ] Time to serialize properties into /tmp/LTL1298612336427545654.prop : 1 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/LTL16431723456011737423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9560187742540601425.hoa' '-atoms' '/tmp/LTL1298612336427545654.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/LTL1298612336427545654.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9560187742540601425.hoa
Detected timeout of ITS tools.
[2024-05-31 10:24:42] [INFO ] Flatten gal took : 31 ms
[2024-05-31 10:24:42] [INFO ] Flatten gal took : 30 ms
[2024-05-31 10:24:42] [INFO ] Time to serialize gal into /tmp/LTL11116762876144215311.gal : 6 ms
[2024-05-31 10:24:42] [INFO ] Time to serialize properties into /tmp/LTL9684664672537225092.ltl : 2 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/LTL11116762876144215311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9684664672537225092.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...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows...12272
Formula 0 simplified : G(!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_...12266
Detected timeout of ITS tools.
[2024-05-31 10:24:57] [INFO ] Flatten gal took : 30 ms
[2024-05-31 10:24:57] [INFO ] Applying decomposition
[2024-05-31 10:24:57] [INFO ] Flatten gal took : 29 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/graph309532871554314622.txt' '-o' '/tmp/graph309532871554314622.bin' '-w' '/tmp/graph309532871554314622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph309532871554314622.bin' '-l' '-1' '-v' '-w' '/tmp/graph309532871554314622.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:24:58] [INFO ] Decomposing Gal with order
[2024-05-31 10:24:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:24:58] [INFO ] Removed a total of 648 redundant transitions.
[2024-05-31 10:24:58] [INFO ] Flatten gal took : 354 ms
[2024-05-31 10:24:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 39 ms.
[2024-05-31 10:24:59] [INFO ] Time to serialize gal into /tmp/LTL2117526425510192902.gal : 8 ms
[2024-05-31 10:24:59] [INFO ] Time to serialize properties into /tmp/LTL11950401119056350966.ltl : 1 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/LTL2117526425510192902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11950401119056350966.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...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...15836
Formula 0 simplified : G(!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...15830
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8105536710392396228
[2024-05-31 10:25:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8105536710392396228
Running compilation step : cd /tmp/ltsmin8105536710392396228;'/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'
Compilation finished in 1510 ms.
Running link step : cd /tmp/ltsmin8105536710392396228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8105536710392396228;'/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' '<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN09-LTLCardinality-03 finished in 181849 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)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.10 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 10:25:29] [INFO ] Computed 26 invariants in 20 ms
[2024-05-31 10:25:29] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-31 10:25:29] [INFO ] Invariant cache hit.
[2024-05-31 10:25:30] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2024-05-31 10:25:30] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-31 10:25:30] [INFO ] Invariant cache hit.
[2024-05-31 10:25:31] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1844 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1417 reset in 4220 ms.
Product exploration explored 100000 steps with 1418 reset in 4286 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 700843 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 700843 steps, saw 141062 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:25:46] [INFO ] Invariant cache hit.
[2024-05-31 10:25:46] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:25:55] [INFO ] After 9258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 243/243 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 697197 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 697197 steps, saw 140624 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:25:58] [INFO ] Invariant cache hit.
[2024-05-31 10:25:58] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 10:26:08] [INFO ] After 9255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:26:08] [INFO ] Invariant cache hit.
[2024-05-31 10:26:08] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-31 10:26:08] [INFO ] Invariant cache hit.
[2024-05-31 10:26:09] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2024-05-31 10:26:09] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 10:26:09] [INFO ] Invariant cache hit.
[2024-05-31 10:26:09] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1750 ms. Remains : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:26:09] [INFO ] Invariant cache hit.
[2024-05-31 10:26:09] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-31 10:26:19] [INFO ] After 9258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:26:19] [INFO ] Invariant cache hit.
[2024-05-31 10:26:19] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 10:26:19] [INFO ] Invariant cache hit.
[2024-05-31 10:26:20] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2024-05-31 10:26:20] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 10:26:20] [INFO ] Invariant cache hit.
[2024-05-31 10:26:21] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1668 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 142 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 705357 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 705357 steps, saw 141474 distinct states, run finished after 3003 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:26:27] [INFO ] Invariant cache hit.
[2024-05-31 10:26:27] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 10:26:36] [INFO ] After 9252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 243/243 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 710924 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 710924 steps, saw 141980 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:26:40] [INFO ] Invariant cache hit.
[2024-05-31 10:26:40] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:26:49] [INFO ] After 9257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:26:49] [INFO ] Invariant cache hit.
[2024-05-31 10:26:49] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 10:26:49] [INFO ] Invariant cache hit.
[2024-05-31 10:26:50] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2024-05-31 10:26:50] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 10:26:50] [INFO ] Invariant cache hit.
[2024-05-31 10:26:51] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1729 ms. Remains : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:26:51] [INFO ] Invariant cache hit.
[2024-05-31 10:26:51] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:27:00] [INFO ] After 9265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 647 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1418 reset in 4267 ms.
Product exploration explored 100000 steps with 1418 reset in 4316 ms.
Built C files in :
/tmp/ltsmin8936134539712110622
[2024-05-31 10:27:09] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:27:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:27:09] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:27:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:27:09] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:27:10] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:27:10] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8936134539712110622
Running compilation step : cd /tmp/ltsmin8936134539712110622;'/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'
Compilation finished in 1801 ms.
Running link step : cd /tmp/ltsmin8936134539712110622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8936134539712110622;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1113387761696221972.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:27:25] [INFO ] Invariant cache hit.
[2024-05-31 10:27:25] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-31 10:27:25] [INFO ] Invariant cache hit.
[2024-05-31 10:27:26] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2024-05-31 10:27:26] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 10:27:26] [INFO ] Invariant cache hit.
[2024-05-31 10:27:26] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1710 ms. Remains : 243/243 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin3697212555149515319
[2024-05-31 10:27:26] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:27:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:27:26] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:27:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:27:26] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:27:26] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:27:26] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3697212555149515319
Running compilation step : cd /tmp/ltsmin3697212555149515319;'/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'
Compilation finished in 1778 ms.
Running link step : cd /tmp/ltsmin3697212555149515319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3697212555149515319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13204427528559799486.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 10:27:41] [INFO ] Flatten gal took : 21 ms
[2024-05-31 10:27:41] [INFO ] Flatten gal took : 21 ms
[2024-05-31 10:27:41] [INFO ] Time to serialize gal into /tmp/LTL6584601596161797414.gal : 4 ms
[2024-05-31 10:27:41] [INFO ] Time to serialize properties into /tmp/LTL11120589679287142740.prop : 0 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/LTL6584601596161797414.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17632230651929384064.hoa' '-atoms' '/tmp/LTL11120589679287142740.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/LTL11120589679287142740.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17632230651929384064.hoa
Detected timeout of ITS tools.
[2024-05-31 10:27:56] [INFO ] Flatten gal took : 21 ms
[2024-05-31 10:27:57] [INFO ] Flatten gal took : 21 ms
[2024-05-31 10:27:57] [INFO ] Time to serialize gal into /tmp/LTL6596531211751245820.gal : 6 ms
[2024-05-31 10:27:57] [INFO ] Time to serialize properties into /tmp/LTL14783006027559430967.ltl : 1 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/LTL6596531211751245820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14783006027559430967.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Row...927
Formula 0 simplified : FG!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_1_0)+(Rows_1_1+Rows_...921
Detected timeout of ITS tools.
[2024-05-31 10:28:12] [INFO ] Flatten gal took : 20 ms
[2024-05-31 10:28:12] [INFO ] Applying decomposition
[2024-05-31 10:28:12] [INFO ] Flatten gal took : 21 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/graph4425607326923323935.txt' '-o' '/tmp/graph4425607326923323935.bin' '-w' '/tmp/graph4425607326923323935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4425607326923323935.bin' '-l' '-1' '-v' '-w' '/tmp/graph4425607326923323935.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:28:12] [INFO ] Decomposing Gal with order
[2024-05-31 10:28:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:28:12] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-31 10:28:12] [INFO ] Flatten gal took : 74 ms
[2024-05-31 10:28:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-31 10:28:12] [INFO ] Time to serialize gal into /tmp/LTL8618388512745386228.gal : 3 ms
[2024-05-31 10:28:12] [INFO ] Time to serialize properties into /tmp/LTL7206568588572924033.ltl : 1 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/LTL8618388512745386228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7206568588572924033.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 : !((G(F("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((...1251
Formula 0 simplified : FG!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...1245
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7159074057838325583
[2024-05-31 10:28:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7159074057838325583
Running compilation step : cd /tmp/ltsmin7159074057838325583;'/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'
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin7159074057838325583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7159074057838325583;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN09-LTLCardinality-04 finished in 193262 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(p0))'
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-05-31 10:28:42] [INFO ] Computed 243 invariants in 8 ms
[2024-05-31 10:28:43] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-31 10:28:43] [INFO ] Invariant cache hit.
[2024-05-31 10:28:44] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2024-05-31 10:28:44] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 10:28:44] [INFO ] Invariant cache hit.
[2024-05-31 10:28:44] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2389 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 8038 ms.
Product exploration explored 100000 steps with 50000 reset in 8162 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-05 finished in 27067 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((G(p0) U p1)))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:29:09] [INFO ] Invariant cache hit.
[2024-05-31 10:29:10] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-31 10:29:10] [INFO ] Invariant cache hit.
[2024-05-31 10:29:11] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2024-05-31 10:29:11] [INFO ] Invariant cache hit.
[2024-05-31 10:29:11] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1967 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-06 finished in 2105 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 2 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 10:29:11] [INFO ] Computed 26 invariants in 21 ms
[2024-05-31 10:29:12] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-31 10:29:12] [INFO ] Invariant cache hit.
[2024-05-31 10:29:13] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2024-05-31 10:29:13] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-31 10:29:13] [INFO ] Invariant cache hit.
[2024-05-31 10:29:13] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-09 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 (EQ s77 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 639 steps with 8 reset in 31 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-09 finished in 1971 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(G(p0)))'
Support contains 2 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 728 places and 0 transitions.
Iterating post reduction 0 with 728 rules applied. Total rules applied 728 place count 244 transition count 729
Applied a total of 728 rules in 22 ms. Remains 244 /972 variables (removed 728) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 244 cols
[2024-05-31 10:29:13] [INFO ] Computed 26 invariants in 19 ms
[2024-05-31 10:29:14] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-31 10:29:14] [INFO ] Invariant cache hit.
[2024-05-31 10:29:15] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
[2024-05-31 10:29:15] [INFO ] Invariant cache hit.
[2024-05-31 10:29:15] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1731 ms. Remains : 244/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s52 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-12 finished in 1823 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(X((F(p1)&&p0)))) U X(p2)))'
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 727 places and 0 transitions.
Iterating post reduction 0 with 727 rules applied. Total rules applied 727 place count 245 transition count 729
Applied a total of 727 rules in 11 ms. Remains 245 /972 variables (removed 727) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 245 cols
[2024-05-31 10:29:15] [INFO ] Computed 26 invariants in 16 ms
[2024-05-31 10:29:15] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-31 10:29:16] [INFO ] Invariant cache hit.
[2024-05-31 10:29:16] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-31 10:29:16] [INFO ] Invariant cache hit.
[2024-05-31 10:29:17] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1821 ms. Remains : 245/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 p1)), (AND p1 p0), true, p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s21 0) (EQ s86 1)), p0:(AND (OR (EQ s21 0) (EQ s86 1)) (OR (EQ s82 0) (EQ s32 1))), p1:(OR (EQ s25 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3078 steps with 1485 reset in 204 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-13 finished in 2252 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(!(!G(X(p0)) U (!p0 U !p1)))))'
Support contains 4 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 727 places and 0 transitions.
Iterating post reduction 0 with 727 rules applied. Total rules applied 727 place count 245 transition count 729
Applied a total of 727 rules in 12 ms. Remains 245 /972 variables (removed 727) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 245 cols
[2024-05-31 10:29:17] [INFO ] Computed 26 invariants in 14 ms
[2024-05-31 10:29:18] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-31 10:29:18] [INFO ] Invariant cache hit.
[2024-05-31 10:29:19] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2024-05-31 10:29:19] [INFO ] Invariant cache hit.
[2024-05-31 10:29:19] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1823 ms. Remains : 245/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(OR (EQ s106 0) (EQ s82 1)), p1:(OR (EQ s81 0) (EQ s158 1))], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2577 steps with 36 reset in 107 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-15 finished in 2111 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(G(p0)))'
Found a Lengthening insensitive property : Sudoku-PT-AN09-LTLCardinality-00
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-05-31 10:29:20] [INFO ] Computed 26 invariants in 8 ms
[2024-05-31 10:29:20] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-31 10:29:20] [INFO ] Invariant cache hit.
[2024-05-31 10:29:21] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2024-05-31 10:29:21] [INFO ] Invariant cache hit.
[2024-05-31 10:29:21] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1449 ms. Remains : 243/972 places, 729/729 transitions.
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1420 reset in 4418 ms.
Product exploration explored 100000 steps with 1419 reset in 4430 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 697033 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 697033 steps, saw 140603 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:29:36] [INFO ] Invariant cache hit.
[2024-05-31 10:29:36] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:29:45] [INFO ] After 9263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 243/243 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 696707 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 696707 steps, saw 140517 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:29:49] [INFO ] Invariant cache hit.
[2024-05-31 10:29:49] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:29:58] [INFO ] After 9254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:29:58] [INFO ] Invariant cache hit.
[2024-05-31 10:29:59] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-31 10:29:59] [INFO ] Invariant cache hit.
[2024-05-31 10:29:59] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2024-05-31 10:29:59] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 10:29:59] [INFO ] Invariant cache hit.
[2024-05-31 10:30:00] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1474 ms. Remains : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:30:00] [INFO ] Invariant cache hit.
[2024-05-31 10:30:00] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-31 10:30:09] [INFO ] After 9244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:30:09] [INFO ] Invariant cache hit.
[2024-05-31 10:30:10] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-31 10:30:10] [INFO ] Invariant cache hit.
[2024-05-31 10:30:10] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2024-05-31 10:30:10] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 10:30:10] [INFO ] Invariant cache hit.
[2024-05-31 10:30:11] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1460 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 687615 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 687615 steps, saw 139201 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:30:17] [INFO ] Invariant cache hit.
[2024-05-31 10:30:17] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 10:30:26] [INFO ] After 9267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 243/243 places, 729/729 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 711532 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{}
Probabilistic random walk after 711532 steps, saw 142019 distinct states, run finished after 3002 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:30:30] [INFO ] Invariant cache hit.
[2024-05-31 10:30:30] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 10:30:39] [INFO ] After 9247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:30:39] [INFO ] Invariant cache hit.
[2024-05-31 10:30:39] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-31 10:30:39] [INFO ] Invariant cache hit.
[2024-05-31 10:30:40] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2024-05-31 10:30:40] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 10:30:40] [INFO ] Invariant cache hit.
[2024-05-31 10:30:40] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1453 ms. Remains : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:30:40] [INFO ] Invariant cache hit.
[2024-05-31 10:30:41] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 10:30:50] [INFO ] After 9248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1418 reset in 4346 ms.
Product exploration explored 100000 steps with 1418 reset in 4420 ms.
Built C files in :
/tmp/ltsmin18424037063789851114
[2024-05-31 10:30:59] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:30:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:30:59] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:30:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:30:59] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:30:59] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:30:59] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18424037063789851114
Running compilation step : cd /tmp/ltsmin18424037063789851114;'/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'
Compilation finished in 1800 ms.
Running link step : cd /tmp/ltsmin18424037063789851114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18424037063789851114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2276540440679489474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-31 10:31:14] [INFO ] Invariant cache hit.
[2024-05-31 10:31:14] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 10:31:14] [INFO ] Invariant cache hit.
[2024-05-31 10:31:15] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2024-05-31 10:31:15] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 10:31:15] [INFO ] Invariant cache hit.
[2024-05-31 10:31:15] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1446 ms. Remains : 243/243 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin13723931139648659986
[2024-05-31 10:31:15] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:31:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:31:15] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:31:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:31:15] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:31:15] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:31:15] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13723931139648659986
Running compilation step : cd /tmp/ltsmin13723931139648659986;'/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'
Compilation finished in 1792 ms.
Running link step : cd /tmp/ltsmin13723931139648659986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13723931139648659986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4105118135655519731.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 10:31:30] [INFO ] Flatten gal took : 20 ms
[2024-05-31 10:31:30] [INFO ] Flatten gal took : 20 ms
[2024-05-31 10:31:30] [INFO ] Time to serialize gal into /tmp/LTL917927753411664267.gal : 4 ms
[2024-05-31 10:31:30] [INFO ] Time to serialize properties into /tmp/LTL11353832134610581950.prop : 0 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/LTL917927753411664267.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7205910600466293635.hoa' '-atoms' '/tmp/LTL11353832134610581950.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/LTL11353832134610581950.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7205910600466293635.hoa
Detected timeout of ITS tools.
[2024-05-31 10:31:46] [INFO ] Flatten gal took : 20 ms
[2024-05-31 10:31:46] [INFO ] Flatten gal took : 19 ms
[2024-05-31 10:31:46] [INFO ] Time to serialize gal into /tmp/LTL967655446475952985.gal : 3 ms
[2024-05-31 10:31:46] [INFO ] Time to serialize properties into /tmp/LTL18861680833359786.ltl : 1 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/LTL967655446475952985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18861680833359786.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...272
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...1170
Formula 0 simplified : XF!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0_...1164
Detected timeout of ITS tools.
[2024-05-31 10:32:01] [INFO ] Flatten gal took : 25 ms
[2024-05-31 10:32:01] [INFO ] Applying decomposition
[2024-05-31 10:32:01] [INFO ] Flatten gal took : 20 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/graph2301091853775133667.txt' '-o' '/tmp/graph2301091853775133667.bin' '-w' '/tmp/graph2301091853775133667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2301091853775133667.bin' '-l' '-1' '-v' '-w' '/tmp/graph2301091853775133667.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:32:01] [INFO ] Decomposing Gal with order
[2024-05-31 10:32:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:32:01] [INFO ] Removed a total of 1944 redundant transitions.
[2024-05-31 10:32:01] [INFO ] Flatten gal took : 64 ms
[2024-05-31 10:32:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-31 10:32:01] [INFO ] Time to serialize gal into /tmp/LTL9140384773530261969.gal : 4 ms
[2024-05-31 10:32:01] [INFO ] Time to serialize properties into /tmp/LTL17957022922188655520.ltl : 1 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/LTL9140384773530261969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17957022922188655520.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...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((gu162.Columns_0_0+gu162.Columns_0_1)+(gu162.Columns_0_2+gu162.Columns_0_3))+((gu162.Columns_0_4+gu162.Columns_0_5)+(gu...1656
Formula 0 simplified : XF!"((((((((gu162.Columns_0_0+gu162.Columns_0_1)+(gu162.Columns_0_2+gu162.Columns_0_3))+((gu162.Columns_0_4+gu162.Columns_0_5)+(gu16...1650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17457631389248672605
[2024-05-31 10:32:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17457631389248672605
Running compilation step : cd /tmp/ltsmin17457631389248672605;'/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'
Compilation finished in 1175 ms.
Running link step : cd /tmp/ltsmin17457631389248672605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17457631389248672605;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN09-LTLCardinality-00 finished in 191696 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((p0&&F(p1))))'
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)))'
[2024-05-31 10:32:31] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4158015600542212300
[2024-05-31 10:32:31] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2024-05-31 10:32:31] [INFO ] Applying decomposition
[2024-05-31 10:32:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:32:31] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2024-05-31 10:32:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:32:31] [INFO ] Flatten gal took : 26 ms
[2024-05-31 10:32:31] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2024-05-31 10:32:31] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:32:31] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4158015600542212300
Running compilation step : cd /tmp/ltsmin4158015600542212300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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'
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/graph8278401652886945030.txt' '-o' '/tmp/graph8278401652886945030.bin' '-w' '/tmp/graph8278401652886945030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8278401652886945030.bin' '-l' '-1' '-v' '-w' '/tmp/graph8278401652886945030.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:32:32] [INFO ] Decomposing Gal with order
[2024-05-31 10:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:32:32] [INFO ] Removed a total of 1296 redundant transitions.
[2024-05-31 10:32:32] [INFO ] Flatten gal took : 353 ms
[2024-05-31 10:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-31 10:32:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality11020255195124131007.gal : 5 ms
[2024-05-31 10:32:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality4759165271472503358.ltl : 1 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/LTLCardinality11020255195124131007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4759165271472503358.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...298
Read 3 LTL properties
Checking formula 0 : !((X(G("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...1494
Formula 0 simplified : XF!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_6+...1488
Compilation finished in 2242 ms.
Running link step : cd /tmp/ltsmin4158015600542212300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4158015600542212300;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.066: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.066: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.066: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.112: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.330: DFS-FIFO for weak LTL, using special progress label 734
pins2lts-mc-linux64( 0/ 8), 0.330: There are 735 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.330: State length is 973, there are 733 groups
pins2lts-mc-linux64( 0/ 8), 0.330: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.330: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.330: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.330: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 2.934: ~1 levels ~960 states ~676040 transitions
pins2lts-mc-linux64( 0/ 8), 4.348: ~1 levels ~1920 states ~1351880 transitions
pins2lts-mc-linux64( 0/ 8), 6.835: ~1 levels ~3840 states ~2659736 transitions
pins2lts-mc-linux64( 0/ 8), 11.698: ~1 levels ~7680 states ~5269160 transitions
pins2lts-mc-linux64( 4/ 8), 21.623: ~1 levels ~15360 states ~10463376 transitions
pins2lts-mc-linux64( 3/ 8), 31.923: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 48.054:
pins2lts-mc-linux64( 0/ 8), 48.054: mean standard work distribution: 1.2% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 48.054:
pins2lts-mc-linux64( 0/ 8), 48.054: Explored 21411 states 14565700 transitions, fanout: 680.291
pins2lts-mc-linux64( 0/ 8), 48.054: Total exploration time 47.710 sec (37.260 sec minimum, 42.389 sec on average)
pins2lts-mc-linux64( 0/ 8), 48.054: States per second: 449, Transitions per second: 305297
pins2lts-mc-linux64( 0/ 8), 48.054:
pins2lts-mc-linux64( 0/ 8), 48.054: Progress states detected: 10656156
pins2lts-mc-linux64( 0/ 8), 48.054: Redundant explorations: -99.7991
pins2lts-mc-linux64( 0/ 8), 48.054:
pins2lts-mc-linux64( 0/ 8), 48.054: Queue width: 8B, total height: 10891060, memory: 83.09MB
pins2lts-mc-linux64( 0/ 8), 48.054: Tree memory: 337.3MB, 33.2 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 48.054: Tree fill ratio (roots/leafs): 7.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 48.054: Stored 792 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 48.054: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 48.055: Est. total memory use: 420.4MB (~1107.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4158015600542212300;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4158015600542212300;'/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([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 10:57:39] [INFO ] Applying decomposition
[2024-05-31 10:57:40] [INFO ] Flatten gal took : 220 ms
[2024-05-31 10:57:40] [INFO ] Decomposing Gal with order
[2024-05-31 10:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:57:40] [INFO ] Removed a total of 1274 redundant transitions.
[2024-05-31 10:57:40] [INFO ] Flatten gal took : 359 ms
[2024-05-31 10:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-31 10:57:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality1608116795128968682.gal : 59 ms
[2024-05-31 10:57:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality10093647054884792573.ltl : 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/LTLCardinality1608116795128968682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10093647054884792573.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...298
Read 3 LTL properties
Checking formula 0 : !((X(G("((((((((gu34.Columns_0_0+gu195.Columns_0_1)+(gu196.Columns_0_2+gu40.Columns_0_3))+((gu197.Columns_0_4+gu198.Columns_0_5)+(gu19...1623
Formula 0 simplified : XF!"((((((((gu34.Columns_0_0+gu195.Columns_0_1)+(gu196.Columns_0_2+gu40.Columns_0_3))+((gu197.Columns_0_4+gu198.Columns_0_5)+(gu199....1617
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 135524 kB
After kill :
MemTotal: 16393232 kB
MemFree: 14154068 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-PT-AN09"
export BK_EXAMINATION="LTLCardinality"
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-PT-AN09, examination is LTLCardinality"
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-171690556400397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN09.tgz
mv Sudoku-PT-AN09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;