About the Execution of ITS-Tools for CopsAndRobbers-PT-CRL005X001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 203477.00 | 0.00 | 0.00 | FFTTFTFFTFFTTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339400169.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-CRL005X001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339400169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K Jun 6 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 6 11:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Jun 6 11:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 17K Jun 6 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 6 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Jun 6 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 6 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 29K 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-CRL005X001-CTLCardinality-2025-00
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-01
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-02
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-03
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-04
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-05
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-06
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-07
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-08
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-09
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-10
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-11
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-12
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-13
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-14
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749337214981
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-CRL005X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 23:00:16] [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-07 23:00:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 23:00:16] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2025-06-07 23:00:16] [INFO ] Transformed 35 places.
[2025-06-07 23:00:16] [INFO ] Transformed 39 transitions.
[2025-06-07 23:00:16] [INFO ] Parsed PT model containing 35 places and 39 transitions and 174 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 39/39 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 39
Applied a total of 1 rules in 13 ms. Remains 34 /35 variables (removed 1) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 34 cols
[2025-06-07 23:00:16] [INFO ] Computed 8 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:00:16] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-07 23:00:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:00:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:00:16] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:00:16] [INFO ] Invariant cache hit.
[2025-06-07 23:00:16] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:17] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:17] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 4/73 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 0/73 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 58 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:18] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 4/73 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:32] [INFO ] Deduced a trap composed of 15 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-07 23:00:33] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:36] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 73/73 variables, and 92 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31423ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31435ms
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31718 ms. Remains : 34/35 places, 39/39 transitions.
Support contains 32 out of 34 places after structural reductions.
[2025-06-07 23:00:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-07 23:00:48] [INFO ] Flatten gal took : 19 ms
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 23:00:48] [INFO ] Flatten gal took : 7 ms
[2025-06-07 23:00:48] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 40000 steps (9 resets) in 2009 ms. (19 steps per ms) remains 13/39 properties
BEST_FIRST walk for 40000 steps (9 resets) in 325 ms. (122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (13 resets) in 565 ms. (70 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40000 steps (13 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (11 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (10 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (10 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (10 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
[2025-06-07 23:00:49] [INFO ] Invariant cache hit.
[2025-06-07 23:00:49] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp33 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (OVERLAPS) 10/26 variables, 5/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 36/64 variables, 28/36 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 7/43 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 11 (OVERLAPS) 9/73 variables, 6/49 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 3/52 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/73 variables, 0/52 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 52 constraints, problems are : Problem set: 10 solved, 2 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/13 variables, 3/6 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/20 variables, 1/7 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/22 variables, 1/8 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 33/55 variables, 22/30 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 4/34 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 2/36 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/55 variables, 0/36 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 16/71 variables, 10/46 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/71 variables, 6/52 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/71 variables, 0/52 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/73 variables, 2/54 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/73 variables, 0/54 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/73 variables, 0/54 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 54 constraints, problems are : Problem set: 10 solved, 2 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 10 solved, 2 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 127 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 32 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 30 transition count 37
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 29 transition count 36
Applied a total of 7 rules in 15 ms. Remains 29 /34 variables (removed 5) and now considering 36/39 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 29/34 places, 36/39 transitions.
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Probably explored full state space saw : 111 states, properties seen :0
Probabilistic random walk after 266 steps, saw 111 distinct states, run finished after 10 ms. (steps per millisecond=26 ) properties seen :0
Explored full state space saw : 111 states, properties seen :0
Exhaustive walk after 266 steps, saw 111 distinct states, run finished after 9 ms. (steps per millisecond=29 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2025-06-07 23:00:50] [INFO ] Flatten gal took : 5 ms
[2025-06-07 23:00:50] [INFO ] Flatten gal took : 4 ms
[2025-06-07 23:00:50] [INFO ] Input system was already deterministic with 39 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 39
Applied a total of 3 rules in 0 ms. Remains 31 /34 variables (removed 3) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 31 cols
[2025-06-07 23:00:50] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:00:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 23:00:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:00:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:00:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:00:50] [INFO ] Invariant cache hit.
[2025-06-07 23:00:50] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:51] [INFO ] Deduced a trap composed of 14 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-07 23:00:51] [INFO ] Deduced a trap composed of 14 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-07 23:00:51] [INFO ] Deduced a trap composed of 14 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-07 23:00:51] [INFO ] Deduced a trap composed of 15 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-07 23:00:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/70 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:00:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 70/70 variables, and 85 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30911ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 30913ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30991 ms. Remains : 31/34 places, 39/39 transitions.
[2025-06-07 23:01:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:01:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:01:21] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:01:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:01:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:01:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8177027484495595145.gal : 2 ms
[2025-06-07 23:01:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality7704032091089829235.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/CTLCardinality8177027484495595145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7704032091089829235.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,166,0.021522,4032,2,415,5,1598,6,0,161,1587,0
Converting to forward existential form...Done !
original formula: AF((AX((EX(((pl_wait_robber<=pl_robber_absent_n1)&&(pl_end_n4<=1))) * AX(A((pl_start_robber>=1) U (pl_incoming_cops_n4>=1))))) * ((pl_inc...303
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((EX(((pl_wait_robber<=pl_robber_absent_n1)&&(pl_end_n4<=1))) * !(EX(!(!((E(!((pl_incoming_c...455
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.135019,9664,1,0,306,29710,123,152,1229,24493,357
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 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 30 transition count 38
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 29 transition count 38
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 28 transition count 37
Applied a total of 5 rules in 9 ms. Remains 28 /34 variables (removed 6) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 28 cols
[2025-06-07 23:01:21] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:21] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 23:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:01:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:01:22] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-07 23:01:22] [INFO ] Invariant cache hit.
[2025-06-07 23:01:22] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 37/65 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:22] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:22] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:22] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:22] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 52 constraints, problems are : Problem set: 0 solved, 27 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 37/65 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 79 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5554 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6454ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 6454ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/34 places, 37/39 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6562 ms. Remains : 28/34 places, 37/39 transitions.
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 10 ms
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 4 ms
[2025-06-07 23:01:28] [INFO ] Input system was already deterministic with 37 transitions.
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:01:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality18013001601748551568.gal : 1 ms
[2025-06-07 23:01:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality16795782214688027605.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/CTLCardinality18013001601748551568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16795782214688027605.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,136,0.009984,4088,2,288,5,1169,6,0,150,1144,0
Converting to forward existential form...Done !
original formula: AF(E((pl_finalizing>=1) U (pl_cops_n3>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(E((pl_finalizing>=1) U (pl_cops_n3>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t7, t8, t10, t12, t13, t15, t17, t18, t20, t22, t23, t25, t32, t33, t34, t35, t36...255
(forward)formula 0,0,0.043572,5880,1,0,126,9110,100,53,1099,8165,116
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 31 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 37
Applied a total of 5 rules in 3 ms. Remains 29 /34 variables (removed 5) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 29 cols
[2025-06-07 23:01:28] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 23:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:01:28] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/34 places, 37/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 81 ms. Remains : 28/34 places, 37/39 transitions.
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 4 ms
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:01:28] [INFO ] Input system was already deterministic with 37 transitions.
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:01:28] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:01:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1861766242759302123.gal : 0 ms
[2025-06-07 23:01:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8331628678303070086.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/CTLCardinality1861766242759302123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8331628678303070086.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,126,0.009952,4040,2,306,5,1258,6,0,147,1301,0
Converting to forward existential form...Done !
original formula: AF(EG(((pl_cops_n4<1)||((pl_end_n4<1)&&(pl_start_cops<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((pl_cops_n4<1)||((pl_end_n4<1)&&(pl_start_cops<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t9, t10, t11, t13, t14, t15, t17, t18, t19, t21, Intersection with r...233
(forward)formula 0,1,0.063063,6984,1,0,204,16766,100,85,1071,11318,230
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 39
Applied a total of 3 rules in 0 ms. Remains 31 /34 variables (removed 3) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 31 cols
[2025-06-07 23:01:28] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 23:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:01:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:01:28] [INFO ] Invariant cache hit.
[2025-06-07 23:01:28] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:29] [INFO ] Deduced a trap composed of 14 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-07 23:01:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:29] [INFO ] Deduced a trap composed of 15 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-07 23:01:29] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/70 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 55 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:01:30] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 1/70 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 70/70 variables, and 84 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31067ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31067ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31148 ms. Remains : 31/34 places, 39/39 transitions.
[2025-06-07 23:01:59] [INFO ] Flatten gal took : 4 ms
[2025-06-07 23:01:59] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:01:59] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:01:59] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:01:59] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:01:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7940281398928248988.gal : 0 ms
[2025-06-07 23:01:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12476533142775227711.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/CTLCardinality7940281398928248988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12476533142775227711.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,166,0.013193,4140,2,394,5,1543,6,0,161,1496,0
Converting to forward existential form...Done !
original formula: AF(EX((((pl_robber_here_n4>=1)||(pl_finished_moving<=0)) + EF((pl_end_n5<=pl_cops_n3)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((pl_robber_here_n4>=1)||(pl_finished_moving<=0)) + E(TRUE U (pl_end_n5<=pl_cops_n3))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,1,0.053362,6316,1,0,108,10651,106,41,1214,8642,101
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:01:59] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:00] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 23:02:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:02:00] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:02:00] [INFO ] Invariant cache hit.
[2025-06-07 23:02:00] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:00] [INFO ] Deduced a trap composed of 14 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-07 23:02:00] [INFO ] Deduced a trap composed of 14 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-07 23:02:00] [INFO ] Deduced a trap composed of 14 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-07 23:02:00] [INFO ] Deduced a trap composed of 15 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-07 23:02:00] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:02] [INFO ] Deduced a trap along path composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16127ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16127ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16260 ms. Remains : 30/34 places, 39/39 transitions.
[2025-06-07 23:02:16] [INFO ] Flatten gal took : 5 ms
[2025-06-07 23:02:16] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:16] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:02:16] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:16] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:02:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality1129019271276154721.gal : 1 ms
[2025-06-07 23:02:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17409305461741698632.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/CTLCardinality1129019271276154721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17409305461741698632.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,166,0.011596,4136,2,359,5,1468,6,0,160,1524,0
Converting to forward existential form...Done !
original formula: EX((AG(((pl_robber_here_n2>pl_incoming_cops_n4)&&(pl_start_cops>=1))) + (pl_wait_robber<=pl_awaiting)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((pl_robber_here_n2>pl_incoming_cops_n4)&&(pl_start_cops>=1))))))] != FALSE + [(EY(In...202
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,1,0.045476,6184,1,0,99,9381,101,37,1176,7041,90
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:02:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 23:02:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:02:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:02:16] [INFO ] Invariant cache hit.
[2025-06-07 23:02:16] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:16] [INFO ] Deduced a trap composed of 14 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-07 23:02:16] [INFO ] Deduced a trap composed of 14 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-07 23:02:16] [INFO ] Deduced a trap composed of 14 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-07 23:02:16] [INFO ] Deduced a trap composed of 15 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-07 23:02:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:18] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15296 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16110ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16110ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16197 ms. Remains : 30/34 places, 39/39 transitions.
[2025-06-07 23:02:32] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:32] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:32] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:02:32] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:32] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality11729733855986794385.gal : 0 ms
[2025-06-07 23:02:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4366629143284815440.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/CTLCardinality11729733855986794385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4366629143284815440.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,166,0.012438,4128,2,359,5,1468,6,0,160,1524,0
Converting to forward existential form...Done !
original formula: AF(AG(EX((pl_robber_here_n4<1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX((pl_robber_here_n4<1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.069417,6944,1,0,121,14031,103,49,1225,12769,122
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-06 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 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 0 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:02:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 23:02:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:02:32] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:02:32] [INFO ] Invariant cache hit.
[2025-06-07 23:02:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:33] [INFO ] Deduced a trap composed of 14 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-07 23:02:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:33] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:33] [INFO ] Deduced a trap composed of 15 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-07 23:02:33] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:34] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16114ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16114ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16208 ms. Remains : 30/34 places, 39/39 transitions.
[2025-06-07 23:02:48] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:02:48] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:48] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:02:48] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:48] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:02:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality15481702297808955377.gal : 0 ms
[2025-06-07 23:02:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3123637016287321838.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/CTLCardinality15481702297808955377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3123637016287321838.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,166,0.01646,4132,2,359,5,1468,6,0,160,1524,0
Converting to forward existential form...Done !
original formula: EG(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.046726,5668,1,0,101,8665,99,37,1154,7063,93
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 23:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:02:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:02:48] [INFO ] Invariant cache hit.
[2025-06-07 23:02:48] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:49] [INFO ] Deduced a trap composed of 14 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-07 23:02:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:49] [INFO ] Deduced a trap composed of 14 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-07 23:02:49] [INFO ] Deduced a trap composed of 15 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-07 23:02:49] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:02:51] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16245ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16246ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16356 ms. Remains : 30/34 places, 39/39 transitions.
[2025-06-07 23:03:05] [INFO ] Flatten gal took : 9 ms
[2025-06-07 23:03:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:05] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:03:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:05] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:03:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17365958002498787029.gal : 1 ms
[2025-06-07 23:03:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17850152112088191007.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/CTLCardinality17365958002498787029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17850152112088191007.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,166,0.018922,4136,2,359,5,1468,6,0,160,1524,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.019417,4136,1,0,6,1468,7,1,252,1524,1
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-08 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 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
[2025-06-07 23:03:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 23:03:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:03:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:03:05] [INFO ] Invariant cache hit.
[2025-06-07 23:03:05] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:03:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:03:05] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:03:05] [INFO ] Deduced a trap composed of 14 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-07 23:03:05] [INFO ] Deduced a trap composed of 15 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-07 23:03:05] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:03:07] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16153ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16156ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16240 ms. Remains : 30/34 places, 39/39 transitions.
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 4 ms
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11610672425404790499.gal : 0 ms
[2025-06-07 23:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality12802369605603457687.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/CTLCardinality11610672425404790499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12802369605603457687.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,166,0.012964,4136,2,359,5,1468,6,0,160,1524,0
Converting to forward existential form...Done !
original formula: AF((EF(((EX((pl_incoming_cops_n3<1)) * ((pl_robber_here_n4>0)||(pl_moved_robber>pl_incoming_cops_n1))) * (pl_cops_n2<=0))) * AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((EX((pl_incoming_cops_n3<1)) * ((pl_robber_here_n4>0)||(pl_moved_robber>pl_incoming_cops...211
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
(forward)formula 0,0,0.069072,6824,1,0,118,13615,105,48,1239,11867,114
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 30 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 37
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 27 transition count 36
Applied a total of 7 rules in 3 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (removed 3) transitions.
// Phase 1: matrix 36 rows 27 cols
[2025-06-07 23:03:21] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 23:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:03:21] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/34 places, 36/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 98 ms. Remains : 26/34 places, 36/39 transitions.
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 7 ms
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 5 ms
[2025-06-07 23:03:21] [INFO ] Input system was already deterministic with 36 transitions.
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 1 ms
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13149459352840778730.gal : 0 ms
[2025-06-07 23:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6926324921816678680.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/CTLCardinality13149459352840778730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6926324921816678680.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,111,0.010121,4012,2,246,5,1003,6,0,141,950,0
Converting to forward existential form...Done !
original formula: EF(((AF(((pl_cops_n3<1)||((pl_wait_robber<=pl_robber_here_n3)&&(pl_cops_n4<=1)))) * (pl_incoming_cops_n1<=pl_robber_here_n3)) * (pl_robbe...172
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (pl_robber_absent_n2<=0)) * (pl_incoming_cops_n1<=pl_robber_here_n3)) * !(EG(!(((pl_cops_n...230
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t8, t9, t10, t12, t13, t14, t16, t17, t18, t20, t31, t32, t33, t34, t35, ...253
(forward)formula 0,1,0.030625,5420,1,0,102,6061,97,36,1035,4549,92
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 30 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 37
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 27 transition count 36
Applied a total of 7 rules in 8 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (removed 3) transitions.
[2025-06-07 23:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 23:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:03:21] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/34 places, 36/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 102 ms. Remains : 26/34 places, 36/39 transitions.
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Input system was already deterministic with 36 transitions.
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:21] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13802996690530185709.gal : 0 ms
[2025-06-07 23:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9228951847321260737.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/CTLCardinality13802996690530185709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9228951847321260737.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,111,0.008842,4020,2,246,5,1003,6,0,141,950,0
Converting to forward existential form...Done !
original formula: EF(((pl_robber_here_n4>0) * AG((pl_robber_here_n5<=pl_robber_here_n4))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (pl_robber_here_n4>0)) * !(E(TRUE U !((pl_robber_here_n5<=pl_robber_here_n4)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t8, t9, t10, t12, t13, t14, t16, t17, t18, t20, t31, t32, t33, t34, t35, ...253
(forward)formula 0,1,0.037555,5812,1,0,110,9368,95,42,1014,6425,102
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 31 transition count 38
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 3 place count 30 transition count 38
Applied a total of 3 rules in 3 ms. Remains 30 /34 variables (removed 4) and now considering 38/39 (removed 1) transitions.
// Phase 1: matrix 38 rows 30 cols
[2025-06-07 23:03:21] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 23:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:03:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 29/34 places, 38/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 89 ms. Remains : 29/34 places, 38/39 transitions.
[2025-06-07 23:03:22] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:03:22] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:22] [INFO ] Input system was already deterministic with 38 transitions.
[2025-06-07 23:03:22] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:22] [INFO ] Flatten gal took : 1 ms
[2025-06-07 23:03:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12365059883256903386.gal : 0 ms
[2025-06-07 23:03:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality2819013014382242886.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/CTLCardinality12365059883256903386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2819013014382242886.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,141,0.010201,4060,2,326,5,1259,6,0,152,1244,0
Converting to forward existential form...Done !
original formula: (EF((EG((pl_cops_n3>=1)) + (AG(((pl_robber_here_n2>=1)&&(pl_start_cops>pl_cops_n2))) * ((pl_init_robber>pl_incoming_cops_n2)||(pl_init_ro...232
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (EG((pl_cops_n3>=1)) + (!(E(TRUE U !(((pl_robber_here_n2>=1)&&(pl_start_cops>pl_cops_n2...310
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, Intersection with ...234
(forward)formula 0,0,0.052914,6364,1,0,144,11154,112,66,1130,9302,150
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 39
Applied a total of 4 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 30 cols
[2025-06-07 23:03:22] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 23:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 23:03:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2025-06-07 23:03:22] [INFO ] Invariant cache hit.
[2025-06-07 23:03:22] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:03:22] [INFO ] Deduced a trap composed of 14 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-07 23:03:22] [INFO ] Deduced a trap composed of 14 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-07 23:03:22] [INFO ] Deduced a trap composed of 14 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-07 23:03:22] [INFO ] Deduced a trap composed of 15 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-07 23:03:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:03:24] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/69 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 83 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15245 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16063ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 16063ms
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16148 ms. Remains : 30/34 places, 39/39 transitions.
[2025-06-07 23:03:38] [INFO ] Flatten gal took : 5 ms
[2025-06-07 23:03:38] [INFO ] Flatten gal took : 5 ms
[2025-06-07 23:03:38] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-07 23:03:38] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:38] [INFO ] Flatten gal took : 2 ms
[2025-06-07 23:03:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality12130972486670810606.gal : 1 ms
[2025-06-07 23:03:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality10567073698925425622.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/CTLCardinality12130972486670810606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10567073698925425622.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,166,0.0187,4132,2,359,5,1468,6,0,160,1524,0
Converting to forward existential form...Done !
original formula: EF((AX(EG((pl_incoming_cops_n5<=pl_start_cops))) * EG((pl_robber_absent_n5>=1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!(EG((pl_incoming_cops_n5<=pl_start_cops)))))),(pl_robber_absent_n5>=1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t9, t10, t12, t14, t15, t17, t19, t20, t22, t24, t25, t27, Intersection with...235
Hit Full ! (commute/partial/dont) 34/0/5
(forward)formula 0,1,0.099876,8484,1,0,252,22259,108,110,1208,18613,297
FORMULA CopsAndRobbers-PT-CRL005X001-CTLCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 23:03:38] [INFO ] Flatten gal took : 3 ms
[2025-06-07 23:03:38] [INFO ] Flatten gal took : 2 ms
Total runtime 202199 ms.
BK_STOP 1749337418458
--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-CRL005X001"
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-CRL005X001, 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-174931339400169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-CRL005X001.tgz
mv CopsAndRobbers-PT-CRL005X001 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 '
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 ;