Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339500230.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CopsAndRobbers-PT-HRL023X006, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339500230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Jun 6 11:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 11:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 15K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 236K Jun 5 20:08 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-00
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-01
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-02
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-03
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-04
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-05
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-06
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-07
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-09
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-10
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-11
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-12
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-13
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-14
FORMULA_NAME CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749345482985

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL023X006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 01:18:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 01:18:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 01:18:04] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-06-08 01:18:04] [INFO ] Transformed 125 places.
[2025-06-08 01:18:04] [INFO ] Transformed 287 transitions.
[2025-06-08 01:18:04] [INFO ] Parsed PT model containing 125 places and 287 transitions and 1500 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2025-06-08 01:18:04] [INFO ] Flatten gal took : 67 ms
[2025-06-08 01:18:04] [INFO ] Flatten gal took : 53 ms
RANDOM walk for 40010 steps (127 resets) in 1290 ms. (30 steps per ms) remains 8/16 properties
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 01:18:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14795176733527159516.gal : 51 ms
[2025-06-08 01:18:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3357069559846638676.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14795176733527159516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3357069559846638676.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (78 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (51 resets) in 205 ms. (194 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3357069559846638676.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :18 after 21
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :21 after 444
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :444 after 451
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :451 after 458
BEST_FIRST walk for 40004 steps (93 resets) in 642 ms. (62 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (107 resets) in 121 ms. (327 steps per ms) remains 7/8 properties
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (83 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (84 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (80 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
// Phase 1: matrix 287 rows 125 cols
[2025-06-08 01:18:05] [INFO ] Computed 27 invariants in 14 ms
[2025-06-08 01:18:05] [INFO ] State equation strengthened by 54 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-00 is UNSAT
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-11 is UNSAT
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-14 is UNSAT
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-05 is UNSAT
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 29/119 variables, 10/21 constraints. Problems are: Problem set: 4 solved, 3 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :458 after 38022
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/124 variables, 5/26 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/27 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/27 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 287/412 variables, 125/152 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 54/206 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/206 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/412 variables, 0/206 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 206 constraints, problems are : Problem set: 4 solved, 3 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 57/116 variables, 14/18 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/124 variables, 8/26 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/27 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/27 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 287/412 variables, 125/152 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 54/206 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 1/207 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:18:06] [INFO ] Deduced a trap along path composed of 6 places in 47 ms of which 6 ms to minimize.
Problem CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-13 is UNSAT
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 1/208 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/208 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/412 variables, 0/208 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 208 constraints, problems are : Problem set: 5 solved, 2 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2772ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 363 ms.
Support contains 51 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 287/287 transitions.
Graph (complete) has 806 edges and 125 vertex of which 113 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 113 /125 variables (removed 12) and now considering 287/287 (removed 0) transitions.
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 287 rows 113 cols
[2025-06-08 01:18:08] [INFO ] Computed 26 invariants in 3 ms
[2025-06-08 01:18:08] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 23/23 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/24 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 287/389 variables, 102/128 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 54/182 constraints. Problems are: Problem set: 16 solved, 225 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :38022 after 1.12634e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/182 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 11/400 variables, 11/193 constraints. Problems are: Problem set: 16 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 193 constraints, problems are : Problem set: 16 solved, 225 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 225 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 23/23 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/24 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 2/26 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 287/389 variables, 102/128 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 54/182 constraints. Problems are: Problem set: 16 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 155/337 constraints. Problems are: Problem set: 16 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/400 variables, and 337 constraints, problems are : Problem set: 16 solved, 225 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/113 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 155/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40263ms problems are : Problem set: 16 solved, 225 unsolved
Search for dead transitions found 16 dead transitions in 40265ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/125 places, 271/287 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40310 ms. Remains : 113/125 places, 271/287 transitions.
RANDOM walk for 40007 steps (169 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 180 ms. (221 steps per ms) remains 1/2 properties
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (94 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
// Phase 1: matrix 271 rows 113 cols
[2025-06-08 01:18:49] [INFO ] Computed 26 invariants in 2 ms
[2025-06-08 01:18:49] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/53 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/70 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 240/310 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 70/380 variables, 39/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 31/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/384 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 30/53 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/70 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 240/310 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 70/380 variables, 39/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 31/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/384 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 23 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 271/271 transitions.
Graph (complete) has 738 edges and 113 vertex of which 105 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 105 transition count 270
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 270
Applied a total of 3 rules in 27 ms. Remains 104 /113 variables (removed 9) and now considering 270/271 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 104/113 places, 270/271 transitions.
RANDOM walk for 40006 steps (142 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1498047 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1498047 steps, saw 276920 distinct states, run finished after 3006 ms. (steps per millisecond=498 ) properties seen :0
// Phase 1: matrix 270 rows 104 cols
[2025-06-08 01:18:53] [INFO ] Computed 26 invariants in 7 ms
[2025-06-08 01:18:53] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 29/52 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/69 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 239/308 variables, 69/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/374 variables, 35/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 31/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 29/52 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/69 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 239/308 variables, 69/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/374 variables, 35/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 31/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 270/270 transitions.
Applied a total of 0 rules in 12 ms. Remains 104 /104 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 104/104 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2025-06-08 01:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:18:53] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-08 01:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 01:18:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-08 01:18:54] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 01:18:54] [INFO ] Redundant transitions in 15 ms returned []
Running 224 sub problems to find dead transitions.
[2025-06-08 01:18:54] [INFO ] Invariant cache hit.
[2025-06-08 01:18:54] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 270/371 variables, 101/127 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:19:03] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 01:19:11] [INFO ] Deduced a trap along path composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 3/374 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 178 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 270/371 variables, 101/128 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 206/380 constraints. Problems are: Problem set: 0 solved, 224 unsolved
SMT process timed out in 60183ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60830 ms. Remains : 104/104 places, 270/270 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 104 transition count 239
Applied a total of 31 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 239/270 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 239 rows 104 cols
[2025-06-08 01:19:54] [INFO ] Computed 26 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 01:19:54] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 01:19:54] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2025-06-08 01:19:54] [INFO ] [Nat]Absence check using 25 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-08 01:19:54] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-08 01:19:54] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-08 01:19:54] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-08 01:19:54] [INFO ] Flatten gal took : 27 ms
[2025-06-08 01:19:54] [INFO ] Flatten gal took : 18 ms
[2025-06-08 01:19:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8916279791619921914.gal : 7 ms
[2025-06-08 01:19:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16214402103021936099.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8916279791619921914.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16214402103021936099.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16214402103021936099.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 648
Invariant property CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9072,0.047901,6240,2,282,10,2710,6,0,638,852,0
Total reachable state count : 9072

Verifying 1 reachability properties.
Invariant property CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08,1,0.049702,6368,2,105,10,2710,7,0,681,852,0
Over-approximation ignoring read arcs solved 0 properties in 353 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 01:19:54] [INFO ] Flatten gal took : 21 ms
[2025-06-08 01:19:54] [INFO ] Applying decomposition
[2025-06-08 01:19:54] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11659223780582336905.txt' '-o' '/tmp/graph11659223780582336905.bin' '-w' '/tmp/graph11659223780582336905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11659223780582336905.bin' '-l' '-1' '-v' '-w' '/tmp/graph11659223780582336905.weights' '-q' '0' '-e' '0.001'
[2025-06-08 01:19:54] [INFO ] Decomposing Gal with order
[2025-06-08 01:19:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 01:19:54] [INFO ] Removed a total of 186 redundant transitions.
[2025-06-08 01:19:54] [INFO ] Flatten gal took : 95 ms
[2025-06-08 01:19:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 15 ms.
[2025-06-08 01:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8920669123975480460.gal : 4 ms
[2025-06-08 01:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15559414284321883128.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8920669123975480460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15559414284321883128.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15559414284321883128.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 84
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :84 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 462
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :462 after 7215
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7215 after 10736
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10736 after 35232
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :35232 after 178608
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :178608 after 621467
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :621467 after 2.14247e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.14247e+06 after 9.52231e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.52231e+06 after 4.33122e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.33122e+07 after 1.67663e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.67663e+08 after 8.53207e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,9.74061e+08,1316.21,2075100,2,72306,20,9.51703e+06,7,0,875,8.33205e+06,0
Total reachable state count : 974061455

Verifying 1 reachability properties.
Invariant property CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08 is true.
FORMULA CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CopsAndRobbers-PT-HRL023X006-ReachabilityCardinality-2025-08,0,1316.4,2075100,1,0,20,9.51703e+06,7,0,978,8.33205e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 1428401 ms.

BK_STOP 1749346912590

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-HRL023X006"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-HRL023X006, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339500230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL023X006.tgz
mv CopsAndRobbers-PT-HRL023X006 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;