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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.8K Mar 6 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:34 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 29K 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-CRL005X001-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-CRL005X001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779529766958

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-CRL005X001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 09:49:28] [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 09:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:49:28] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2026-05-23 09:49:28] [INFO ] Transformed 35 places.
[2026-05-23 09:49:28] [INFO ] Transformed 39 transitions.
[2026-05-23 09:49:28] [INFO ] Parsed PT model containing 35 places and 39 transitions and 174 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 39/39 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 39
Applied a total of 1 rules in 14 ms. Remains 34 /35 variables (removed 1) and now considering 39/39 (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-15919283844956377787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15000789389275037630.kers'
[2026-05-23 09:49:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15919283844956377787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15000789389275037630.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 29 cols 117 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-23 09:49:28] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15000789389275037630.kers
Total runtime 1 ms.
[2026-05-23 09:49:28] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-23 09:49:28] [INFO ] Invariant cache hit.
[2026-05-23 09:49:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:49:28] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:49:28] [INFO ] Invariant cache hit.
[2026-05-23 09:49:28] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 4/73 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 57 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 4/73 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 73/73 variables, and 89 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31156ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31169ms
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31476 ms. Remains : 34/35 places, 39/39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-23 09:49:59] [INFO ] Invariant cache hit.
[2026-05-23 09:49:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 09:49:59] [INFO ] Invariant cache hit.
[2026-05-23 09:49:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:49:59] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 34/34 places, 39/39 transitions.
Support contains 26 out of 34 places after structural reductions.
[2026-05-23 09:50:00] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:50:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:50:00] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 40000 steps (16 resets) in 1822 ms. (21 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40000 steps (9 resets) in 502 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (11 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (10 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (13 resets) in 180 ms. (220 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (10 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (13 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
[2026-05-23 09:50:01] [INFO ] Invariant cache hit.
[2026-05-23 09:50:01] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem AtomicPropp27 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 2 (OVERLAPS) 7/22 variables, 5/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/24 variables, 2/8 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/57 variables, 24/32 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/36 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 72/73 variables, and 45 constraints, problems are : Problem set: 12 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 33/34 constraints, ReadFeed: 4/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 39
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 39/39 (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-13201354741736583500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6978168627508376250.kers'
[2026-05-23 09:50:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13201354741736583500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6978168627508376250.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 26 cols 111 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-23 09:50:02] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6978168627508376250.kers
Total runtime 0 ms.
[2026-05-23 09:50:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 09:50:02] [INFO ] Invariant cache hit.
[2026-05-23 09:50:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:50:02] [INFO ] Invariant cache hit.
[2026-05-23 09:50:02] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/70 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 70/70 variables, and 84 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31174ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 31175ms
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31291 ms. Remains : 31/34 places, 39/39 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 18 steps with 2 reset in 2 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-00 finished in 31567 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((G(p0)||(p0&&F(p1))))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 31 transition count 37
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 29 transition count 37
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 28 transition count 36
Applied a total of 7 rules in 14 ms. Remains 28 /34 variables (removed 6) and now considering 36/39 (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-11933352873877166515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11948583249874504471.kers'
[2026-05-23 09:50:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11933352873877166515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11948583249874504471.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 23 cols 105 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 09:50:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11948583249874504471.kers
Total runtime 0 ms.
[2026-05-23 09:50:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 09:50:33] [INFO ] Invariant cache hit.
[2026-05-23 09:50:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:33] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/34 places, 36/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 27/34 places, 36/39 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((G(p0)||(p0&&F(p1))))))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-04
Product exploration explored 100000 steps with 5878 reset in 235 ms.
Product exploration explored 100000 steps with 5970 reset in 129 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 133 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 16692 steps (4 resets) in 48 ms. (340 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 496 ms.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 36/36 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (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-17858208310076902349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7444924159893395739.kers'
[2026-05-23 09:50:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17858208310076902349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7444924159893395739.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 22 cols 95 entries
Finished phase 1 with 19 SingleSign rule and 1 generalized
[2026-05-23 09:50:34] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7444924159893395739.kers
Total runtime 0 ms.
[2026-05-23 09:50:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 09:50:34] [INFO ] Invariant cache hit.
[2026-05-23 09:50:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-23 09:50:34] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2026-05-23 09:50:34] [INFO ] Invariant cache hit.
[2026-05-23 09:50:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 36/62 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/63 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/63 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 36/62 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 22/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/63 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/63 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 6185 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7055ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 7055ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7155 ms. Remains : 27/27 places, 36/36 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 133 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 26710 steps (9 resets) in 54 ms. (485 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 470 ms.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 5771 reset in 91 ms.
Product exploration explored 100000 steps with 5846 reset in 120 ms.
Built C files in :
/tmp/ltsmin5739662651903399703
[2026-05-23 09:50:42] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2026-05-23 09:50:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 09:50:42] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2026-05-23 09:50:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 09:50:42] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2026-05-23 09:50:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 09:50:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5739662651903399703
Running compilation step : cd /tmp/ltsmin5739662651903399703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 214 ms.
Running link step : cd /tmp/ltsmin5739662651903399703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5739662651903399703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6065724370760643906.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-04 finished in 9586 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 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 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 30 transition count 37
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 28 transition count 37
Applied a total of 5 rules in 5 ms. Remains 28 /34 variables (removed 6) and now considering 37/39 (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-18179695891464003206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18049636502413751323.kers'
[2026-05-23 09:50:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18179695891464003206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18049636502413751323.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 37 rows 23 cols 105 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 09:50:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18049636502413751323.kers
Total runtime 0 ms.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 09:50:43] [INFO ] Invariant cache hit.
[2026-05-23 09:50:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/34 places, 37/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 27/34 places, 37/39 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 29 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-06
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-06 finished in 156 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&&G(F(p0)))))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 30 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 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 30 transition count 37
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 28 transition count 37
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 27 transition count 36
Applied a total of 7 rules in 6 ms. Remains 27 /34 variables (removed 7) and now considering 36/39 (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-17445850963828314529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16834670270010086063.kers'
[2026-05-23 09:50:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17445850963828314529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16834670270010086063.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 22 cols 103 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-23 09:50:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16834670270010086063.kers
Total runtime 0 ms.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 09:50:43] [INFO ] Invariant cache hit.
[2026-05-23 09:50:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/34 places, 36/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 26/34 places, 36/39 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&&G(F(p0)))))'
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-08
Stuttering criterion allowed to conclude after 79 steps with 9 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-08 finished in 187 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(p1))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 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 31 transition count 37
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 29 transition count 37
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 28 transition count 36
Applied a total of 7 rules in 6 ms. Remains 28 /34 variables (removed 6) and now considering 36/39 (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-15882516173052201177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9548053116675660124.kers'
[2026-05-23 09:50:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15882516173052201177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9548053116675660124.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 36 rows 23 cols 105 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 09:50:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9548053116675660124.kers
Total runtime 0 ms.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 09:50:43] [INFO ] Invariant cache hit.
[2026-05-23 09:50:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/34 places, 36/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 27/34 places, 36/39 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(p1))))'
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-09
Stuttering criterion allowed to conclude after 60 steps with 7 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-09 finished in 212 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 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Graph (complete) has 167 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 31 transition count 37
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 29 transition count 37
Applied a total of 5 rules in 7 ms. Remains 29 /34 variables (removed 5) and now considering 37/39 (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-11468417668595018416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9288974739463907019.kers'
[2026-05-23 09:50:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11468417668595018416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9288974739463907019.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 37 rows 24 cols 107 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-23 09:50:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9288974739463907019.kers
Total runtime 0 ms.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 09:50:43] [INFO ] Invariant cache hit.
[2026-05-23 09:50:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/34 places, 37/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 28/34 places, 37/39 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 31 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-10 finished in 162 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&&F(p1)&&X(p2)))'
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 39/39 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 39
Applied a total of 2 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 39/39 (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-14706817706899101940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14821456815413146243.kers'
[2026-05-23 09:50:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14706817706899101940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14821456815413146243.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 27 cols 113 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-23 09:50:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14821456815413146243.kers
Total runtime 1 ms.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 09:50:43] [INFO ] Invariant cache hit.
[2026-05-23 09:50:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 09:50:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-05-23 09:50:43] [INFO ] Invariant cache hit.
[2026-05-23 09:50:43] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 2/71 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 55 constraints, problems are : Problem set: 0 solved, 29 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 21/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 69/71 variables, and 75 constraints, problems are : Problem set: 0 solved, 29 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/32 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 21/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30905ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 30906ms
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31007 ms. Remains : 32/34 places, 39/39 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&&F(p1)&&X(p2)))'
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-CRL005X001-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 9 steps with 4 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL005X001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL005X001-LTLCardinality-11 finished in 31147 ms.
All properties solved by simple procedures.
Total runtime 106912 ms.

BK_STOP 1779529875068

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

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