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-171690556200312.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-COL-AN12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556200312
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 11:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717137054177

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-COL-AN12
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 06:30:55] [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 06:30:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:30:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 06:30:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:30:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 596 ms
[2024-05-31 06:30:56] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 06:30:56] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-31 06:30:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN12-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10073 steps, including 68 resets, run finished after 32 ms. (steps per millisecond=314 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 18 ms. (steps per millisecond=559 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 16 ms. (steps per millisecond=629 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 13 ms. (steps per millisecond=774 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 10 ms. (steps per millisecond=1007 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 10 ms. (steps per millisecond=1007 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:30:56] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 06:30:56] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 06:30:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:30:56] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2024-05-31 06:30:56] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-31 06:30:56] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=143 )
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4/4 places, 1/1 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 3/4 places, 1/1 transitions.
Incomplete random walk after 10073 steps, including 68 resets, run finished after 5 ms. (steps per millisecond=2014 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 5 ms. (steps per millisecond=2014 ) properties (out of 1) seen :0
Finished probabilistic random walk after 284 steps, run visited all 1 properties in 15 ms. (steps per millisecond=18 )
Probabilistic random walk after 284 steps, saw 144 distinct states, run finished after 15 ms. (steps per millisecond=18 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:30:56] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:30:56] [INFO ] Flatten gal took : 1 ms
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2024-05-31 06:30:56] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 32 ms.
[2024-05-31 06:30:56] [INFO ] Unfolded 11 HLPN properties in 7 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:30:57] [INFO ] Computed 432 invariants in 38 ms
[2024-05-31 06:30:57] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-31 06:30:57] [INFO ] Invariant cache hit.
[2024-05-31 06:30:58] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2024-05-31 06:30:58] [INFO ] Invariant cache hit.
[2024-05-31 06:30:59] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2423 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2024-05-31 06:30:59] [INFO ] Flatten gal took : 184 ms
[2024-05-31 06:31:00] [INFO ] Flatten gal took : 147 ms
[2024-05-31 06:31:00] [INFO ] Input system was already deterministic with 1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2029 ms. (steps per millisecond=4 ) properties (out of 17) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-31 06:31:04] [INFO ] Invariant cache hit.
[2024-05-31 06:31:05] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-31 06:31:06] [INFO ] [Nat]Absence check using 432 positive place invariants in 107 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 06:31:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 06:31:30] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 432 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.4 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1670 ms. (steps per millisecond=5 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Probabilistic random walk after 153152 steps, saw 125679 distinct states, run finished after 9062 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:31:42] [INFO ] Computed 35 invariants in 115 ms
[2024-05-31 06:31:43] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 28 ms returned sat
[2024-05-31 06:31:43] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 06:31:43] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 27 ms returned sat
[2024-05-31 06:31:44] [INFO ] After 946ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-31 06:31:44] [INFO ] After 1447ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 281 ms.
[2024-05-31 06:31:45] [INFO ] After 1959ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 8 properties in 16 ms. (steps per millisecond=9 )
Parikh walk visited 6 properties in 17 ms.
Support contains 288 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 43 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 432/432 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1199 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Probabilistic random walk after 122534 steps, saw 95086 distinct states, run finished after 3007 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 06:31:49] [INFO ] Invariant cache hit.
[2024-05-31 06:31:49] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 32 ms returned sat
[2024-05-31 06:31:51] [INFO ] After 1980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 06:31:51] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 29 ms returned sat
[2024-05-31 06:31:54] [INFO ] After 2396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 06:31:54] [INFO ] After 2533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-31 06:31:54] [INFO ] After 2722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-AN12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 65 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:31:55] [INFO ] Computed 432 invariants in 23 ms
[2024-05-31 06:31:55] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-31 06:31:55] [INFO ] Invariant cache hit.
[2024-05-31 06:31:57] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2024-05-31 06:31:57] [INFO ] Redundant transitions in 97 ms returned []
[2024-05-31 06:31:57] [INFO ] Invariant cache hit.
[2024-05-31 06:31:58] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3838 ms. Remains : 2160/2160 places, 1728/1728 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-00 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 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 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]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 30 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-00 finished in 4106 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(F(p0))||G(p1))))'
Support contains 288 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.7 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:31:59] [INFO ] Computed 35 invariants in 107 ms
[2024-05-31 06:31:59] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-31 06:31:59] [INFO ] Invariant cache hit.
[2024-05-31 06:32:01] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2024-05-31 06:32:01] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-31 06:32:01] [INFO ] Invariant cache hit.
[2024-05-31 06:32:01] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2893 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 2 (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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 85620 steps with 679 reset in 10002 ms.
Product exploration timeout after 83940 steps with 666 reset in 10003 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1347 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 128940 steps, run timeout after 3006 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128940 steps, saw 101486 distinct states, run finished after 3007 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 06:33:21] [INFO ] Invariant cache hit.
[2024-05-31 06:33:21] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 29 ms returned sat
[2024-05-31 06:33:21] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 06:33:21] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 28 ms returned sat
[2024-05-31 06:33:22] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 06:33:22] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-31 06:33:22] [INFO ] After 1266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 22 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 288 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 16 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:33:23] [INFO ] Invariant cache hit.
[2024-05-31 06:33:23] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-31 06:33:23] [INFO ] Invariant cache hit.
[2024-05-31 06:33:25] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
[2024-05-31 06:33:25] [INFO ] Redundant transitions in 102 ms returned []
[2024-05-31 06:33:25] [INFO ] Invariant cache hit.
[2024-05-31 06:33:26] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3075 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1350 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 126022 steps, run timeout after 3003 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 126022 steps, saw 98570 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 06:34:25] [INFO ] Invariant cache hit.
[2024-05-31 06:34:25] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 30 ms returned sat
[2024-05-31 06:34:25] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 06:34:26] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 27 ms returned sat
[2024-05-31 06:34:26] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 06:34:27] [INFO ] After 1064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-31 06:34:27] [INFO ] After 1259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 25 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 85610 steps with 680 reset in 10001 ms.
Product exploration timeout after 85030 steps with 675 reset in 10001 ms.
Built C files in :
/tmp/ltsmin7117635675761415828
[2024-05-31 06:34:47] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2024-05-31 06:34:47] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7117635675761415828
Running compilation step : cd /tmp/ltsmin7117635675761415828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7117635675761415828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7117635675761415828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 288 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:34:50] [INFO ] Invariant cache hit.
[2024-05-31 06:34:50] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 06:34:50] [INFO ] Invariant cache hit.
[2024-05-31 06:34:53] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2024-05-31 06:34:53] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 06:34:53] [INFO ] Invariant cache hit.
[2024-05-31 06:34:53] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2837 ms. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin11021678217858563024
[2024-05-31 06:34:53] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2024-05-31 06:34:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11021678217858563024
Running compilation step : cd /tmp/ltsmin11021678217858563024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11021678217858563024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11021678217858563024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:34:56] [INFO ] Flatten gal took : 72 ms
[2024-05-31 06:34:57] [INFO ] Flatten gal took : 83 ms
[2024-05-31 06:34:57] [INFO ] Time to serialize gal into /tmp/LTL14904098401708912450.gal : 24 ms
[2024-05-31 06:34:57] [INFO ] Time to serialize properties into /tmp/LTL5380183102967693944.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/LTL14904098401708912450.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12735008780678133863.hoa' '-atoms' '/tmp/LTL5380183102967693944.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/LTL5380183102967693944.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12735008780678133863.hoa
Detected timeout of ITS tools.
[2024-05-31 06:35:12] [INFO ] Flatten gal took : 62 ms
[2024-05-31 06:35:12] [INFO ] Flatten gal took : 60 ms
[2024-05-31 06:35:12] [INFO ] Time to serialize gal into /tmp/LTL10015433903700410911.gal : 9 ms
[2024-05-31 06:35:12] [INFO ] Time to serialize properties into /tmp/LTL2939689201080071000.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10015433903700410911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2939689201080071000.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((G(F("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)...3431
Formula 0 simplified : G(FG!"(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(C...3421
Detected timeout of ITS tools.
[2024-05-31 06:35:27] [INFO ] Flatten gal took : 62 ms
[2024-05-31 06:35:27] [INFO ] Applying decomposition
[2024-05-31 06:35:27] [INFO ] Flatten gal took : 63 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/graph1134357523031117818.txt' '-o' '/tmp/graph1134357523031117818.bin' '-w' '/tmp/graph1134357523031117818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1134357523031117818.bin' '-l' '-1' '-v' '-w' '/tmp/graph1134357523031117818.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:35:27] [INFO ] Decomposing Gal with order
[2024-05-31 06:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:35:28] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 06:35:28] [INFO ] Flatten gal took : 795 ms
[2024-05-31 06:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-31 06:35:28] [INFO ] Time to serialize gal into /tmp/LTL7162415139156997080.gal : 24 ms
[2024-05-31 06:35:28] [INFO ] Time to serialize properties into /tmp/LTL3558997649539508782.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/LTL7162415139156997080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3558997649539508782.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 : !((F((G(F("(((((((((gu145.Columns_0+gu145.Columns_1)+(gu145.Columns_2+gu145.Columns_3))+((gu145.Columns_4+gu145.Columns_5)+(gu145.Colu...4871
Formula 0 simplified : G(FG!"(((((((((gu145.Columns_0+gu145.Columns_1)+(gu145.Columns_2+gu145.Columns_3))+((gu145.Columns_4+gu145.Columns_5)+(gu145.Columns...4861
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13389301373741475111
[2024-05-31 06:35:43] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13389301373741475111
Running compilation step : cd /tmp/ltsmin13389301373741475111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13389301373741475111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13389301373741475111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN12-LTLCardinality-02 finished in 227991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(G((!(p0 U !p1)&&G(!p0))))))))'
Support contains 2016 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 22 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:35:47] [INFO ] Computed 432 invariants in 10 ms
[2024-05-31 06:35:47] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-31 06:35:47] [INFO ] Invariant cache hit.
[2024-05-31 06:35:49] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2024-05-31 06:35:49] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 06:35:49] [INFO ] Invariant cache hit.
[2024-05-31 06:35:50] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3031 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s20...], 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 123 steps with 0 reset in 31 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-03 finished in 3138 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 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.5 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 78 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:35:50] [INFO ] Computed 35 invariants in 40 ms
[2024-05-31 06:35:50] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-31 06:35:50] [INFO ] Invariant cache hit.
[2024-05-31 06:35:51] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
[2024-05-31 06:35:51] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-31 06:35:51] [INFO ] Invariant cache hit.
[2024-05-31 06:35:52] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2289 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 18 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-04 finished in 2363 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)&&X((p1 U (p1&&G(p2)))))))'
Support contains 2016 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 12 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:35:52] [INFO ] Computed 432 invariants in 11 ms
[2024-05-31 06:35:53] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-31 06:35:53] [INFO ] Invariant cache hit.
[2024-05-31 06:35:54] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2024-05-31 06:35:54] [INFO ] Invariant cache hit.
[2024-05-31 06:35:55] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2935 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 28 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-05 finished in 3253 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((F(p0)&&X(p1)))))'
Support contains 288 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 20 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:35:55] [INFO ] Computed 35 invariants in 47 ms
[2024-05-31 06:35:55] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-31 06:35:55] [INFO ] Invariant cache hit.
[2024-05-31 06:35:57] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2024-05-31 06:35:57] [INFO ] Invariant cache hit.
[2024-05-31 06:35:57] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1928 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 1 reset in 16 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-06 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((F(p0)&&G((!p1||X(G(!p2)))))))'
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 11 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:35:57] [INFO ] Computed 432 invariants in 6 ms
[2024-05-31 06:35:58] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-31 06:35:58] [INFO ] Invariant cache hit.
[2024-05-31 06:35:59] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2024-05-31 06:35:59] [INFO ] Invariant cache hit.
[2024-05-31 06:36:00] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2248 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p2), (AND p1 p2), p2, true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=p2, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LEQ (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 85180 steps with 675 reset in 10001 ms.
Product exploration timeout after 83860 steps with 665 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1158 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p2, p2, p2]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1138 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 218863 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218863 steps, saw 165292 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:54:16] [INFO ] Invariant cache hit.
[2024-05-31 06:54:16] [INFO ] [Real]Absence check using 432 positive place invariants in 105 ms returned sat
[2024-05-31 06:54:41] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.2 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1138 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249733 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249733 steps, saw 171310 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:54:45] [INFO ] Computed 35 invariants in 48 ms
[2024-05-31 06:54:45] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 25 ms returned sat
[2024-05-31 06:54:46] [INFO ] After 1140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:54:46] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 27 ms returned sat
[2024-05-31 06:54:47] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:54:47] [INFO ] After 1152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-31 06:54:47] [INFO ] After 1289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 144 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 16 factoid took 1433 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 109 ms :[true, p2, p2, p2]
Support contains 144 out of 2160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 8 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:54:49] [INFO ] Computed 432 invariants in 8 ms
[2024-05-31 06:54:49] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 06:54:49] [INFO ] Invariant cache hit.
[2024-05-31 06:54:50] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2024-05-31 06:54:50] [INFO ] Invariant cache hit.
[2024-05-31 06:54:51] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2248 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p2, p2, p2]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1121 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 229918 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229918 steps, saw 167586 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 06:55:24] [INFO ] Invariant cache hit.
[2024-05-31 06:55:25] [INFO ] [Real]Absence check using 432 positive place invariants in 102 ms returned sat
[2024-05-31 06:55:49] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.2 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1107 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253164 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253164 steps, saw 172070 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 06:55:54] [INFO ] Computed 35 invariants in 50 ms
[2024-05-31 06:55:54] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2024-05-31 06:55:55] [INFO ] After 1097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:55:55] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2024-05-31 06:55:56] [INFO ] After 1073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 06:55:56] [INFO ] After 1137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-31 06:55:56] [INFO ] After 1270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 144 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(NOT p2), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 119 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 123 ms :[true, p2, p2, p2]
Product exploration timeout after 86220 steps with 683 reset in 10001 ms.
Product exploration timeout after 86000 steps with 682 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 97 ms :[true, p2, p2, p2]
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.5 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 80 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:56:17] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 06:56:17] [INFO ] Invariant cache hit.
[2024-05-31 06:56:17] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 432/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin3148267192623680992
[2024-05-31 06:56:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3148267192623680992
Running compilation step : cd /tmp/ltsmin3148267192623680992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3148267192623680992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3148267192623680992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 22 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:56:21] [INFO ] Invariant cache hit.
[2024-05-31 06:56:21] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 06:56:21] [INFO ] Invariant cache hit.
[2024-05-31 06:56:22] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2024-05-31 06:56:22] [INFO ] Invariant cache hit.
[2024-05-31 06:56:23] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2235 ms. Remains : 432/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin7500469538890596879
[2024-05-31 06:56:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7500469538890596879
Running compilation step : cd /tmp/ltsmin7500469538890596879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7500469538890596879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7500469538890596879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 06:56:26] [INFO ] Flatten gal took : 96 ms
[2024-05-31 06:56:26] [INFO ] Flatten gal took : 136 ms
[2024-05-31 06:56:26] [INFO ] Time to serialize gal into /tmp/LTL16609204558623300526.gal : 16 ms
[2024-05-31 06:56:26] [INFO ] Time to serialize properties into /tmp/LTL543032077468092683.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/LTL16609204558623300526.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14745804634214349286.hoa' '-atoms' '/tmp/LTL543032077468092683.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/LTL543032077468092683.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14745804634214349286.hoa
Detected timeout of ITS tools.
[2024-05-31 06:56:41] [INFO ] Flatten gal took : 71 ms
[2024-05-31 06:56:41] [INFO ] Flatten gal took : 71 ms
[2024-05-31 06:56:41] [INFO ] Time to serialize gal into /tmp/LTL2840962920207643770.gal : 10 ms
[2024-05-31 06:56:41] [INFO ] Time to serialize properties into /tmp/LTL17139449038992207876.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/LTL2840962920207643770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17139449038992207876.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((F("((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11...47762
Formula 0 simplified : X(G!"((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))...47750
Detected timeout of ITS tools.
[2024-05-31 06:56:57] [INFO ] Flatten gal took : 83 ms
[2024-05-31 06:56:57] [INFO ] Applying decomposition
[2024-05-31 06:56:57] [INFO ] Flatten gal took : 66 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/graph10233969948817997614.txt' '-o' '/tmp/graph10233969948817997614.bin' '-w' '/tmp/graph10233969948817997614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10233969948817997614.bin' '-l' '-1' '-v' '-w' '/tmp/graph10233969948817997614.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:57:05] [INFO ] Decomposing Gal with order
[2024-05-31 06:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:57:07] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 06:57:07] [INFO ] Flatten gal took : 2007 ms
[2024-05-31 06:57:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-31 06:57:08] [INFO ] Time to serialize gal into /tmp/LTL6830316981666133948.gal : 15 ms
[2024-05-31 06:57:08] [INFO ] Time to serialize properties into /tmp/LTL15256221284738173298.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/LTL6830316981666133948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15256221284738173298.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((F("((((((((((((gi1.gu1.Board_0+gi1.gu1.Board_1)+(gi1.gu1.Board_2+gi1.gu1.Board_3))+((gi1.gu1.Board_4+gi1.gu1.Board_5)+(gi1.gu1.B...77714
Formula 0 simplified : X(G!"((((((((((((gi1.gu1.Board_0+gi1.gu1.Board_1)+(gi1.gu1.Board_2+gi1.gu1.Board_3))+((gi1.gu1.Board_4+gi1.gu1.Board_5)+(gi1.gu1.Boa...77702
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12102536832884008075
[2024-05-31 06:57:23] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12102536832884008075
Running compilation step : cd /tmp/ltsmin12102536832884008075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12102536832884008075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12102536832884008075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN12-LTLCardinality-07 finished in 1288571 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(((p1||(G(p1) U X(p2)))&&p0))))'
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 5 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:57:26] [INFO ] Computed 432 invariants in 11 ms
[2024-05-31 06:57:26] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 06:57:26] [INFO ] Invariant cache hit.
[2024-05-31 06:57:27] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
[2024-05-31 06:57:27] [INFO ] Invariant cache hit.
[2024-05-31 06:57:28] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2226 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LEQ 2 (ADD s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1884 s1885 s1886 s1887 s1888 s1889 s1890 s1891 s1892 s1893 s1...], 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][false, false, false, false]]
Product exploration timeout after 57040 steps with 452 reset in 10002 ms.
Product exploration timeout after 56420 steps with 448 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 864 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1906 ms. (steps per millisecond=5 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-31 07:08:34] [INFO ] Invariant cache hit.
[2024-05-31 07:08:35] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 07:08:35] [INFO ] [Nat]Absence check using 432 positive place invariants in 102 ms returned sat
[2024-05-31 07:08:48] [INFO ] After 1264ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-31 07:08:48] [INFO ] After 1399ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-31 07:08:48] [INFO ] After 12959ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 12 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p0 p2))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (AND p1 p0 p2))), (F (OR (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 16 factoid took 2272 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLCardinality-09 finished in 684270 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((F(!p0)||X((p1&&X((p1 U ((!p0 U (G(!p0)||(!p0&&G(p2))))||G(p1))))))))))'
Support contains 288 out of 2160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 16 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-31 07:08:50] [INFO ] Computed 35 invariants in 44 ms
[2024-05-31 07:08:50] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 07:08:50] [INFO ] Invariant cache hit.
[2024-05-31 07:08:51] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-31 07:08:51] [INFO ] Invariant cache hit.
[2024-05-31 07:08:51] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1146 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 19 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-13 finished in 1358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((F(p1)&&(p1||G(!p2)))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 12 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 07:08:52] [INFO ] Computed 432 invariants in 11 ms
[2024-05-31 07:08:52] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-31 07:08:52] [INFO ] Invariant cache hit.
[2024-05-31 07:08:54] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
[2024-05-31 07:08:54] [INFO ] Invariant cache hit.
[2024-05-31 07:08:55] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3544 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 (ADD s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 50680 steps with 25340 reset in 10001 ms.
Product exploration timeout after 50710 steps with 25355 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 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-COL-AN12-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLCardinality-15 finished in 138591 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(F(p0))||G(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' '!(X((F(p0)&&G((!p1||X(G(!p2)))))))'
[2024-05-31 07:11:10] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1452183125013169555
[2024-05-31 07:11:10] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2024-05-31 07:11:10] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1452183125013169555
Running compilation step : cd /tmp/ltsmin1452183125013169555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 07:11:10] [INFO ] Applying decomposition
[2024-05-31 07:11:11] [INFO ] Flatten gal took : 66 ms
Compilation finished in 4491 ms.
Running link step : cd /tmp/ltsmin1452183125013169555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin1452183125013169555;'/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' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
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/graph10929004728636700297.txt' '-o' '/tmp/graph10929004728636700297.bin' '-w' '/tmp/graph10929004728636700297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10929004728636700297.bin' '-l' '-1' '-v' '-w' '/tmp/graph10929004728636700297.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:11:21] [INFO ] Decomposing Gal with order
[2024-05-31 07:11:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:11:25] [INFO ] Removed a total of 4752 redundant transitions.
[2024-05-31 07:11:26] [INFO ] Flatten gal took : 4405 ms
[2024-05-31 07:11:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2024-05-31 07:11:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality4718283711266820647.gal : 43 ms
[2024-05-31 07:11:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality16733527572073935057.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/LTLCardinality4718283711266820647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16733527572073935057.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 2 LTL properties
Checking formula 0 : !((F((G(F("(((((((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Colu...4583
Formula 0 simplified : G(FG!"(((((((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns...4573
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 250764 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15984208 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-COL-AN12"
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-COL-AN12, 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-171690556200312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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