Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339500233.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339500233
=====================================================================

--------------------
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-CTLCardinality-2025-00
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-01
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-02
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-03
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-04
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-05
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-06
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-07
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-08
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-09
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-10
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-11
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-12
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-13
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-14
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749345946092

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202505121319
[2025-06-08 01:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 01:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 01:25:47] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-06-08 01:25:47] [INFO ] Transformed 56 places.
[2025-06-08 01:25:47] [INFO ] Transformed 93 transitions.
[2025-06-08 01:25:47] [INFO ] Parsed PT model containing 56 places and 93 transitions and 506 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 93/93 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 93
Applied a total of 2 rules in 14 ms. Remains 54 /56 variables (removed 2) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 54 cols
[2025-06-08 01:25:47] [INFO ] Computed 12 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:25:47] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-08 01:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:25:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:25:47] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:25:47] [INFO ] Invariant cache hit.
[2025-06-08 01:25:47] [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:25:48] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:25:48] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:25:48] [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:25:49] [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:25:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:25:49] [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:25:49] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:25:49] [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:25:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 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) 8/147 variables, 8/97 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:25:50] [INFO ] Deduced a trap composed of 24 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:25:50] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 99 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4821 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 11/11 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, 45/134 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 8/147 variables, 8/142 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 45/187 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 189 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5142 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10052ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 10065ms
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10406 ms. Remains : 54/56 places, 93/93 transitions.
Support contains 51 out of 54 places after structural reductions.
[2025-06-08 01:25:58] [INFO ] Flatten gal took : 47 ms
[2025-06-08 01:25:58] [INFO ] Flatten gal took : 34 ms
[2025-06-08 01:25:58] [INFO ] Input system was already deterministic with 93 transitions.
RANDOM walk for 40000 steps (1442 resets) in 1183 ms. (33 steps per ms) remains 25/88 properties
BEST_FIRST walk for 4003 steps (77 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (88 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (68 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (51 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (76 resets) in 47 ms. (83 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (66 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (70 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (71 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (81 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (74 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (71 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (63 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (85 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (77 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (72 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (70 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (69 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (63 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (85 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (444 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (75 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (80 resets) in 22 ms. (173 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (81 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
[2025-06-08 01:25:58] [INFO ] Invariant cache hit.
[2025-06-08 01:25:58] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp76 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 17 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/34 variables, 4/10 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/35 variables, 1/11 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/12 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 84/120 variables, 36/48 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 13/61 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 19 solved, 6 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 11 (OVERLAPS) 25/145 variables, 16/77 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 9/86 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/86 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/147 variables, 2/88 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/147 variables, 0/88 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/147 variables, 0/88 constraints. Problems are: Problem set: 24 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 88 constraints, problems are : Problem set: 24 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 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: 24 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 1/2 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 8/10 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/11 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/53 variables, 21/32 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 2/34 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/34 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/66 variables, 4/38 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/39 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/70 variables, 1/40 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/70 variables, 0/40 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 46/116 variables, 10/50 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 10/60 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 26/142 variables, 14/74 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/142 variables, 10/84 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/142 variables, 0/84 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/147 variables, 5/89 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/147 variables, 0/89 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/147 variables, 0/89 constraints. Problems are: Problem set: 24 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 89 constraints, problems are : Problem set: 24 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 24 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 93/93 transitions.
Graph (complete) has 290 edges and 54 vertex of which 47 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 47 transition count 91
Deduced a syphon composed of 2 places in 1 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 0 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 20 ms. Remains 44 /54 variables (removed 10) and now considering 90/93 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 44/54 places, 90/93 transitions.
RANDOM walk for 40000 steps (2628 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (917 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 11 ms. (steps per millisecond=87 ) 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 4 ms. (steps per millisecond=240 ) properties seen :0
Successfully simplified 25 atomic propositions for a total of 15 simplifications.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-08 01:25:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-08 01:25:59] [INFO ] Flatten gal took : 8 ms
[2025-06-08 01:25:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-08 01:25:59] [INFO ] Flatten gal took : 8 ms
[2025-06-08 01:25:59] [INFO ] Input system was already deterministic with 93 transitions.
Support contains 41 out of 54 places (down from 44) after GAL structural reductions.
Computed a total of 0 stabilizing places and 4 stable transitions
Graph (complete) has 370 edges and 54 vertex of which 46 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 93
Applied a total of 8 rules in 1 ms. Remains 46 /54 variables (removed 8) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 46 cols
[2025-06-08 01:25:59] [INFO ] Computed 12 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:25:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-08 01:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:25:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:25:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:25:59] [INFO ] Invariant cache hit.
[2025-06-08 01:25:59] [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:26:00] [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:26:00] [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:26:00] [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:26:00] [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:26:00] [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:26:00] [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:26:00] [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:26:00] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:00] [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:26:00] [INFO ] Deduced a trap composed of 23 places in 39 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 2720 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 3273 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 6028ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6029ms
Starting structural reductions in LTL mode, iteration 1 : 46/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6186 ms. Remains : 46/54 places, 93/93 transitions.
[2025-06-08 01:26:05] [INFO ] Flatten gal took : 12 ms
[2025-06-08 01:26:05] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:05] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:05] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:05] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13364384418468175449.gal : 2 ms
[2025-06-08 01:26:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality440931197899561522.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13364384418468175449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality440931197899561522.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.053956,5336,2,485,5,5738,6,0,280,6367,0


Converting to forward existential form...Done !
original formula: EX(((EF((pl_robber_here_n9<1)) * EG(AX((pl_robber_here_n1>0)))) * (AX((pl_robber_absent_n10>=1)) + EF(EX(((pl_robber_absent_n6>=1)&&(pl_c...171
=> equivalent forward existential formula: ([((EY(Init) * (E(TRUE U (pl_robber_here_n9<1)) * EG(!(EX(!((pl_robber_here_n1>0))))))) * !(EX(!((pl_robber_abse...341
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.165024,9816,1,0,249,26993,219,103,2658,22425,264
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 93
Applied a total of 8 rules in 1 ms. Remains 46 /54 variables (removed 8) and now considering 93/93 (removed 0) transitions.
[2025-06-08 01:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-08 01:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:26:06] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:26:06] [INFO ] Invariant cache hit.
[2025-06-08 01:26:06] [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:26:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:06] [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:26:06] [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:26:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:07] [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:26:07] [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:26:07] [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:26:07] [INFO ] Deduced a trap composed of 23 places in 43 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 2664 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 3273 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 5968ms
Starting structural reductions in LTL mode, iteration 1 : 46/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6131 ms. Remains : 46/54 places, 93/93 transitions.
[2025-06-08 01:26:12] [INFO ] Flatten gal took : 9 ms
[2025-06-08 01:26:12] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:12] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:12] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:12] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7395777978027766462.gal : 2 ms
[2025-06-08 01:26:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11438297742995928610.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7395777978027766462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11438297742995928610.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.043814,5544,2,485,5,5738,6,0,280,6367,0


Converting to forward existential form...Done !
original formula: AF(AG(AX((pl_cops_n8>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EX(!((pl_cops_n8>=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,0,0.178452,11304,1,0,258,29637,214,119,2608,30606,265
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 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 47 transition count 93
Applied a total of 7 rules in 1 ms. Remains 47 /54 variables (removed 7) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 47 cols
[2025-06-08 01:26:12] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:12] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-08 01:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:26:12] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:26:12] [INFO ] Invariant cache hit.
[2025-06-08 01:26:12] [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:26:13] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:13] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:13] [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:26:13] [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:26:13] [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:26:13] [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:26:13] [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:26:13] [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:26:13] [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:26:13] [INFO ] Deduced a trap composed of 23 places in 45 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) 1/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (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 3608 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, 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, 84/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (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 4928 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 8566ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 8568ms
Starting structural reductions in LTL mode, iteration 1 : 47/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8717 ms. Remains : 47/54 places, 93/93 transitions.
[2025-06-08 01:26:20] [INFO ] Flatten gal took : 8 ms
[2025-06-08 01:26:20] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:20] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:20] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:26:20] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:26:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7668239860165205362.gal : 2 ms
[2025-06-08 01:26:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12883172502962461210.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7668239860165205362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12883172502962461210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.057572,6360,2,577,5,7624,6,0,281,9878,0


Converting to forward existential form...Done !
original formula: EG(AX((pl_end_n2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((pl_end_n2>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,0,0.12963,8664,1,0,196,21873,209,62,2489,16321,195
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 93
Applied a total of 4 rules in 1 ms. Remains 50 /54 variables (removed 4) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 50 cols
[2025-06-08 01:26:21] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-08 01:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:26:21] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:26:21] [INFO ] Invariant cache hit.
[2025-06-08 01:26:21] [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:26:21] [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:26:21] [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:26:22] [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:26:22] [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:26:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:22] [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:26:22] [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:26:22] [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:26:22] [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:26:22] [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) 4/143 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3696 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 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, 66/156 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 4/143 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 24/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 12663 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16382ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 16384ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16519 ms. Remains : 50/54 places, 93/93 transitions.
[2025-06-08 01:26:37] [INFO ] Flatten gal took : 10 ms
[2025-06-08 01:26:37] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:26:37] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:37] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:37] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:26:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10846452647339262966.gal : 1 ms
[2025-06-08 01:26:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17140792825140196059.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10846452647339262966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17140792825140196059.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.065598,6648,2,732,5,7874,6,0,284,8810,0


Converting to forward existential form...Done !
original formula: (AX((pl_end_n8<=pl_finished_moving)) + (AX((AG(!(A((pl_incoming_cops_n2<=pl_cops_n8) U (pl_robber_here_n3>=1)))) * (pl_incoming_cops_n9<1...406
=> equivalent forward existential formula: (([((FwdU(EY((Init * !(!(EX(!((pl_end_n8<=pl_finished_moving))))))),TRUE) * !(EG(!((pl_robber_here_n3>=1))))) * ...691
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,1,0.476768,25432,1,0,371,113323,229,167,2761,76715,405
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 93
Applied a total of 8 rules in 1 ms. Remains 46 /54 variables (removed 8) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 46 cols
[2025-06-08 01:26:38] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-08 01:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:26:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:26:38] [INFO ] Invariant cache hit.
[2025-06-08 01:26:38] [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:26:39] [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:26:39] [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:26:39] [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:26:39] [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:26:39] [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:26:39] [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:26:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:39] [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:26:39] [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:26:39] [INFO ] Deduced a trap composed of 23 places in 38 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 2680 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 3310 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 6013ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6013ms
Starting structural reductions in LTL mode, iteration 1 : 46/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6155 ms. Remains : 46/54 places, 93/93 transitions.
[2025-06-08 01:26:44] [INFO ] Flatten gal took : 8 ms
[2025-06-08 01:26:44] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:44] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:44] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:26:44] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:26:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16182008869326975855.gal : 2 ms
[2025-06-08 01:26:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1896703345159477397.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16182008869326975855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1896703345159477397.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.044045,5588,2,485,5,5738,6,0,280,6367,0


Converting to forward existential form...Done !
original formula: EX(AF((pl_robber_here_n1>=1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((pl_robber_here_n1>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,1,0.222905,14292,1,0,261,49885,209,102,2561,41597,288
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 93
Applied a total of 8 rules in 4 ms. Remains 46 /54 variables (removed 8) and now considering 93/93 (removed 0) transitions.
[2025-06-08 01:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-08 01:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:26:44] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:26:44] [INFO ] Invariant cache hit.
[2025-06-08 01:26:44] [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:26:45] [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:26:45] [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:26:45] [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:26:45] [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:26:45] [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:26:45] [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:26:45] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:45] [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:26:45] [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:26:45] [INFO ] Deduced a trap composed of 23 places in 44 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 2659 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 3194 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 5881ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5881ms
Starting structural reductions in LTL mode, iteration 1 : 46/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6020 ms. Remains : 46/54 places, 93/93 transitions.
[2025-06-08 01:26:50] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:26:50] [INFO ] Flatten gal took : 6 ms
[2025-06-08 01:26:50] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:50] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:26:50] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:26:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13775591096468570218.gal : 1 ms
[2025-06-08 01:26:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3049588893829092830.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13775591096468570218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3049588893829092830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.044411,5588,2,485,5,5738,6,0,280,6367,0


Converting to forward existential form...Done !
original formula: EX((pl_robber_absent_n10<1))
=> equivalent forward existential formula: [(EY(Init) * (pl_robber_absent_n10<1))] != FALSE
(forward)formula 0,0,0.045975,5844,1,0,8,5738,8,1,453,6367,2
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 49 transition count 93
Applied a total of 5 rules in 1 ms. Remains 49 /54 variables (removed 5) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 49 cols
[2025-06-08 01:26:50] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-08 01:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:26:50] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:26:50] [INFO ] Invariant cache hit.
[2025-06-08 01:26:50] [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:26:51] [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:26:51] [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:26:51] [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:26:51] [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:26:51] [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:26:51] [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:26:51] [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:26:51] [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:26:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:26:52] [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) 3/142 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 93 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3531 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 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, 72/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 3/142 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 18/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 183 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8682ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 8682ms
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8827 ms. Remains : 49/54 places, 93/93 transitions.
[2025-06-08 01:26:59] [INFO ] Flatten gal took : 7 ms
[2025-06-08 01:26:59] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:26:59] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:26:59] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:26:59] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:26:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality329936668780998730.gal : 1 ms
[2025-06-08 01:26:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality127087877034361279.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality329936668780998730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality127087877034361279.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.064187,6248,2,659,5,7299,6,0,283,9142,0


Converting to forward existential form...Done !
original formula: AX((EX((AF((pl_robber_absent_n3<=pl_end_n9)) + (pl_robber_here_n5<=pl_end_n3))) * (EF((pl_end_n2<=pl_end_n3)) + AG((pl_cops_n5>0)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((!(EG(!((pl_robber_absent_n3<=pl_end_n9)))) + (pl_robber_here_n5<=pl_end_n3)))))] = FALSE * [...246
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,1,0.338329,17692,1,0,297,69763,218,121,2616,56703,307
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Graph (complete) has 370 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 48 transition count 92
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 3 place count 47 transition count 92
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 5 place count 46 transition count 91
Applied a total of 5 rules in 16 ms. Remains 46 /54 variables (removed 8) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 46 cols
[2025-06-08 01:26:59] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:26:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-08 01:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:27:00] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 01:27:00] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-08 01:27:00] [INFO ] Invariant cache hit.
[2025-06-08 01:27: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/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 91/135 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:00] [INFO ] Deduced a trap composed of 22 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:27:00] [INFO ] Deduced a trap composed of 22 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:00] [INFO ] Deduced a trap composed of 22 places in 39 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:00] [INFO ] Deduced a trap composed of 22 places in 36 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:00] [INFO ] Deduced a trap composed of 22 places in 41 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:00] [INFO ] Deduced a trap composed of 22 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:00] [INFO ] Deduced a trap composed of 22 places in 42 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:01] [INFO ] Deduced a trap composed of 22 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:01] [INFO ] Deduced a trap composed of 22 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:27:01] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 2/137 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 90 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3727 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: 88/88 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 91/135 variables, 44/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 76/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 2/137 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 12/178 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 178 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4986 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: 88/88 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8740ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 8740ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/54 places, 91/93 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8890 ms. Remains : 46/54 places, 91/93 transitions.
[2025-06-08 01:27:08] [INFO ] Flatten gal took : 11 ms
[2025-06-08 01:27:08] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:27:08] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-08 01:27:08] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:27:08] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:27:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality17202596585890785485.gal : 2 ms
[2025-06-08 01:27:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality18413595974036252652.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17202596585890785485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18413595974036252652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,420,0.038075,5188,2,489,5,4466,6,0,272,5043,0


Converting to forward existential form...Done !
original formula: (EF((pl_finalizing>pl_robber_absent_n5)) * (AF((((E((pl_incoming_cops_n6>=1) U (pl_cops_n10<=pl_robber_absent_n8)) + EG((pl_robber_here_n...280
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (pl_finalizing>pl_robber_absent_n5))))] = FALSE * ([((Init * !(!(EG(!((((E((pl_incoming_cop...595
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t7, t8, t10, t11, t13, t14, t16, t17, t19, t20, t22, t23, t25, t26, t28, t29,...404
(forward)formula 0,1,0.221853,13764,1,0,254,44855,220,100,2593,36219,278
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 93
Applied a total of 8 rules in 3 ms. Remains 46 /54 variables (removed 8) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 46 cols
[2025-06-08 01:27:09] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-08 01:27:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:27:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:27:09] [INFO ] Invariant cache hit.
[2025-06-08 01:27:09] [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:09] [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:27:09] [INFO ] Deduced a trap composed of 23 places in 36 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:09] [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:27:10] [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:10] [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:27:10] [INFO ] Deduced a trap composed of 23 places in 36 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:10] [INFO ] Deduced a trap composed of 23 places in 35 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:10] [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:27:10] [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:10] [INFO ] Deduced a trap composed of 23 places in 51 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 2626 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 3326 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 5971ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5971ms
Starting structural reductions in LTL mode, iteration 1 : 46/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6114 ms. Remains : 46/54 places, 93/93 transitions.
[2025-06-08 01:27:15] [INFO ] Flatten gal took : 9 ms
[2025-06-08 01:27:15] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:27:15] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:27:15] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:27:15] [INFO ] Flatten gal took : 5 ms
[2025-06-08 01:27:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12512048154839783703.gal : 1 ms
[2025-06-08 01:27:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality15386333564268239339.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12512048154839783703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15386333564268239339.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.043625,5508,2,485,5,5738,6,0,280,6367,0


Converting to forward existential form...Done !
original formula: EX(EX((pl_robber_absent_n9>=1)))
=> equivalent forward existential formula: [(EY(EY(Init)) * (pl_robber_absent_n9>=1))] != FALSE
(forward)formula 0,1,0.045352,5892,1,0,9,5738,8,1,457,6367,3
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 93/93 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 93
Applied a total of 8 rules in 1 ms. Remains 46 /54 variables (removed 8) and now considering 93/93 (removed 0) transitions.
[2025-06-08 01:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-08 01:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:27:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-08 01:27:15] [INFO ] Invariant cache hit.
[2025-06-08 01:27:15] [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:16] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:27:16] [INFO ] Deduced a trap composed of 23 places in 48 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:16] [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:27:16] [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:16] [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:27:16] [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:16] [INFO ] Deduced a trap composed of 23 places in 54 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:16] [INFO ] Deduced a trap composed of 23 places in 48 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:16] [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:27:16] [INFO ] Deduced a trap composed of 23 places in 39 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 2641 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 3332 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 6009ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6023ms
Starting structural reductions in LTL mode, iteration 1 : 46/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6147 ms. Remains : 46/54 places, 93/93 transitions.
[2025-06-08 01:27:21] [INFO ] Flatten gal took : 3 ms
[2025-06-08 01:27:21] [INFO ] Flatten gal took : 3 ms
[2025-06-08 01:27:21] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:27:21] [INFO ] Flatten gal took : 3 ms
[2025-06-08 01:27:21] [INFO ] Flatten gal took : 3 ms
[2025-06-08 01:27:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality17571542963046709692.gal : 1 ms
[2025-06-08 01:27:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3737475132689898946.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17571542963046709692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3737475132689898946.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.04682,5588,2,485,5,5738,6,0,280,6367,0


Converting to forward existential form...Done !
original formula: AF((EX((pl_incoming_cops_n10>pl_robber_absent_n8)) + (((pl_cops_n6<1)&&(pl_cops_n9>0))&&(pl_robber_here_n1>pl_incoming_cops_n4))))
=> equivalent forward existential formula: [FwdG(Init,!((EX((pl_incoming_cops_n10>pl_robber_absent_n8)) + (((pl_cops_n6<1)&&(pl_cops_n9>0))&&(pl_robber_her...193
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,0,0.169592,10452,1,0,246,25159,209,117,2573,26902,256
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 54/54 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 48 transition count 93
Applied a total of 6 rules in 1 ms. Remains 48 /54 variables (removed 6) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 48 cols
[2025-06-08 01:27:21] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-08 01:27:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:27:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-08 01:27:21] [INFO ] Implicit Places using invariants and state equation in 103 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:27:21] [INFO ] Invariant cache hit.
[2025-06-08 01:27:21] [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:22] [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:27:22] [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:22] [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:27:22] [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:27:22] [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:27:22] [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:27:22] [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:22] [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:22] [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:22] [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, 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) 2/141 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 92 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 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, 81/171 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 2/141 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 182 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5945 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9632ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9633ms
Starting structural reductions in LTL mode, iteration 1 : 48/54 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9779 ms. Remains : 48/54 places, 93/93 transitions.
[2025-06-08 01:27:31] [INFO ] Flatten gal took : 8 ms
[2025-06-08 01:27:31] [INFO ] Flatten gal took : 4 ms
[2025-06-08 01:27:31] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-08 01:27:31] [INFO ] Flatten gal took : 3 ms
[2025-06-08 01:27:31] [INFO ] Flatten gal took : 3 ms
[2025-06-08 01:27:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality2194508274051736009.gal : 1 ms
[2025-06-08 01:27:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality7602594548947708416.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2194508274051736009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7602594548947708416.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,620,0.05976,6244,2,670,5,7574,6,0,282,9568,0


Converting to forward existential form...Done !
original formula: AF(((pl_cops_n10>0) * ((!(E(((pl_start_robber<=1)&&(pl_robber_absent_n7<=pl_start_cops)) U ((EX((pl_end_n1>=1)) + (pl_robber_absent_n4<=p...296
=> equivalent forward existential formula: [FwdG(Init,!(((pl_cops_n10>0) * ((!(E(((pl_start_robber<=1)&&(pl_robber_absent_n7<=pl_start_cops)) U ((EX((pl_en...414
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t21, t22, t24, t25, t27, t28, t30, t31...405
(forward)formula 0,0,0.229617,13412,1,0,327,37421,226,166,2585,37485,348
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-CTLCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-06-08 01:27:31] [INFO ] Flatten gal took : 8 ms
[2025-06-08 01:27:31] [INFO ] Flatten gal took : 3 ms
Total runtime 104446 ms.

BK_STOP 1749346051748

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-174931339500233"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;