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-177946967800523.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-KFL028N008K002X005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967800523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K Mar 6 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 6 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 15 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 762K 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-KFL028N008K002X005-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779535521372

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-KFL028N008K002X005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 11:25:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 11:25:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:25:22] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2026-05-23 11:25:22] [INFO ] Transformed 146 places.
[2026-05-23 11:25:22] [INFO ] Transformed 927 transitions.
[2026-05-23 11:25:22] [INFO ] Parsed PT model containing 146 places and 927 transitions and 5438 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 927/927 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 124 transition count 927
Applied a total of 22 rules in 30 ms. Remains 124 /146 variables (removed 22) and now considering 927/927 (removed 0) transitions.
Running 852 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-4075810417642281524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8619327365169173550.kers'
[2026-05-23 11:25:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4075810417642281524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8619327365169173550.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 927 rows 96 cols 3546 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-23 11:25:23] [INFO ] Computed 30 invariants in 4 ms
Computed 30 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8619327365169173550.kers
Total runtime 5 ms.
[2026-05-23 11:25:23] [INFO ] State equation strengthened by 70 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/1051 variables, and 218 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/124 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 489/707 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1051 variables, and 707 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/124 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 834/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41959ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 42001ms
[2026-05-23 11:26:04] [INFO ] Invariant cache hit.
[2026-05-23 11:26:05] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 11:26:05] [INFO ] Invariant cache hit.
[2026-05-23 11:26:05] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:26:05] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 124/146 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42898 ms. Remains : 124/146 places, 927/927 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 927/927 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 11:26:05] [INFO ] Invariant cache hit.
[2026-05-23 11:26:05] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-23 11:26:05] [INFO ] Invariant cache hit.
[2026-05-23 11:26:06] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:26:06] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 758 ms. Remains : 124/124 places, 927/927 transitions.
Support contains 46 out of 124 places after structural reductions.
[2026-05-23 11:26:06] [INFO ] Flatten gal took : 95 ms
[2026-05-23 11:26:06] [INFO ] Flatten gal took : 57 ms
[2026-05-23 11:26:07] [INFO ] Input system was already deterministic with 927 transitions.
RANDOM walk for 40000 steps (646 resets) in 1765 ms. (22 steps per ms) remains 4/34 properties
BEST_FIRST walk for 40004 steps (39 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (52 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
[2026-05-23 11:26:07] [INFO ] Invariant cache hit.
[2026-05-23 11:26:07] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 32/1051 variables, and 5 constraints, problems are : Problem set: 4 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 5/30 constraints, State Equation: 0/124 constraints, ReadFeed: 0/70 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 2320 edges and 124 vertex of which 118 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 ms
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Graph (complete) has 2320 edges and 124 vertex of which 118 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 118 transition count 926
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 117 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 116 transition count 925
Applied a total of 5 rules in 108 ms. Remains 116 /124 variables (removed 8) and now considering 925/927 (removed 2) transitions.
Running 850 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-12520750449225705339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1602428106519797724.kers'
[2026-05-23 11:26:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12520750449225705339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1602428106519797724.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 925 rows 88 cols 3530 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 11:26:08] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1602428106519797724.kers
Total runtime 5 ms.
[2026-05-23 11:26:08] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (OVERLAPS) 925/1041 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 216 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 850/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (OVERLAPS) 925/1041 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 301 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 850/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41112ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41114ms
[2026-05-23 11:26:49] [INFO ] Invariant cache hit.
[2026-05-23 11:26:49] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-23 11:26:49] [INFO ] Invariant cache hit.
[2026-05-23 11:26:49] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:26:50] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2026-05-23 11:26:50] [INFO ] Redundant transitions in 46 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/124 places, 925/927 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42472 ms. Remains : 116/124 places, 925/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 213 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-01
Stuttering criterion allowed to conclude after 84 steps with 3 reset in 19 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-01 finished in 42791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((p1||X((X((p2&&X(F(p3)))) U (p1&&X((p2&&X(F(p3)))))))) U (p0&&(p1||X((X((p2&&X(F(p3)))) U (p1&&X((p2&&X(F(p3))))))))))))))'
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 927
Applied a total of 4 rules in 14 ms. Remains 120 /124 variables (removed 4) and now considering 927/927 (removed 0) transitions.
Running 852 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-7108705478636268483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11592912387969261850.kers'
[2026-05-23 11:26:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7108705478636268483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11592912387969261850.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 927 rows 92 cols 3538 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-23 11:26:50] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11592912387969261850.kers
Total runtime 13 ms.
[2026-05-23 11:26:50] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/1047 variables, and 218 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/120 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 501/719 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1047 variables, and 719 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/120 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 846/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42078ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 42095ms
[2026-05-23 11:27:32] [INFO ] Invariant cache hit.
[2026-05-23 11:27:33] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 11:27:33] [INFO ] Invariant cache hit.
[2026-05-23 11:27:33] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:27:34] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 120/124 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43411 ms. Remains : 120/124 places, 927/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((p1||X((X((p2&&X(F(p3)))) U (p1&&X((p2&&X(F(p3)))))))) U (p0&&(p1||X((X((p2&&X(F(p3)))) U (p1&&X((p2&&X(F(p3))))))))))))))'
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-02
Stuttering criterion allowed to conclude after 67 steps with 24 reset in 4 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-02 finished in 43797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 927
Applied a total of 6 rules in 9 ms. Remains 118 /124 variables (removed 6) and now considering 927/927 (removed 0) transitions.
Running 852 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-10797063402423378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2204891020449525304.kers'
[2026-05-23 11:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10797063402423378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2204891020449525304.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 927 rows 90 cols 3534 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 11:27:34] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-2204891020449525304.kers
Total runtime 17 ms.
[2026-05-23 11:27:34] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/1045 variables, and 218 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/118 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 507/725 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1045 variables, and 725 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/118 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41471ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 41474ms
[2026-05-23 11:28:16] [INFO ] Invariant cache hit.
[2026-05-23 11:28:16] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-23 11:28:16] [INFO ] Invariant cache hit.
[2026-05-23 11:28:16] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:28:17] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42536 ms. Remains : 118/124 places, 927/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-03
Stuttering criterion allowed to conclude after 47 steps with 1 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-03 finished in 42679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||X(X(F(p2)))))))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Graph (complete) has 2320 edges and 124 vertex of which 118 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 118 transition count 926
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 117 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 116 transition count 925
Applied a total of 5 rules in 54 ms. Remains 116 /124 variables (removed 8) and now considering 925/927 (removed 2) transitions.
Running 850 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-13329345209414310349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11852674372443629724.kers'
[2026-05-23 11:28:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13329345209414310349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11852674372443629724.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 1 ms.
// Phase 1: matrix 925 rows 88 cols 3530 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 11:28:17] [INFO ] Computed 30 invariants in 5 ms
Computed 30 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-11852674372443629724.kers
Total runtime 20 ms.
[2026-05-23 11:28:17] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (OVERLAPS) 925/1041 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 216 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 850/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (OVERLAPS) 925/1041 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 301 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 850/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41040ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41041ms
[2026-05-23 11:28:58] [INFO ] Invariant cache hit.
[2026-05-23 11:28:58] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 11:28:58] [INFO ] Invariant cache hit.
[2026-05-23 11:28:58] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:28:59] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2026-05-23 11:28:59] [INFO ] Redundant transitions in 13 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/124 places, 925/927 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42274 ms. Remains : 116/124 places, 925/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||X(X(F(p2)))))))))'
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-06
Product exploration explored 100000 steps with 2379 reset in 1125 ms.
Product exploration explored 100000 steps with 2412 reset in 1067 ms.
Computed a total of 0 stabilizing places and 56 stable transitions
Computed a total of 0 stabilizing places and 56 stable transitions
Knowledge based reduction with 10 factoid took 79 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40001 steps (747 resets) in 789 ms. (50 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
[2026-05-23 11:29:02] [INFO ] Invariant cache hit.
[2026-05-23 11:29:02] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/1041 variables, 22/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1041 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1041 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 94/116 constraints, ReadFeed: 48/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 37 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 116/116 places, 925/925 transitions.
RANDOM walk for 40000 steps (748 resets) in 836 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (61 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 496006 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 496006 steps, saw 100225 distinct states, run finished after 3005 ms. (steps per millisecond=165 ) properties seen :0
[2026-05-23 11:29:07] [INFO ] Invariant cache hit.
[2026-05-23 11:29:07] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/1041 variables, 22/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1041 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/997 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/1041 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 22/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1041 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1041 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 25 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 116/116 places, 925/925 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 23 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
[2026-05-23 11:29:09] [INFO ] Invariant cache hit.
[2026-05-23 11:29:09] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-23 11:29:09] [INFO ] Invariant cache hit.
[2026-05-23 11:29:09] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:29:10] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2026-05-23 11:29:10] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1308 ms. Remains : 116/116 places, 925/925 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 116 transition count 871
Applied a total of 54 rules in 48 ms. Remains 116 /116 variables (removed 0) and now considering 871/925 (removed 54) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13505669433583390345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10132562144012056466.kers'
[2026-05-23 11:29:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13505669433583390345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10132562144012056466.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 871 rows 88 cols 3476 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 11:29:10] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10132562144012056466.kers
Total runtime 4 ms.
[2026-05-23 11:29:10] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2026-05-23 11:29:10] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 11:29:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2026-05-23 11:29:13] [INFO ] After 2372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 11:29:17] [INFO ] After 6742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 11:29:17] [INFO ] After 6816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 7198 ms.
Knowledge based reduction with 10 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 16151 ms.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 42 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17895505153070595251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14898893939160083397.kers'
[2026-05-23 11:29:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17895505153070595251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14898893939160083397.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 925 rows 88 cols 3530 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 11:29:18] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14898893939160083397.kers
Total runtime 10 ms.
[2026-05-23 11:29:18] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-23 11:29:18] [INFO ] Invariant cache hit.
[2026-05-23 11:29:18] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:29:19] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2026-05-23 11:29:19] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1359 ms. Remains : 116/116 places, 925/925 transitions.
Computed a total of 0 stabilizing places and 56 stable transitions
Computed a total of 0 stabilizing places and 56 stable transitions
Knowledge based reduction with 10 factoid took 65 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40002 steps (733 resets) in 859 ms. (46 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (47 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2026-05-23 11:29:19] [INFO ] Invariant cache hit.
[2026-05-23 11:29:19] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/1041 variables, 22/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1041 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1041 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 94/116 constraints, ReadFeed: 48/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1823ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 23 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 116/116 places, 925/925 transitions.
RANDOM walk for 40000 steps (725 resets) in 896 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (48 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 504175 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 504175 steps, saw 102573 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-23 11:29:25] [INFO ] Invariant cache hit.
[2026-05-23 11:29:25] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 44/1041 variables, 22/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1041 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1041 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 454/512 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 485/997 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/997 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 45/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/997 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/1041 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 22/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1041 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1041 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/116 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 29 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 116/116 places, 925/925 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 41 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
[2026-05-23 11:29:27] [INFO ] Invariant cache hit.
[2026-05-23 11:29:27] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 11:29:27] [INFO ] Invariant cache hit.
[2026-05-23 11:29:27] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:29:28] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2026-05-23 11:29:28] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1201 ms. Remains : 116/116 places, 925/925 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 116 transition count 871
Applied a total of 54 rules in 26 ms. Remains 116 /116 variables (removed 0) and now considering 871/925 (removed 54) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15608096583442589900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15616542742553571276.kers'
[2026-05-23 11:29:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15608096583442589900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15616542742553571276.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 871 rows 88 cols 3476 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 11:29:28] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15616542742553571276.kers
Total runtime 4 ms.
[2026-05-23 11:29:28] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2026-05-23 11:29:28] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 11:29:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2026-05-23 11:29:30] [INFO ] After 2188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 11:29:35] [INFO ] After 6570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 11:29:35] [INFO ] After 6642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6909 ms.
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 15875 ms.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2436 reset in 1031 ms.
Product exploration explored 100000 steps with 2461 reset in 1043 ms.
Built C files in :
/tmp/ltsmin13681005810546551080
[2026-05-23 11:29:37] [INFO ] Computing symmetric may disable matrix : 925 transitions.
[2026-05-23 11:29:37] [INFO ] Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:29:37] [INFO ] Computing symmetric may enable matrix : 925 transitions.
[2026-05-23 11:29:37] [INFO ] Computation of Complete enable matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:29:37] [INFO ] Computing Do-Not-Accords matrix : 925 transitions.
[2026-05-23 11:29:37] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:29:38] [INFO ] Built C files in 474ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13681005810546551080
Running compilation step : cd /tmp/ltsmin13681005810546551080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13681005810546551080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13681005810546551080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 925/925 transitions.
Applied a total of 0 rules in 24 ms. Remains 116 /116 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17881744265037448703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12800351562710801353.kers'
[2026-05-23 11:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17881744265037448703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12800351562710801353.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 925 rows 88 cols 3530 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 11:29:41] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12800351562710801353.kers
Total runtime 3 ms.
[2026-05-23 11:29:41] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-23 11:29:41] [INFO ] Invariant cache hit.
[2026-05-23 11:29:41] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:29:42] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2026-05-23 11:29:42] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1212 ms. Remains : 116/116 places, 925/925 transitions.
Built C files in :
/tmp/ltsmin17237340527016170068
[2026-05-23 11:29:42] [INFO ] Computing symmetric may disable matrix : 925 transitions.
[2026-05-23 11:29:42] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:29:42] [INFO ] Computing symmetric may enable matrix : 925 transitions.
[2026-05-23 11:29:42] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:29:42] [INFO ] Computing Do-Not-Accords matrix : 925 transitions.
[2026-05-23 11:29:42] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:29:42] [INFO ] Built C files in 325ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17237340527016170068
Running compilation step : cd /tmp/ltsmin17237340527016170068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17237340527016170068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17237340527016170068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 11:29:45] [INFO ] Flatten gal took : 89 ms
[2026-05-23 11:29:45] [INFO ] Flatten gal took : 48 ms
[2026-05-23 11:29:45] [INFO ] Time to serialize gal into /tmp/LTL2900214774351593500.gal : 25 ms
[2026-05-23 11:29:45] [INFO ] Time to serialize properties into /tmp/LTL16133106837150978538.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2900214774351593500.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3465301990906366920.hoa' '-atoms' '/tmp/LTL16133106837150978538.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16133106837150978538.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3465301990906366920.hoa
Detected timeout of ITS tools.
[2026-05-23 11:30:01] [INFO ] Flatten gal took : 77 ms
[2026-05-23 11:30:01] [INFO ] Flatten gal took : 65 ms
[2026-05-23 11:30:01] [INFO ] Time to serialize gal into /tmp/LTL14170418188130747189.gal : 23 ms
[2026-05-23 11:30:01] [INFO ] Time to serialize properties into /tmp/LTL12674689242751826670.ltl : 18 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14170418188130747189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12674689242751826670.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(pl_robber_here_n16<1)"))||(X(("(pl_cops_n21<3)")||(X(X(F("(pl_incoming_cops_n15<2)"))))))))))
Formula 0 simplified : G(F!"(pl_cops_n21<3)" & FG(!"(pl_incoming_cops_n15<2)" & !"(pl_robber_here_n16<1)"))
Detected timeout of ITS tools.
[2026-05-23 11:30:16] [INFO ] Flatten gal took : 28 ms
[2026-05-23 11:30:16] [INFO ] Applying decomposition
[2026-05-23 11:30:16] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4781201879872139968.txt' '-o' '/tmp/graph4781201879872139968.bin' '-w' '/tmp/graph4781201879872139968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4781201879872139968.bin' '-l' '-1' '-v' '-w' '/tmp/graph4781201879872139968.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:30:16] [INFO ] Decomposing Gal with order
[2026-05-23 11:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:30:17] [INFO ] Removed a total of 2097 redundant transitions.
[2026-05-23 11:30:17] [INFO ] Flatten gal took : 777 ms
[2026-05-23 11:30:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 476 labels/synchronizations in 65 ms.
[2026-05-23 11:30:17] [INFO ] Time to serialize gal into /tmp/LTL6378352751766443578.gal : 21 ms
[2026-05-23 11:30:17] [INFO ] Time to serialize properties into /tmp/LTL13887742695052989555.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6378352751766443578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13887742695052989555.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(i6.u17.pl_robber_here_n16<1)"))||(X(("(u0.pl_cops_n21<3)")||(X(X(F("(u0.pl_incoming_cops_n15<2)"))))))))))
Formula 0 simplified : G(F!"(u0.pl_cops_n21<3)" & FG(!"(i6.u17.pl_robber_here_n16<1)" & !"(u0.pl_incoming_cops_n15<2)"))
Detected timeout of ITS tools.
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-06 finished in 135362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Graph (complete) has 2320 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 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 119 transition count 926
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 118 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 117 transition count 925
Applied a total of 5 rules in 49 ms. Remains 117 /124 variables (removed 7) and now considering 925/927 (removed 2) transitions.
Running 850 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-17930549978156144141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17623799034355420893.kers'
[2026-05-23 11:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17930549978156144141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17623799034355420893.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 925 rows 89 cols 3532 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-23 11:30:32] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17623799034355420893.kers
Total runtime 3 ms.
[2026-05-23 11:30:32] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (OVERLAPS) 925/1041 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1041/1042 variables, and 216 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/117 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 850/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (OVERLAPS) 925/1041 variables, 116/146 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 70/216 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/1042 variables, and 298 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 116/117 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 847/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41348ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41350ms
[2026-05-23 11:31:14] [INFO ] Invariant cache hit.
[2026-05-23 11:31:14] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-23 11:31:14] [INFO ] Invariant cache hit.
[2026-05-23 11:31:14] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:31:15] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2026-05-23 11:31:15] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/124 places, 925/927 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42477 ms. Remains : 117/124 places, 925/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-07
Stuttering criterion allowed to conclude after 24988 steps with 635 reset in 296 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-07 finished in 42865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 927
Applied a total of 6 rules in 3 ms. Remains 118 /124 variables (removed 6) and now considering 927/927 (removed 0) transitions.
Running 852 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-3813854514535293744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15007342766933217654.kers'
[2026-05-23 11:31:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3813854514535293744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15007342766933217654.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 927 rows 90 cols 3534 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 11:31:15] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15007342766933217654.kers
Total runtime 3 ms.
[2026-05-23 11:31:15] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/1045 variables, and 218 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/118 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 507/725 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1045 variables, and 725 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/118 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41523ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 41525ms
[2026-05-23 11:31:57] [INFO ] Invariant cache hit.
[2026-05-23 11:31:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-23 11:31:57] [INFO ] Invariant cache hit.
[2026-05-23 11:31:57] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:31:58] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42629 ms. Remains : 118/124 places, 927/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 39 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 51 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-08 finished in 43620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p0))) U X((F((p0&&X(F(p2)))) U !p2))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 927
Applied a total of 6 rules in 2 ms. Remains 118 /124 variables (removed 6) and now considering 927/927 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 11:31:59] [INFO ] Invariant cache hit.
[2026-05-23 11:31:59] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-23 11:31:59] [INFO ] Invariant cache hit.
[2026-05-23 11:31:59] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:32:00] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 118/124 places, 927/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U X((F((p0&&X(F(p2)))) U !p2))))'
Stuttering acceptance computed with spot in 277 ms :[p2, p2, (AND (NOT p0) p2 (NOT p1)), p2, (OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-10
Stuttering criterion allowed to conclude after 1010 steps with 233 reset in 10 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-10 finished in 1513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(p1))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 927
Applied a total of 5 rules in 2 ms. Remains 119 /124 variables (removed 5) and now considering 927/927 (removed 0) transitions.
Running 852 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-11784421989991296285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11440638244822302178.kers'
[2026-05-23 11:32:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11784421989991296285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11440638244822302178.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 927 rows 91 cols 3536 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 11:32:00] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11440638244822302178.kers
Total runtime 3 ms.
[2026-05-23 11:32:00] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/1046 variables, and 218 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/119 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 504/722 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1046 variables, and 722 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/119 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 849/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41591ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 41593ms
[2026-05-23 11:32:42] [INFO ] Invariant cache hit.
[2026-05-23 11:32:42] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-23 11:32:42] [INFO ] Invariant cache hit.
[2026-05-23 11:32:42] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:32:43] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42691 ms. Remains : 119/124 places, 927/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(p1))))'
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-14 finished in 42914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(p1) U p2))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 927/927 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 927
Applied a total of 6 rules in 5 ms. Remains 118 /124 variables (removed 6) and now considering 927/927 (removed 0) transitions.
Running 852 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-7936647798304316315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-360520562168639199.kers'
[2026-05-23 11:32:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7936647798304316315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-360520562168639199.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 1 ms.
// Phase 1: matrix 927 rows 90 cols 3534 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 11:32:43] [INFO ] Computed 30 invariants in 9 ms
Computed 30 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-360520562168639199.kers
Total runtime 10 ms.
[2026-05-23 11:32:43] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1045/1045 variables, and 218 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/118 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 927/1045 variables, 118/148 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 70/218 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 507/725 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1045 variables, and 725 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 118/118 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 852/507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41480ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 41482ms
[2026-05-23 11:33:25] [INFO ] Invariant cache hit.
[2026-05-23 11:33:25] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 11:33:25] [INFO ] Invariant cache hit.
[2026-05-23 11:33:25] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-23 11:33:25] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 927/927 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42419 ms. Remains : 118/124 places, 927/927 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(p1) U p2))))'
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-15 finished in 42661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||X(X(F(p2)))))))))'
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 11:33:26] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4613129028112179082
[2026-05-23 11:33:26] [INFO ] Applying decomposition
[2026-05-23 11:33:26] [INFO ] Computing symmetric may disable matrix : 927 transitions.
[2026-05-23 11:33:26] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:33:26] [INFO ] Flatten gal took : 54 ms
[2026-05-23 11:33:26] [INFO ] Computing symmetric may enable matrix : 927 transitions.
[2026-05-23 11:33:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13863732015121649799.txt' '-o' '/tmp/graph13863732015121649799.bin' '-w' '/tmp/graph13863732015121649799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13863732015121649799.bin' '-l' '-1' '-v' '-w' '/tmp/graph13863732015121649799.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:33:26] [INFO ] Decomposing Gal with order
[2026-05-23 11:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:33:26] [INFO ] Computing Do-Not-Accords matrix : 927 transitions.
[2026-05-23 11:33:26] [INFO ] Computation of Completed DNA matrix. took 85 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:33:26] [INFO ] Removed a total of 1678 redundant transitions.
[2026-05-23 11:33:26] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4613129028112179082
Running compilation step : cd /tmp/ltsmin4613129028112179082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 11:33:26] [INFO ] Flatten gal took : 194 ms
[2026-05-23 11:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 476 labels/synchronizations in 29 ms.
[2026-05-23 11:33:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality1938707692261795747.gal : 21 ms
[2026-05-23 11:33:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality13633302287138186135.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1938707692261795747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13633302287138186135.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(i2.u18.pl_robber_here_n16<1)"))||(X(("(u0.pl_cops_n21<3)")||(X(X(F("(u0.pl_incoming_cops_n15<2)"))))))))))
Formula 0 simplified : G(F!"(u0.pl_cops_n21<3)" & FG(!"(i2.u18.pl_robber_here_n16<1)" & !"(u0.pl_incoming_cops_n15<2)"))
Compilation finished in 3755 ms.
Running link step : cd /tmp/ltsmin4613129028112179082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin4613129028112179082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||X(X(<>((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t12, t16, t18, t21, t24, t27, t30, t34, t36, t39, t43, t45, t49, t52, t54, t57, ...3468
Computing Next relation with stutter on 1.8879e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
89027 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,890.425,9154852,1,0,549766,3.11925e+07,3074,1.75145e+06,2339,1.26082e+08,349378
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CopsAndRobbers-PT-KFL028N008K002X005-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1391529 ms.

BK_STOP 1779536914087

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CopsAndRobbers-PT-KFL028N008K002X005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-KFL028N008K002X005.tgz
mv CopsAndRobbers-PT-KFL028N008K002X005 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;