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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 9.3K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 191K 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-HRL020X006-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779531954142

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-HRL020X006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 10:25:55] [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 10:25:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:25:55] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-23 10:25:55] [INFO ] Transformed 110 places.
[2026-05-23 10:25:55] [INFO ] Transformed 224 transitions.
[2026-05-23 10:25:55] [INFO ] Parsed PT model containing 110 places and 224 transitions and 1149 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 224/224 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 101 transition count 224
Applied a total of 9 rules in 28 ms. Remains 101 /110 variables (removed 9) and now considering 224/224 (removed 0) transitions.
Running 184 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-10849907592038185062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3444342313366960322.kers'
[2026-05-23 10:25:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10849907592038185062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3444342313366960322.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 224 rows 81 cols 751 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-23 10:25:55] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3444342313366960322.kers
Total runtime 2 ms.
[2026-05-23 10:25:55] [INFO ] State equation strengthened by 60 read => feed constraints.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 224/314 variables, 90/113 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 60/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 11/325 variables, 11/184 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/184 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/325 variables, 0/184 constraints. Problems are: Problem set: 40 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 184 constraints, problems are : Problem set: 40 solved, 144 unsolved in 17619 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 101/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 224/314 variables, 90/113 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 60/173 constraints. Problems are: Problem set: 40 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 89/262 constraints. Problems are: Problem set: 40 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/325 variables, and 262 constraints, problems are : Problem set: 40 solved, 144 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 90/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 89/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37879ms problems are : Problem set: 40 solved, 144 unsolved
Search for dead transitions found 40 dead transitions in 37894ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 40 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12847591679085670485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9781383767002108132.kers'
[2026-05-23 10:26:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12847591679085670485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9781383767002108132.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 184 rows 81 cols 591 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-23 10:26:33] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9781383767002108132.kers
Total runtime 1 ms.
[2026-05-23 10:26:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 10:26:33] [INFO ] Invariant cache hit.
[2026-05-23 10:26:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:26:33] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/110 places, 184/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38338 ms. Remains : 101/110 places, 184/224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Running 144 sub problems to find dead transitions.
[2026-05-23 10:26:33] [INFO ] Invariant cache hit.
[2026-05-23 10:26:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 11/285 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 165 constraints, problems are : Problem set: 0 solved, 144 unsolved in 14423 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 89/242 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/285 variables, and 244 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 90/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 89/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34477ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 34477ms
[2026-05-23 10:27:08] [INFO ] Invariant cache hit.
[2026-05-23 10:27:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 10:27:08] [INFO ] Invariant cache hit.
[2026-05-23 10:27:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:27:08] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 34826 ms. Remains : 101/101 places, 184/184 transitions.
Support contains 44 out of 101 places after structural reductions.
[2026-05-23 10:27:08] [INFO ] Flatten gal took : 37 ms
[2026-05-23 10:27:08] [INFO ] Flatten gal took : 16 ms
[2026-05-23 10:27:08] [INFO ] Input system was already deterministic with 184 transitions.
Support contains 41 out of 101 places (down from 44) after GAL structural reductions.
RANDOM walk for 40009 steps (82 resets) in 1154 ms. (34 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40003 steps (76 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (80 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (78 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (91 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
[2026-05-23 10:27:09] [INFO ] Invariant cache hit.
[2026-05-23 10:27:09] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/33 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 13/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 50/285 variables, and 36 constraints, problems are : Problem set: 5 solved, 0 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/101 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 475ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 41 stable transitions
Graph (complete) has 703 edges and 101 vertex of which 90 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 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(p0))) U (p1&&X(X(!p0))&&(p1 U p2))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 184
Applied a total of 11 rules in 2 ms. Remains 90 /101 variables (removed 11) and now considering 184/184 (removed 0) transitions.
Running 144 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-4257227195697254731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2319334958154341257.kers'
[2026-05-23 10:27:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4257227195697254731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2319334958154341257.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 184 rows 70 cols 569 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-23 10:27:10] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2319334958154341257.kers
Total runtime 1 ms.
[2026-05-23 10:27:10] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 154 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11405 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 144/297 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 298 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 31471ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 31472ms
[2026-05-23 10:27:41] [INFO ] Invariant cache hit.
[2026-05-23 10:27:41] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 10:27:42] [INFO ] Invariant cache hit.
[2026-05-23 10:27:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:27:42] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 90/101 places, 184/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31941 ms. Remains : 90/101 places, 184/184 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(p0))) U (p1&&X(X(!p0))&&(p1 U p2))))'
Stuttering acceptance computed with spot in 517 ms :[(OR (NOT p2) (NOT p1) p0), (NOT p0), p0, (NOT p2), (NOT p0), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-00
Stuttering criterion allowed to conclude after 125 steps with 25 reset in 3 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-00 finished in 32559 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 !p0) U X(p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 91 transition count 184
Applied a total of 10 rules in 2 ms. Remains 91 /101 variables (removed 10) and now considering 184/184 (removed 0) transitions.
Running 144 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-6783648880848624608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15547010971271012066.kers'
[2026-05-23 10:27:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6783648880848624608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15547010971271012066.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 184 rows 71 cols 571 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 10:27:42] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15547010971271012066.kers
Total runtime 2 ms.
[2026-05-23 10:27:42] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/275 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 155 constraints, problems are : Problem set: 0 solved, 144 unsolved in 15465 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 91/91 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 139/292 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 35534ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 35535ms
[2026-05-23 10:28:18] [INFO ] Invariant cache hit.
[2026-05-23 10:28:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 10:28:18] [INFO ] Invariant cache hit.
[2026-05-23 10:28:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:28:19] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 91/101 places, 184/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36244 ms. Remains : 91/101 places, 184/184 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 !p0) U X(p1))))'
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), p0]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-02
Stuttering criterion allowed to conclude after 105 steps with 28 reset in 3 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-02 finished in 36492 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 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (complete) has 703 edges and 101 vertex of which 90 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 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 90 transition count 183
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 89 transition count 183
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 88 transition count 182
Applied a total of 5 rules in 42 ms. Remains 88 /101 variables (removed 13) and now considering 182/184 (removed 2) transitions.
Running 142 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-2669027592706296421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2256203428437045957.kers'
[2026-05-23 10:28:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2669027592706296421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2256203428437045957.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 182 rows 68 cols 565 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-23 10:28:19] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2256203428437045957.kers
Total runtime 1 ms.
[2026-05-23 10:28:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 153 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 142/293 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40071ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40072ms
[2026-05-23 10:28:59] [INFO ] Invariant cache hit.
[2026-05-23 10:28:59] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 10:28:59] [INFO ] Invariant cache hit.
[2026-05-23 10:28:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:29:00] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2026-05-23 10:29:00] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/101 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40831 ms. Remains : 88/101 places, 182/184 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-HRL020X006-LTLCardinality-04
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-04 finished in 40920 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(((F(p0)||(p1&&F(G(p2)))) U (G((F(p0)||(p1&&F(G(p2)))))||((F(p0)||(p1&&F(G(p2))))&&G(p3))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (complete) has 703 edges and 101 vertex of which 93 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 93 transition count 183
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 92 transition count 183
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 91 transition count 182
Applied a total of 5 rules in 23 ms. Remains 91 /101 variables (removed 10) and now considering 182/184 (removed 2) transitions.
Running 142 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-5716789072620894499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13261337537525881573.kers'
[2026-05-23 10:29:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5716789072620894499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13261337537525881573.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 182 rows 71 cols 571 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 10:29:00] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13261337537525881573.kers
Total runtime 0 ms.
[2026-05-23 10:29:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 3/273 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 273/273 variables, and 156 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 91/91 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 127/278 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40069ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40069ms
[2026-05-23 10:29:40] [INFO ] Invariant cache hit.
[2026-05-23 10:29:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-23 10:29:40] [INFO ] Invariant cache hit.
[2026-05-23 10:29:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:29:40] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2026-05-23 10:29:40] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/101 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40644 ms. Remains : 91/101 places, 182/184 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(((F(p0)||(p1&&F(G(p2)))) U (G((F(p0)||(p1&&F(G(p2)))))||(G(p3)&&(F(p0)||(p1&&F(G(p2)))))))))'
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-05
Stuttering criterion allowed to conclude after 164 steps with 3 reset in 3 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-05 finished in 40871 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((p0||((F(p1) U X(p2))&&X(p3)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 92 transition count 184
Applied a total of 9 rules in 4 ms. Remains 92 /101 variables (removed 9) and now considering 184/184 (removed 0) transitions.
Running 144 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-4892176836965707749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3891985945761472719.kers'
[2026-05-23 10:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4892176836965707749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3891985945761472719.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 184 rows 72 cols 573 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-23 10:29:41] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3891985945761472719.kers
Total runtime 1 ms.
[2026-05-23 10:29:41] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 2/276 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 156 constraints, problems are : Problem set: 0 solved, 144 unsolved in 14509 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 92/92 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 134/287 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 144 unsolved
SMT process timed out in 34561ms, After SMT, problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 34562ms
[2026-05-23 10:30:15] [INFO ] Invariant cache hit.
[2026-05-23 10:30:15] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 10:30:15] [INFO ] Invariant cache hit.
[2026-05-23 10:30:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:30:16] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 92/101 places, 184/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35190 ms. Remains : 92/101 places, 184/184 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((p0||((F(p1) U X(p2))&&X(p3)))))'
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-09 finished in 35476 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 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (complete) has 703 edges and 101 vertex of which 91 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 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 91 transition count 183
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 90 transition count 183
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 89 transition count 182
Applied a total of 5 rules in 18 ms. Remains 89 /101 variables (removed 12) and now considering 182/184 (removed 2) transitions.
Running 142 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-1324312314349878247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17098049404132652020.kers'
[2026-05-23 10:30:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1324312314349878247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17098049404132652020.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 182 rows 69 cols 567 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-23 10:30:16] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17098049404132652020.kers
Total runtime 2 ms.
[2026-05-23 10:30:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 271/271 variables, and 154 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 137/288 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SMT process timed out in 40074ms, After SMT, problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40075ms
[2026-05-23 10:30:56] [INFO ] Invariant cache hit.
[2026-05-23 10:30:56] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 10:30:56] [INFO ] Invariant cache hit.
[2026-05-23 10:30:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:30:57] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2026-05-23 10:30:57] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/101 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40555 ms. Remains : 89/101 places, 182/184 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 45 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-10
Stuttering criterion allowed to conclude after 453 steps with 5 reset in 6 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-10 finished in 40637 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(!p0))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (complete) has 703 edges and 101 vertex of which 91 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 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 91 transition count 183
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 90 transition count 183
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 89 transition count 182
Applied a total of 5 rules in 20 ms. Remains 89 /101 variables (removed 12) and now considering 182/184 (removed 2) 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-6707379852608204646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3021902432802970027.kers'
[2026-05-23 10:30:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6707379852608204646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3021902432802970027.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 182 rows 69 cols 567 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-23 10:30:57] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3021902432802970027.kers
Total runtime 1 ms.
[2026-05-23 10:30:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 10:30:57] [INFO ] Invariant cache hit.
[2026-05-23 10:30:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:30:57] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2026-05-23 10:30:57] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/101 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 89/101 places, 182/184 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(p0))'
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-11 finished in 687 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(p0)&&p1)) U (p0 U p2))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 93 transition count 184
Applied a total of 8 rules in 4 ms. Remains 93 /101 variables (removed 8) and now considering 184/184 (removed 0) transitions.
Running 144 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-4031970750281332917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11839077417638997276.kers'
[2026-05-23 10:30:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4031970750281332917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11839077417638997276.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 184 rows 73 cols 575 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-23 10:30:58] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11839077417638997276.kers
Total runtime 0 ms.
[2026-05-23 10:30:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 3/277 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 159 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 93/93 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 2/90 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 184/274 variables, 90/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 40/153 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 129/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/277 variables, and 283 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 90/93 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 129/144 constraints, Known Traps: 0/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40069ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 40070ms
[2026-05-23 10:31:38] [INFO ] Invariant cache hit.
[2026-05-23 10:31:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 10:31:38] [INFO ] Invariant cache hit.
[2026-05-23 10:31:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:31:38] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 93/101 places, 184/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40587 ms. Remains : 93/101 places, 184/184 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(p0)&&p1)) U (p0 U p2))))'
Stuttering acceptance computed with spot in 235 ms :[p2, p2, true, p2, (AND p2 p0 p1), p0]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-12 finished in 40861 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)&&F(G(p1)))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 184/184 transitions.
Graph (complete) has 703 edges and 101 vertex of which 90 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 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 90 transition count 183
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 89 transition count 183
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 88 transition count 182
Applied a total of 5 rules in 17 ms. Remains 88 /101 variables (removed 13) and now considering 182/184 (removed 2) transitions.
Running 142 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-2393549294969295626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11008995848774516230.kers'
[2026-05-23 10:31:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2393549294969295626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11008995848774516230.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 182 rows 68 cols 565 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-23 10:31:38] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11008995848774516230.kers
Total runtime 1 ms.
[2026-05-23 10:31:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 153 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 182/270 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 293 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 40096ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40096ms
[2026-05-23 10:32:19] [INFO ] Invariant cache hit.
[2026-05-23 10:32:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 10:32:19] [INFO ] Invariant cache hit.
[2026-05-23 10:32:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 10:32:19] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2026-05-23 10:32:19] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/101 places, 182/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40786 ms. Remains : 88/101 places, 182/184 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-HRL020X006-LTLCardinality-14
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-HRL020X006-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-HRL020X006-LTLCardinality-14 finished in 40985 ms.
All properties solved by simple procedures.
Total runtime 384615 ms.

BK_STOP 1779532339892

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

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL020X006.tgz
mv CopsAndRobbers-PT-HRL020X006 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 ;