Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491200348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Sudoku-COL-AN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491200348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749212143913

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-AN04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-06 12:15:46] [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]
[2025-06-06 12:15:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 12:15:46] [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.
[2025-06-06 12:15:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-06 12:15:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1181 ms
[2025-06-06 12:15:48] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2025-06-06 12:15:48] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 11 ms.
[2025-06-06 12:15:48] [INFO ] Skeletonized 16 HLPN properties in 3 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 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-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).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-06 12:15:48] [INFO ] Flatten gal took : 39 ms
[2025-06-06 12:15:48] [INFO ] Flatten gal took : 7 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2025-06-06 12:15:48] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 31 ms.
[2025-06-06 12:15:48] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 28 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2025-06-06 12:15:49] [INFO ] Computed 11 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:15:49] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-06 12:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:15:49] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2025-06-06 12:15:49] [INFO ] Flatten gal took : 37 ms
[2025-06-06 12:15:49] [INFO ] Flatten gal took : 80 ms
[2025-06-06 12:15:50] [INFO ] Input system was already deterministic with 64 transitions.
Reduction of identical properties reduced properties to check from 4 to 1
RANDOM walk for 54 steps (0 resets) in 10 ms. (4 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN04-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN04-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((X(p0)||p1) U (G((X(p0)||p2))||(p0&&(X(p0)||p3)))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:15:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-06 12:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:15:50] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 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 119 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-00
Product exploration explored 100000 steps with 6953 reset in 2592 ms.
Product exploration explored 100000 steps with 6947 reset in 1881 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X (NOT p0)), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))))), (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p2 (NOT p3) (NOT p1))))), (X (NOT (AND p2 p0 (NOT p3) p1))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) (NOT p3) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p2 (NOT p3) (NOT p1)))))), (X (X (NOT (AND p2 p0 (NOT p3) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 329 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (AND (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 12 to 6
RANDOM walk for 40000 steps (2780 resets) in 3800 ms. (10 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (132 resets) in 1231 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 1965 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 1292 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 2663 ms. (15 steps per ms) remains 4/4 properties
[2025-06-06 12:15:59] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 48/112 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 105 ms.
Refiners :[Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/48 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X (NOT p0)), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))))), (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p2 (NOT p3) (NOT p1))))), (X (NOT (AND p2 p0 (NOT p3) p1))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) (NOT p3) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p2 (NOT p3) (NOT p1)))))), (X (X (NOT (AND p2 p0 (NOT p3) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p3))), (G (OR p0 p1 p2)), (G (OR (NOT p0) (NOT p1) (NOT p2) p3)), (G (AND (OR p0 p1 (NOT p2)) (OR p1 (NOT p2) p3))), (G (OR p0 p2)), (G (OR p0 p1 (NOT p2))), (G (AND (OR p0 (NOT p1) p2) (OR (NOT p1) p2 p3))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1 p2) (OR p1 p2 p3)))), (F p0), (F (NOT p3)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 32 factoid took 610 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:16:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 12:16:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:16:00] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 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 163 ms. Remains : 48/48 places, 64/64 transitions.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 p3), (X (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 304 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Reduction of identical properties reduced properties to check from 4 to 1
RANDOM walk for 51 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p3), (X (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F p0), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 665 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Product exploration explored 100000 steps with 6949 reset in 1146 ms.
Product exploration explored 100000 steps with 6960 reset in 1148 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), true]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 12:16:05] [INFO ] Redundant transitions in 1 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 16 ms. Remains : 48/48 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin544546740669654468
[2025-06-06 12:16:05] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin544546740669654468
Running compilation step : cd /tmp/ltsmin544546740669654468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1628 ms.
Running link step : cd /tmp/ltsmin544546740669654468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin544546740669654468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3781067576643101225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:16:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-06 12:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:16:20] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 134 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 137 ms. Remains : 48/48 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin8081069374514729873
[2025-06-06 12:16:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8081069374514729873
Running compilation step : cd /tmp/ltsmin8081069374514729873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 365 ms.
Running link step : cd /tmp/ltsmin8081069374514729873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8081069374514729873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased723688289413954056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 12:16:36] [INFO ] Flatten gal took : 17 ms
[2025-06-06 12:16:36] [INFO ] Flatten gal took : 15 ms
[2025-06-06 12:16:36] [INFO ] Time to serialize gal into /tmp/LTL5343967209320099481.gal : 6 ms
[2025-06-06 12:16:36] [INFO ] Time to serialize properties into /tmp/LTL7481325259529527258.prop : 5 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5343967209320099481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12585949299036252097.hoa' '-atoms' '/tmp/LTL7481325259529527258.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7481325259529527258.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12585949299036252097.hoa
Detected timeout of ITS tools.
[2025-06-06 12:16:51] [INFO ] Flatten gal took : 12 ms
[2025-06-06 12:16:51] [INFO ] Flatten gal took : 11 ms
[2025-06-06 12:16:51] [INFO ] Time to serialize gal into /tmp/LTL8209800913224458560.gal : 2 ms
[2025-06-06 12:16:51] [INFO ] Time to serialize properties into /tmp/LTL11393461260282455393.ltl : 22 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8209800913224458560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11393461260282455393.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((Rows_1<1)||(Cells_1<1))||(Columns_5<1))&&(((Rows_10<1)||(Cells_10<1))||(Columns_10<1)))&&((((Rows_12<1)||(Cells_15<1...25553
Formula 0 simplified : X(F!"(((((((((Rows_1<1)||(Cells_1<1))||(Columns_5<1))&&(((Rows_10<1)||(Cells_10<1))||(Columns_10<1)))&&((((Rows_12<1)||(Cells_15<1))...12675
Detected timeout of ITS tools.
[2025-06-06 12:17:06] [INFO ] Flatten gal took : 18 ms
[2025-06-06 12:17:06] [INFO ] Applying decomposition
[2025-06-06 12:17:06] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7097256540527170876.txt' '-o' '/tmp/graph7097256540527170876.bin' '-w' '/tmp/graph7097256540527170876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7097256540527170876.bin' '-l' '-1' '-v' '-w' '/tmp/graph7097256540527170876.weights' '-q' '0' '-e' '0.001'
[2025-06-06 12:17:06] [INFO ] Decomposing Gal with order
[2025-06-06 12:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 12:17:06] [INFO ] Removed a total of 144 redundant transitions.
[2025-06-06 12:17:06] [INFO ] Flatten gal took : 77 ms
[2025-06-06 12:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-06 12:17:06] [INFO ] Time to serialize gal into /tmp/LTL4702997345803397591.gal : 4 ms
[2025-06-06 12:17:06] [INFO ] Time to serialize properties into /tmp/LTL13460454150204431226.ltl : 11 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4702997345803397591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13460454150204431226.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((u1.Rows_1<1)||(u17.Cells_1<1))||(u37.Columns_5<1))&&(((u10.Rows_10<1)||(u26.Cells_10<1))||(u42.Columns_10<1)))&&((((...31377
Formula 0 simplified : X(F!"(((((((((u1.Rows_1<1)||(u17.Cells_1<1))||(u37.Columns_5<1))&&(((u10.Rows_10<1)||(u26.Cells_10<1))||(u42.Columns_10<1)))&&((((u1...15587
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN04-LTLFireability-00 finished in 91437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 12:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:21] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 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 145 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-01 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 12:17:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:22] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 142 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 142 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 1100 ms.
Product exploration explored 100000 steps with 33333 reset in 990 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 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-AN04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-02 finished in 2487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:24] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 12:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:24] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 12:17:24] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 51 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-03
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-03 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 12:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:24] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 12:17:24] [INFO ] Redundant transitions in 1 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 163 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-04
Product exploration explored 100000 steps with 6954 reset in 755 ms.
Product exploration explored 100000 steps with 6950 reset in 649 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-04 finished in 1765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 12:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 12:17:26] [INFO ] Redundant transitions in 0 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 103 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-05
Product exploration explored 100000 steps with 6956 reset in 967 ms.
Product exploration explored 100000 steps with 6960 reset in 650 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-05 finished in 1855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&X(F(!p0))) U X(!p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 12:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:28] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 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 110 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 188 ms :[p0, p0, true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 1138 ms.
Product exploration explored 100000 steps with 33333 reset in 975 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-09 finished in 2502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(F(!p0)&&X(X(X(p0))))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 12:17:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 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 116 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-10
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-10 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 12:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 12:17:31] [INFO ] Redundant transitions in 1 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 167 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-11
Product exploration explored 100000 steps with 6956 reset in 775 ms.
Product exploration explored 100000 steps with 6955 reset in 534 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-11 finished in 1668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(!p0)))) U G(!p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-06 12:17:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 12:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 12:17:33] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 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 124 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-12 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((X(p0)||p1) U (G((X(p0)||p2))||(p0&&(X(p0)||p3)))))))'
[2025-06-06 12:17:33] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12614920925112907845
[2025-06-06 12:17:33] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2025-06-06 12:17:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 12:17:33] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2025-06-06 12:17:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 12:17:33] [INFO ] Applying decomposition
[2025-06-06 12:17:33] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2025-06-06 12:17:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 12:17:33] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12614920925112907845
Running compilation step : cd /tmp/ltsmin12614920925112907845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 12:17:33] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7738419796860549791.txt' '-o' '/tmp/graph7738419796860549791.bin' '-w' '/tmp/graph7738419796860549791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7738419796860549791.bin' '-l' '-1' '-v' '-w' '/tmp/graph7738419796860549791.weights' '-q' '0' '-e' '0.001'
[2025-06-06 12:17:33] [INFO ] Decomposing Gal with order
[2025-06-06 12:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 12:17:33] [INFO ] Removed a total of 144 redundant transitions.
[2025-06-06 12:17:33] [INFO ] Flatten gal took : 40 ms
[2025-06-06 12:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-06 12:17:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2258784843877654176.gal : 3 ms
[2025-06-06 12:17:33] [INFO ] Time to serialize properties into /tmp/LTLFireability1265591022881403952.ltl : 9 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2258784843877654176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1265591022881403952.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((u1.Rows_1<1)||(u17.Cells_1<1))||(u37.Columns_5<1))&&(((u10.Rows_10<1)||(u26.Cells_10<1))||(u42.Columns_10<1)))&&((((...31377
Formula 0 simplified : X(F!"(((((((((u1.Rows_1<1)||(u17.Cells_1<1))||(u37.Columns_5<1))&&(((u10.Rows_10<1)||(u26.Cells_10<1))||(u42.Columns_10<1)))&&((((u1...15587
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin12614920925112907845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12614920925112907845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||((X((LTLAPp0==true))||(LTLAPp1==true)) U ([]((X((LTLAPp0==true))||(LTLAPp2==true)))||((LTLAPp0==true)&&(X((LTLAPp0==true))||(LTLAPp3==true)))))))' '--buchi-type=spotba'
LTSmin run took 515756 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 623665 ms.

BK_STOP 1749212770667

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-AN04"
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-5832"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN04, 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 r226-smll-174903491200348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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