About the Execution of ITS-Tools for CopsAndRobbers-PT-HRL014X002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 763.144 | 223270.00 | 248598.00 | 476.90 | TFTFFTTTTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700482.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CopsAndRobbers-PT-HRL014X002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700482
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 6 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 6 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 134K Mar 3 18:30 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-HRL014X002-CTLFireability-2024-00
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-01
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-02
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-03
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-04
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-05
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-06
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-07
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-08
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-09
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-10
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-11
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-12
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-13
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-14
FORMULA_NAME CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779531464135
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL014X002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 10:17:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 10:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:17:45] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2026-05-23 10:17:45] [INFO ] Transformed 80 places.
[2026-05-23 10:17:45] [INFO ] Transformed 158 transitions.
[2026-05-23 10:17:45] [INFO ] Parsed PT model containing 80 places and 158 transitions and 807 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 61 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 158/158 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 66 transition count 158
Applied a total of 14 rules in 16 ms. Remains 66 /80 variables (removed 14) and now considering 158/158 (removed 0) transitions.
Running 130 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1498548835682074453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12044779280023884747.kers'
[2026-05-23 10:17:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1498548835682074453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12044779280023884747.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 158 rows 52 cols 513 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 10:17:45] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12044779280023884747.kers
Total runtime 1 ms.
[2026-05-23 10:17:45] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 158/224 variables, 66/83 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 42/125 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/125 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/125 constraints. Problems are: Problem set: 28 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 125 constraints, problems are : Problem set: 28 solved, 102 unsolved in 5772 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 158/224 variables, 66/83 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 42/125 constraints. Problems are: Problem set: 28 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 102/227 constraints. Problems are: Problem set: 28 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 224/224 variables, and 227 constraints, problems are : Problem set: 28 solved, 102 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26005ms problems are : Problem set: 28 solved, 102 unsolved
Search for dead transitions found 28 dead transitions in 26026ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 28 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8904207776877776535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6372402412096718838.kers'
[2026-05-23 10:18:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8904207776877776535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6372402412096718838.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 52 cols 401 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 10:18:11] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6372402412096718838.kers
Total runtime 0 ms.
[2026-05-23 10:18:11] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 10:18:11] [INFO ] Invariant cache hit.
[2026-05-23 10:18:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:18:11] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/80 places, 130/158 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26225 ms. Remains : 66/80 places, 130/158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Running 102 sub problems to find dead transitions.
[2026-05-23 10:18:11] [INFO ] Invariant cache hit.
[2026-05-23 10:18:11] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 112 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5421 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 215 constraints, problems are : Problem set: 0 solved, 102 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 25467ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 25469ms
[2026-05-23 10:18:37] [INFO ] Invariant cache hit.
[2026-05-23 10:18:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 10:18:37] [INFO ] Invariant cache hit.
[2026-05-23 10:18:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:18:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25607 ms. Remains : 66/66 places, 130/130 transitions.
Support contains 61 out of 66 places after structural reductions.
[2026-05-23 10:18:37] [INFO ] Flatten gal took : 51 ms
[2026-05-23 10:18:37] [INFO ] Flatten gal took : 16 ms
[2026-05-23 10:18:37] [INFO ] Input system was already deterministic with 130 transitions.
Reduction of identical properties reduced properties to check from 78 to 76
RANDOM walk for 40001 steps (289 resets) in 1216 ms. (32 steps per ms) remains 20/76 properties
BEST_FIRST walk for 4004 steps (23 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (22 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (17 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (19 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (17 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (11 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (24 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 19/20 properties
[2026-05-23 10:18:38] [INFO ] Invariant cache hit.
[2026-05-23 10:18:38] [INFO ] State equation strengthened by 28 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 10/10 constraints. Problems are: Problem set: 11 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 8/54 variables, 7/17 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 118/172 variables, 54/71 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 16/87 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/87 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/196 variables, 12/99 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 12/111 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/111 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/111 constraints. Problems are: Problem set: 15 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 111 constraints, problems are : Problem set: 15 solved, 4 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 4 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/34 variables, 8/8 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/43 variables, 9/17 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/17 constraints. Problems are: Problem set: 16 solved, 3 unsolved
Problem AtomicPropp69 is UNSAT
At refinement iteration 5 (OVERLAPS) 107/150 variables, 43/60 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 5/65 constraints. Problems are: Problem set: 17 solved, 2 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/66 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/66 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 46/196 variables, 23/89 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 23/112 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 1/113 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/113 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/196 variables, 0/113 constraints. Problems are: Problem set: 18 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 113 constraints, problems are : Problem set: 18 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 680ms problems are : Problem set: 18 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 130/130 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 66 transition count 129
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 2 place count 65 transition count 129
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 4 place count 64 transition count 128
Applied a total of 4 rules in 20 ms. Remains 64 /66 variables (removed 2) and now considering 128/130 (removed 2) transitions.
Running 100 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2146774524306434731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11512993104854599343.kers'
[2026-05-23 10:18:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2146774524306434731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11512993104854599343.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 128 rows 50 cols 397 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 10:18:39] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11512993104854599343.kers
Total runtime 0 ms.
[2026-05-23 10:18:39] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 111 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8474 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 100 unsolved
SMT process timed out in 28511ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28511ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28533 ms. Remains : 64/66 places, 128/130 transitions.
RANDOM walk for 40000 steps (319 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 11775 steps (83 resets) in 13 ms. (841 steps per ms) remains 0/1 properties
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
[2026-05-23 10:19:07] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:19:07] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:19:07] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 51 out of 66 places (down from 55) after GAL structural reductions.
Computed a total of 4 stabilizing places and 29 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Running 102 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3462005559447739060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1098239215279714978.kers'
[2026-05-23 10:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3462005559447739060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1098239215279714978.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 52 cols 401 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 10:19:07] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1098239215279714978.kers
Total runtime 0 ms.
[2026-05-23 10:19:07] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 112 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5197 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 215 constraints, problems are : Problem set: 0 solved, 102 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25232ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 25232ms
[2026-05-23 10:19:33] [INFO ] Invariant cache hit.
[2026-05-23 10:19:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 10:19:33] [INFO ] Invariant cache hit.
[2026-05-23 10:19:33] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:33] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25455 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:33] [INFO ] Flatten gal took : 14 ms
[2026-05-23 10:19:33] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:19:33] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:19:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:19:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7043740288228347414.gal : 4 ms
[2026-05-23 10:19:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5375480315898289512.ctl : 2 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7043740288228347414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5375480315898289512.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.178881,10424,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: (E(((!(AG(AX(FALSE))) + (((pl_cops_n8>=1)&&(pl_robber_here_n8>=1))&&((((pl_robber_here_n14>=1)&&(pl_incoming_cops_n14>=1))||(((pl_start_r...792
=> equivalent forward existential formula: [FwdG((Init * E(((!(!(E(TRUE U !(!(EX(!(FALSE))))))) + (((pl_cops_n8>=1)&&(pl_robber_here_n8>=1))&&((((pl_robber...883
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, t29, t30, t32, t34...526
(forward)formula 0,1,1.04531,40844,1,0,321,177438,306,118,3677,141945,331
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:34] [INFO ] Invariant cache hit.
[2026-05-23 10:19:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 10:19:34] [INFO ] Invariant cache hit.
[2026-05-23 10:19:34] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:34] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:19:34] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:34] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:34] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:34] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:19:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9083254523139133211.gal : 2 ms
[2026-05-23 10:19:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7667791802335663565.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9083254523139133211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7667791802335663565.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.172452,10540,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: EX((AX(AX(((pl_cops_n12<1)||(pl_robber_here_n12<1)))) * ((AG(((pl_robber_here_n8<1)||(pl_incoming_cops_n8<1))) + (((pl_start_cops>=2)&&(p...317
=> equivalent forward existential formula: (([((EY(Init) * !(EX(!(!(EX(!(((pl_cops_n12<1)||(pl_robber_here_n12<1))))))))) * !(E(TRUE U !(((pl_robber_here_n...566
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, t29, t30, t32, t34...526
(forward)formula 0,0,2.2902,83840,1,0,367,458603,286,134,3520,260722,359
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:37] [INFO ] Invariant cache hit.
[2026-05-23 10:19:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 10:19:37] [INFO ] Invariant cache hit.
[2026-05-23 10:19:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:37] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:37] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:37] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:37] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:37] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:37] [INFO ] Flatten gal took : 11 ms
[2026-05-23 10:19:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14499533793062854294.gal : 1 ms
[2026-05-23 10:19:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14695421510256050865.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14499533793062854294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14695421510256050865.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.167653,10496,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != 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, t29, t30, t32, t34...526
(forward)formula 0,1,0.740797,29824,1,0,329,116134,281,123,3460,106490,304
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-02 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 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:38] [INFO ] Invariant cache hit.
[2026-05-23 10:19:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 10:19:38] [INFO ] Invariant cache hit.
[2026-05-23 10:19:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:38] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:38] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:19:38] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:19:38] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:38] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:19:38] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11348519741820296098.gal : 1 ms
[2026-05-23 10:19:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16961808597690216248.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11348519741820296098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16961808597690216248.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.167369,10528,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: (EF((((AG((pl_init_cops<1)) + EX(TRUE)) * (pl_start_cops>=1)) * ((pl_cops_n9>=1)&&(pl_robber_absent_n9>=1)))) * EF(EG(((EF((((pl_finalizi...290
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U (((!(E(TRUE U !((pl_init_cops<1)))) + EX(TRUE)) * (pl_start_cops>=1)) * ((pl_cops_n9...364
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, t29, t30, t32, t34...526
(forward)formula 0,0,2.72594,100636,1,0,439,555059,293,175,3655,352774,461
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-03 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 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:41] [INFO ] Invariant cache hit.
[2026-05-23 10:19:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 10:19:41] [INFO ] Invariant cache hit.
[2026-05-23 10:19:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:41] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:41] [INFO ] Flatten gal took : 9 ms
[2026-05-23 10:19:41] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:19:41] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5464969104804741706.gal : 2 ms
[2026-05-23 10:19:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6988772758838261538.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5464969104804741706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6988772758838261538.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.167008,10512,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: EF((EX(AF(((pl_robber_here_n6>=1)&&(pl_incoming_cops_n6>=1)))) * (EG((((pl_start_cops>=1)&&(pl_cops_n5>=1))&&(pl_robber_absent_n5>=1))) +...373
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * EX(!(EG(!(((pl_robber_here_n6>=1)&&(pl_incoming_cops_n6>=1))))))),(((pl_start_cops>=1)...913
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, t29, t30, t32, t34...526
Hit Full ! (commute/partial/dont) 92/71/38
(forward)formula 0,0,4.47846,147928,1,0,538,856524,296,228,3616,601883,557
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-04 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 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:46] [INFO ] Invariant cache hit.
[2026-05-23 10:19:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 10:19:46] [INFO ] Invariant cache hit.
[2026-05-23 10:19:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:46] [INFO ] Flatten gal took : 6 ms
[2026-05-23 10:19:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:19:46] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:46] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:46] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8044748979552388437.gal : 1 ms
[2026-05-23 10:19:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2392195766735755381.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8044748979552388437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2392195766735755381.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.160976,10516,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: AG((AF((A(EX((((pl_finalizing>=1)&&(pl_robber_absent_n5>=1))&&(pl_incoming_cops_n5>=1))) U (pl_init_cops<1)) * (AF((((pl_start_cops>=1)&&...407
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((pl_start_cops>=1)&&(pl_cops_n3>=1))&&(pl_robber_absent_n3>=1)))),!((!((E(!((pl_ini...529
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, t29, t30, t32, t34...526
(forward)formula 0,1,4.76506,160328,1,0,603,939972,297,266,3548,644071,645
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 12 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:51] [INFO ] Invariant cache hit.
[2026-05-23 10:19:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 10:19:51] [INFO ] Invariant cache hit.
[2026-05-23 10:19:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:51] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2026-05-23 10:19:51] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 190 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:51] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:19:51] [INFO ] Flatten gal took : 5 ms
[2026-05-23 10:19:51] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:51] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:19:51] [INFO ] Flatten gal took : 7 ms
[2026-05-23 10:19:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8574428537583684496.gal : 1 ms
[2026-05-23 10:19:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13200072823921541807.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8574428537583684496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13200072823921541807.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.164298,10532,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: ((AG(((((pl_start_cops<1)||(pl_cops_n1<1))||((pl_robber_absent_n1<1)||(((pl_finalizing>=1)&&(pl_robber_absent_n2>=1))&&(pl_incoming_cops_...759
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(((((pl_start_cops<1)||(pl_cops_n1<1))||((pl_robber_absent_n1<1)||(((pl_finalizing>...1020
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, t29, t30, t32, t34...526
(forward)formula 0,1,6.54565,197140,1,0,670,1.14842e+06,301,303,3582,779654,733
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:58] [INFO ] Invariant cache hit.
[2026-05-23 10:19:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 10:19:58] [INFO ] Invariant cache hit.
[2026-05-23 10:19:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:58] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:58] [INFO ] Flatten gal took : 10 ms
[2026-05-23 10:19:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:58] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:58] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9650134412511250688.gal : 1 ms
[2026-05-23 10:19:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10277566751411733556.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9650134412511250688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10277566751411733556.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.161067,10508,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: EG(((EX(EX((((pl_start_robber>=1)&&(pl_robber_absent_n5>=1))&&(pl_robber_here_n6>=1)))) + (pl_start_robber<1)) + ((pl_robber_absent_n3<1)...181
=> equivalent forward existential formula: [FwdG(Init,((EX(EX((((pl_start_robber>=1)&&(pl_robber_absent_n5>=1))&&(pl_robber_here_n6>=1)))) + (pl_start_robb...224
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, t29, t30, t32, t34...526
(forward)formula 0,1,0.74774,30320,1,0,331,121106,284,126,3505,109095,311
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-07 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 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:19:59] [INFO ] Invariant cache hit.
[2026-05-23 10:19:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 10:19:59] [INFO ] Invariant cache hit.
[2026-05-23 10:19:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:19:59] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:19:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:19:59] [INFO ] Flatten gal took : 4 ms
[2026-05-23 10:19:59] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:19:59] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:59] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability758191335225778474.gal : 1 ms
[2026-05-23 10:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9753302858658246803.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability758191335225778474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9753302858658246803.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,17158,0.162079,10520,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: E((!(((pl_init_robber>=1)&&(pl_robber_absent_n8>=1))) * EX(!(AX(AG((((pl_start_robber>=1)&&(pl_robber_here_n12>=1))&&(pl_robber_absent_n1...233
=> equivalent forward existential formula: [(FwdU(Init,(!(((pl_init_robber>=1)&&(pl_robber_absent_n8>=1))) * EX(!(!(EX(!(!(E(TRUE U !((((pl_start_robber>=1...303
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, t29, t30, t32, t34...526
Using saturation style SCC detection
(forward)formula 0,1,4.41262,153140,1,0,548,884287,302,240,3608,627223,583
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:20:03] [INFO ] Invariant cache hit.
[2026-05-23 10:20:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 10:20:03] [INFO ] Invariant cache hit.
[2026-05-23 10:20:03] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:20:03] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:20:03] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:03] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:04] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:20:04] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:20:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10831311179467816562.gal : 1 ms
[2026-05-23 10:20:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13959966838885882622.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10831311179467816562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13959966838885882622.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.159445,10520,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: AX(EG(AG(EF((((pl_start_cops>=1)&&(pl_cops_n7>=1))&&(pl_robber_absent_n7>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(E(TRUE U !(E(TRUE U (((pl_start_cops>=1)&&(pl_cops_n7>=1))&&(pl_robber_absent_n7>=1)))))))))...164
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, t29, t30, t32, t34...526
(forward)formula 0,0,4.57407,149460,1,0,393,873404,288,146,3509,513882,402
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:20:08] [INFO ] Invariant cache hit.
[2026-05-23 10:20:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 10:20:08] [INFO ] Invariant cache hit.
[2026-05-23 10:20:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:20:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:20:08] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:20:08] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:20:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:20:08] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10962374557296560229.gal : 1 ms
[2026-05-23 10:20:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10040817124974991679.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10962374557296560229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10040817124974991679.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.161004,10500,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: AF((EX(TRUE) * AG(EF((((pl_start_robber>=1)&&(pl_robber_absent_n8>=1))&&(pl_robber_here_n9>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(TRUE) * !(E(TRUE U !(E(TRUE U (((pl_start_robber>=1)&&(pl_robber_absent_n8>=1))&&(pl_robber_her...180
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, t29, t30, t32, t34...526
(forward)formula 0,0,4.02031,140928,1,0,388,807838,285,146,3601,488997,399
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 66 transition count 129
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 2 place count 65 transition count 129
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 4 place count 64 transition count 128
Applied a total of 4 rules in 14 ms. Remains 64 /66 variables (removed 2) and now considering 128/130 (removed 2) transitions.
Running 100 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-941939545974831968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1229546552694830524.kers'
[2026-05-23 10:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-941939545974831968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1229546552694830524.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 128 rows 50 cols 397 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 10:20:12] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1229546552694830524.kers
Total runtime 2 ms.
[2026-05-23 10:20:12] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 111 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8388 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 128/192 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 28/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 100 unsolved
SMT process timed out in 28440ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28441ms
[2026-05-23 10:20:41] [INFO ] Invariant cache hit.
[2026-05-23 10:20:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 10:20:41] [INFO ] Invariant cache hit.
[2026-05-23 10:20:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:20:41] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2026-05-23 10:20:41] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 64/66 places, 128/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28779 ms. Remains : 64/66 places, 128/130 transitions.
[2026-05-23 10:20:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:41] [INFO ] Input system was already deterministic with 128 transitions.
[2026-05-23 10:20:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:20:41] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:20:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17316163073857420648.gal : 1 ms
[2026-05-23 10:20:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3307083161437964208.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17316163073857420648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3307083161437964208.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,14218,0.14712,9308,2,1584,5,20545,6,0,385,22292,0
Converting to forward existential form...Done !
original formula: EG(AF(AG(((pl_cops_n7<1)||(pl_robber_here_n7<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((pl_cops_n7<1)||(pl_robber_here_n7<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, t27, t28, t30, t32, t33...534
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,1.67611,67748,1,0,316,365718,290,115,3514,205031,346
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Running 102 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17812327277548827903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8162155903587558946.kers'
[2026-05-23 10:20:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17812327277548827903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8162155903587558946.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 130 rows 52 cols 401 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 10:20:43] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8162155903587558946.kers
Total runtime 1 ms.
[2026-05-23 10:20:43] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 112 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5344 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 102 unsolved
SMT process timed out in 25387ms, After SMT, problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 25388ms
[2026-05-23 10:21:08] [INFO ] Invariant cache hit.
[2026-05-23 10:21:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 10:21:08] [INFO ] Invariant cache hit.
[2026-05-23 10:21:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:21:09] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25688 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:21:09] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:21:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:09] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:21:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:09] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9448050956046821266.gal : 1 ms
[2026-05-23 10:21:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8044888036086310506.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9448050956046821266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8044888036086310506.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.164349,10516,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: AF(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, t29, t30, t32, t34...526
(forward)formula 0,0,0.713249,29836,1,0,329,116134,281,123,3488,106510,304
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-12 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 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:21:09] [INFO ] Invariant cache hit.
[2026-05-23 10:21:09] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 10:21:09] [INFO ] Invariant cache hit.
[2026-05-23 10:21:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:21:10] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:21:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:21:10] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:10] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:21:10] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:10] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13653928848860356880.gal : 1 ms
[2026-05-23 10:21:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6130413413968998245.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13653928848860356880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6130413413968998245.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.16553,10500,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: AG((E((((pl_start_cops>=1)&&(pl_cops_n14>=1))&&(pl_robber_absent_n14>=1)) U (((pl_finalizing>=1)&&(pl_robber_absent_n14>=1))&&(pl_incomin...311
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(E((((pl_start_cops>=1)&&(pl_cops_n14>=1))&&(pl_robber_absent_n14>=1)) U (((pl_finali...554
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, t29, t30, t32, t34...526
Hit Full ! (commute/partial/dont) 119/0/11
(forward)formula 0,0,0.661299,27484,1,0,303,109892,291,99,3636,86852,284
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:21:10] [INFO ] Invariant cache hit.
[2026-05-23 10:21:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 10:21:10] [INFO ] Invariant cache hit.
[2026-05-23 10:21:10] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:21:10] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-23 10:21:11] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:21:11] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9674192738908700790.gal : 1 ms
[2026-05-23 10:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14566715521982593364.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9674192738908700790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14566715521982593364.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.180333,10500,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: EF(EG((E((pl_init_cops>=1) U (((pl_start_cops>=1)&&(pl_cops_n13>=1))&&(pl_robber_absent_n13>=1))) * (((pl_start_robber<1)||(pl_robber_abs...192
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E((pl_init_cops>=1) U (((pl_start_cops>=1)&&(pl_cops_n13>=1))&&(pl_robber_absent_n13>=1))...242
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, t29, t30, t32, t34...526
(forward)formula 0,0,0.664882,25268,1,0,299,100091,287,99,3504,70137,284
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 130/130 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:21:11] [INFO ] Invariant cache hit.
[2026-05-23 10:21:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 10:21:11] [INFO ] Invariant cache hit.
[2026-05-23 10:21:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 10:21:11] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 66/66 places, 130/130 transitions.
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 3 ms
[2026-05-23 10:21:11] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 10:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16830288837961086658.gal : 1 ms
[2026-05-23 10:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12324412367418916002.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16830288837961086658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12324412367418916002.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,17158,0.169628,10500,2,1893,5,23148,6,0,395,29207,0
Converting to forward existential form...Done !
original formula: EX((AF(E(!((((pl_cops_n3>=1)&&(pl_robber_here_n3>=1))||(((pl_start_robber>=1)&&(pl_robber_absent_n6>=1))&&(pl_robber_here_n7>=1)))) U (((...525
=> equivalent forward existential formula: [(((FwdU((EY(Init) * !(EG(!(E(!((((pl_cops_n3>=1)&&(pl_robber_here_n3>=1))||(((pl_start_robber>=1)&&(pl_robber_a...771
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, t29, t30, t32, t34...526
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,15.2378,405344,1,0,1712,2.40417e+06,306,953,3620,1.70104e+06,1932
FORMULA CopsAndRobbers-PT-HRL014X002-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-23 10:21:27] [INFO ] Flatten gal took : 8 ms
[2026-05-23 10:21:27] [INFO ] Flatten gal took : 2 ms
Total runtime 222045 ms.
BK_STOP 1779531687405
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-HRL014X002"
export BK_EXAMINATION="CTLFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-HRL014X002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL014X002.tgz
mv CopsAndRobbers-PT-HRL014X002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;