MCC'2026- Execution of r114-smll-177955740500275

About the Execution of ITS-Tools for EisenbergMcGuire-PT-08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1824.119	577627.00	717094.00	1577.70	TTFFTFFFFTFFFFFT	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.r114-smll-177955740500275.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 EisenbergMcGuire-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.5K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 EisenbergMcGuire-PT-08-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779793813181

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 11:10:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 11:10:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:10:16] [INFO ] Load time of PNML (sax parser for PT used): 497 ms
[2026-05-26 11:10:16] [INFO ] Transformed 712 places.
[2026-05-26 11:10:16] [INFO ] Transformed 2816 transitions.
[2026-05-26 11:10:16] [INFO ] Found NUPN structural information;
[2026-05-26 11:10:16] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 748 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 658 transition count 2384
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 658 transition count 2384
Applied a total of 108 rules in 258 ms. Remains 658 /712 variables (removed 54) and now considering 2384/2816 (removed 432) transitions.
[2026-05-26 11:10:16] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9921849525414191215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7958840938332687575.kers'
[2026-05-26 11:10:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9921849525414191215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7958840938332687575.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 936 rows 658 cols 2160 entries
Finished phase 1 with 625 SingleSign rule and 8 generalized
[2026-05-26 11:10:16] [INFO ] Computed 25 invariants in 8 ms
Computed 25 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7958840938332687575.kers
Total runtime 11 ms.
[2026-05-26 11:10:19] [INFO ] Implicit Places using invariants in 2408 ms returned []
[2026-05-26 11:10:19] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2026-05-26 11:10:19] [INFO ] Invariant cache hit.
[2026-05-26 11:10:20] [INFO ] State equation strengthened by 298 read => feed constraints.
[2026-05-26 11:10:26] [INFO ] Implicit Places using invariants and state equation in 6945 ms returned []
Implicit Place search using SMT with State Equation took 9423 ms to find 0 implicit places.
Running 2376 sub problems to find dead transitions.
[2026-05-26 11:10:26] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2026-05-26 11:10:26] [INFO ] Invariant cache hit.
[2026-05-26 11:10:26] [INFO ] State equation strengthened by 298 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2376 unsolved
SMT process timed out in 31799ms, After SMT, problems are : Problem set: 0 solved, 2376 unsolved
Search for dead transitions found 0 dead transitions in 31849ms
Starting structural reductions in LTL mode, iteration 1 : 658/712 places, 2384/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41627 ms. Remains : 658/712 places, 2384/2816 transitions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Applied a total of 0 rules in 36 ms. Remains 658 /658 variables (removed 0) and now considering 2384/2384 (removed 0) transitions.
[2026-05-26 11:10:58] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2026-05-26 11:10:58] [INFO ] Invariant cache hit.
[2026-05-26 11:10:59] [INFO ] Implicit Places using invariants in 1541 ms returned []
[2026-05-26 11:10:59] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2026-05-26 11:10:59] [INFO ] Invariant cache hit.
[2026-05-26 11:11:00] [INFO ] State equation strengthened by 298 read => feed constraints.
[2026-05-26 11:11:05] [INFO ] Implicit Places using invariants and state equation in 6046 ms returned []
Implicit Place search using SMT with State Equation took 7589 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7627 ms. Remains : 658/658 places, 2384/2384 transitions.
Support contains 33 out of 658 places after structural reductions.
[2026-05-26 11:11:06] [INFO ] Flatten gal took : 379 ms
[2026-05-26 11:11:06] [INFO ] Flatten gal took : 174 ms
[2026-05-26 11:11:06] [INFO ] Input system was already deterministic with 2384 transitions.
RANDOM walk for 40000 steps (8 resets) in 1721 ms. (23 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
[2026-05-26 11:11:07] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2026-05-26 11:11:07] [INFO ] Invariant cache hit.
[2026-05-26 11:11:07] [INFO ] State equation strengthened by 298 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 373/387 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/401 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 168/569 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 821/1390 variables, 569/590 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1390 variables, 140/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1390 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 22/1412 variables, 8/738 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1412 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1412 variables, 82/821 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1412 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 22/1434 variables, 10/831 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1434 variables, 9/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1434 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 45/1479 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1479 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/1481 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1481 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 24/1505 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1505 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 89/1594 variables, 71/914 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1594 variables, 67/981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1594 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/1594 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 981 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 658/658 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 373/387 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/401 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 9781ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 192 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 192 Pre rules applied. Total rules applied 16 place count 650 transition count 2184
Deduced a syphon composed of 192 places in 5 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 400 place count 458 transition count 2184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 402 place count 456 transition count 2168
Iterating global reduction 2 with 2 rules applied. Total rules applied 404 place count 456 transition count 2168
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 4 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 514 place count 401 transition count 2113
Applied a total of 514 rules in 468 ms. Remains 401 /658 variables (removed 257) and now considering 2113/2384 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 401/658 places, 2113/2384 transitions.
RANDOM walk for 40000 steps (8 resets) in 758 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 232569 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :4 out of 6
Probabilistic random walk after 232569 steps, saw 134267 distinct states, run finished after 3006 ms. (steps per millisecond=77 ) properties seen :4
[2026-05-26 11:11:21] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-309543173288063936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5010594155686224097.kers'
[2026-05-26 11:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-309543173288063936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5010594155686224097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 401 cols 1618 entries
Finished phase 1 with 368 SingleSign rule and 8 generalized
[2026-05-26 11:11:21] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5010594155686224097.kers
Total runtime 6 ms.
[2026-05-26 11:11:21] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 148/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/162 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/209 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 39/248 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 418/666 variables, 248/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 70/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 50/716 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/716 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/716 variables, 48/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/716 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 66/782 variables, 30/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/782 variables, 24/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/782 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 82/864 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/864 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 6/870 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/870 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 27/897 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/897 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 169/1066 variables, 115/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1066 variables, 142/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1066 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1066 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1066/1066 variables, and 710 constraints, problems are : Problem set: 0 solved, 2 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 401/401 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 148/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/162 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/209 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 39/248 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 418/666 variables, 248/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 70/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 50/716 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/716 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/716 variables, 48/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/716 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 66/782 variables, 30/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/782 variables, 24/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/782 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 82/864 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/864 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 6/870 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/870 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/870 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/870 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/870 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/870 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/870 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 27/897 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/897 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 169/1066 variables, 115/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1066 variables, 142/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1066 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/1066 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1066/1066 variables, and 727 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5359 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 401/401 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6248ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 880 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 2113/2113 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 401 transition count 2109
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 397 transition count 2109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 396 transition count 2108
Applied a total of 10 rules in 194 ms. Remains 396 /401 variables (removed 5) and now considering 2108/2113 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 396/401 places, 2108/2113 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 213930 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 213930 steps, saw 127338 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2026-05-26 11:11:32] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9610412732423833565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9197518697556671332.kers'
[2026-05-26 11:11:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9610412732423833565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9197518697556671332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 396 cols 1608 entries
Finished phase 1 with 363 SingleSign rule and 8 generalized
[2026-05-26 11:11:32] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9197518697556671332.kers
Total runtime 5 ms.
[2026-05-26 11:11:32] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/160 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/206 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/244 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 414/658 variables, 244/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 70/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 50/708 variables, 8/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/708 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 48/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 66/774 variables, 30/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/774 variables, 24/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/774 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 81/855 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/855 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 6/861 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/861 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 27/888 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/888 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 168/1056 variables, 114/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1056 variables, 142/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1056 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1056 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1056/1056 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/160 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 46/206 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/244 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 414/658 variables, 244/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 70/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/658 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 50/708 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/708 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/708 variables, 48/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/708 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 66/774 variables, 30/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/774 variables, 24/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/774 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 81/855 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/855 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/861 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/861 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/861 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/861 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/861 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 27/888 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/888 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 168/1056 variables, 114/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1056 variables, 142/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1056 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/1056 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1056/1056 variables, and 722 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5274 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6464ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 313 ms.
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 124 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 396/396 places, 2108/2108 transitions.
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 317898 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 317898 steps, saw 179585 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2026-05-26 11:11:42] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2026-05-26 11:11:42] [INFO ] Invariant cache hit.
[2026-05-26 11:11:42] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
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) 74/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/110 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/148 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 250/398 variables, 148/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 78/476 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 28/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 110/586 variables, 50/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 30/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/721 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/731 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/731 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 45/776 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/776 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 280/1056 variables, 190/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1056 variables, 202/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1056 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1056 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1056/1056 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 284/284 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) 74/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 250/398 variables, 148/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 24/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 78/476 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 28/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/586 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/586 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/586 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 135/721 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/721 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/731 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/731 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/731 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/731 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/731 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 45/776 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/776 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 280/1056 variables, 190/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1056 variables, 202/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1056 variables, 3/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1056 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1056 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1056/1056 variables, and 716 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3143 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 133 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 396/396 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 120 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2026-05-26 11:11:46] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2026-05-26 11:11:46] [INFO ] Invariant cache hit.
[2026-05-26 11:11:47] [INFO ] Implicit Places using invariants in 977 ms returned []
[2026-05-26 11:11:47] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2026-05-26 11:11:47] [INFO ] Invariant cache hit.
[2026-05-26 11:11:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:11:51] [INFO ] Implicit Places using invariants and state equation in 3988 ms returned []
Implicit Place search using SMT with State Equation took 4974 ms to find 0 implicit places.
[2026-05-26 11:11:51] [INFO ] Redundant transitions in 155 ms returned []
Running 2100 sub problems to find dead transitions.
[2026-05-26 11:11:51] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2026-05-26 11:11:51] [INFO ] Invariant cache hit.
[2026-05-26 11:11:51] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1056 variables, and 33 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/396 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1056 variables, and 56 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/396 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60940ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 60950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66218 ms. Remains : 396/396 places, 2108/2108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(X(p1) U ((p1&&X(p1))||X(G(p1))))))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 61 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2026-05-26 11:12:53] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13716169135799682620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14527675898080978353.kers'
[2026-05-26 11:12:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13716169135799682620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14527675898080978353.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:12:53] [INFO ] Computed 25 invariants in 7 ms
Computed 25 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14527675898080978353.kers
Total runtime 9 ms.
[2026-05-26 11:12:54] [INFO ] Implicit Places using invariants in 1503 ms returned []
[2026-05-26 11:12:54] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:12:54] [INFO ] Invariant cache hit.
[2026-05-26 11:12:55] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:13:00] [INFO ] Implicit Places using invariants and state equation in 6174 ms returned []
Implicit Place search using SMT with State Equation took 7682 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:13:00] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:13:00] [INFO ] Invariant cache hit.
[2026-05-26 11:13:00] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31135ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31151ms
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38906 ms. Remains : 656/658 places, 2368/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(X(p1) U ((p1&&X(p1))||X(G(p1))))))'
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 858 ms.
Product exploration explored 100000 steps with 50000 reset in 740 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 22 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 41 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-01 finished in 41115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 650 transition count 2178
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 452 transition count 2178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 450 transition count 2162
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 394 transition count 2106
Applied a total of 528 rules in 209 ms. Remains 394 /658 variables (removed 264) and now considering 2106/2384 (removed 278) transitions.
[2026-05-26 11:13:34] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17387331254947737056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3927375457349910903.kers'
[2026-05-26 11:13:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17387331254947737056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3927375457349910903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 658 rows 394 cols 1604 entries
Finished phase 1 with 361 SingleSign rule and 8 generalized
[2026-05-26 11:13:34] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3927375457349910903.kers
Total runtime 4 ms.
[2026-05-26 11:13:34] [INFO ] Implicit Places using invariants in 772 ms returned []
[2026-05-26 11:13:34] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:13:34] [INFO ] Invariant cache hit.
[2026-05-26 11:13:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:13:37] [INFO ] Implicit Places using invariants and state equation in 3004 ms returned []
Implicit Place search using SMT with State Equation took 3781 ms to find 0 implicit places.
[2026-05-26 11:13:38] [INFO ] Redundant transitions in 58 ms returned []
Running 2098 sub problems to find dead transitions.
[2026-05-26 11:13:38] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:13:38] [INFO ] Invariant cache hit.
[2026-05-26 11:13:38] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 31 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 57 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60894ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/658 places, 2106/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64959 ms. Remains : 394/658 places, 2106/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 398 ms.
Stack based approach found an accepted trace after 546 steps with 0 reset with depth 547 and stack size 473 in 7 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-02 finished in 65477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 195 Pre rules applied. Total rules applied 16 place count 650 transition count 2181
Deduced a syphon composed of 195 places in 4 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 406 place count 455 transition count 2181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 408 place count 453 transition count 2165
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 453 transition count 2165
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 522 place count 397 transition count 2109
Applied a total of 522 rules in 253 ms. Remains 397 /658 variables (removed 261) and now considering 2109/2384 (removed 275) transitions.
[2026-05-26 11:14:39] [INFO ] Flow matrix only has 661 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9485496236222169686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8843014433551407586.kers'
[2026-05-26 11:14:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9485496236222169686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8843014433551407586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 661 rows 397 cols 1610 entries
Finished phase 1 with 364 SingleSign rule and 8 generalized
[2026-05-26 11:14:39] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8843014433551407586.kers
Total runtime 7 ms.
[2026-05-26 11:14:40] [INFO ] Implicit Places using invariants in 798 ms returned []
[2026-05-26 11:14:40] [INFO ] Flow matrix only has 661 transitions (discarded 1448 similar events)
[2026-05-26 11:14:40] [INFO ] Invariant cache hit.
[2026-05-26 11:14:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:14:44] [INFO ] Implicit Places using invariants and state equation in 4320 ms returned []
Implicit Place search using SMT with State Equation took 5125 ms to find 0 implicit places.
[2026-05-26 11:14:45] [INFO ] Redundant transitions in 342 ms returned []
Running 2101 sub problems to find dead transitions.
[2026-05-26 11:14:45] [INFO ] Flow matrix only has 661 transitions (discarded 1448 similar events)
[2026-05-26 11:14:45] [INFO ] Invariant cache hit.
[2026-05-26 11:14:45] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
SMT process timed out in 31081ms, After SMT, problems are : Problem set: 0 solved, 2101 unsolved
Search for dead transitions found 0 dead transitions in 31089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 397/658 places, 2109/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36827 ms. Remains : 397/658 places, 2109/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 424 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-03 finished in 37408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 63 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2026-05-26 11:15:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12854266558179212219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2660194767391764021.kers'
[2026-05-26 11:15:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12854266558179212219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2660194767391764021.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:15:16] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2660194767391764021.kers
Total runtime 8 ms.
[2026-05-26 11:15:18] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2026-05-26 11:15:18] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:15:18] [INFO ] Invariant cache hit.
[2026-05-26 11:15:19] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:15:24] [INFO ] Implicit Places using invariants and state equation in 6213 ms returned []
Implicit Place search using SMT with State Equation took 7751 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:15:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:15:24] [INFO ] Invariant cache hit.
[2026-05-26 11:15:24] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 30907ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 30912ms
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38742 ms. Remains : 656/658 places, 2368/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 371 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-05 finished in 39391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(!p0)||(p1 U (G(p1)||(p1&&(!p2 U (p3||G(!p2))))))))||((X(!p0)||(p1 U (G(p1)||(p1&&(!p2 U (p3||G(!p2)))))))&&F(!p2))))'
Support contains 6 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 657 transition count 2376
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 657 transition count 2376
Applied a total of 2 rules in 60 ms. Remains 657 /658 variables (removed 1) and now considering 2376/2384 (removed 8) transitions.
[2026-05-26 11:15:56] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14820480625527365186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1351982270037415528.kers'
[2026-05-26 11:15:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14820480625527365186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1351982270037415528.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 928 rows 657 cols 2144 entries
Finished phase 1 with 624 SingleSign rule and 8 generalized
[2026-05-26 11:15:56] [INFO ] Computed 25 invariants in 7 ms
Computed 25 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1351982270037415528.kers
Total runtime 9 ms.
[2026-05-26 11:15:57] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2026-05-26 11:15:57] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:15:57] [INFO ] Invariant cache hit.
[2026-05-26 11:15:58] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:16:03] [INFO ] Implicit Places using invariants and state equation in 5862 ms returned []
Implicit Place search using SMT with State Equation took 7156 ms to find 0 implicit places.
Running 2368 sub problems to find dead transitions.
[2026-05-26 11:16:03] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:16:03] [INFO ] Invariant cache hit.
[2026-05-26 11:16:03] [INFO ] State equation strengthened by 291 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2368 unsolved
SMT process timed out in 30925ms, After SMT, problems are : Problem set: 0 solved, 2368 unsolved
Search for dead transitions found 0 dead transitions in 30930ms
Starting structural reductions in LTL mode, iteration 1 : 657/658 places, 2376/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38158 ms. Remains : 657/658 places, 2376/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(p1 U (G(p1)||(p1&&(!p2 U (p3||G(!p2))))))))||(F(!p2)&&(X(p0)||(p1 U (G(p1)||(p1&&(!p2 U (p3||G(!p2))))))))))'
Stuttering acceptance computed with spot in 723 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), true, (AND (NOT p3) p2), (NOT p1), (AND (NOT p3) p2 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p0) (NOT p1) p2), p2, (AND p0 (NOT p1) p2)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-07
Product exploration explored 100000 steps with 238 reset in 456 ms.
Product exploration explored 100000 steps with 225 reset in 437 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 26 factoid took 110 ms. Reduced automaton from 13 states, 31 edges and 4 AP (stutter sensitive) to 11 states, 22 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 597 ms. (66 steps per ms) remains 6/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
[2026-05-26 11:16:36] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:16:36] [INFO ] Invariant cache hit.
[2026-05-26 11:16:36] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 162/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/174 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf7 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 5 (OVERLAPS) 70/244 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 353/597 variables, 244/253 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 24/277 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 78/675 variables, 8/285 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 1/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 37/323 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 0/323 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 110/785 variables, 50/373 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/785 variables, 23/396 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 0/396 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 225/1010 variables, 5/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1010 variables, 0/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 10/1020 variables, 5/406 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1020 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 120/1140 variables, 5/411 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1140 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 445/1585 variables, 355/766 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1585 variables, 207/973 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1585 variables, 0/973 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1585 variables, 0/973 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1585/1585 variables, and 973 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 657/657 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 162/168 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/174 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 70/244 variables, 3/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 353/597 variables, 244/258 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 24/282 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 78/675 variables, 8/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 1/291 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 37/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/675 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 110/785 variables, 50/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 23/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 0/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 225/1010 variables, 5/406 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1010 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 10/1020 variables, 5/411 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1020 variables, 4/415 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1585 variables, and 421 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 3/8 constraints, State Equation: 302/657 constraints, ReadFeed: 84/291 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7770ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 2376/2376 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 657 transition count 2368
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 649 transition count 2368
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 649 transition count 2171
Deduced a syphon composed of 197 places in 4 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 452 transition count 2171
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 518 place count 398 transition count 2117
Applied a total of 518 rules in 224 ms. Remains 398 /657 variables (removed 259) and now considering 2117/2376 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 398/657 places, 2117/2376 transitions.
RANDOM walk for 40000 steps (8 resets) in 417 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 7774 steps, run visited all 4 properties in 222 ms. (steps per millisecond=35 )
Probabilistic random walk after 7774 steps, saw 6122 distinct states, run finished after 230 ms. (steps per millisecond=33 ) properties seen :4
Found 2 invariant AP formulas.
Knowledge based reduction with 28 factoid took 336 ms. Reduced automaton from 11 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), p2]
Knowledge-based reduction took 9872 ms.
Stuttering acceptance computed with spot in 438 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), p2]
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 2376/2376 transitions.
Applied a total of 0 rules in 31 ms. Remains 657 /657 variables (removed 0) and now considering 2376/2376 (removed 0) transitions.
[2026-05-26 11:16:46] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:16:46] [INFO ] Invariant cache hit.
[2026-05-26 11:16:48] [INFO ] Implicit Places using invariants in 1525 ms returned []
[2026-05-26 11:16:48] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:16:48] [INFO ] Invariant cache hit.
[2026-05-26 11:16:48] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:16:53] [INFO ] Implicit Places using invariants and state equation in 5817 ms returned []
Implicit Place search using SMT with State Equation took 7345 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7377 ms. Remains : 657/657 places, 2376/2376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 14 factoid took 79 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2026-05-26 11:16:54] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:16:54] [INFO ] Invariant cache hit.
[2026-05-26 11:16:54] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 162/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/174 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 70/244 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 353/597 variables, 244/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 24/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/675 variables, 8/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 37/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 110/785 variables, 50/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/785 variables, 23/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 225/1010 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1010 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 10/1020 variables, 5/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1020 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 120/1140 variables, 5/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1140 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 445/1585 variables, 355/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1585 variables, 207/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1585 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1585 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1585/1585 variables, and 973 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 657/657 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 2/2 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 162/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/174 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 70/244 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 353/597 variables, 244/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 24/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/675 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 37/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/675 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 110/785 variables, 50/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 23/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 225/1010 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1010 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 10/1020 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1020 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1020 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6699ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 2376/2376 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 657 transition count 2368
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 649 transition count 2368
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 649 transition count 2171
Deduced a syphon composed of 197 places in 3 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 452 transition count 2171
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 518 place count 398 transition count 2117
Applied a total of 518 rules in 199 ms. Remains 398 /657 variables (removed 259) and now considering 2117/2376 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 398/657 places, 2117/2376 transitions.
RANDOM walk for 40000 steps (8 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7774 steps, run visited all 2 properties in 90 ms. (steps per millisecond=86 )
Probabilistic random walk after 7774 steps, saw 6122 distinct states, run finished after 90 ms. (steps per millisecond=86 ) properties seen :2
Knowledge based reduction with 14 factoid took 276 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), p2]
Knowledge-based reduction took 8159 ms.
Stuttering acceptance computed with spot in 416 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 422 ms :[(NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p0)), (AND p2 (NOT p1)), p2]
Product exploration explored 100000 steps with 236 reset in 315 ms.
Product exploration explored 100000 steps with 252 reset in 326 ms.
Spot run failed in 231 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9636572769135080218
[2026-05-26 11:17:03] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9636572769135080218
Running compilation step : cd /tmp/ltsmin9636572769135080218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9636572769135080218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9636572769135080218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 2376/2376 transitions.
Applied a total of 0 rules in 17 ms. Remains 657 /657 variables (removed 0) and now considering 2376/2376 (removed 0) transitions.
[2026-05-26 11:17:06] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:17:06] [INFO ] Invariant cache hit.
[2026-05-26 11:17:08] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2026-05-26 11:17:08] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:17:08] [INFO ] Invariant cache hit.
[2026-05-26 11:17:08] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:17:14] [INFO ] Implicit Places using invariants and state equation in 6192 ms returned []
Implicit Place search using SMT with State Equation took 7459 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7478 ms. Remains : 657/657 places, 2376/2376 transitions.
Built C files in :
/tmp/ltsmin3363441204408471337
[2026-05-26 11:17:14] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3363441204408471337
Running compilation step : cd /tmp/ltsmin3363441204408471337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3363441204408471337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3363441204408471337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 11:17:17] [INFO ] Flatten gal took : 105 ms
[2026-05-26 11:17:17] [INFO ] Flatten gal took : 110 ms
[2026-05-26 11:17:17] [INFO ] Time to serialize gal into /tmp/LTL9511480610152455063.gal : 32 ms
[2026-05-26 11:17:17] [INFO ] Time to serialize properties into /tmp/LTL9838958270688821590.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9511480610152455063.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14511915762791942478.hoa' '-atoms' '/tmp/LTL9838958270688821590.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9838958270688821590.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14511915762791942478.hoa
Detected timeout of ITS tools.
[2026-05-26 11:17:33] [INFO ] Flatten gal took : 81 ms
[2026-05-26 11:17:33] [INFO ] Flatten gal took : 83 ms
[2026-05-26 11:17:33] [INFO ] Time to serialize gal into /tmp/LTL13584025403479138894.gal : 23 ms
[2026-05-26 11:17:33] [INFO ] Time to serialize properties into /tmp/LTL15422107566687101388.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13584025403479138894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15422107566687101388.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G((X("((p33_4_6!=0)&&(p12_4_3!=1))"))||(("(p12_4_6!=1)")U((G("(p12_4_6!=1)"))||(("(p12_4_6!=1)")&&((!("((p18_3_7==0)||(p18_1_2==1)...534
Formula 0 simplified : F(X!"((p33_4_6!=0)&&(p12_4_3!=1))" & (("((p18_3_7==0)||(p18_1_2==1))" M !"((!((p18_3_7==0)||(p18_1_2==1)))&&(p10_4_2!=1))") U !"(p12...348
Detected timeout of ITS tools.
[2026-05-26 11:17:48] [INFO ] Flatten gal took : 99 ms
[2026-05-26 11:17:48] [INFO ] Applying decomposition
[2026-05-26 11:17:48] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10745980857620517254.txt' '-o' '/tmp/graph10745980857620517254.bin' '-w' '/tmp/graph10745980857620517254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10745980857620517254.bin' '-l' '-1' '-v' '-w' '/tmp/graph10745980857620517254.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:17:48] [INFO ] Decomposing Gal with order
[2026-05-26 11:17:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:17:49] [INFO ] Removed a total of 4556 redundant transitions.
[2026-05-26 11:17:49] [INFO ] Flatten gal took : 768 ms
[2026-05-26 11:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 670 labels/synchronizations in 157 ms.
[2026-05-26 11:17:50] [INFO ] Time to serialize gal into /tmp/LTL1226458123919317001.gal : 28 ms
[2026-05-26 11:17:50] [INFO ] Time to serialize properties into /tmp/LTL12070373125330486336.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1226458123919317001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12070373125330486336.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G((X("((i17.i3.u87.p33_4_6!=0)&&(i11.u97.p12_4_3!=1))"))||(("(i11.u58.p12_4_6!=1)")U((G("(i11.u58.p12_4_6!=1)"))||(("(i11.u58.p12_...797
Formula 0 simplified : F(X!"((i17.i3.u87.p33_4_6!=0)&&(i11.u97.p12_4_3!=1))" & (("((i3.i0.u121.p18_3_7==0)||(i21.i1.u110.p18_1_2==1))" M !"((!((i3.i0.u121....533
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-07 finished in 129021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 657 transition count 2376
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 657 transition count 2376
Applied a total of 2 rules in 36 ms. Remains 657 /658 variables (removed 1) and now considering 2376/2384 (removed 8) transitions.
[2026-05-26 11:18:05] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4158478289665879065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6987364071649594277.kers'
[2026-05-26 11:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4158478289665879065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6987364071649594277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 928 rows 657 cols 2144 entries
Finished phase 1 with 624 SingleSign rule and 8 generalized
[2026-05-26 11:18:05] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6987364071649594277.kers
Total runtime 6 ms.
[2026-05-26 11:18:06] [INFO ] Implicit Places using invariants in 1565 ms returned []
[2026-05-26 11:18:06] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:18:06] [INFO ] Invariant cache hit.
[2026-05-26 11:18:07] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:18:13] [INFO ] Implicit Places using invariants and state equation in 6814 ms returned []
Implicit Place search using SMT with State Equation took 8384 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 657/658 places, 2376/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8420 ms. Remains : 657/658 places, 2376/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 748 ms.
Product exploration explored 100000 steps with 50000 reset in 802 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 17 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-09 finished in 10199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&(G(p2)||p1)))&&X(X(p3))))'
Support contains 6 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 53 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2026-05-26 11:18:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10137177725298839108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8255391350401615065.kers'
[2026-05-26 11:18:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10137177725298839108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8255391350401615065.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:18:15] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8255391350401615065.kers
Total runtime 9 ms.
[2026-05-26 11:18:17] [INFO ] Implicit Places using invariants in 1584 ms returned []
[2026-05-26 11:18:17] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:18:17] [INFO ] Invariant cache hit.
[2026-05-26 11:18:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:18:23] [INFO ] Implicit Places using invariants and state equation in 6816 ms returned []
Implicit Place search using SMT with State Equation took 8402 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:18:23] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:18:23] [INFO ] Invariant cache hit.
[2026-05-26 11:18:23] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31150ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31157ms
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39621 ms. Remains : 656/658 places, 2368/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&(G(p2)||p1)))&&X(X(p3))))'
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-11 finished in 40132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 59 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2026-05-26 11:18:55] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:18:55] [INFO ] Invariant cache hit.
[2026-05-26 11:18:57] [INFO ] Implicit Places using invariants in 1638 ms returned []
[2026-05-26 11:18:57] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:18:57] [INFO ] Invariant cache hit.
[2026-05-26 11:18:58] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:19:03] [INFO ] Implicit Places using invariants and state equation in 6113 ms returned []
Implicit Place search using SMT with State Equation took 7753 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7812 ms. Remains : 656/658 places, 2368/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 202 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-12 finished in 7958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 650 transition count 2177
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 451 transition count 2177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 449 transition count 2161
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 393 transition count 2105
Applied a total of 530 rules in 128 ms. Remains 393 /658 variables (removed 265) and now considering 2105/2384 (removed 279) transitions.
[2026-05-26 11:19:03] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-366128781386386487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5651497595587269770.kers'
[2026-05-26 11:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-366128781386386487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5651497595587269770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 657 rows 393 cols 1602 entries
Finished phase 1 with 360 SingleSign rule and 8 generalized
[2026-05-26 11:19:03] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5651497595587269770.kers
Total runtime 4 ms.
[2026-05-26 11:19:04] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2026-05-26 11:19:04] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:19:04] [INFO ] Invariant cache hit.
[2026-05-26 11:19:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:19:08] [INFO ] Implicit Places using invariants and state equation in 3558 ms returned []
Implicit Place search using SMT with State Equation took 4580 ms to find 0 implicit places.
[2026-05-26 11:19:08] [INFO ] Redundant transitions in 57 ms returned []
Running 2097 sub problems to find dead transitions.
[2026-05-26 11:19:08] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:19:08] [INFO ] Invariant cache hit.
[2026-05-26 11:19:08] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
SMT process timed out in 30891ms, After SMT, problems are : Problem set: 0 solved, 2097 unsolved
Search for dead transitions found 0 dead transitions in 30897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/658 places, 2105/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35683 ms. Remains : 393/658 places, 2105/2384 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 394 ms.
Stack based approach found an accepted trace after 3246 steps with 0 reset with depth 3247 and stack size 2688 in 21 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-14 finished in 36302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(!p0)||(p1 U (G(p1)||(p1&&(!p2 U (p3||G(!p2))))))))||((X(!p0)||(p1 U (G(p1)||(p1&&(!p2 U (p3||G(!p2)))))))&&F(!p2))))'
Spot run failed in 88 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 11:19:40] [INFO ] Flatten gal took : 104 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2469830003166380132
[2026-05-26 11:19:40] [INFO ] Too many transitions (2384) to apply POR reductions. Disabling POR matrices.
[2026-05-26 11:19:40] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2469830003166380132
Running compilation step : cd /tmp/ltsmin2469830003166380132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 11:19:40] [INFO ] Applying decomposition
[2026-05-26 11:19:40] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2352027106848292659.txt' '-o' '/tmp/graph2352027106848292659.bin' '-w' '/tmp/graph2352027106848292659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2352027106848292659.bin' '-l' '-1' '-v' '-w' '/tmp/graph2352027106848292659.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:19:40] [INFO ] Decomposing Gal with order
[2026-05-26 11:19:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:19:40] [INFO ] Removed a total of 4651 redundant transitions.
[2026-05-26 11:19:40] [INFO ] Flatten gal took : 280 ms
[2026-05-26 11:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 530 labels/synchronizations in 89 ms.
[2026-05-26 11:19:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality14305151917863293807.gal : 37 ms
[2026-05-26 11:19:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality3840687972122857080.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14305151917863293807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3840687972122857080.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G((X(!("((i8.i0.i1.u81.p33_4_6==0)||(i19.u22.p12_4_3==1))")))||(("(i19.u51.p12_4_6!=1)")U((G("(i19.u51.p12_4_6!=1)"))||(("(i19.u51...775
Formula 0 simplified : F(X"((i8.i0.i1.u81.p33_4_6==0)||(i19.u22.p12_4_3==1))" & (("((i15.u121.p18_3_7==0)||(i11.u109.p18_1_2==1))" M !"((!((i15.u121.p18_3_...509
Compilation finished in 8765 ms.
Running link step : cd /tmp/ltsmin2469830003166380132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2469830003166380132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X(!(LTLAPp0==true))||((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true)))))))))||((X(!(LTLAPp0==true))||((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))&&<>(!(LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 1673 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 575428 ms.

BK_STOP 1779794390808

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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