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

About the Execution of ITS-Tools for CloudReconfiguration-PT-304

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1177.092 331526.00 430484.00 808.40 FTFTFFFFFTFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Mar 6 08:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 08:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 6 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 6 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-304-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779500487159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-304
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 01:41:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 01:41:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:41:28] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-05-23 01:41:28] [INFO ] Transformed 2584 places.
[2026-05-23 01:41:28] [INFO ] Transformed 3094 transitions.
[2026-05-23 01:41:28] [INFO ] Found NUPN structural information;
[2026-05-23 01:41:28] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 520 places :
Symmetric choice reduction at 0 with 520 rule applications. Total rules 520 place count 2064 transition count 2574
Iterating global reduction 0 with 520 rules applied. Total rules applied 1040 place count 2064 transition count 2574
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1069 place count 2064 transition count 2545
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1308 place count 1825 transition count 2306
Iterating global reduction 1 with 239 rules applied. Total rules applied 1547 place count 1825 transition count 2306
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 1638 place count 1734 transition count 2215
Iterating global reduction 1 with 91 rules applied. Total rules applied 1729 place count 1734 transition count 2215
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1746 place count 1734 transition count 2198
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1796 place count 1684 transition count 2148
Iterating global reduction 2 with 50 rules applied. Total rules applied 1846 place count 1684 transition count 2148
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1855 place count 1684 transition count 2139
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1895 place count 1644 transition count 2094
Iterating global reduction 3 with 40 rules applied. Total rules applied 1935 place count 1644 transition count 2094
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1963 place count 1616 transition count 2066
Iterating global reduction 3 with 28 rules applied. Total rules applied 1991 place count 1616 transition count 2066
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2017 place count 1590 transition count 2040
Iterating global reduction 3 with 26 rules applied. Total rules applied 2043 place count 1590 transition count 2040
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2069 place count 1564 transition count 2014
Iterating global reduction 3 with 26 rules applied. Total rules applied 2095 place count 1564 transition count 2014
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2118 place count 1541 transition count 1976
Iterating global reduction 3 with 23 rules applied. Total rules applied 2141 place count 1541 transition count 1976
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2149 place count 1533 transition count 1962
Iterating global reduction 3 with 8 rules applied. Total rules applied 2157 place count 1533 transition count 1962
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2165 place count 1525 transition count 1951
Iterating global reduction 3 with 8 rules applied. Total rules applied 2173 place count 1525 transition count 1951
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2176 place count 1525 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2179 place count 1522 transition count 1945
Iterating global reduction 4 with 3 rules applied. Total rules applied 2182 place count 1522 transition count 1945
Applied a total of 2182 rules in 1634 ms. Remains 1522 /2584 variables (removed 1062) and now considering 1945/3094 (removed 1149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4212678233413284921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8285755546708182972.kers'
[2026-05-23 01:41:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4212678233413284921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8285755546708182972.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1945 rows 1522 cols 4059 entries
Finished phase 1 with 1517 SingleSign rule and 1 generalized
[2026-05-23 01:41:30] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8285755546708182972.kers
Total runtime 11 ms.
[2026-05-23 01:41:31] [INFO ] Implicit Places using invariants in 537 ms returned []
[2026-05-23 01:41:31] [INFO ] Invariant cache hit.
[2026-05-23 01:41:32] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
Running 1944 sub problems to find dead transitions.
[2026-05-23 01:41:32] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1521/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30088 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 1944/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1521/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 0/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60711ms problems are : Problem set: 0 solved, 1944 unsolved
Search for dead transitions found 0 dead transitions in 60732ms
Starting structural reductions in LTL mode, iteration 1 : 1522/2584 places, 1945/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64045 ms. Remains : 1522/2584 places, 1945/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 1945/1945 transitions.
Applied a total of 0 rules in 56 ms. Remains 1522 /1522 variables (removed 0) and now considering 1945/1945 (removed 0) transitions.
[2026-05-23 01:42:32] [INFO ] Invariant cache hit.
[2026-05-23 01:42:33] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-23 01:42:33] [INFO ] Invariant cache hit.
[2026-05-23 01:42:34] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1221 ms. Remains : 1522/1522 places, 1945/1945 transitions.
Support contains 14 out of 1522 places after structural reductions.
[2026-05-23 01:42:34] [INFO ] Flatten gal took : 129 ms
[2026-05-23 01:42:34] [INFO ] Flatten gal took : 72 ms
[2026-05-23 01:42:34] [INFO ] Input system was already deterministic with 1945 transitions.
RANDOM walk for 40000 steps (312 resets) in 914 ms. (43 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (79 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (80 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
[2026-05-23 01:42:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1097 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 414/1511 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1511 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1935/3446 variables, 1511/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3458 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3458 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3460 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3460 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3462 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3462 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3464 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3464 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3466 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3466 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3467 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3467 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3467 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3467/3467 variables, and 1526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1840 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1522/1522 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1097 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 414/1511 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1511 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1935/3446 variables, 1511/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3446 variables, 2/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3446 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3448 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3448 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3450 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3450 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3452 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3452 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3454 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3456 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3456 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3458 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3458 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3460 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3460 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3462 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3462 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3464 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3464 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3466 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3466 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3467 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3467 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3467 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3467/3467 variables, and 1528 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1522/1522 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5888ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
Parikh walk visited 2 properties in 48 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2120 edges and 1522 vertex of which 1513 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.29 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(X(X((G(p2)||p1))))||p0)))'
Support contains 7 out of 1522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 1945/1945 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1517 transition count 1940
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1515 transition count 1938
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1515 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1515 transition count 1937
Applied a total of 15 rules in 186 ms. Remains 1515 /1522 variables (removed 7) and now considering 1937/1945 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8570711149626211587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10966012813053600617.kers'
[2026-05-23 01:42:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8570711149626211587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10966012813053600617.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1937 rows 1515 cols 4043 entries
Finished phase 1 with 1510 SingleSign rule and 1 generalized
[2026-05-23 01:42:41] [INFO ] Computed 4 invariants in 17 ms
Computed 4 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-10966012813053600617.kers
Total runtime 19 ms.
[2026-05-23 01:42:41] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-23 01:42:41] [INFO ] Invariant cache hit.
[2026-05-23 01:42:42] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2026-05-23 01:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60490ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1522 places, 1937/1945 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61870 ms. Remains : 1515/1522 places, 1937/1945 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(X(X((G(p2)||p1))))||p0)))'
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-03
Product exploration explored 100000 steps with 783 reset in 237 ms.
Product exploration explored 100000 steps with 777 reset in 187 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2112 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (303 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (80 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (84 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (84 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 344255 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 5
Probabilistic random walk after 344255 steps, saw 84445 distinct states, run finished after 3005 ms. (steps per millisecond=114 ) properties seen :0
[2026-05-23 01:43:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3431 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 1/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3452/3452 variables, and 1519 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3589 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3431 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 5/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3431 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/3433 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3445/3452 variables, and 1520 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1515 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8612ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1515/1515 places, 1937/1937 transitions.
Graph (trivial) has 1837 edges and 1515 vertex of which 687 / 1515 are part of one of the 63 SCC in 5 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 785 transitions
Reduce isomorphic transitions removed 785 transitions.
Graph (complete) has 1322 edges and 891 vertex of which 882 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 882 transition count 652
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 548 rules applied. Total rules applied 1046 place count 393 transition count 593
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1086 place count 355 transition count 591
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 1090 place count 354 transition count 588
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1092 place count 352 transition count 588
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1092 place count 352 transition count 539
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1190 place count 303 transition count 539
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1200 place count 293 transition count 525
Iterating global reduction 5 with 10 rules applied. Total rules applied 1210 place count 293 transition count 525
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 1212 place count 293 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1214 place count 291 transition count 523
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1221 place count 284 transition count 515
Iterating global reduction 7 with 7 rules applied. Total rules applied 1228 place count 284 transition count 515
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1234 place count 284 transition count 509
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1235 place count 283 transition count 503
Iterating global reduction 8 with 1 rules applied. Total rules applied 1236 place count 283 transition count 503
Performed 147 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 8 with 294 rules applied. Total rules applied 1530 place count 136 transition count 261
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1545 place count 136 transition count 246
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1548 place count 133 transition count 243
Iterating global reduction 9 with 3 rules applied. Total rules applied 1551 place count 133 transition count 243
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1575 place count 121 transition count 229
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1589 place count 121 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1591 place count 120 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1593 place count 120 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1595 place count 119 transition count 211
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1597 place count 119 transition count 209
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 12 with 64 rules applied. Total rules applied 1661 place count 87 transition count 240
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 12 with 46 rules applied. Total rules applied 1707 place count 87 transition count 194
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1730 place count 64 transition count 164
Iterating global reduction 13 with 23 rules applied. Total rules applied 1753 place count 64 transition count 164
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1766 place count 64 transition count 151
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 1771 place count 59 transition count 141
Iterating global reduction 14 with 5 rules applied. Total rules applied 1776 place count 59 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1780 place count 59 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 15 with 27 rules applied. Total rules applied 1807 place count 59 transition count 110
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1810 place count 56 transition count 103
Iterating global reduction 15 with 3 rules applied. Total rules applied 1813 place count 56 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1814 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 1816 place count 54 transition count 100
Iterating global reduction 16 with 2 rules applied. Total rules applied 1818 place count 54 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1820 place count 54 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1822 place count 53 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1824 place count 53 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1827 place count 53 transition count 92
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1831 place count 50 transition count 91
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 18 with 11 rules applied. Total rules applied 1842 place count 50 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1847 place count 50 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1848 place count 49 transition count 85
Applied a total of 1848 rules in 192 ms. Remains 49 /1515 variables (removed 1466) and now considering 85/1937 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 49/1515 places, 85/1937 transitions.
RANDOM walk for 40000 steps (835 resets) in 418 ms. (95 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
[2026-05-23 01:43:56] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6728084503700002704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16530594975010205205.kers'
[2026-05-23 01:43:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6728084503700002704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16530594975010205205.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 49 cols 214 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-23 01:43:56] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16530594975010205205.kers
Total runtime 0 ms.
[2026-05-23 01:43:56] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/125 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/130 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 55 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/125 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/130 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Knowledge-based reduction took 12938 ms.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 7 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1937/1937 transitions.
Applied a total of 0 rules in 58 ms. Remains 1515 /1515 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4694936101260071129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2053733243132615411.kers'
[2026-05-23 01:43:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4694936101260071129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2053733243132615411.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1937 rows 1515 cols 4043 entries
Finished phase 1 with 1510 SingleSign rule and 1 generalized
[2026-05-23 01:43:57] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2053733243132615411.kers
Total runtime 10 ms.
[2026-05-23 01:43:57] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 01:43:57] [INFO ] Invariant cache hit.
[2026-05-23 01:43:58] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1209 ms. Remains : 1515/1515 places, 1937/1937 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2112 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (299 resets) in 393 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (81 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (84 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (81 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (86 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (79 resets) in 67 ms. (588 steps per ms) remains 4/5 properties
[2026-05-23 01:43:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3431 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3452/3452 variables, and 1519 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2977 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3431 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 4/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3431 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3433 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3449/3452 variables, and 1521 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1515 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7997ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1515/1515 places, 1937/1937 transitions.
Graph (trivial) has 1837 edges and 1515 vertex of which 687 / 1515 are part of one of the 63 SCC in 5 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 785 transitions
Reduce isomorphic transitions removed 785 transitions.
Graph (complete) has 1322 edges and 891 vertex of which 882 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 882 transition count 652
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 548 rules applied. Total rules applied 1046 place count 393 transition count 593
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1086 place count 355 transition count 591
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 1090 place count 354 transition count 588
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1092 place count 352 transition count 588
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 49 Pre rules applied. Total rules applied 1092 place count 352 transition count 539
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 1190 place count 303 transition count 539
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1200 place count 293 transition count 525
Iterating global reduction 5 with 10 rules applied. Total rules applied 1210 place count 293 transition count 525
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 1212 place count 293 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1214 place count 291 transition count 523
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1221 place count 284 transition count 515
Iterating global reduction 7 with 7 rules applied. Total rules applied 1228 place count 284 transition count 515
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1234 place count 284 transition count 509
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1235 place count 283 transition count 503
Iterating global reduction 8 with 1 rules applied. Total rules applied 1236 place count 283 transition count 503
Performed 147 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 8 with 294 rules applied. Total rules applied 1530 place count 136 transition count 261
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1545 place count 136 transition count 246
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1548 place count 133 transition count 243
Iterating global reduction 9 with 3 rules applied. Total rules applied 1551 place count 133 transition count 243
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1575 place count 121 transition count 229
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1589 place count 121 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1591 place count 120 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1593 place count 120 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1595 place count 119 transition count 211
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1597 place count 119 transition count 209
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 12 with 64 rules applied. Total rules applied 1661 place count 87 transition count 240
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 12 with 46 rules applied. Total rules applied 1707 place count 87 transition count 194
Discarding 23 places :
Symmetric choice reduction at 13 with 23 rule applications. Total rules 1730 place count 64 transition count 164
Iterating global reduction 13 with 23 rules applied. Total rules applied 1753 place count 64 transition count 164
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1766 place count 64 transition count 151
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 1771 place count 59 transition count 141
Iterating global reduction 14 with 5 rules applied. Total rules applied 1776 place count 59 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1780 place count 59 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 15 with 27 rules applied. Total rules applied 1807 place count 59 transition count 110
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1810 place count 56 transition count 103
Iterating global reduction 15 with 3 rules applied. Total rules applied 1813 place count 56 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1814 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 1816 place count 54 transition count 100
Iterating global reduction 16 with 2 rules applied. Total rules applied 1818 place count 54 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1820 place count 54 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1822 place count 53 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1824 place count 53 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1827 place count 53 transition count 92
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1831 place count 50 transition count 91
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 18 with 11 rules applied. Total rules applied 1842 place count 50 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1847 place count 50 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1848 place count 49 transition count 85
Applied a total of 1848 rules in 136 ms. Remains 49 /1515 variables (removed 1466) and now considering 85/1937 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 49/1515 places, 85/1937 transitions.
RANDOM walk for 40000 steps (808 resets) in 220 ms. (180 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 50 ms. (784 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2026-05-23 01:44:06] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10273310387003849767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7180778450207392182.kers'
[2026-05-23 01:44:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10273310387003849767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7180778450207392182.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 49 cols 214 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-23 01:44:06] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7180778450207392182.kers
Total runtime 0 ms.
[2026-05-23 01:44:06] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/125 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/130 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 55 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/125 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/130 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Knowledge-based reduction took 9245 ms.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 789 reset in 133 ms.
Product exploration explored 100000 steps with 779 reset in 144 ms.
Spot run failed in 74 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/ltsmin12117656255197927030
[2026-05-23 01:44:08] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12117656255197927030
Running compilation step : cd /tmp/ltsmin12117656255197927030;'/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/ltsmin12117656255197927030;'/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/ltsmin12117656255197927030;'/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 7 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1937/1937 transitions.
Applied a total of 0 rules in 84 ms. Remains 1515 /1515 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9683502810585544828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18028838879236653084.kers'
[2026-05-23 01:44:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9683502810585544828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18028838879236653084.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1937 rows 1515 cols 4043 entries
Finished phase 1 with 1510 SingleSign rule and 1 generalized
[2026-05-23 01:44:11] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-18028838879236653084.kers
Total runtime 10 ms.
[2026-05-23 01:44:11] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-23 01:44:11] [INFO ] Invariant cache hit.
[2026-05-23 01:44:12] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1255 ms. Remains : 1515/1515 places, 1937/1937 transitions.
Built C files in :
/tmp/ltsmin11809877085096307462
[2026-05-23 01:44:12] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11809877085096307462
Running compilation step : cd /tmp/ltsmin11809877085096307462;'/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/ltsmin11809877085096307462;'/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/ltsmin11809877085096307462;'/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-23 01:44:15] [INFO ] Flatten gal took : 50 ms
[2026-05-23 01:44:15] [INFO ] Flatten gal took : 49 ms
[2026-05-23 01:44:15] [INFO ] Time to serialize gal into /tmp/LTL11242447895391312454.gal : 15 ms
[2026-05-23 01:44:15] [INFO ] Time to serialize properties into /tmp/LTL494374835614919671.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/LTL11242447895391312454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6355447592168677519.hoa' '-atoms' '/tmp/LTL494374835614919671.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...317
Loading property file /tmp/LTL494374835614919671.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6355447592168677519.hoa
Detected timeout of ITS tools.
[2026-05-23 01:44:31] [INFO ] Flatten gal took : 38 ms
[2026-05-23 01:44:31] [INFO ] Flatten gal took : 34 ms
[2026-05-23 01:44:31] [INFO ] Time to serialize gal into /tmp/LTL15439180584725073693.gal : 7 ms
[2026-05-23 01:44:31] [INFO ] Time to serialize properties into /tmp/LTL722550328268716718.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/LTL15439180584725073693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL722550328268716718.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...275
Read 1 LTL properties
Checking formula 0 : !((G(("((p1429==0)||(p1217==1))")||(X(X(X(("((p663==0)||(p1803==0))")||(("(p1656==1)")||(G("((p142==0)||(p2229==1))"))))))))))
Formula 0 simplified : F(!"((p1429==0)||(p1217==1))" & XXX(!"((p663==0)||(p1803==0))" & !"(p1656==1)" & F!"((p142==0)||(p2229==1))"))
Detected timeout of ITS tools.
[2026-05-23 01:44:46] [INFO ] Flatten gal took : 45 ms
[2026-05-23 01:44:46] [INFO ] Applying decomposition
[2026-05-23 01:44:46] [INFO ] Flatten gal took : 29 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/graph14639213160055646980.txt' '-o' '/tmp/graph14639213160055646980.bin' '-w' '/tmp/graph14639213160055646980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14639213160055646980.bin' '-l' '-1' '-v' '-w' '/tmp/graph14639213160055646980.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:44:46] [INFO ] Decomposing Gal with order
[2026-05-23 01:44:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:44:46] [INFO ] Removed a total of 522 redundant transitions.
[2026-05-23 01:44:46] [INFO ] Flatten gal took : 127 ms
[2026-05-23 01:44:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 27 ms.
[2026-05-23 01:44:46] [INFO ] Time to serialize gal into /tmp/LTL17966801911651382851.gal : 20 ms
[2026-05-23 01:44:46] [INFO ] Time to serialize properties into /tmp/LTL6309771021755430446.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/LTL17966801911651382851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6309771021755430446.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(("((i21.i1.i1.u337.p1429==0)||(i16.i0.i6.u269.p1217==1))")||(X(X(X(("((i10.i1.i0.u135.p663==0)||(i28.i1.i1.u431.p1803==0))")||(("...244
Formula 0 simplified : F(!"((i21.i1.i1.u337.p1429==0)||(i16.i0.i6.u269.p1217==1))" & XXX(!"((i10.i1.i0.u135.p663==0)||(i28.i1.i1.u431.p1803==0))" & !"(i39....230
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t291, t320, t369, t440, t492, t675, t727, t758, t838, t909, t960, t1147, t12...2034
Computing Next relation with stutter on 91936 deadlock states
40 unique states visited
0 strongly connected components in search stack
76 transitions explored
40 items max in DFS search stack
476 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.93123,196672,1,0,335777,4837,22145,614911,473,21823,1505882
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-03 finished in 131336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1522 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1522/1522 places, 1945/1945 transitions.
Graph (trivial) has 1857 edges and 1522 vertex of which 696 / 1522 are part of one of the 63 SCC in 5 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1378 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 485 transitions
Trivial Post-agglo rules discarded 485 transitions
Performed 485 trivial Post agglomeration. Transition count delta: 485
Iterating post reduction 0 with 485 rules applied. Total rules applied 487 place count 879 transition count 718
Reduce places removed 485 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 509 rules applied. Total rules applied 996 place count 394 transition count 694
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1008 place count 382 transition count 694
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1008 place count 382 transition count 647
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1102 place count 335 transition count 647
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1115 place count 322 transition count 627
Iterating global reduction 3 with 13 rules applied. Total rules applied 1128 place count 322 transition count 627
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1130 place count 322 transition count 625
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1132 place count 320 transition count 625
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1141 place count 311 transition count 613
Iterating global reduction 5 with 9 rules applied. Total rules applied 1150 place count 311 transition count 613
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1156 place count 311 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1157 place count 310 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 1158 place count 310 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1159 place count 309 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 1160 place count 309 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1161 place count 308 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 1162 place count 308 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1163 place count 307 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 1164 place count 307 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1165 place count 306 transition count 597
Iterating global reduction 6 with 1 rules applied. Total rules applied 1166 place count 306 transition count 597
Performed 141 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 6 with 282 rules applied. Total rules applied 1448 place count 165 transition count 375
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1461 place count 165 transition count 362
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1467 place count 159 transition count 353
Iterating global reduction 7 with 6 rules applied. Total rules applied 1473 place count 159 transition count 353
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1475 place count 157 transition count 346
Iterating global reduction 7 with 2 rules applied. Total rules applied 1477 place count 157 transition count 346
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1478 place count 156 transition count 344
Iterating global reduction 7 with 1 rules applied. Total rules applied 1479 place count 156 transition count 344
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1505 place count 143 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1518 place count 143 transition count 316
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1519 place count 142 transition count 314
Iterating global reduction 8 with 1 rules applied. Total rules applied 1520 place count 142 transition count 314
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1554 place count 125 transition count 351
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 1575 place count 125 transition count 330
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1584 place count 116 transition count 312
Iterating global reduction 9 with 9 rules applied. Total rules applied 1593 place count 116 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1599 place count 116 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 10 with 38 rules applied. Total rules applied 1637 place count 116 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1638 place count 116 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1639 place count 116 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1640 place count 115 transition count 266
Applied a total of 1640 rules in 121 ms. Remains 115 /1522 variables (removed 1407) and now considering 266/1945 (removed 1679) transitions.
[2026-05-23 01:44:52] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9093568951218076347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3385149527849449205.kers'
[2026-05-23 01:44:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9093568951218076347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3385149527849449205.kers]
Normalized transition count is 208 out of 209 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 115 cols 595 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 01:44:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3385149527849449205.kers
Total runtime 1 ms.
[2026-05-23 01:44:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 01:44:52] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
[2026-05-23 01:44:52] [INFO ] Invariant cache hit.
[2026-05-23 01:44:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 01:44:53] [INFO ] Implicit Places using invariants and state equation in 357 ms returned [12, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 437 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1522 places, 266/1945 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 263
Applied a total of 3 rules in 8 ms. Remains 109 /112 variables (removed 3) and now considering 263/266 (removed 3) transitions.
[2026-05-23 01:44:53] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7737849810991253267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8350519386413007805.kers'
[2026-05-23 01:44:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7737849810991253267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8350519386413007805.kers]
Normalized transition count is 205 out of 206 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 109 cols 580 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-23 01:44:53] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8350519386413007805.kers
Total runtime 1 ms.
[2026-05-23 01:44:53] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-23 01:44:53] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2026-05-23 01:44:53] [INFO ] Invariant cache hit.
[2026-05-23 01:44:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:44:53] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1522 places, 263/1945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 923 ms. Remains : 109/1522 places, 263/1945 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-05 finished in 976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||((G(!p0)||(!p0&&F(!p1)))&&X(X(p1)))))))'
Support contains 4 out of 1522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 1945/1945 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1515 transition count 1938
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1515 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1513 transition count 1936
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1512 transition count 1935
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1511 transition count 1934
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1510 transition count 1933
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1509 transition count 1932
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1509 transition count 1932
Applied a total of 26 rules in 316 ms. Remains 1509 /1522 variables (removed 13) and now considering 1932/1945 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-635822924867387549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17287438397229660616.kers'
[2026-05-23 01:44:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-635822924867387549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17287438397229660616.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1932 rows 1509 cols 4033 entries
Finished phase 1 with 1504 SingleSign rule and 1 generalized
[2026-05-23 01:44:53] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17287438397229660616.kers
Total runtime 10 ms.
[2026-05-23 01:44:54] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-23 01:44:54] [INFO ] Invariant cache hit.
[2026-05-23 01:44:55] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2026-05-23 01:44:55] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1522 places, 1932/1945 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61973 ms. Remains : 1509/1522 places, 1932/1945 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(X(p1))&&(G(p0)||(F(!p1)&&p2)))))))'
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-07
Stuttering criterion allowed to conclude after 229 steps with 7 reset in 4 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-07 finished in 62264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p0)))'
Support contains 2 out of 1522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 1945/1945 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1515 transition count 1938
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1515 transition count 1938
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1511 transition count 1934
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1511 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1510 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1509 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1508 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1507 transition count 1929
Applied a total of 31 rules in 340 ms. Remains 1507 /1522 variables (removed 15) and now considering 1929/1945 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9520623919738241333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6039073864849338370.kers'
[2026-05-23 01:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9520623919738241333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6039073864849338370.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:45:56] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6039073864849338370.kers
Total runtime 10 ms.
[2026-05-23 01:45:56] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-23 01:45:56] [INFO ] Invariant cache hit.
[2026-05-23 01:45:57] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 01:45:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1522 places, 1929/1945 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61887 ms. Remains : 1507/1522 places, 1929/1945 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p0)))'
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2104 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 15 ms. Proved property starting from automaton with 3 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-13 finished in 62872 ms.
All properties solved by simple procedures.
Total runtime 330269 ms.

BK_STOP 1779500818685

--------------------
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="CloudReconfiguration-PT-304"
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 CloudReconfiguration-PT-304, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967500139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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