Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491800611.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-PT-BN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491800611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 2.2K 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-PT-BN01-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749461962011

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-09 09:39:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-09 09:39:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-09 09:39:24] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-09 09:39:24] [INFO ] Transformed 5 places.
[2025-06-09 09:39:24] [INFO ] Transformed 1 transitions.
[2025-06-09 09:39:24] [INFO ] Found NUPN structural information;
[2025-06-09 09:39:24] [INFO ] Parsed PT model containing 5 places and 1 transitions and 5 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Applied a total of 0 rules in 14 ms. Remains 5 /5 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 5 cols
[2025-06-09 09:39:25] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:25] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-09 09:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 5/5 places, 1/1 transitions.
Support contains 5 out of 5 places after structural reductions.
[2025-06-09 09:39:25] [INFO ] Flatten gal took : 22 ms
[2025-06-09 09:39:25] [INFO ] Flatten gal took : 4 ms
[2025-06-09 09:39:25] [INFO ] Input system was already deterministic with 1 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (20000 resets) in 1349 ms. (29 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 904 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 310 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
[2025-06-09 09:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 5/6 variables, and 9 constraints, problems are : Problem set: 6 solved, 0 unsolved in 88 ms.
Refiners :[Domain max(s): 5/5 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-BN01-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-BN01-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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).
FORMULA Sudoku-PT-BN01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(p0)))))'
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 12 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-09 09:39:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-09 09:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 2/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 508 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
[2025-06-09 09:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-09 09:39:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-09 09:39:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-09 09:39:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-09 09:39:29] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2025-06-09 09:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-09 09:39:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 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 60 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
[2025-06-09 09:39:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-09 09:39:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-09 09:39:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-09 09:39:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-09 09:39:31] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 3 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-09 09:39:32] [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 11 ms. Remains : 2/2 places, 1/1 transitions.
Built C files in :
/tmp/ltsmin11067250532116223185
[2025-06-09 09:39:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11067250532116223185
Running compilation step : cd /tmp/ltsmin11067250532116223185;'/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 382 ms.
Running link step : cd /tmp/ltsmin11067250532116223185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin11067250532116223185;'/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/stateBased4356886235018896171.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA Sudoku-PT-BN01-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-PT-BN01-LTLCardinality-01 finished in 5615 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(F(p0)))'
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1 transition count 1
Applied a total of 4 rules in 3 ms. Remains 1 /5 variables (removed 4) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2025-06-09 09:39:33] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-09 09:39:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:33] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 1/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 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).
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 p0), (X (X 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 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN01-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN01-LTLCardinality-02 finished in 570 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(p0)||F(!p1)))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 1
Applied a total of 3 rules in 0 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-09 09:39:33] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-09 09:39:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:33] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 2/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : Sudoku-PT-BN01-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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 p1) (NOT p0)), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 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 185 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (20000 resets) in 111 ms. (357 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2025-06-09 09:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/3 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3/3 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 2/3 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN01-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN01-LTLCardinality-06 finished in 1345 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(F(p0)))))'
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1 transition count 1
Applied a total of 4 rules in 1 ms. Remains 1 /5 variables (removed 4) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2025-06-09 09:39:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-09 09:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 1/5 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 1/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN01-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN01-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN01-LTLCardinality-08 finished in 261 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 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 1/1 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-09 09:39:35] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-09 09:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-09 09:39:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-09 09:39:35] [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 64 ms. Remains : 2/5 places, 1/1 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-BN01-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN01-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN01-LTLCardinality-13 finished in 182 ms.
All properties solved by simple procedures.
Total runtime 11130 ms.

BK_STOP 1749461975866

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-BN01"
export BK_EXAMINATION="LTLCardinality"
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-PT-BN01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903491800611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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