fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r066-tall-177946967800515
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for CopsAndRobbers-PT-KFL010N005K002X001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
430.327 55581.00 72159.00 2559.50 FFFFFFFFFFFFTFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967800515.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-KFL010N005K002X001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967800515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 11K Mar 6 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 6 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 15 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K 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 75K 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-KFL010N005K002X001-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779534760155

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-KFL010N005K002X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 11:12:41] [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:12:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:12:41] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2026-05-23 11:12:41] [INFO ] Transformed 56 places.
[2026-05-23 11:12:41] [INFO ] Transformed 93 transitions.
[2026-05-23 11:12:41] [INFO ] Parsed PT model containing 56 places and 93 transitions and 506 arcs in 136 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 1 formulas.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 93/93 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 52 transition count 93
Applied a total of 4 rules in 14 ms. Remains 52 /56 variables (removed 4) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16479111082361004348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8071644898499940639.kers'
[2026-05-23 11:12:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16479111082361004348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8071644898499940639.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 42 cols 318 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-23 11:12:41] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8071644898499940639.kers
Total runtime 1 ms.
[2026-05-23 11:12:41] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-23 11:12:41] [INFO ] Invariant cache hit.
[2026-05-23 11:12:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:12:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-23 11:12:41] [INFO ] Invariant cache hit.
[2026-05-23 11:12:41] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 6/145 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 96 constraints, problems are : Problem set: 0 solved, 90 unsolved in 8104 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 54/144 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 6/145 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 36/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 186 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13818ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 13832ms
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14197 ms. Remains : 52/56 places, 93/93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2026-05-23 11:12:55] [INFO ] Invariant cache hit.
[2026-05-23 11:12:55] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 11:12:55] [INFO ] Invariant cache hit.
[2026-05-23 11:12:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:12:55] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 52/52 places, 93/93 transitions.
Support contains 36 out of 52 places after structural reductions.
[2026-05-23 11:12:56] [INFO ] Flatten gal took : 29 ms
[2026-05-23 11:12:56] [INFO ] Flatten gal took : 12 ms
[2026-05-23 11:12:56] [INFO ] Input system was already deterministic with 93 transitions.
RANDOM walk for 40000 steps (1451 resets) in 1400 ms. (28 steps per ms) remains 12/36 properties
BEST_FIRST walk for 40000 steps (629 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (696 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (721 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (698 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (673 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (686 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (741 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (647 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (709 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (686 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (724 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (718 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
[2026-05-23 11:12:57] [INFO ] Invariant cache hit.
[2026-05-23 11:12:57] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (OVERLAPS) 13/28 variables, 6/8 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/32 variables, 4/12 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 79/111 variables, 32/44 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 8/52 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/52 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 142/145 variables, and 69 constraints, problems are : Problem set: 12 solved, 0 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 49/52 constraints, ReadFeed: 8/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 8 stable transitions
Graph (complete) has 364 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 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(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Graph (complete) has 364 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 46 transition count 91
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 43 transition count 90
Applied a total of 7 rules in 15 ms. Remains 43 /52 variables (removed 9) and now considering 90/93 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13048234577252459646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12115253765199917818.kers'
[2026-05-23 11:12:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13048234577252459646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12115253765199917818.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 90 rows 33 cols 300 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-23 11:12:57] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12115253765199917818.kers
Total runtime 0 ms.
[2026-05-23 11:12:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 11:12:57] [INFO ] Invariant cache hit.
[2026-05-23 11:12:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:12:57] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 161 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/52 places, 90/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 42/52 places, 90/93 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(p0)))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03
Stuttering criterion allowed to conclude after 388 steps with 22 reset in 6 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-03 finished in 410 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(X(F((X(F(p1))&&p0)))))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 93
Applied a total of 5 rules in 2 ms. Remains 47 /52 variables (removed 5) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3146166275843874412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12967745083677484793.kers'
[2026-05-23 11:12:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3146166275843874412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12967745083677484793.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 37 cols 308 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-23 11:12:58] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12967745083677484793.kers
Total runtime 1 ms.
[2026-05-23 11:12:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 11:12:58] [INFO ] Invariant cache hit.
[2026-05-23 11:12:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:12:58] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-23 11:12:58] [INFO ] Invariant cache hit.
[2026-05-23 11:12:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3595 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 181 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6267 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9888ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9890ms
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10053 ms. Remains : 47/52 places, 93/93 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(X(F((X(F(p1))&&p0)))))'
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-04
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-04 finished in 10279 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 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Graph (complete) has 364 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 46 transition count 91
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 43 transition count 90
Applied a total of 7 rules in 12 ms. Remains 43 /52 variables (removed 9) and now considering 90/93 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9566049167905650822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10685022318210663620.kers'
[2026-05-23 11:13:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9566049167905650822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10685022318210663620.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 90 rows 33 cols 300 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-23 11:13:08] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10685022318210663620.kers
Total runtime 0 ms.
[2026-05-23 11:13:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 11:13:08] [INFO ] Invariant cache hit.
[2026-05-23 11:13:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:08] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/52 places, 90/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 42/52 places, 90/93 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 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05
Stuttering criterion allowed to conclude after 32 steps with 2 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-05 finished in 270 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))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 46 transition count 93
Applied a total of 6 rules in 1 ms. Remains 46 /52 variables (removed 6) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11165344243454419227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7276605418075952307.kers'
[2026-05-23 11:13:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11165344243454419227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7276605418075952307.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 36 cols 306 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 11:13:08] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7276605418075952307.kers
Total runtime 1 ms.
[2026-05-23 11:13:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 11:13:08] [INFO ] Invariant cache hit.
[2026-05-23 11:13:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:08] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-23 11:13:08] [INFO ] Invariant cache hit.
[2026-05-23 11:13:08] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 180 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6625ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6626ms
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6782 ms. Remains : 46/52 places, 93/93 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))'
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-06 finished in 6902 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(p1) U p0)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 46 transition count 93
Applied a total of 6 rules in 3 ms. Remains 46 /52 variables (removed 6) and now considering 93/93 (removed 0) transitions.
[2026-05-23 11:13:15] [INFO ] Invariant cache hit.
[2026-05-23 11:13:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 11:13:15] [INFO ] Invariant cache hit.
[2026-05-23 11:13:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:15] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 46/52 places, 93/93 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(p1) U p0)))'
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-07 finished in 253 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((p0 U p1))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Graph (complete) has 364 edges and 52 vertex of which 48 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 48 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 46 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 45 transition count 90
Applied a total of 7 rules in 11 ms. Remains 45 /52 variables (removed 7) and now considering 90/93 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17866924638833513630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-311038614286848449.kers'
[2026-05-23 11:13:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17866924638833513630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-311038614286848449.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 90 rows 35 cols 304 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-23 11:13:15] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-311038614286848449.kers
Total runtime 1 ms.
[2026-05-23 11:13:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-23 11:13:15] [INFO ] Invariant cache hit.
[2026-05-23 11:13:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:15] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/52 places, 90/93 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 44/52 places, 90/93 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((p0 U p1))))'
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-08
Stuttering criterion allowed to conclude after 394 steps with 22 reset in 2 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-08 finished in 291 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(X(G((F(p0)||X(p1))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 93
Applied a total of 5 rules in 1 ms. Remains 47 /52 variables (removed 5) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5435258198962928365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9016772746068608406.kers'
[2026-05-23 11:13:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5435258198962928365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9016772746068608406.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 37 cols 308 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-23 11:13:16] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9016772746068608406.kers
Total runtime 0 ms.
[2026-05-23 11:13:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 11:13:16] [INFO ] Invariant cache hit.
[2026-05-23 11:13:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-23 11:13:16] [INFO ] Invariant cache hit.
[2026-05-23 11:13:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3540 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 84/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 181 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6173 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9730ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9731ms
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9870 ms. Remains : 47/52 places, 93/93 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(X(G((F(p0)||X(p1))))))'
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-09
Stuttering criterion allowed to conclude after 262 steps with 51 reset in 2 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-09 finished in 10100 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)) U (p1 U X(!p0))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 46 transition count 93
Applied a total of 6 rules in 1 ms. Remains 46 /52 variables (removed 6) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7446900149877621102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13374011400745294496.kers'
[2026-05-23 11:13:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7446900149877621102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13374011400745294496.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 36 cols 306 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 11:13:26] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13374011400745294496.kers
Total runtime 0 ms.
[2026-05-23 11:13:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 11:13:26] [INFO ] Invariant cache hit.
[2026-05-23 11:13:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-23 11:13:26] [INFO ] Invariant cache hit.
[2026-05-23 11:13:26] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 93/139 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 90 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2869 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 93/139 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 180 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3568 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6458ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6459ms
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6608 ms. Remains : 46/52 places, 93/93 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)) U (p1 U X(!p0))))'
Stuttering acceptance computed with spot in 159 ms :[p0, false, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-10
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-10 finished in 6802 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(p0))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Graph (complete) has 364 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 46 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 91
Applied a total of 5 rules in 8 ms. Remains 44 /52 variables (removed 8) and now considering 91/93 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16394732344994039585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1777942083190177045.kers'
[2026-05-23 11:13:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16394732344994039585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1777942083190177045.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 91 rows 34 cols 302 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-23 11:13:33] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1777942083190177045.kers
Total runtime 1 ms.
[2026-05-23 11:13:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 11:13:33] [INFO ] Invariant cache hit.
[2026-05-23 11:13:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:33] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/52 places, 91/93 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 43/52 places, 91/93 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 35 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 122 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 3 factoid took 22 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 32 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-12 finished in 1826 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(p0))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Graph (complete) has 364 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 46 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 43 transition count 90
Applied a total of 7 rules in 8 ms. Remains 43 /52 variables (removed 9) and now considering 90/93 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-680317101413508709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8832007703741866421.kers'
[2026-05-23 11:13:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-680317101413508709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8832007703741866421.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 90 rows 33 cols 300 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-23 11:13:34] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8832007703741866421.kers
Total runtime 0 ms.
[2026-05-23 11:13:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 11:13:34] [INFO ] Invariant cache hit.
[2026-05-23 11:13:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:34] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/52 places, 90/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 42/52 places, 90/93 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 35 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-13 finished in 217 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(X((p0||G(p1)))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 93/93 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 46 transition count 93
Applied a total of 6 rules in 2 ms. Remains 46 /52 variables (removed 6) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1452625325382923338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11000244178826886234.kers'
[2026-05-23 11:13:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1452625325382923338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11000244178826886234.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 36 cols 306 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 11:13:35] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11000244178826886234.kers
Total runtime 1 ms.
[2026-05-23 11:13:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 11:13:35] [INFO ] Invariant cache hit.
[2026-05-23 11:13:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 11:13:35] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 93/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 46/52 places, 93/93 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(X((p0||G(p1)))))'
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Computed a total of 0 stabilizing places and 20 stable transitions
Computed a total of 0 stabilizing places and 20 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 15 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 17 ms.
FORMULA CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CopsAndRobbers-PT-KFL010N005K002X001-LTLCardinality-14 finished in 622 ms.
All properties solved by simple procedures.
Total runtime 54447 ms.

BK_STOP 1779534815736

--------------------
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-KFL010N005K002X001"
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-KFL010N005K002X001, 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-177946967800515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-KFL010N005K002X001.tgz
mv CopsAndRobbers-PT-KFL010N005K002X001 execution
cd execution
if [ "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 ;