MCC'2026- Execution of r034-tall-177946841900382

About the Execution of ITS-Tools for BugTracking-PT-q3m256

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
6049.812	281628.00	630281.00	3579.00	TFFTFFFFTFTFTFFT	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841900382.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 BugTracking-PT-q3m256, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Mar 5 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 5 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m256-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-14
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779593123543

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 03:25:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 03:25:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:25:25] [INFO ] Load time of PNML (sax parser for PT used): 775 ms
[2026-05-24 03:25:25] [INFO ] Transformed 754 places.
[2026-05-24 03:25:25] [INFO ] Transformed 27370 transitions.
[2026-05-24 03:25:25] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 959 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 132 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40163 steps (16 resets) in 2098 ms. (19 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
[2026-05-24 03:25:26] [INFO ] Flatten gal took : 527 ms
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
[2026-05-24 03:25:26] [INFO ] Flatten gal took : 151 ms
BEST_FIRST walk for 40002 steps (8 resets) in 430 ms. (92 steps per ms) remains 5/5 properties
[2026-05-24 03:25:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3031923613477263889.gal : 98 ms
[2026-05-24 03:25:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6679701719391777298.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3031923613477263889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6679701719391777298.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6679701719391777298.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :56 after 165
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :165 after 680
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :680 after 3654
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3654 after 23426
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :23426 after 161700
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :161700 after 1.19814e+06
Interrupted probabilistic random walk after 123589 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 5
Probabilistic random walk after 123589 steps, saw 59810 distinct states, run finished after 3008 ms. (steps per millisecond=41 ) properties seen :0
[2026-05-24 03:25:30] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14616998124007943236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-138813738140081838.kers'
[2026-05-24 03:25:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14616998124007943236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-138813738140081838.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2642 rows 240 cols 12480 entries
Finished phase 1 with 230 SingleSign rule and 0 generalized
[2026-05-24 03:25:30] [INFO ] Computed 10 invariants in 8 ms
Computed 10 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-138813738140081838.kers
Total runtime 11 ms.
[2026-05-24 03:25:30] [INFO ] State equation strengthened by 255 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem BugTracking-PT-q3m256-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q3m256-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q3m256-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 93/109 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2069/2178 variables, 109/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2178 variables, 107/222 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2178 variables, 0/222 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 681/2859 variables, 109/331 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2859 variables, 1/332 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2859 variables, 147/479 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2859 variables, 0/479 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/2864 variables, 3/482 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2864 variables, 3/485 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2864 variables, 0/485 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.19814e+06 after 3.66932e+09
At refinement iteration 13 (OVERLAPS) 18/2882 variables, 19/504 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2882 variables, 1/505 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2069/2178 variables, 109/118 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2178 variables, 107/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2178 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 681/2859 variables, 109/334 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2859 variables, 1/335 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2859 variables, 147/482 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2859 variables, 1/483 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2859 variables, 3/486 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2859 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/2864 variables, 3/489 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2864 variables, 3/492 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2864 variables, 0/492 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 18/2882 variables, 19/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2882 variables, 1/512 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2882 variables, 1/513 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2882 variables, 0/513 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2882 variables, 0/513 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2882/2882 variables, and 513 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6623ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5299 ms.
Support contains 13 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 235 transition count 2749
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 231 transition count 2749
Applied a total of 15 rules in 353 ms. Remains 231 /240 variables (removed 9) and now considering 2749/2769 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 231/240 places, 2749/2769 transitions.
RANDOM walk for 40396 steps (19 resets) in 365 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 143142 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 143142 steps, saw 69650 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2026-05-24 03:25:45] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14891479745898573353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8654996074107125906.kers'
[2026-05-24 03:25:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14891479745898573353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8654996074107125906.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2620 rows 231 cols 12401 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-24 03:25:45] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8654996074107125906.kers
Total runtime 9 ms.
[2026-05-24 03:25:45] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2024/2126 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2126 variables, 66/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2126 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 707/2833 variables, 111/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2833 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2833 variables, 175/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2833 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/2834 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2834 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2834 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 17/2851 variables, 17/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2851 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2851 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2851/2851 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2024/2126 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2126 variables, 66/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2126 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2126 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 707/2833 variables, 111/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2833 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2833 variables, 175/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2833 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2833 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2833 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/2834 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2834 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2834 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 17/2851 variables, 17/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2851 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2851 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2851/2851 variables, and 484 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2937 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4555ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3.66932e+09 after 1.53958e+10
Parikh walk visited 0 properties in 13388 ms.
Support contains 13 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2749/2749 transitions.
Applied a total of 0 rules in 52 ms. Remains 231 /231 variables (removed 0) and now considering 2749/2749 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 231/231 places, 2749/2749 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2749/2749 transitions.
Applied a total of 0 rules in 39 ms. Remains 231 /231 variables (removed 0) and now considering 2749/2749 (removed 0) transitions.
[2026-05-24 03:26:03] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
[2026-05-24 03:26:03] [INFO ] Invariant cache hit.
[2026-05-24 03:26:04] [INFO ] Implicit Places using invariants in 510 ms returned []
[2026-05-24 03:26:04] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
[2026-05-24 03:26:04] [INFO ] Invariant cache hit.
[2026-05-24 03:26:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2026-05-24 03:26:07] [INFO ] Implicit Places using invariants and state equation in 2860 ms returned []
Implicit Place search using SMT with State Equation took 3383 ms to find 0 implicit places.
[2026-05-24 03:26:07] [INFO ] Redundant transitions in 180 ms returned []
Running 2747 sub problems to find dead transitions.
[2026-05-24 03:26:07] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
[2026-05-24 03:26:07] [INFO ] Invariant cache hit.
[2026-05-24 03:26:07] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2747 unsolved
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD2275 is UNSAT
Problem TDEAD2276 is UNSAT
Problem TDEAD2277 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2279 is UNSAT
Problem TDEAD2280 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2284 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2289 is UNSAT
Problem TDEAD2290 is UNSAT
Problem TDEAD2291 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2301 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2304 is UNSAT
Problem TDEAD2305 is UNSAT
Problem TDEAD2306 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2312 is UNSAT
Problem TDEAD2313 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2317 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2319 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2851 variables, and 16 constraints, problems are : Problem set: 80 solved, 2667 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2747/1213 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 80 solved, 2667 unsolved
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 8/16 constraints. Problems are: Problem set: 96 solved, 2651 unsolved
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 4/20 constraints. Problems are: Problem set: 130 solved, 2617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2851 variables, and 20 constraints, problems are : Problem set: 130 solved, 2617 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1534/1213 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64763ms problems are : Problem set: 130 solved, 2617 unsolved
Search for dead transitions found 130 dead transitions in 64780ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/231 places, 2619/2749 transitions.
Reduce places removed 32 places and 829 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 199 transition count 1790
Reduce places removed 21 places and 285 transitions.
Graph (complete) has 1906 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 22 rules applied. Total rules applied 54 place count 177 transition count 1505
Reduce places removed 10 places and 165 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 64 place count 167 transition count 1340
Reduce places removed 6 places and 114 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 70 place count 161 transition count 1226
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 160 transition count 1209
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 73 place count 158 transition count 1171
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 17 places and 264 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 92 place count 141 transition count 907
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 92 rules in 48 ms. Remains 141 /231 variables (removed 90) and now considering 907/2619 (removed 1712) transitions.
[2026-05-24 03:27:12] [INFO ] Flow matrix only has 863 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13711772599673722611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5436843002875800360.kers'
[2026-05-24 03:27:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13711772599673722611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5436843002875800360.kers]
Culling trivial invariants: removing 6 columns.
Culled 6 columns in 7 ms.
// Phase 1: matrix 863 rows 135 cols 3968 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-24 03:27:12] [INFO ] Computed 14 invariants in 10 ms
Computed 14 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5436843002875800360.kers
Total runtime 11 ms.
[2026-05-24 03:27:12] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-24 03:27:12] [INFO ] Flow matrix only has 863 transitions (discarded 44 similar events)
[2026-05-24 03:27:12] [INFO ] Invariant cache hit.
[2026-05-24 03:27:12] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 03:27:13] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 141/231 places, 907/2749 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69427 ms. Remains : 141/231 places, 907/2749 transitions.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40071 steps (11 resets) in 137 ms. (290 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475477 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475477 steps, saw 230540 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2026-05-24 03:27:16] [INFO ] Flow matrix only has 863 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12548952840850449637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8974120961031463283.kers'
[2026-05-24 03:27:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12548952840850449637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8974120961031463283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 863 rows 135 cols 3968 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-24 03:27:16] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8974120961031463283.kers
Total runtime 4 ms.
[2026-05-24 03:27:16] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 425/460 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 196/656 variables, 43/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 67/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/658 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 306/964 variables, 37/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/964 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/964 variables, 36/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/964 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/966 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/966 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/998 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/998 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/998 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/998 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/998 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 425/460 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 196/656 variables, 43/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 67/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/658 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 306/964 variables, 37/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/964 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/964 variables, 36/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/964 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/964 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/964 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/966 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/966 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/998 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/998 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/998 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/998 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/998 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/998 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2021 ms.
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 907/907 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 907/907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 135/135 places, 907/907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 907/907 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 907/907 (removed 0) transitions.
[2026-05-24 03:27:19] [INFO ] Flow matrix only has 863 transitions (discarded 44 similar events)
[2026-05-24 03:27:19] [INFO ] Invariant cache hit.
[2026-05-24 03:27:19] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-24 03:27:19] [INFO ] Flow matrix only has 863 transitions (discarded 44 similar events)
[2026-05-24 03:27:19] [INFO ] Invariant cache hit.
[2026-05-24 03:27:20] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 03:27:21] [INFO ] Implicit Places using invariants and state equation in 1516 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2026-05-24 03:27:21] [INFO ] Redundant transitions in 12 ms returned []
Running 905 sub problems to find dead transitions.
[2026-05-24 03:27:21] [INFO ] Flow matrix only has 863 transitions (discarded 44 similar events)
[2026-05-24 03:27:21] [INFO ] Invariant cache hit.
[2026-05-24 03:27:21] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 905 unsolved
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 901 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 901 unsolved
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
At refinement iteration 3 (OVERLAPS) 863/997 variables, 134/143 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 115/258 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 0/258 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 6 (OVERLAPS) 1/998 variables, 1/259 constraints. Problems are: Problem set: 8 solved, 897 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 998/998 variables, and 259 constraints, problems are : Problem set: 8 solved, 897 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 905/905 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 3 (OVERLAPS) 863/997 variables, 134/143 constraints. Problems are: Problem set: 8 solved, 897 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 115/258 constraints. Problems are: Problem set: 8 solved, 897 unsolved
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 800/1058 constraints. Problems are: Problem set: 74 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/998 variables, and 1059 constraints, problems are : Problem set: 74 solved, 831 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 134/135 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 800/905 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60818ms problems are : Problem set: 74 solved, 831 unsolved
Search for dead transitions found 74 dead transitions in 60822ms
Found 74 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 74 transitions
Dead transitions reduction (with SMT) removed 74 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/135 places, 833/907 transitions.
Reduce places removed 17 places and 300 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 118 transition count 533
Reduce places removed 16 places and 132 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 102 transition count 401
Reduce places removed 4 places and 33 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 98 transition count 368
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 96 transition count 352
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 95 transition count 338
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 43 place count 92 transition count 316
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 46 place count 92 transition count 316
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 46 rules in 17 ms. Remains 92 /135 variables (removed 43) and now considering 316/833 (removed 517) transitions.
[2026-05-24 03:28:22] [INFO ] Flow matrix only has 299 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-796224297983231605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9276387558932245474.kers'
[2026-05-24 03:28:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-796224297983231605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9276387558932245474.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 299 rows 91 cols 1335 entries
Finished phase 1 with 79 SingleSign rule and 3 generalized
[2026-05-24 03:28:22] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9276387558932245474.kers
Total runtime 2 ms.
[2026-05-24 03:28:22] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 03:28:22] [INFO ] Flow matrix only has 299 transitions (discarded 17 similar events)
[2026-05-24 03:28:22] [INFO ] Invariant cache hit.
[2026-05-24 03:28:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 03:28:22] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 92/135 places, 316/907 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62914 ms. Remains : 92/135 places, 316/907 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40001 steps (12 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1146858 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1146858 steps, saw 555756 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2026-05-24 03:28:25] [INFO ] Flow matrix only has 299 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5622497974583845992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16255719661525031305.kers'
[2026-05-24 03:28:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5622497974583845992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16255719661525031305.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 91 cols 1335 entries
Finished phase 1 with 79 SingleSign rule and 3 generalized
[2026-05-24 03:28:25] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16255719661525031305.kers
Total runtime 2 ms.
[2026-05-24 03:28:25] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/76 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 79/155 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/159 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/162 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 137/299 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/371 variables, 28/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/371 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/371 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/373 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/373 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 17/390 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/390 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/390 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/390 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/390 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/76 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/155 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/159 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/162 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 137/299 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 22/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/299 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/371 variables, 28/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/371 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/371 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/371 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/371 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/373 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/373 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 17/390 variables, 14/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/390 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/390 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/390 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/390 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/390 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 616ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 663 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/91 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 316/316 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2026-05-24 03:28:27] [INFO ] Flow matrix only has 299 transitions (discarded 17 similar events)
[2026-05-24 03:28:27] [INFO ] Invariant cache hit.
[2026-05-24 03:28:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 03:28:27] [INFO ] Flow matrix only has 299 transitions (discarded 17 similar events)
[2026-05-24 03:28:27] [INFO ] Invariant cache hit.
[2026-05-24 03:28:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 03:28:27] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2026-05-24 03:28:27] [INFO ] Redundant transitions in 2 ms returned []
Running 314 sub problems to find dead transitions.
[2026-05-24 03:28:27] [INFO ] Flow matrix only has 299 transitions (discarded 17 similar events)
[2026-05-24 03:28:27] [INFO ] Invariant cache hit.
[2026-05-24 03:28:27] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 3 (OVERLAPS) 299/389 variables, 90/99 constraints. Problems are: Problem set: 2 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 57/156 constraints. Problems are: Problem set: 2 solved, 312 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 4/160 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/160 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/161 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/161 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/161 constraints. Problems are: Problem set: 45 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 161 constraints, problems are : Problem set: 45 solved, 269 unsolved in 15836 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/8 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 3/90 variables, 1/13 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 299/389 variables, 90/103 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 57/160 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 212/372 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 3/375 constraints. Problems are: Problem set: 45 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 1/376 constraints. Problems are: Problem set: 45 solved, 269 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 1/377 constraints. Problems are: Problem set: 50 solved, 264 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/390 variables, and 377 constraints, problems are : Problem set: 50 solved, 264 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/91 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 212/314 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45956ms problems are : Problem set: 50 solved, 264 unsolved
Search for dead transitions found 50 dead transitions in 45957ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/91 places, 266/316 transitions.
Graph (complete) has 464 edges and 91 vertex of which 88 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 85 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 85 transition count 244
Applied a total of 6 rules in 17 ms. Remains 85 /91 variables (removed 6) and now considering 244/266 (removed 22) transitions.
[2026-05-24 03:29:13] [INFO ] Flow matrix only has 226 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17793629439787916460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5743538442352422201.kers'
[2026-05-24 03:29:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17793629439787916460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5743538442352422201.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 85 cols 981 entries
Finished phase 1 with 74 SingleSign rule and 3 generalized
[2026-05-24 03:29:13] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5743538442352422201.kers
Total runtime 5 ms.
[2026-05-24 03:29:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 03:29:13] [INFO ] Flow matrix only has 226 transitions (discarded 18 similar events)
[2026-05-24 03:29:13] [INFO ] Invariant cache hit.
[2026-05-24 03:29:13] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 03:29:13] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/91 places, 244/316 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46598 ms. Remains : 85/91 places, 244/316 transitions.
RANDOM walk for 40152 steps (21 resets) in 85 ms. (466 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1264581 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :0 out of 1
Probabilistic random walk after 1264581 steps, saw 614715 distinct states, run finished after 3003 ms. (steps per millisecond=421 ) properties seen :0
[2026-05-24 03:29:16] [INFO ] Flow matrix only has 226 transitions (discarded 18 similar events)
[2026-05-24 03:29:16] [INFO ] Invariant cache hit.
[2026-05-24 03:29:16] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/76 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 74/150 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/154 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/157 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/229 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/229 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 63/292 variables, 22/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/292 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/292 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/294 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/294 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 17/311 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/311 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/311 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/311 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/311 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/76 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/150 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/154 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/157 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 72/229 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/229 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/229 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 63/292 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/292 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/292 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/294 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/294 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 17/311 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/311 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/311 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/311 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/311 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/311 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 647 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 244/244 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 244/244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 244/244 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2026-05-24 03:29:17] [INFO ] Flow matrix only has 226 transitions (discarded 18 similar events)
[2026-05-24 03:29:17] [INFO ] Invariant cache hit.
[2026-05-24 03:29:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 03:29:17] [INFO ] Flow matrix only has 226 transitions (discarded 18 similar events)
[2026-05-24 03:29:17] [INFO ] Invariant cache hit.
[2026-05-24 03:29:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 03:29:17] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2026-05-24 03:29:18] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2026-05-24 03:29:18] [INFO ] Flow matrix only has 226 transitions (discarded 18 similar events)
[2026-05-24 03:29:18] [INFO ] Invariant cache hit.
[2026-05-24 03:29:18] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 3 (OVERLAPS) 226/310 variables, 84/92 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 49/141 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/142 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 1/311 variables, 1/143 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/143 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/143 constraints. Problems are: Problem set: 12 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 143 constraints, problems are : Problem set: 12 solved, 230 unsolved in 13136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 226/310 variables, 84/93 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 49/142 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 178/320 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/321 constraints. Problems are: Problem set: 12 solved, 230 unsolved
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 5/326 constraints. Problems are: Problem set: 20 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 5/331 constraints. Problems are: Problem set: 20 solved, 222 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.53958e+10 after 3.88459e+10
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 1/332 constraints. Problems are: Problem set: 20 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/332 constraints. Problems are: Problem set: 20 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 1/311 variables, 1/333 constraints. Problems are: Problem set: 20 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 52/385 constraints. Problems are: Problem set: 20 solved, 222 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 3/388 constraints. Problems are: Problem set: 20 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 391 constraints, problems are : Problem set: 20 solved, 222 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 230/242 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43225ms problems are : Problem set: 20 solved, 222 unsolved
Search for dead transitions found 20 dead transitions in 43227ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 224/244 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-05-24 03:30:01] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43494 ms. Remains : 85/85 places, 224/244 transitions.
RANDOM walk for 40000 steps (11 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1429971 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1429971 steps, saw 694809 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
[2026-05-24 03:30:04] [INFO ] Flow matrix only has 206 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8195588197370300792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6603128900755558247.kers'
[2026-05-24 03:30:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8195588197370300792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6603128900755558247.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 85 cols 891 entries
Finished phase 1 with 74 SingleSign rule and 3 generalized
[2026-05-24 03:30:04] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6603128900755558247.kers
Total runtime 1 ms.
[2026-05-24 03:30:04] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/76 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 74/150 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/154 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/157 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/217 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 55/272 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/272 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/272 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/274 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/274 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 17/291 variables, 14/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/291 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/291 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/291 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/291 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/76 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/150 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/154 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/157 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 60/217 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 55/272 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/272 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/272 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/272 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/274 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/274 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 17/291 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/291 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/291 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/291 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/291 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3932 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=357 )
FORMULA BugTracking-PT-q3m256-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 17 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 280473 ms.

BK_STOP 1779593405171

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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