Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339500235.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 CopsAndRobbers-PT-KFL010N005K002X001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339500235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.8K Jun 6 08:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Jun 6 08:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Jun 6 11:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 11:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 6 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 6 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 11:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Jun 6 11:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 19 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 78K Jun 5 20:08 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 CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749346060949

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-KFL010N005K002X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 01:27:42] [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-08 01:27:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 01:27:42] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2025-06-08 01:27:42] [INFO ] Transformed 56 places.
[2025-06-08 01:27:42] [INFO ] Transformed 93 transitions.
[2025-06-08 01:27:42] [INFO ] Parsed PT model containing 56 places and 93 transitions and 506 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 93/93 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 93
Applied a total of 3 rules in 14 ms. Remains 53 /56 variables (removed 3) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 53 cols
[2025-06-08 01:27:42] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:42] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-08 01:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:27:42] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:27:42] [INFO ] Invariant cache hit.
[2025-06-08 01:27:42] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:43] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:43] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:43] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:44] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:44] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:44] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:44] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 7/146 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 97 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 7/146 variables, 7/148 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 39/187 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 187 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9479ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9491ms
Starting structural reductions in LTL mode, iteration 1 : 53/56 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9866 ms. Remains : 53/56 places, 93/93 transitions.
Support contains 33 out of 53 places after structural reductions.
[2025-06-08 01:27:52] [INFO ] Flatten gal took : 27 ms
[2025-06-08 01:27:52] [INFO ] Flatten gal took : 14 ms
[2025-06-08 01:27:52] [INFO ] Input system was already deterministic with 93 transitions.
Support contains 32 out of 53 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (1362 resets) in 1738 ms. (23 steps per ms) remains 15/30 properties
BEST_FIRST walk for 4003 steps (67 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (74 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (68 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (58 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (84 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (70 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (77 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (59 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (65 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (69 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (65 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (69 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (69 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (80 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2025-06-08 01:27:53] [INFO ] Invariant cache hit.
[2025-06-08 01:27:53] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/31 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/37 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 87/125 variables, 38/50 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 17/67 constraints. Problems are: Problem set: 3 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 10 (OVERLAPS) 21/146 variables, 15/82 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 5/87 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/87 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/146 variables, 0/87 constraints. Problems are: Problem set: 14 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 87 constraints, problems are : Problem set: 14 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 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, 0/0 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 1/2 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 8/10 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/11 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/53 variables, 21/32 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 2/34 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/34 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/66 variables, 4/38 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/39 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/70 variables, 1/40 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/70 variables, 0/40 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 46/116 variables, 10/50 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 10/60 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 27/143 variables, 15/75 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/143 variables, 10/85 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/143 variables, 0/85 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/146 variables, 3/88 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/146 variables, 0/88 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/146 variables, 0/88 constraints. Problems are: Problem set: 14 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 88 constraints, problems are : Problem set: 14 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 14 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 93/93 transitions.
Graph (complete) has 287 edges and 53 vertex of which 47 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 47 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 45 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 44 transition count 90
Applied a total of 7 rules in 17 ms. Remains 44 /53 variables (removed 9) and now considering 90/93 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 44/53 places, 90/93 transitions.
RANDOM walk for 40000 steps (2672 resets) in 744 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (972 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Probably explored full state space saw : 310 states, properties seen :0
Probabilistic random walk after 960 steps, saw 310 distinct states, run finished after 15 ms. (steps per millisecond=64 ) properties seen :0
Explored full state space saw : 310 states, properties seen :0
Exhaustive walk after 960 steps, saw 310 distinct states, run finished after 3 ms. (steps per millisecond=320 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 6 stable transitions
Graph (complete) has 367 edges and 53 vertex of which 46 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-09 FALSE 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((G(p0)||X(G(p1)))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 93/93 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 93
Applied a total of 7 rules in 1 ms. Remains 46 /53 variables (removed 7) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 46 cols
[2025-06-08 01:27:54] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-08 01:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:27:54] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:27:54] [INFO ] Invariant cache hit.
[2025-06-08 01:27:54] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2587 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 180 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5912ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5913ms
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6074 ms. Remains : 46/53 places, 93/93 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 2 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-00 finished in 6419 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 U X(p1)))&&F(p2)&&X(p3))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 93/93 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 93
Applied a total of 6 rules in 2 ms. Remains 47 /53 variables (removed 6) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 47 cols
[2025-06-08 01:28:00] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-08 01:28:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:28:00] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:28:00] [INFO ] Invariant cache hit.
[2025-06-08 01:28:00] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:03] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4007 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 93/139 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 84/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 181 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5633 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9680ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9682ms
Starting structural reductions in LTL mode, iteration 1 : 47/53 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9844 ms. Remains : 47/53 places, 93/93 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 551 steps with 157 reset in 11 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03 finished in 10193 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))))'
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 93/93 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 93
Applied a total of 7 rules in 1 ms. Remains 46 /53 variables (removed 7) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 46 cols
[2025-06-08 01:28:10] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 01:28:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:28:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:28:10] [INFO ] Invariant cache hit.
[2025-06-08 01:28:10] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:11] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:12] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 180 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3364 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5968ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5970ms
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6116 ms. Remains : 46/53 places, 93/93 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05 finished in 6280 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 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 93/93 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 93
Applied a total of 6 rules in 0 ms. Remains 47 /53 variables (removed 6) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 47 cols
[2025-06-08 01:28:17] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 01:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:28:17] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:28:17] [INFO ] Invariant cache hit.
[2025-06-08 01:28:17] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:18] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 93/139 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 84/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 181 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5656 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9714ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9714ms
Starting structural reductions in LTL mode, iteration 1 : 47/53 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9846 ms. Remains : 47/53 places, 93/93 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 183 steps with 7 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12 finished in 9951 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(X(F(p0))))))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 93/93 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 93
Applied a total of 7 rules in 1 ms. Remains 46 /53 variables (removed 7) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 46 cols
[2025-06-08 01:28:27] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:27] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-08 01:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:28:27] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:28:27] [INFO ] Invariant cache hit.
[2025-06-08 01:28:27] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:27] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:27] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:27] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:28:28] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 180 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6129ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6130ms
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6270 ms. Remains : 46/53 places, 93/93 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13 finished in 6461 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 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 93/93 transitions.
Graph (complete) has 367 edges and 53 vertex of which 46 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 46 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 43 transition count 90
Applied a total of 7 rules in 12 ms. Remains 43 /53 variables (removed 10) and now considering 90/93 (removed 3) transitions.
// Phase 1: matrix 90 rows 43 cols
[2025-06-08 01:28:33] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-08 01:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:28:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:28:33] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 130 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/53 places, 90/93 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 42/53 places, 90/93 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14
Product exploration explored 100000 steps with 6493 reset in 220 ms.
Stack based approach found an accepted trace after 32 steps with 4 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14 finished in 407 ms.
All properties solved by simple procedures.
Total runtime 51784 ms.

BK_STOP 1749346113917

--------------------
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="CopsAndRobbers-PT-KFL010N005K002X001"
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 CopsAndRobbers-PT-KFL010N005K002X001, 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 r254-tall-174931339500235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-KFL010N005K002X001.tgz
mv CopsAndRobbers-PT-KFL010N005K002X001 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 ;