Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532500508.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 itstools
Input is Sudoku-COL-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532500508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 10:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 10:13 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 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-AN13-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717036499120

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 02:35:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:35:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:35:00] [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-30 02:35:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 02:35:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 496 ms
[2024-05-30 02:35:00] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 02:35:01] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 02:35:01] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 1 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-30 02:35:01] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:35:01] [INFO ] Flatten gal took : 2 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2024-05-30 02:35:01] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 64 ms.
[2024-05-30 02:35:01] [INFO ] Unfolded 15 HLPN properties in 8 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 51 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 02:35:04] [INFO ] Computed 38 invariants in 132 ms
[2024-05-30 02:35:05] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-30 02:35:05] [INFO ] Invariant cache hit.
[2024-05-30 02:35:06] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2214 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2024-05-30 02:35:07] [INFO ] Flatten gal took : 437 ms
[2024-05-30 02:35:10] [INFO ] Flatten gal took : 468 ms
[2024-05-30 02:35:14] [INFO ] Input system was already deterministic with 2197 transitions.
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (268 resets) in 6959 ms. (5 steps per ms) remains 1/2 properties
BEST_FIRST walk for 17120 steps (2 resets) in 22438 ms. (0 steps per ms) remains 1/1 properties
[2024-05-30 02:35:21] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 507/2704 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 151 ms.
Refiners :[Generalized P Invariants (flows): 0/38 constraints, State Equation: 0/507 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5953ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-COL-AN13-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:35:28] [INFO ] Invariant cache hit.
[2024-05-30 02:35:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 02:35:28] [INFO ] Invariant cache hit.
[2024-05-30 02:35:30] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2024-05-30 02:35:30] [INFO ] Redundant transitions in 106 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1844 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-00
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 35 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-00 finished in 2180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:35:30] [INFO ] Invariant cache hit.
[2024-05-30 02:35:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 02:35:31] [INFO ] Invariant cache hit.
[2024-05-30 02:35:32] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-05-30 02:35:32] [INFO ] Redundant transitions in 39 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1799 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-01
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 24 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-01 finished in 1927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:35:32] [INFO ] Invariant cache hit.
[2024-05-30 02:35:32] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-30 02:35:32] [INFO ] Invariant cache hit.
[2024-05-30 02:35:34] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1791 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-02
Product exploration timeout after 51430 steps with 25715 reset in 10001 ms.
Product exploration timeout after 51410 steps with 25705 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 27 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-02 finished in 23580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 16 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:35:56] [INFO ] Invariant cache hit.
[2024-05-30 02:35:56] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 02:35:56] [INFO ] Invariant cache hit.
[2024-05-30 02:35:58] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-30 02:35:58] [INFO ] Redundant transitions in 100 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1915 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-03
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 22 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-03 finished in 2059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X((p0&&X(p0)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:35:58] [INFO ] Invariant cache hit.
[2024-05-30 02:35:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-30 02:35:58] [INFO ] Invariant cache hit.
[2024-05-30 02:36:00] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1771 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, p0, (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-04
Product exploration timeout after 74140 steps with 1036 reset in 10001 ms.
Product exploration timeout after 73740 steps with 922 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 587 steps (0 resets) in 156 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:36:22] [INFO ] Invariant cache hit.
[2024-05-30 02:36:23] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 02:36:23] [INFO ] Invariant cache hit.
[2024-05-30 02:36:24] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1844 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 588 steps (0 resets) in 169 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 39150 steps with 13050 reset in 10001 ms.
Product exploration timeout after 38920 steps with 12973 reset in 10001 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 17 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:36:47] [INFO ] Redundant transitions in 42 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin14139406840124213806
[2024-05-30 02:36:47] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14139406840124213806
Running compilation step : cd /tmp/ltsmin14139406840124213806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14139406840124213806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14139406840124213806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:36:50] [INFO ] Invariant cache hit.
[2024-05-30 02:36:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 02:36:50] [INFO ] Invariant cache hit.
[2024-05-30 02:36:52] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1759 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin5293980047038689345
[2024-05-30 02:36:52] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5293980047038689345
Running compilation step : cd /tmp/ltsmin5293980047038689345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin5293980047038689345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin5293980047038689345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 02:36:57] [INFO ] Flatten gal took : 188 ms
[2024-05-30 02:36:57] [INFO ] Flatten gal took : 167 ms
[2024-05-30 02:36:57] [INFO ] Time to serialize gal into /tmp/LTL18099784742326061290.gal : 40 ms
[2024-05-30 02:36:57] [INFO ] Time to serialize properties into /tmp/LTL13137863001330255382.prop : 35 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18099784742326061290.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5024946893775771132.hoa' '-atoms' '/tmp/LTL13137863001330255382.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13137863001330255382.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5024946893775771132.hoa
Detected timeout of ITS tools.
[2024-05-30 02:37:13] [INFO ] Flatten gal took : 132 ms
[2024-05-30 02:37:13] [INFO ] Flatten gal took : 133 ms
[2024-05-30 02:37:13] [INFO ] Time to serialize gal into /tmp/LTL14207512061848675070.gal : 42 ms
[2024-05-30 02:37:13] [INFO ] Time to serialize properties into /tmp/LTL181653497224877814.ltl : 75 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14207512061848675070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL181653497224877814.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((Rows_82<1)||(Cells_89<1))||(Columns_147<1))&&(((Rows_136<1)||(Cells_133<1))||(Columns_45<1)))&&((((Rows_116<1)||...343085
Formula 0 simplified : G!"(((((((((((((((Rows_82<1)||(Cells_89<1))||(Columns_147<1))&&(((Rows_136<1)||(Cells_133<1))||(Columns_45<1)))&&((((Rows_116<1)||(C...343075
Detected timeout of ITS tools.
[2024-05-30 02:37:28] [INFO ] Flatten gal took : 126 ms
[2024-05-30 02:37:28] [INFO ] Applying decomposition
[2024-05-30 02:37:28] [INFO ] Flatten gal took : 129 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10202617923651962532.txt' '-o' '/tmp/graph10202617923651962532.bin' '-w' '/tmp/graph10202617923651962532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10202617923651962532.bin' '-l' '-1' '-v' '-w' '/tmp/graph10202617923651962532.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:37:29] [INFO ] Decomposing Gal with order
[2024-05-30 02:37:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:37:29] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 02:37:30] [INFO ] Flatten gal took : 324 ms
[2024-05-30 02:37:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-30 02:37:30] [INFO ] Time to serialize gal into /tmp/LTL10966587516905212384.gal : 19 ms
[2024-05-30 02:37:30] [INFO ] Time to serialize properties into /tmp/LTL787404406427251387.ltl : 38 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10966587516905212384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL787404406427251387.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u82.Rows_82<1)||(u258.Cells_89<1))||(u485.Columns_147<1))&&(((u136.Rows_136<1)||(u302.Cells_133<1))||(u383.Colum...437660
Formula 0 simplified : G!"(((((((((((((((u82.Rows_82<1)||(u258.Cells_89<1))||(u485.Columns_147<1))&&(((u136.Rows_136<1)||(u302.Cells_133<1))||(u383.Columns...437650
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN13-LTLFireability-04 finished in 106842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:37:45] [INFO ] Invariant cache hit.
[2024-05-30 02:37:45] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-30 02:37:45] [INFO ] Invariant cache hit.
[2024-05-30 02:37:47] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1830 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-05
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 25 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-05 finished in 1978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X((X(p0)||p1)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:37:47] [INFO ] Invariant cache hit.
[2024-05-30 02:37:47] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-30 02:37:47] [INFO ] Invariant cache hit.
[2024-05-30 02:37:49] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1779 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), false, false, false, false, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-07
Product exploration timeout after 39160 steps with 13053 reset in 10001 ms.
Product exploration timeout after 39280 steps with 13093 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p1 p0), (X p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 590 steps (0 resets) in 251 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:38:13] [INFO ] Invariant cache hit.
[2024-05-30 02:38:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 02:38:13] [INFO ] Invariant cache hit.
[2024-05-30 02:38:15] [INFO ] Implicit Places using invariants and state equation in 1701 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 1811 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 587 steps (0 resets) in 172 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Product exploration timeout after 39630 steps with 13210 reset in 10004 ms.
Product exploration timeout after 39460 steps with 13153 reset in 10001 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:38:39] [INFO ] Redundant transitions in 42 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin1856407253036283397
[2024-05-30 02:38:39] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1856407253036283397
Running compilation step : cd /tmp/ltsmin1856407253036283397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1856407253036283397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1856407253036283397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:38:42] [INFO ] Invariant cache hit.
[2024-05-30 02:38:42] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-30 02:38:42] [INFO ] Invariant cache hit.
[2024-05-30 02:38:44] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1729 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin10127067278480856440
[2024-05-30 02:38:44] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10127067278480856440
Running compilation step : cd /tmp/ltsmin10127067278480856440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10127067278480856440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10127067278480856440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 02:38:47] [INFO ] Flatten gal took : 115 ms
[2024-05-30 02:38:47] [INFO ] Flatten gal took : 223 ms
[2024-05-30 02:38:47] [INFO ] Time to serialize gal into /tmp/LTL16403107055377170744.gal : 24 ms
[2024-05-30 02:38:47] [INFO ] Time to serialize properties into /tmp/LTL3416265890090185500.prop : 35 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16403107055377170744.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17925936087979638776.hoa' '-atoms' '/tmp/LTL3416265890090185500.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3416265890090185500.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17925936087979638776.hoa
Detected timeout of ITS tools.
[2024-05-30 02:39:03] [INFO ] Flatten gal took : 117 ms
[2024-05-30 02:39:03] [INFO ] Flatten gal took : 138 ms
[2024-05-30 02:39:03] [INFO ] Time to serialize gal into /tmp/LTL11290159910836002732.gal : 103 ms
[2024-05-30 02:39:03] [INFO ] Time to serialize properties into /tmp/LTL3302540660812912371.ltl : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11290159910836002732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3302540660812912371.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((((((Rows_82<1)||(Cells_89<1))||(Columns_147<1))&&(((Rows_136<1)||(Cells_133<1))||(Columns_45<1)))&&((((Rows_116<1)...343104
Formula 0 simplified : X(F!"(((((((((((((((Rows_82<1)||(Cells_89<1))||(Columns_147<1))&&(((Rows_136<1)||(Cells_133<1))||(Columns_45<1)))&&((((Rows_116<1)||...343086
Detected timeout of ITS tools.
[2024-05-30 02:39:18] [INFO ] Flatten gal took : 117 ms
[2024-05-30 02:39:18] [INFO ] Applying decomposition
[2024-05-30 02:39:19] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13797746880003441794.txt' '-o' '/tmp/graph13797746880003441794.bin' '-w' '/tmp/graph13797746880003441794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13797746880003441794.bin' '-l' '-1' '-v' '-w' '/tmp/graph13797746880003441794.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:39:19] [INFO ] Decomposing Gal with order
[2024-05-30 02:39:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:39:19] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 02:39:19] [INFO ] Flatten gal took : 346 ms
[2024-05-30 02:39:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2024-05-30 02:39:20] [INFO ] Time to serialize gal into /tmp/LTL173191584449014845.gal : 66 ms
[2024-05-30 02:39:20] [INFO ] Time to serialize properties into /tmp/LTL7029289321490627872.ltl : 180 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL173191584449014845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7029289321490627872.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((((((u82.Rows_82<1)||(u258.Cells_89<1))||(u485.Columns_147<1))&&(((u136.Rows_136<1)||(u302.Cells_133<1))||(u383.Col...437679
Formula 0 simplified : X(F!"(((((((((((((((u82.Rows_82<1)||(u258.Cells_89<1))||(u485.Columns_147<1))&&(((u136.Rows_136<1)||(u302.Cells_133<1))||(u383.Colum...437661
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN13-LTLFireability-07 finished in 108150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 12 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:39:35] [INFO ] Invariant cache hit.
[2024-05-30 02:39:35] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-30 02:39:35] [INFO ] Invariant cache hit.
[2024-05-30 02:39:37] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2024-05-30 02:39:37] [INFO ] Redundant transitions in 43 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1783 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-09
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 29 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-09 finished in 1912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:39:37] [INFO ] Invariant cache hit.
[2024-05-30 02:39:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-30 02:39:37] [INFO ] Invariant cache hit.
[2024-05-30 02:39:39] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
[2024-05-30 02:39:39] [INFO ] Redundant transitions in 42 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1745 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-10
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 22 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-10 finished in 1827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:39:39] [INFO ] Invariant cache hit.
[2024-05-30 02:39:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 02:39:39] [INFO ] Invariant cache hit.
[2024-05-30 02:39:40] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1725 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-12
Product exploration timeout after 51280 steps with 25640 reset in 10001 ms.
Product exploration timeout after 51390 steps with 25695 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLFireability-12 finished in 23405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:40:02] [INFO ] Invariant cache hit.
[2024-05-30 02:40:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 02:40:02] [INFO ] Invariant cache hit.
[2024-05-30 02:40:04] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 1740 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-13
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 24 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-13 finished in 1951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 10 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 02:40:04] [INFO ] Invariant cache hit.
[2024-05-30 02:40:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-30 02:40:04] [INFO ] Invariant cache hit.
[2024-05-30 02:40:06] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2024-05-30 02:40:06] [INFO ] Redundant transitions in 42 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1800 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLFireability-15
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 19 ms.
FORMULA Sudoku-COL-AN13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLFireability-15 finished in 1903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X((p0&&X(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X((X(p0)||p1)))))'
[2024-05-30 02:40:07] [INFO ] Flatten gal took : 214 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2823666926928894064
[2024-05-30 02:40:07] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 02:40:07] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2823666926928894064
Running compilation step : cd /tmp/ltsmin2823666926928894064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 02:40:07] [INFO ] Applying decomposition
[2024-05-30 02:40:07] [INFO ] Flatten gal took : 226 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2081963500563784208.txt' '-o' '/tmp/graph2081963500563784208.bin' '-w' '/tmp/graph2081963500563784208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2081963500563784208.bin' '-l' '-1' '-v' '-w' '/tmp/graph2081963500563784208.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:40:07] [INFO ] Decomposing Gal with order
[2024-05-30 02:40:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:40:08] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 02:40:09] [INFO ] Flatten gal took : 471 ms
[2024-05-30 02:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-30 02:40:09] [INFO ] Time to serialize gal into /tmp/LTLFireability18194036219175715084.gal : 42 ms
[2024-05-30 02:40:09] [INFO ] Time to serialize properties into /tmp/LTLFireability11283476446309772638.ltl : 108 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18194036219175715084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11283476446309772638.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !(((F(!("(((((((((((((((u82.Rows_82>=1)&&(u258.Cells_89>=1))&&(u485.Columns_147>=1))||(((u136.Rows_136>=1)&&(u302.Cells_133>=1))&&(u38...444254
Formula 0 simplified : G"(((((((((((((((u82.Rows_82>=1)&&(u258.Cells_89>=1))&&(u485.Columns_147>=1))||(((u136.Rows_136>=1)&&(u302.Cells_133>=1))&&(u383.Col...444240
Compilation finished in 8256 ms.
Running link step : cd /tmp/ltsmin2823666926928894064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 177 ms.
Running LTSmin : cd /tmp/ltsmin2823666926928894064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!(LTLAPp0==true))&&X(((LTLAPp0==true)&&X((LTLAPp0==true)))))' '--buchi-type=spotba'

BK_STOP 1717037374637

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN13, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532500508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;